The Undirected Team Orienteering Arc Routing Problem: Formulations, Valid Inequalities, and Exact Algorithms

弧形布线 数学优化 本德分解 定向运动 抓住 极限(数学) 计算机科学 布线(电子设计自动化) 无向图 灵活性(工程) 数学 集合(抽象数据类型) 车辆路径问题 钥匙(锁) 利用 模块化(生物学) 分解 利润(经济学) 分解法(排队论) 列生成 分支和切割 时限 二进制数 计算复杂性理论 有向图 弧(几何) 拉格朗日乘数 最优化问题 三角形不等式 组合优化
作者
Wenjin Yan,Elena Fernández,Ivana Ljubić
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
标识
DOI:10.1287/trsc.2025.0155
摘要

We introduce a new variant of the Undirected Team Orienteering Arc Routing Problem (UTOARP) that incorporates three key features: required edges, capacitated vehicles, and multiple services. These features have been investigated individually in the literature but have not been considered simultaneously. In this problem, demand is placed at some edges of a given undirected graph, and served demand edges produce a profit. Feasible routes must start and end at a given depot, and there is a time limit on the maximum duration of each route and a capacity limit on the demand served by each vehicle. The problem asks for a set of up to |K| maximum profit routes while ensuring all required edges are served. We exploit optimality conditions for this problem and propose a new unified, undirected formulation with binary variables. We also introduce a logic-based Benders decomposition derived from this formulation, resulting in a new problem reformulation, and show how to strengthen the logic-based Benders cuts. Crucially, the structure of the Benders subproblems remains unchanged regardless of which of the above features are enabled, highlighting the modularity and flexibility of the approach. Furthermore, we design several new families of valid inequalities, where some of them are derived from conflict graphs. Extensive computational tests are conducted to examine the performance of the proposed formulations and valid inequalities under various settings. We further analyze the solution structure of a real-world instance to illustrate the practical impact of the different features. Our findings highlight the pivotal role of logic-based Benders decomposition and conflict graphs in solving the UTOARP, marking their first application in the context of arc routing problems to the best of our knowledge. Moreover, these techniques hold promise for advancing solution approaches in broader arc routing contexts. Funding: E. Fernández acknowledges partial support from [Grant PID2023-146643NB-I00], funded by the AEI of the Spanish Ministry of Science, Innovation, and Universities [MICIU/AEI/10.13039/501100011033]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/trsc.2025.0155 .
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
文泽完成签到,获得积分10
1秒前
科研通AI6.2应助Horizon采纳,获得10
1秒前
Tracy完成签到,获得积分20
2秒前
龙星完成签到,获得积分10
3秒前
3秒前
3秒前
挽晨发布了新的文献求助10
4秒前
4秒前
aikeyan发布了新的文献求助10
4秒前
务实善若完成签到,获得积分10
4秒前
5秒前
香蕉觅云应助科研通管家采纳,获得10
5秒前
英姑应助科研通管家采纳,获得10
5秒前
5秒前
星辰大海应助科研通管家采纳,获得10
5秒前
大个应助科研通管家采纳,获得10
5秒前
5秒前
小二郎应助科研通管家采纳,获得10
5秒前
ding应助科研通管家采纳,获得10
5秒前
情怀应助科研通管家采纳,获得10
6秒前
DKJ应助科研通管家采纳,获得10
6秒前
violetyun应助科研通管家采纳,获得10
6秒前
NexusExplorer应助科研通管家采纳,获得10
6秒前
6秒前
七月流火应助科研通管家采纳,获得10
6秒前
6秒前
研友_8K2x2Z完成签到,获得积分10
7秒前
小二郎应助A001采纳,获得10
7秒前
7秒前
Alicia发布了新的文献求助50
8秒前
邦邦完成签到,获得积分10
8秒前
LL发布了新的文献求助10
8秒前
张振国发布了新的文献求助10
8秒前
细心语琴应助YY采纳,获得50
9秒前
9秒前
zzz完成签到,获得积分10
9秒前
10秒前
11秒前
11秒前
高分求助中
Cronologia da história de Macau 5000
Erwählung und Berufung bei Paulus: Bedeutung, Entwicklung und Funktion einer Vorstellung in ihrem frühjüdischen und griechisch-römischen Kontext 850
Matrix Methods in Data Mining and Pattern Recognition 510
Interactions of Vowel Quality and Prosody in East Slavic 500
用于植入式医疗器械的馈通设计与实现 400
Animalia: Animal and Human Interaction in the Early Medieval English World (Exeter Studies in Medieval Europe) 400
Synfacts Issue 07 · Volume 22 400
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7138329
求助须知:如何正确求助?哪些是违规求助? 8786826
关于积分的说明 18575391
捐赠科研通 6725808
什么是DOI,文献DOI怎么找? 3154714
关于科研通互助平台的介绍 2281538
邀请新用户注册赠送积分活动 2129178