An adaptive large neighborhood search heuristic for the flying sidekick traveling salesman problem with multiple drops

被引:50
作者
Mara, Setyo Tri Windras [1 ]
Rifai, Achmad Pratama [1 ]
Sopha, Bertha Maya [1 ]
机构
[1] Univ Gadjah Mada, Fac Engn, Dept Mech & Ind Engn, Sleman Regency 55284, Special Region, Indonesia
关键词
Flying sidekick traveling salesman problem; Multi-visit; Adaptive large neighborhood search; Truck-drone system; Last-mile delivery; Logistics; VEHICLE-ROUTING PROBLEM; SAME-DAY DELIVERY; DRONES; OPTIMIZATION; ALGORITHM;
D O I
10.1016/j.eswa.2022.117647
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Drones are the latest trend in commercial logistics research, especially in the context of last-mile delivery. Combining a drone and a truck offers numerous distinctive capabilities that introduce new opportunities to enhance the performance of the last-mile delivery system even further. To deal with the challenges of routing optimization for the combined system, the present paper proposes a new mathematical formulation and a new heuristic approach based on Adaptive Large Neighborhood Search (ALNS) for the Flying Sidekick Traveling Salesman Problem (FSTSP) with multiple drops (multi-drop FSTSP). The effectiveness of the proposed approach was demonstrated in several test instances, some of which are based on a real case delivery problem in Indonesia. It appears that the proposed ALNS approach performs better than the state-of-the-art method adapted from the previous literature.
引用
收藏
页数:20
相关论文
共 50 条
[21]   An Adaptive Large Neighborhood Search Heuristic for Dynamic Ridesharing Problem [J].
Hua, Shijia ;
Qi, Mingyao .
2019 IEEE 6TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND APPLICATIONS (ICIEA), 2019, :888-892
[22]   An adaptive large neighborhood search heuristic for solving a robust gate assignment problem [J].
Yu, Chuhang ;
Zhang, Dong ;
Lau, Henry Y. K. .
EXPERT SYSTEMS WITH APPLICATIONS, 2017, 84 :143-154
[23]   The multiple flying sidekicks traveling salesman problem: Parcel delivery with multiple drones [J].
Murray, Chase C. ;
Raj, Ritwik .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2020, 110 (110) :368-398
[24]   Improving variable neighborhood search to solve the traveling salesman problem [J].
Hore, Samrat ;
Chatterjee, Aditya ;
Dewanji, Anup .
APPLIED SOFT COMPUTING, 2018, 68 :83-91
[25]   A hybrid adaptive large neighborhood search heuristic for the team orienteering problem [J].
Hammami, Farouk ;
Rekik, Monia ;
Coelho, Leandro C. .
COMPUTERS & OPERATIONS RESEARCH, 2020, 123
[26]   The double traveling salesman problem with multiple stacks: A variable neighborhood search approach [J].
Felipe, Angel ;
Teresa Ortuno, M. ;
Tirado, Gregorio .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (11) :2983-2993
[27]   Flying Sidekick Traveling Salesman Problem with Pick-Up and Delivery and Drone Energy Optimization [J].
Gacal, J. B. ;
Urera, M. Q. ;
Cruz, D. E. .
2020 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEE IEEM), 2020, :1167-1171
[28]   A column-and-row generation approach for the flying sidekick travelling salesman problem [J].
Boccia, Maurizio ;
Masone, Adriano ;
Sforza, Antonio ;
Sterle, Claudio .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 124
[29]   An adaptive large neighborhood search heuristic for the cumulative capacitated vehicle routing problem [J].
Ribeiro, Glaydston Mattos ;
Laporte, Gilbert .
COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (03) :728-735
[30]   An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem [J].
Dayarian, Iman ;
Crainic, Teodor Gabriel ;
Gendreau, Michel ;
Rei, Walter .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2016, 95 :95-123