Truck-Drone Pickup and Delivery Problem with Drone Weight-Related Cost

被引:5
作者
Xia, Yang [1 ]
Wu, Tingying [2 ]
Xia, Beixin [1 ]
Zhang, Junkang [1 ]
机构
[1] Shanghai Univ, Sch Management, Shanghai 200444, Peoples R China
[2] Univ Sci & Technol China, Int Inst Finance, Sch Management, Anhui Prov Key Lab Contemporary Logist & Supply Ch, Hefei 230026, Peoples R China
关键词
truck-drone pickup and delivery problem; drone weight-related cost; adaptive large neighborhood search algorithm; VEHICLE-ROUTING PROBLEM; TRAVELING SALESMAN PROBLEM; TIME WINDOWS; SEARCH; OPTIMIZATION; ALGORITHM; BRANCH; PRICE; CUT;
D O I
10.3390/su152316342
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
Truck-drone delivery is widely used in logistics distribution for achieving sustainable development, in which drone weight greatly affects transportation cost. Thus, we consider a new combined truck-drone pickup and delivery problem with drone weight-related cost in the context of last-mile logistics. A system of integer programming is formulated with the objective of minimizing the total cost of the drone weight-related cost, fixed vehicle cost and travel distance cost. An improved adaptive large neighborhood search algorithm (IALNS) is designed based on the characteristics of the problem, several effective destroy and repair operators are designed to explore the solution space, and a simulated annealing strategy is introduced to avoid falling into the local optimal solution. To evaluate the performance of the IALNS algorithm, 72 instances are randomly generated and tested. The computational results on small instances show that the proposed IALNS algorithm performs better than CPLEX both in efficiency and effectiveness. When comparing the truck-drone pickup and delivery problem with drone weight-related cost to the problem without drone weight-related cost, it is found that ignoring the drone weight constraints leads to an underestimate of the total travel cost by 12.61% based on the test of large instances.
引用
收藏
页数:15
相关论文
共 30 条
[1]   An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading [J].
Alyasiry, Ali Mehsin ;
Forbes, Michael ;
Bulmer, Michael .
TRANSPORTATION SCIENCE, 2019, 53 (06) :1695-1705
[2]   Dynamic programming approaches for the traveling salesman problem with drone [J].
Bouman, Paul ;
Agatz, Niels ;
Schmidt, Marie .
NETWORKS, 2018, 72 (04) :528-542
[3]   Parcel delivery by vehicle and drone [J].
El-Adle, Amro M. ;
Ghoniem, Ahmed ;
Haouari, Mohamed .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2021, 72 (02) :398-416
[4]   Hybrid genetic-sweep algorithm to solve the vehicle routing problem with drones [J].
Euchi, Jalel ;
Sadok, Abdeljawed .
PHYSICAL COMMUNICATION, 2021, 44
[5]   Granular tabu search for the pickup and delivery problem with time windows and electric vehicles [J].
Goeke, Dominik .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 278 (03) :821-836
[6]  
Haibing Li, 2003, International Journal on Artificial Intelligence Tools (Architectures, Languages, Algorithms), V12, P173, DOI 10.1142/S0218213003001186
[7]   Design and Control of an Unmanned Aerial Vehicle for Autonomous Parcel Delivery with Transition from Vertical Take-off to Forward Flight [J].
Hochstenbach, Menno ;
Notteboom, Cyriel ;
Theys, Bart ;
De Schutter, Joris .
INTERNATIONAL JOURNAL OF MICRO AIR VEHICLES, 2015, 7 (04) :395-405
[8]   The vehicle routing problem with simultaneous pickup and delivery and handling costs [J].
Hornstra, Richard P. ;
Silva, Allyson ;
Roodbergen, Kees Jan ;
Coelho, Leandro C. .
COMPUTERS & OPERATIONS RESEARCH, 2020, 115
[9]   Truck-drone hybrid delivery routing: Payload-energy dependency and No-Fly zones [J].
Jeong, Ho Young ;
Song, Byung Duk ;
Lee, Seokcheon .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 2019, 214 :220-233
[10]   Using simulated annealing to minimize fuel consumption for the time-dependent vehicle routing problem [J].
Kuo, Yiyo .
COMPUTERS & INDUSTRIAL ENGINEERING, 2010, 59 (01) :157-165