The Multi-visit Traveling Salesman Problem with Multi-Drones

无人机 旅行商问题 计算机科学 有效载荷(计算) 数学优化 数学 网络数据包 算法 计算机网络 遗传学 生物
作者
Zhihao Luo,Mark Poon,Zhenzhen Zhang,Zhong Liu,Andrew Lim
出处
期刊:Transportation Research Part C-emerging Technologies [Elsevier BV]
卷期号:128: 103172-103172 被引量:118
标识
DOI:10.1016/j.trc.2021.103172
摘要

The use of drones for parcel delivery has recently attracted wide attention due to its potential in improving efficiency of the last-mile delivery. Though attempts have been made on combined truck-drone delivery to deploy multiple drones that can deliver multiple packages per trip, many placed extra assumptions to simplify the problem. This paper investigates the multi-visit traveling salesman problem with multi-drones (MTSP-MD), whose objective is to minimize the time (makespan) required by the truck and the drones to serve all customers together. The energy consumption of the drone depends on the flight time, the self-weight of the drone and the total weight of packages carried by the drone, which declines after each delivery throughout the drone flight. The MTSP-MD problem consists of three complicated sub-problems, namely (1) the drone flight problem with both a payload capacity constraint and an energy endurance constraint, (2) the traveling salesman problem with precedence constraints, and (3) the synchronization problem between the truck route and the drone schedules. The problem is first formulated into a mixed-integer linear program (MILP) model and we propose a multi-start tabu search (MSTS) algorithm with tailored neighborhood structure and a two-level solution evaluation method that incorporates a drone-level segment-based evaluation and a solution-level evaluation based on the critical path method (CPM). The experimental results demonstrate the accuracy and efficiency of our proposed algorithm on small-scale instances and show a significant cost reduction when considering multi-visits, multi-drones, and drones with higher payload capacity and higher battery capacity for medium and large-scale instances.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
军帽发布了新的文献求助10
1秒前
是子子子子枫完成签到,获得积分10
1秒前
2秒前
苹果白凝发布了新的文献求助50
2秒前
麻烦~发布了新的文献求助10
3秒前
5秒前
传奇3应助岁岁采纳,获得10
7秒前
8秒前
10秒前
MJS完成签到,获得积分10
11秒前
屿若发布了新的文献求助10
11秒前
共享精神应助刘无敌采纳,获得10
11秒前
wtt发布了新的文献求助10
11秒前
CC关注了科研通微信公众号
12秒前
sn完成签到,获得积分10
14秒前
bkagyin应助飞翔的企鹅采纳,获得10
14秒前
14秒前
虞滢滢发布了新的文献求助10
14秒前
量子星尘发布了新的文献求助10
15秒前
麻烦~完成签到,获得积分10
15秒前
16秒前
Li chun sheng完成签到,获得积分10
18秒前
3366发布了新的文献求助10
19秒前
20秒前
CipherSage应助谨言采纳,获得10
21秒前
qqqqqqy完成签到,获得积分10
25秒前
BDMAXPK发布了新的文献求助10
26秒前
彭于晏应助Shrine采纳,获得10
28秒前
深情的皮皮虾完成签到 ,获得积分10
31秒前
i_jueloa完成签到,获得积分10
31秒前
32秒前
34秒前
34秒前
岁岁完成签到,获得积分10
36秒前
木乙发布了新的文献求助10
37秒前
38秒前
Tong完成签到,获得积分10
38秒前
39秒前
研友_VZG7GZ应助笨笨的秋采纳,获得10
39秒前
塔菲尔完成签到 ,获得积分10
40秒前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
Picture Books with Same-sex Parented Families: Unintentional Censorship 700
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
不知道标题是什么 500
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3975658
求助须知:如何正确求助?哪些是违规求助? 3519986
关于积分的说明 11200481
捐赠科研通 3256410
什么是DOI,文献DOI怎么找? 1798247
邀请新用户注册赠送积分活动 877490
科研通“疑难数据库(出版商)”最低求助积分说明 806376