Fast Bi-Level Task Assignment and Routing for Truck-Drone Collaborative Delivery

IF 9.1 1区 工程技术 Q1 ENGINEERING, CIVIL
Zonghan He;Jian Yang;Qi Zhao;Haobin Yang;Xinyu Chen;Xingyu Zhou;Yuhui Shi
{"title":"Fast Bi-Level Task Assignment and Routing for Truck-Drone Collaborative Delivery","authors":"Zonghan He;Jian Yang;Qi Zhao;Haobin Yang;Xinyu Chen;Xingyu Zhou;Yuhui Shi","doi":"10.1109/TITS.2026.3711461","DOIUrl":null,"url":null,"abstract":"The emerging use of drones in last-mile delivery (e.g., for e-commerce and emergency services) creates a need to optimize collaborative operations among trucks, drones, and supporting facilities. In this paper, we focus on the Cumulative Vehicle Routing Problem with Drone Stations (CumVRP-DS), which jointly optimizes customer (task) assignment and vehicle routing in the context of drone-station-assisted last-mile delivery. The objective is to minimize the total customer waiting time. To solve this problem, we first formulate it as a Mixed Integer Linear Programming (MILP) model, which extends the multi-level network (MLN) formulation to incorporate drone-stations. Second, we propose an improved bi-level meta-heuristic algorithm, designed to reduce the search effort required at the inner routing layer. Computational experiments show that the proposed MILP formulation is able to produce theoretically-guaranteed optimal results for instances with up to 100 customers with Gurobi, and the improved bi-level meta-heuristic achieves significantly better solutions on large instances (over 100 customers) with an average 4.4% reduction in objective values. Furthermore, our analysis provides key operational insights: it demonstrates that (1) similar task assignments often lead to similar (near-)optimal truck routes, justifying the route-reconstruction strategy, and (2) inner-layer routing can be effectively handled by reconstruction alone, suggesting computational resources should be prioritized for the task-assignment sub-problem. These insights offer an effective solution framework and practical guidelines for similar drone-assisted delivery optimization problems.","PeriodicalId":13416,"journal":{"name":"IEEE Transactions on Intelligent Transportation Systems","volume":"27 10","pages":"12782-12790"},"PeriodicalIF":9.1000,"publicationDate":"2026-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Intelligent Transportation Systems","FirstCategoryId":"5","ListUrlMain":"https://ieeexplore.ieee.org/document/11614958/","RegionNum":1,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/7/20 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"ENGINEERING, CIVIL","Score":null,"Total":0}
引用次数: 0

Abstract

The emerging use of drones in last-mile delivery (e.g., for e-commerce and emergency services) creates a need to optimize collaborative operations among trucks, drones, and supporting facilities. In this paper, we focus on the Cumulative Vehicle Routing Problem with Drone Stations (CumVRP-DS), which jointly optimizes customer (task) assignment and vehicle routing in the context of drone-station-assisted last-mile delivery. The objective is to minimize the total customer waiting time. To solve this problem, we first formulate it as a Mixed Integer Linear Programming (MILP) model, which extends the multi-level network (MLN) formulation to incorporate drone-stations. Second, we propose an improved bi-level meta-heuristic algorithm, designed to reduce the search effort required at the inner routing layer. Computational experiments show that the proposed MILP formulation is able to produce theoretically-guaranteed optimal results for instances with up to 100 customers with Gurobi, and the improved bi-level meta-heuristic achieves significantly better solutions on large instances (over 100 customers) with an average 4.4% reduction in objective values. Furthermore, our analysis provides key operational insights: it demonstrates that (1) similar task assignments often lead to similar (near-)optimal truck routes, justifying the route-reconstruction strategy, and (2) inner-layer routing can be effectively handled by reconstruction alone, suggesting computational resources should be prioritized for the task-assignment sub-problem. These insights offer an effective solution framework and practical guidelines for similar drone-assisted delivery optimization problems.
卡车-无人机协同配送的快速双层任务分配和路由
无人机在最后一英里交付(例如电子商务和应急服务)中的新兴应用,需要优化卡车、无人机和配套设施之间的协同运营。本文研究了基于无人机站点的车辆路径累积问题(CumVRP-DS),该问题在无人机站点辅助的最后一英里配送环境下,对客户(任务)分配和车辆路径进行了联合优化。目标是尽量减少顾客等待的总时间。为了解决这个问题,我们首先将其表述为一个混合整数线性规划(MILP)模型,该模型扩展了多层次网络(MLN)的表述,以纳入无人机站。其次,我们提出了一种改进的双层元启发式算法,旨在减少内部路由层所需的搜索工作量。计算实验表明,对于拥有多达100个客户的实例,所提出的MILP公式能够产生理论上保证的最优结果,并且改进的双级元启发式在大型实例(超过100个客户)上实现了显着更好的解决方案,目标值平均降低4.4%。此外,我们的分析提供了关键的操作见解:它表明(1)类似的任务分配通常会导致相似的(接近)最优卡车路线,证明了路线重建策略的有效性;(2)仅通过重建就可以有效地处理内层路线,这表明应该优先考虑任务分配子问题的计算资源。这些见解为类似的无人机辅助配送优化问题提供了有效的解决方案框架和实用指南。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IEEE Transactions on Intelligent Transportation Systems
IEEE Transactions on Intelligent Transportation Systems 工程技术-工程:电子与电气
CiteScore
14.80
自引率
12.90%
发文量
1872
审稿时长
7.5 months
期刊介绍: The theoretical, experimental and operational aspects of electrical and electronics engineering and information technologies as applied to Intelligent Transportation Systems (ITS). Intelligent Transportation Systems are defined as those systems utilizing synergistic technologies and systems engineering concepts to develop and improve transportation systems of all kinds. The scope of this interdisciplinary activity includes the promotion, consolidation and coordination of ITS technical activities among IEEE entities, and providing a focus for cooperative activities, both internally and externally.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书