已入深夜,您辛苦了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!祝你早点完成任务,早点休息,好梦!

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 被引量:172
标识
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
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
刚刚
1秒前
2秒前
2秒前
4秒前
betterme发布了新的文献求助30
4秒前
8R发布了新的文献求助10
4秒前
杨海洋发布了新的文献求助10
4秒前
bkagyin应助sxf采纳,获得10
5秒前
5秒前
科研浦东发布了新的文献求助10
5秒前
文艺的襄完成签到,获得积分10
5秒前
surgeon_mq发布了新的文献求助10
6秒前
只想摸鱼完成签到,获得积分10
6秒前
烟花应助欧阳辞采纳,获得10
6秒前
淡淡若蕊完成签到,获得积分20
7秒前
7秒前
7秒前
彬彬发布了新的文献求助10
8秒前
研友_VZG7GZ应助纸箱采纳,获得10
9秒前
贪玩雅山发布了新的文献求助10
9秒前
10秒前
英俊的铭应助macon采纳,获得10
11秒前
12秒前
科研通AI6.2应助zihang采纳,获得10
12秒前
13秒前
青帝完成签到 ,获得积分10
14秒前
小yang发布了新的文献求助10
15秒前
科研通AI6.2应助红墨采纳,获得10
15秒前
15秒前
乐观的黎云完成签到,获得积分10
16秒前
molihuakai应助we233采纳,获得10
16秒前
失眠妙竹完成签到,获得积分10
16秒前
fruchtjelly发布了新的文献求助10
17秒前
周南发布了新的文献求助10
17秒前
欧阳辞完成签到,获得积分10
17秒前
18秒前
18秒前
18秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Principles of town planning: translating concepts to applications 1000
Management and the Arts 510
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
核安全综合知识2024版 500
Photothermal Science and Techniques 500
Digital Displacement Hydrostatic Transmission for Rotorcraft and Distributed Propulsion 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7705492
求助须知:如何正确求助?哪些是违规求助? 9263129
关于积分的说明 20041587
捐赠科研通 7281074
什么是DOI,文献DOI怎么找? 3295304
关于科研通互助平台的介绍 2450284
邀请新用户注册赠送积分活动 2302145