Scheduling the covering delivery problem in last mile delivery

作者：

Highlights：

• We propose a covering delivery problem with applications in the last-mile delivery.

• Flow-based and bilevel programming models are proposed to formulated the problem.

• A hybrid BBO based on bilevel programming ideas is proposed to solve the problem.

• Random and benchmark instances are used to test the effectiveness of the approach.

摘要

•We propose a covering delivery problem with applications in the last-mile delivery.•Flow-based and bilevel programming models are proposed to formulated the problem.•A hybrid BBO based on bilevel programming ideas is proposed to solve the problem.•Random and benchmark instances are used to test the effectiveness of the approach.

论文关键词：Covering delivery problem,Bilevel programming,Biogeography-based optimization,Last mile delivery

论文评审过程：Received 28 July 2020, Revised 26 July 2021, Accepted 6 September 2021, Available online 24 September 2021, Version of Record 29 September 2021.

论文官网地址：https://doi.org/10.1016/j.eswa.2021.115894