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 条
[41]   A SELECTIVE ADAPTIVE LARGE NEIGHBORHOOD SEARCH HEURISTIC FOR THE PROFITABLE TOUR PROBLEM WITH SIMULTANEOUS PICKUP AND DELIVERY SERVICES [J].
Chentli, Hayet ;
Ouafi, Rachid ;
Cherif-Khettaf, Wahiba Ramdane .
RAIRO-OPERATIONS RESEARCH, 2018, 52 (4-5) :1295-1328
[42]   A Quantum Heuristic Algorithm for the Traveling Salesman Problem [J].
Bang, Jeongho ;
Ryu, Junghee ;
Lee, Changhyoup ;
Yoo, Seokwon ;
Lim, James ;
Lee, Jinhyoung .
JOURNAL OF THE KOREAN PHYSICAL SOCIETY, 2012, 61 (12) :1944-1949
[43]   New heuristic algorithm for traveling salesman problem [J].
Shahab, M. L. .
INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION, 2019, 1218
[44]   A faster heuristic for the traveling salesman problem with drone [J].
Hokama, Pedro Henrique Del Bianco ;
Lintzmayer, Carla Negri ;
San Felice, Mario Cesar .
OPTIMIZATION LETTERS, 2025, 19 (04) :771-791
[45]   An adaptive large neighborhood search heuristic for dynamic vehicle routing problems [J].
Chen, Shifeng ;
Chen, Rong ;
Wang, Gai-Ge ;
Gao, Jian ;
Sangaiah, Arun Kumar .
COMPUTERS & ELECTRICAL ENGINEERING, 2018, 67 :596-607
[46]   A Hybrid Mathematical Model for Flying Sidekick Travelling Salesman Problem with Time Windows [J].
Budak G. ;
Chen X. .
Operations Research Forum, 4 (4)
[47]   A Memetic Algorithm with a large neighborhood crossover operator for the Generalized Traveling Salesman Problem [J].
Bontoux, Boris ;
Artigues, Christian ;
Feillet, Dominique .
COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (11) :1844-1852
[48]   Memetic search for the minmax multiple traveling salesman problem with single and multiple depots [J].
He, Pengfei ;
Hao, Jin-Kao .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 307 (03) :1055-1070
[49]   Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests [J].
Li, Yuan ;
Chen, Haoxun ;
Prins, Christian .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (01) :27-38
[50]   An Investigation of Hybrid Tabu Search for the Traveling Salesman Problem [J].
Xu, Dan ;
Weise, Thomas ;
Wu, Yuezhong ;
Laessig, Joerg ;
Chiong, Raymond .
BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2015, 2015, 562 :523-537