Aerial-ground collaborative routing with time constraints

查看全文 作　　者：Jiahao [1,2]XING;Lichen [3]SU;Wenjing [4,5]HONG;Lu [6]TONG;Renli [7]LYU;Wenbo [1]DU

机构地区：[1]School of Electronics and Information Engineering,Beihang University,Beijing 100091,China;[2]School of Future Aerospace Technology/Shen Yuan Honors College,Beihang University,Bejing 100091,China;[3]School of Automation Science and Electrical Engineering,Beihang University,Bejing 100091,China;[4]Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent Computation,Shenzhen 518055,China;[5]Department of Computer Science and Engineering,Southern University of Science and Technology,Shenzhen 518055,China;[6]Research Institute of Frontier Science,Beihang University,Beijing 100083,China;[7]CAAC Key Laboratory of General Aviation Operation,Civil Aviation Management Institute of China,Beijing 100102,China

出　　处：《Chinese Journal of Aeronautics》索引2023年第36卷第2期,共14页

基　　金：supported by the National Natural Science Foundation of China(No.61961146005)。 摘　　要：The advancement of autonomous technology makes electric-powered drones an excellent choice for flexible logistics services at the last mile delivery stage.To reach a balance between green transportation and competitive edge,the collaborative routing of drones in the air and trucks on the ground is increasingly invested in the next generation of delivery,where it is particularly reasonable to consider customer time windows and time-dependent travel times as two typical time-related factors in daily services.In this paper,we propose the Vehicle Routing Problem with Drones under Time constraints(VRPD-T)and focus on the time constraints involved in realistic scenarios during the delivery.A mixed-integer linear programming model has been developed to minimize the total delivery completion time.Furthermore,to overcome the limitations of standard solvers in handling large-scale complex issues,a space-time hybrid heuristic-based algorithm has been developed to effectively identify a high-quality solution.The numerical results produced from randomly generated instances demonstrate the effectiveness of the proposed algorithm. 关键词：Aerial-ground collaborative delivery Mixed-integer programming Space-time hybrid heuristic algorithm Vehicle routing problem with drones Time-dependent travel times

相关文献

参考文献（37）
引证文献（1）
耦合文献（0）

参考文献(37)

引证文献(1)

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

Aerial-ground collaborative routing with time constraints

参考文献(37)

引证文献(1)

用户提示