Optimizing last-mile delivery services: a robust truck-drone cooperation model and hybrid metaheuristic algorithm

被引:1
作者
Mirzapour Al-e-Hashem, Seyed Mohammad Javad [1 ,2 ]
Hejazi, Taha-Hossein [3 ]
Haghverdizadeh, Ghazal [3 ]
Shidpour, Mohsen [4 ]
机构
[1] Amirkabir Univ Technol, Tehran Polytech, Dept Ind Engn & Management Syst, Tehran, Iran
[2] Rennes Sch Business, 2 Rue Robert Arbrissel, F-35065 Rennes, France
[3] Amirkabir Univ Technol, Tehran Polytech, Dept Ind Engn, Garmsar Campus, Garmsar, Iran
[4] Amirkabir Univ Technol, Dept Ind Engn, Tehran, Iran
关键词
Hybrid truck-drone routing; Robust optimization; Uncertainty; Adaptive large neighborhood search algorithm; TRAVELING SALESMAN PROBLEM; OPTIMIZATION; DEPOT;
D O I
10.1007/s10479-024-06164-5
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In response to the increasing demand for faster customer service and cost-effective solutions in competitive markets, many companies are exploring strategies and tools to streamline their services. One emerging approach involves the integration of drones with trucks, offering potential benefits such as reduced environmental impact and delivery time. This study focuses on the use of a single truck coordinating with multiple drones for postal package delivery. The drones are transported by the truck, and both vehicles are responsible for carrying out deliveries. To account for weather uncertainties, specifically wind direction and speed affecting drone travel time, a robust optimization model is developed to address the truck-drone routing problem. Additionally, a hybrid metaheuristic algorithm is proposed, combining Adaptive Large Neighborhood Search, Clarke and Wright Saving Algorithm, and Genetic Algorithm. The effectiveness of this algorithm is assessed through numerical experiments, including sensitivity analyses on key problem parameters. The findings demonstrate that the proposed model has practical applications in last-mile delivery services, while the algorithm provides near-optimal solutions within a reasonable timeframe (ALNS reaches the solutions 3500% faster than GAMS for small-sized problems in average). Also the results show that with the 100% increase in average distance between nodes in the network, the service time increases by more than 200%.
引用
收藏
页数:31
相关论文
共 38 条
[1]   Truck-based drone delivery system: An economic and environmental assessment [J].
Baldisseri, Andrea ;
Siragusa, Chiara ;
Seghezzi, Arianna ;
Mangiaracina, Riccardo ;
Tumino, Angela .
TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2022, 107
[2]   Robust discrete optimization and network flows [J].
Bertsimas, D ;
Sim, M .
MATHEMATICAL PROGRAMMING, 2003, 98 (1-3) :49-71
[3]   Dynamic programming approaches for the traveling salesman problem with drone [J].
Bouman, Paul ;
Agatz, Niels ;
Schmidt, Marie .
NETWORKS, 2018, 72 (04) :528-542
[4]   Drone delivery from trucks: Drone scheduling for given truck routes [J].
Boysen, Nils ;
Briskorn, Dirk ;
Fedtke, Stefan ;
Schwerdfeger, Stefan .
NETWORKS, 2018, 72 (04) :506-527
[5]   Optimization for drone and drone-truck combined operations: A review of the state of the art and future directions [J].
Chung, Sung Hoon ;
Sah, Bhawesh ;
Lee, Jinkun .
COMPUTERS & OPERATIONS RESEARCH, 2020, 123
[6]   SCHEDULING OF VEHICLES FROM CENTRAL DEPOT TO NUMBER OF DELIVERY POINTS [J].
CLARKE, G ;
WRIGHT, JW .
OPERATIONS RESEARCH, 1964, 12 (04) :568-&
[7]   Optimization of battery swapping infrastructure for e-commerce drone delivery [J].
Cokyasar, Taner .
COMPUTER COMMUNICATIONS, 2021, 168 :146-154
[8]  
CPLEX, 2009, International Business Machines Corporation, V46, P2157
[9]   A Green Vehicle Routing Problem [J].
Erdogan, Sevgi ;
Miller-Hooks, Elise .
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2012, 48 (01) :100-114
[10]   Dynamic truck-drone routing problem for scheduled deliveries and on-demand pickups with time-related constraints [J].
Gu, Ruixue ;
Liu, Yang ;
Poon, Mark .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2023, 151