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

被引:52
作者
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 条
[31]   An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots [J].
Chen, Cheng ;
Demir, Emrah ;
Huang, Yuan .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 294 (03) :1164-1180
[32]   The multiple flying sidekicks traveling salesman problem with variable drone speeds [J].
Raj, Ritwik ;
Murray, Chase .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2020, 120
[33]   An adaptive large neighborhood search heuristic for the share-a-ride problem [J].
Li, Baoxiang ;
Krushinsky, Dmitry ;
Van Woensel, Tom ;
Reijers, Hajo A. .
COMPUTERS & OPERATIONS RESEARCH, 2016, 66 :170-180
[34]   An adaptive large neighborhood search heuristic for the Electric Vehicle Scheduling Problem [J].
Wen, M. ;
Linde, E. ;
Ropke, S. ;
Mirchandani, P. ;
Larsen, A. .
COMPUTERS & OPERATIONS RESEARCH, 2016, 76 :73-83
[35]   An adaptive large neighborhood search for a vehicle routing problem with multiple routes [J].
Azi, Nabila ;
Gendreau, Michel ;
Potvin, Jean-Yves .
COMPUTERS & OPERATIONS RESEARCH, 2014, 41 :167-173
[36]   An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem [J].
Martin-Iradi, Bernardo ;
Pacino, Dario ;
Ropke, Stefan .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 316 (01) :152-167
[37]   Multiple traveling salesman problem with drones: Mathematical model and heuristic approach [J].
Kitjacharoenchai, Patchara ;
Ventresca, Mario ;
Moshref-Javadi, Mohammad ;
Lee, Seokcheon ;
Tanchoco, Jose M. A. ;
Brunese, Patrick A. .
COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 129 :14-30
[38]   New neighborhood structures for the Double Traveling Salesman Problem with Multiple Stacks [J].
Felipe, A. ;
Ortuno, M. T. ;
Tirado, G. .
TOP, 2009, 17 (01) :190-213
[39]   An Adaptive Large Neighborhood Search heuristic for last-mile deliveries under stochastic customer and visits [J].
Ozarik, Sami Serkan ;
Lurkin, Virgine ;
Veelenturf, Lucas P. ;
Van Woensel, Tom ;
Laporte, Gilbert .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2023, 170 :194-220
[40]   An improved variable neighborhood search for parallel drone scheduling traveling salesman problem [J].
Lei, Deming ;
Chen, Xiang .
APPLIED SOFT COMPUTING, 2022, 127