摘要
This paper introduces and formulates a covering traveling salesman problem with profit arose in the last mile delivery. In this problem, a set of vertices including a central depot, customers and parcel lockers (PL) are given, and the goal is to construct a Hamiltonian cycle within a pre-defined cost over a subset of customers and/or PLs to collect maximum profits, each unvisited customer is covered by a PL in the cycle or outsourced. To solve the problem, a two-phase heuristic combined with a feasible solution construction procedure and an improvement procedure is proposed. The algorithm is evaluated on two sets of instances, and the computational results indicated its efficiency.
学科与关键词
关键词
Covering traveling salesman problemProfitVariable neighborhood searchLast mile delivery
- Scheduling the covering delivery problem in last mile deliveryJiang, Li; Zang, Xiaoning*; Alghoul, Ibrahim I. Y.; Fang, Xiang; Dong, Junfeng; Liang, ChangyongEXPERT SYSTEMS WITH APPLICATIONS, 2022, 187: 115894.被引 10
- A traveling salesman problem with time windows for the last mile delivery in online shoppingLi Jiang; Mohamed Dhiaf; Junfeng Dong; Changyong Liang; Shuping ZhaoInternational Journal of Production Research, 2020, 58(16): 5077-5088.
- The Vehicle Routing Problem with Simultaneous Pickup and Delivery and Parcel LockersYu, Vincent F.; Susanto, Hadi; Yeh, Yu-Hsuan; Lin, Shih-Wei*; Huang, Yu-TsungMathematics, 2022, 10(6): 920.被引 16
