A column-and-row generation approach for the flying sidekick travelling salesman problem

旅行商问题 无人机 列生成 计算机科学 数学优化 卡车 车辆路径问题 水准点(测量) 代表(政治) 整数规划 运筹学 布线(电子设计自动化) 数学 工程类 计算机网络 遗传学 大地测量学 政治 法学 地理 政治学 生物 航空航天工程
作者
Maurizio Boccia,Adriano Masone,Antonio Sforza,Claudio Sterle
出处
期刊:Transportation Research Part C-emerging Technologies [Elsevier BV]
卷期号:124: 102913-102913 被引量:73
标识
DOI:10.1016/j.trc.2020.102913
摘要

The flying sidekick traveling salesman problem (FS-TSP) is a parcel delivery problem arising in the last-mile logistics, where the distribution plan of a driver-operated truck assisted by a drone (unmanned aerial vehicle, UAV) has to be defined. The FS-TSP is a variant of the TSP where routing decisions are integrated with customer-to-drone and customer-to-truck assignment decisions and truck-and-drone synchronization constraints. The objective is the minimization of the time required to serve all the customers, taking into account drone payload capacity and battery power constraints. In this work we provide a new representation of the FS-TSP based on the definition of an extended graph. This representation allows to model the problem by a new and compact integer linear programming formulation, where the synchronization issue is tackled in a column generation fashion, thus avoiding the usage of big-M constraints, representing one of the main drawbacks of the models present in literature. The proposed formulation has been solved by an exact approach which combines a Branch-and-Cut algorithm and a column generation procedure, strengthened by variable fixing strategies and new valid inequalities specifically defined for the problem. The proposed method has been experienced on a large set of benchmark instances. Computational results show that the proposed approach either is competitive or outperforms the best exact approach present in literature for the FS-TSP. Indeed, it is able to provide the optimal solution for all small size instances with 10 customers and for several medium size instances with 20 customers, some of them never solved before.
最长约 10秒,即可获得该文献文件

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

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
xyh发布了新的文献求助10
刚刚
江璃完成签到,获得积分10
1秒前
TT发布了新的文献求助10
1秒前
美梦成真完成签到,获得积分10
2秒前
Gakay完成签到,获得积分10
2秒前
量子星尘发布了新的文献求助10
3秒前
szj完成签到,获得积分0
4秒前
旦皋完成签到,获得积分10
4秒前
赘婿应助花壳在逃野猪采纳,获得10
5秒前
卷卷完成签到,获得积分10
7秒前
JSY完成签到 ,获得积分20
7秒前
xyh完成签到,获得积分10
8秒前
小曾应助Florencia采纳,获得10
9秒前
神外王001完成签到 ,获得积分10
9秒前
14秒前
你是谁完成签到,获得积分10
15秒前
majf完成签到,获得积分10
16秒前
linhanwenzhou完成签到,获得积分10
16秒前
JSY关注了科研通微信公众号
16秒前
853225598完成签到,获得积分10
16秒前
798完成签到,获得积分10
17秒前
善学以致用应助董怼怼采纳,获得10
17秒前
妍儿完成签到,获得积分20
18秒前
隐形曼青应助高大的水壶采纳,获得10
18秒前
马哥二弟无敌完成签到 ,获得积分10
19秒前
20秒前
Florencia完成签到,获得积分10
20秒前
务实颜完成签到 ,获得积分10
20秒前
20秒前
amberzyc应助小远采纳,获得10
21秒前
21秒前
22秒前
22秒前
23秒前
23秒前
Rondab应助小猪采纳,获得30
23秒前
DLDL完成签到,获得积分10
23秒前
24秒前
沧海云完成签到 ,获得积分10
24秒前
发嗲的迎天完成签到 ,获得积分10
25秒前
高分求助中
【提示信息,请勿应助】关于scihub 10000
Les Mantodea de Guyane: Insecta, Polyneoptera [The Mantids of French Guiana] 3000
徐淮辽南地区新元古代叠层石及生物地层 3000
The Mother of All Tableaux: Order, Equivalence, and Geometry in the Large-scale Structure of Optimality Theory 3000
Handbook of Industrial Diamonds.Vol2 1100
Global Eyelash Assessment scale (GEA) 1000
Picture Books with Same-sex Parented Families: Unintentional Censorship 550
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4038368
求助须知:如何正确求助?哪些是违规求助? 3576068
关于积分的说明 11374313
捐赠科研通 3305780
什么是DOI,文献DOI怎么找? 1819322
邀请新用户注册赠送积分活动 892672
科研通“疑难数据库(出版商)”最低求助积分说明 815029