Reliable truck-drone routing with dynamic synchronization: A high-dimensional network programming approach

被引:10
作者
Xing, Jiahao [1 ,2 ]
Guo, Tong [1 ,2 ]
Tong, Lu [1 ,2 ]
机构
[1] Beihang Univ, Sch Elect & Informat Engn, Beijing 100191, Peoples R China
[2] State Key Lab CNS ATM, Beijing 100191, Peoples R China
关键词
Truck -drone routing problem; Travel time reliability; Space -time -state network; Integer programming; Hierarchical decomposition algorithm; TRAVELING SALESMAN PROBLEM; TIME VARIABILITY; LOCAL SEARCH; DELIVERY; ALGORITHM; OPTIMIZATION; DESIGN;
D O I
10.1016/j.trc.2024.104698
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Within the context of burgeoning multimodal transportation systems, the emerging integration of drones and trucks is shaping the landscape of last -mile delivery. In this service -centric industry, uncertainty in travel time challenges the stability of delivery systems, highlighting the need for a more reliable and effective methodology. To tackle this challenge, we propose a reliable truckdrone collaborative routing problem enabling dynamic synchronization between trucks and drones in this paper. An integer programming model based on a space - time-state network has been developed to minimize the total travel time as well as their associated variabilities. Furthermore, to overcome the computational challenges for large-scale scenarios, a multidimensional -based hierarchical decomposition has been developed to identify a high -quality solution effectively. Numerical experimental results based on an illustrative network and a real -world network demonstrate the effectiveness of the introduced algorithm. Our proposed methodology advances operational planning for truck -drone collaborative delivery by appropriately navigating unavoidable variations of travel time, shedding light on the broad development prospects of the multimodal transportation system.
引用
收藏
页数:25
相关论文
共 59 条
[1]   Optimization Approaches for the Traveling Salesman Problem with Drone [J].
Agatz, Niels ;
Bouman, Paul ;
Schmidt, Marie .
TRANSPORTATION SCIENCE, 2018, 52 (04) :965-981
[2]  
Antunes J., 2021, COMMERCIAL UAV NEWS
[3]   School bus routing and scheduling with stochastic time-dependent travel times considering on-time arrival reliability [J].
Babaei, Mohsen ;
Rajabi-Bahaabadi, Mojtaba .
COMPUTERS & INDUSTRIAL ENGINEERING, 2019, 138
[4]   A column-and-row generation approach for the flying sidekick travelling salesman problem [J].
Boccia, Maurizio ;
Masone, Adriano ;
Sforza, Antonio ;
Sterle, Claudio .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 124
[5]   The Continuous-Time Service Network Design Problem [J].
Boland, Natashia ;
Hewitt, Mike ;
Marshall, Luke ;
Savelsbergh, Martin .
OPERATIONS RESEARCH, 2017, 65 (05) :1303-1321
[6]   A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones [J].
Bruni, M. E. ;
Khodaparasti, S. ;
Moshref-Javadi, M. .
COMPUTERS & OPERATIONS RESEARCH, 2022, 145
[7]   Value of travel time reliability: A review of current evidence [J].
Carrion, Carlos ;
Levinson, David .
TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 2012, 46 (04) :720-741
[8]   Exact methods for the traveling salesman problem with multiple drones [J].
Cavani, Sara ;
Iori, Manuel ;
Roberti, Roberto .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2021, 130
[9]   The α-reliable path problem in stochastic road networks with link correlations: A moment-matching-based path finding algorithm [J].
Chen, Peng ;
Tong, Rui ;
Lu, Guangquan ;
Wang, Yunpeng .
EXPERT SYSTEMS WITH APPLICATIONS, 2018, 110 :20-32
[10]  
Cheng C., 2020, Work. Pap.