The problem that searches for the shortest delivery time of cooperative routes of trucks and drones is called the cooperative delivery routing prob-lem of trucks and drones (CDRP-T&D). The CDRP-T&D is an extension of the vehicle routing problem which involves multiple trucks and multiple drones. In CDRP-T&D, each truck serves as a moving depot and can replace fresh batteries for drones, while each drone serves as a flying sidekick that delivers multiple parcels in a sortie. Additionally, the energy consumption of the drone, which varies with the payload, is taken into account. The mathe-matic model is formulated for CDRP-T&D. The CDRP-T&D is tackled by using a variable neighborhood descent (VND) and the initial solution of VND is generate by integrating K-means clustering and Nearest neighbor. Experiments are run by comparing the proposed algorithm with tabu search (TS) on different-scale instances. The experimental results indicate that the proposed method is competitive against TS. Besides, the sensitivity analysis is conducted with respect to a critical factor.
A Variable Neighborhood Descent Method for Cooperative Delivery Routing Problem of Trucks and Drones
Lect. Notes Electrical Eng.
International Conference on Autonomous Unmanned Systems ; 2021 ; Changsha, China September 24, 2021 - September 26, 2021
Proceedings of 2021 International Conference on Autonomous Unmanned Systems (ICAUS 2021) ; Chapter : 152 ; 1537-1546
2022-03-18
10 pages
Article/Chapter (Book)
Electronic Resource
English
A Variable Neighborhood Descent Method for Cooperative Delivery Routing Problem of Trucks and Drones
British Library Conference Proceedings | 2022
|Multi-trucks-and-drones cooperative pickup and delivery problem
Elsevier | 2023
|Multiple-Drones-Multiple-Trucks Routing Problem for Disruption Assessment
Transportation Research Record | 2022
|Scheduling trucks and drones for cooperative deliveries
Elsevier | 2023
|