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

无人机 计算机科学 布线(电子设计自动化) 数学优化 分支和切割 线性规划 航程(航空) 灵活性(工程) 整数规划 车辆路径问题 拉格朗日松弛 线性规划松弛 卡车 放松(心理学) 算法 数学 计算机网络 工程类 心理学 社会心理学 统计 遗传学 生物 航空航天工程
作者
Felix Tamke,Udo Buscher
出处
期刊:Transportation Research Part B-methodological [Elsevier BV]
卷期号:144: 174-203 被引量:114
标识
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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
烟雨平生完成签到 ,获得积分10
1秒前
蒙多完成签到,获得积分10
1秒前
2秒前
不辞完成签到,获得积分10
2秒前
打打应助xyz采纳,获得10
2秒前
舒服的鱼完成签到 ,获得积分10
2秒前
Sofia完成签到 ,获得积分0
2秒前
Res_M完成签到 ,获得积分10
4秒前
酷波er应助梅雨季来信采纳,获得10
5秒前
5秒前
5秒前
早早完成签到,获得积分10
6秒前
Bioflying完成签到,获得积分10
8秒前
今后应助机械师简采纳,获得10
8秒前
沟通亿心发布了新的文献求助10
9秒前
搞怪藏今完成签到 ,获得积分10
9秒前
亦沐黎完成签到,获得积分10
9秒前
9秒前
Yi发布了新的文献求助10
9秒前
嘟嘟等文章完成签到,获得积分10
10秒前
忐忑的天真完成签到 ,获得积分10
10秒前
wm999完成签到,获得积分20
10秒前
zhongbo完成签到,获得积分10
11秒前
冯侠完成签到,获得积分20
11秒前
小橘子完成签到,获得积分10
11秒前
义气小白菜完成签到 ,获得积分10
11秒前
12秒前
bkagyin应助z'x采纳,获得10
14秒前
Julie完成签到 ,获得积分10
14秒前
14秒前
Sledge完成签到,获得积分10
15秒前
秀丽的初柔完成签到,获得积分10
16秒前
干净幻梦完成签到,获得积分10
16秒前
老迟到的凝丝完成签到,获得积分10
16秒前
kitty完成签到,获得积分10
16秒前
凶狠的白桃完成签到 ,获得积分10
16秒前
兼听则明完成签到,获得积分10
17秒前
17秒前
markerfxq完成签到,获得积分10
17秒前
17秒前
高分求助中
The world according to Garb 600
Разработка метода ускоренного контроля качества электрохромных устройств 500
Mass producing individuality 500
Chinesen in Europa – Europäer in China: Journalisten, Spione, Studenten 500
Arthur Ewert: A Life for the Comintern 500
China's Relations With Japan 1945-83: The Role of Liao Chengzhi // Kurt Werner Radtke 500
Two Years in Peking 1965-1966: Book 1: Living and Teaching in Mao's China // Reginald Hunt 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 物理 生物化学 纳米技术 计算机科学 化学工程 内科学 复合材料 物理化学 电极 遗传学 量子力学 基因 冶金 催化作用
热门帖子
关注 科研通微信公众号,转发送积分 3820043
求助须知:如何正确求助?哪些是违规求助? 3362959
关于积分的说明 10419891
捐赠科研通 3081308
什么是DOI,文献DOI怎么找? 1695047
邀请新用户注册赠送积分活动 814901
科研通“疑难数据库(出版商)”最低求助积分说明 768545