A branch-and-cut algorithm for the vehicle routing problem with drones

无人机 计算机科学 布线(电子设计自动化) 数学优化 分支和切割 线性规划 航程(航空) 灵活性(工程) 整数规划 车辆路径问题 拉格朗日松弛 线性规划松弛 卡车 放松(心理学) 算法 数学 计算机网络 工程类 遗传学 社会心理学 生物 统计 航空航天工程 心理学
作者
Felix Tamke,Udo Buscher
出处
期刊:Transportation Research Part B-methodological [Elsevier]
卷期号:144: 174-203 被引量:89
标识
DOI:10.1016/j.trb.2020.11.011
摘要

Increasing online purchases and higher customer requirements in terms of speed, flexibility, and costs of home deliveries are challenges to every company involved in last mile delivery. Technological advances have paved the way for last mile deliveries by unmanned aerial vehicles (UAV). Yet, the limited range and capacity of UAVs remain a challenge. This makes the possibility of pairing drones with well-established means of transportation highly attractive. However, the optimization problem arising in joint delivery by truck and drone has only recently been considered in the literature. We develop a new mixed integer linear programming (MILP) model for the vehicle routing problem with drones (VRPD) with two different time-oriented objective functions. Additionally, we introduce new valid inequalities based on problem properties to strengthen the linear relaxation. One type of valid inequalities is an extension of the well known subtour elimination constraints. As the number of these constraints grows exponentially with instance size, we provide a separation routine that identifies violated cuts in relaxed solutions to add them efficiently. We therefore derive the first branch-and-cut algorithm for the VRPD. Extensive numerical experiments are performed to demonstrate the competitiveness of our MILP formulation and to show the impact of different combinations of valid inequalities. We optimally solve instances with unrestricted drone ranges with up to 20 nodes and instances with range-limited drones with up to 30 nodes. These are significantly larger instance sizes than the previously known exact approaches are able to handle. In addition, we introduce a relaxation of the VRPD that provides good lower bounds in notable reduced run times. To provide managerial insights, we show that integrating truck-drone tandems into transportation systems can not only lead to improvements regarding the speed of deliveries, but can also be used to reduce the fleet size without slowing down the delivery process and increasing the workload of truck drivers.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
白切鸡大王完成签到,获得积分10
刚刚
七子完成签到 ,获得积分10
1秒前
爆米花应助yingzi采纳,获得10
1秒前
言余应助三岁半采纳,获得20
1秒前
AI读文献的小新完成签到,获得积分10
1秒前
2秒前
malistm完成签到,获得积分10
3秒前
果实完成签到,获得积分10
4秒前
李健春发布了新的文献求助10
4秒前
叶世玉发布了新的文献求助10
4秒前
沈sm发布了新的文献求助10
5秒前
猪猪完成签到,获得积分10
5秒前
ruixuekuangben完成签到,获得积分0
5秒前
89757完成签到,获得积分10
6秒前
Orange应助彪壮的未来采纳,获得10
7秒前
无花果应助malistm采纳,获得10
8秒前
米妮完成签到 ,获得积分10
8秒前
CipherSage应助yujie采纳,获得10
8秒前
ding应助汪汪队立大功采纳,获得10
8秒前
8秒前
谢陈完成签到 ,获得积分10
9秒前
互助遵法尚德应助橘子采纳,获得10
10秒前
兔子发布了新的文献求助30
10秒前
彭于彦祖应助踏实的雁玉采纳,获得20
10秒前
11秒前
独特的忆彤完成签到 ,获得积分10
11秒前
11秒前
耗尽完成签到,获得积分10
12秒前
coco234完成签到,获得积分10
12秒前
lalala完成签到 ,获得积分10
12秒前
susu完成签到,获得积分10
13秒前
Yilam完成签到,获得积分10
13秒前
Nolan完成签到,获得积分10
14秒前
14秒前
14秒前
14秒前
轻松的雨竹给轻松的雨竹的求助进行了留言
15秒前
16秒前
16秒前
16秒前
高分求助中
Evolution 10000
The Young builders of New china : the visit of the delegation of the WFDY to the Chinese People's Republic 1000
юрские динозавры восточного забайкалья 800
English Wealden Fossils 700
Foreign Policy of the French Second Empire: A Bibliography 500
Chen Hansheng: China’s Last Romantic Revolutionary 500
China's Relations With Japan 1945-83: The Role of Liao Chengzhi 400
热门求助领域 (近24小时)
化学 医学 生物 材料科学 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 基因 遗传学 催化作用 物理化学 免疫学 量子力学 细胞生物学
热门帖子
关注 科研通微信公众号,转发送积分 3147695
求助须知:如何正确求助?哪些是违规求助? 2798784
关于积分的说明 7831337
捐赠科研通 2455622
什么是DOI,文献DOI怎么找? 1306889
科研通“疑难数据库(出版商)”最低求助积分说明 627943
版权声明 601587