亲爱的研友该休息了!由于当前在线用户较少,发布求助请尽量完整地填写文献信息,科研通机器人24小时在线,伴您度过漫漫科研夜!身体可是革命的本钱,早点休息,好梦!

Benders decomposition for traveling salesman problem with drone: A space-time-state network perspective

旅行商问题 无人机 透视图(图形) 分解 2-选项 旅行购买者问题 状态空间 国家(计算机科学) 计算机科学 数学优化 运筹学 流量网络 工程类 航空航天工程 数学 人工智能 算法 遗传学 生物 统计 生态学
作者
Chenhao Zhang,Yaoxin Wu,Tao Feng,Yibei Zhang,Maocan Song,Lin Cheng
出处
期刊:Transportation Research Part C-emerging Technologies [Elsevier BV]
卷期号:179: 105255-105255 被引量:2
标识
DOI:10.1016/j.trc.2025.105255
摘要

As technology advances, the integration of diverse transportation modes is accelerating, with truck-drone collaboration emerging as a promising solution to urban last-mile delivery challenges. While prior research has extensively covered spatial synchronization in customer service networks, studies on temporal synchronization and time-dependence in real transportation networks remains limited, as does the consideration of candidate rendezvous points. To address this gap, we propose a novel modeling approach to the Traveling Salesman Problem with Drone, utilizing a Space-Time-State network framework, termed TSPD-STS. An arc-based integer linear programming (ILP) model is presented for single-truck single-drone delivery, incorporating time-dependent travel time influenced by varying speeds, candidate rendezvous, drone capacity, payload-dependent endurance and time windows. We solve the problem by a branch-and-Benders-cut approach based on generalized Benders decomposition, dividing it into an assignment problem (i.e., the master problem) and a coupled scheduling problem (i.e., the subproblem). The master problem is solved only once, while the subproblem dynamically provides cuts along the branching. To improve computational efficiency, we design five classes valid inequalities to strengthen the relaxed master problem, and propose a dynamically tightened optimal cut and a novel valid cut which, unlike traditional no-good cut, can handle clusters of variables in a single step. Extensive computational experiments on 170 instances with 4 to 20 space nodes, tested under four time-dependent patterns and compared against ten algorithms using branch-and-bound and operation-based dynamic programming as baselines, demonstrate the superior performance of the proposed method. Our approach reduces computation time by 38.15% to 79.43% and yields smaller optimality gaps, with an average of 0.46%. Sensitivity analyses provide practical insights for logistics planning and strategic decision-making.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
chris完成签到,获得积分10
6秒前
15秒前
qqq发布了新的文献求助10
21秒前
大医仁心完成签到 ,获得积分10
37秒前
1分钟前
柠檬水发布了新的文献求助10
1分钟前
柠檬水完成签到,获得积分10
2分钟前
丰富的德天完成签到 ,获得积分10
2分钟前
2分钟前
2分钟前
张兔子完成签到 ,获得积分10
2分钟前
仁爱的觅风完成签到,获得积分10
3分钟前
张张张完成签到 ,获得积分20
3分钟前
navon完成签到,获得积分10
3分钟前
伽古拉40k完成签到,获得积分10
4分钟前
huyu完成签到 ,获得积分10
4分钟前
默默无闻完成签到 ,获得积分10
4分钟前
Orange应助晚星采纳,获得30
5分钟前
渡人舟应助提米橘采纳,获得10
5分钟前
渡人舟应助提米橘采纳,获得50
5分钟前
渡人舟应助提米橘采纳,获得10
5分钟前
渡人舟应助提米橘采纳,获得10
5分钟前
渡人舟应助提米橘采纳,获得10
5分钟前
渡人舟应助提米橘采纳,获得50
5分钟前
6分钟前
晚星发布了新的文献求助30
6分钟前
6分钟前
土豆饼完成签到,获得积分20
7分钟前
7分钟前
Gloria发布了新的文献求助10
8分钟前
8分钟前
8分钟前
LSS发布了新的文献求助10
8分钟前
南猫喵完成签到,获得积分10
9分钟前
汉堡包应助Callan采纳,获得10
9分钟前
欢喜的不平完成签到,获得积分10
10分钟前
李健应助科研通管家采纳,获得10
10分钟前
suge完成签到,获得积分10
10分钟前
坦率如之完成签到,获得积分10
11分钟前
零号轨迹完成签到 ,获得积分10
11分钟前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Health Psychology 600
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
When Is Two-Stage Sample Robust Optimization Asymptotically Optimal? 500
APA handbook of comparative psychology: Basic concepts, methods, neural substrate, and behavior 500
Discerning Saints: Moralization of Intrinsic Motivation and Selective Prosociality at Work 500
Handbuch Trainingswissenschaft – Trainingslehre 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7592060
求助须知:如何正确求助?哪些是违规求助? 9169242
关于积分的说明 19626005
捐赠科研通 7170408
什么是DOI,文献DOI怎么找? 3267480
关于科研通互助平台的介绍 2432351
邀请新用户注册赠送积分活动 2259968