Affiliations: Key Laboratory of Operation Programming & Safety Technology of Air Traffic Management, Civil Aviation University of China, Tianjin, China
Correspondence:
[*]
Corresponding author. Meng Li, Key Laboratory of Operation Programming & Safety Technology of Air Traffic Management, Civil Aviation University of China, 300300, Tianjin, China. E-mail: m-li@cauc.edu.cn.
Abstract: Synchronous delivery with different vehicles, as an emerging concept of the delivery network, improves the efficiency of the modern logistics system significantly, which gradually gives birth to a new issue: the traveling salesman problem with drone (TSP-D). In this paper, we propose a one-truck-multiple-drone (OTMD) model on the base of the TSP-D. Compared with the traditional one-truck-one-drone (OTOD) and multiple drones models, our scheme introduces a united objective function into the optimization calculation. In terms of the proposed multiple levels iterative theory, we can compute the optimal synchronous delivery network that takes both the total delivery time and the number of drones into consideration. Four types of customer distributions are employed to investigate the OTMD model and its associated calculation approaches. Comparing the parameters of the optimal network in different delivery models, we study the relationship among the total delivery time, customer distribution and the number of serving drones. These simulation results verify the feasibility and practicality of the OTMD, and demonstrate the features of optimization calculation with different customer distributions, being beneficial to improve the efficiency of the model logistics system.
Keywords: Traveling salesman problem with drone (TSP-D), one-truck-multiple-drone (OTMD)
model, optimization calculation, modern logistics system
