Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows

整数规划 数学优化 子网 分支和切割 整数(计算机科学) 路径(计算) 布线(电子设计自动化) 剖切面法 计算机科学 匹配(统计) 车辆路径问题 还原(数学) 选择(遗传算法) 数学 统计 程序设计语言 人工智能 几何学 计算机安全 计算机网络
作者
Nicola Bianchessi,Stefan Irnich
出处
期刊:Transportation Science [Institute for Operations Research and the Management Sciences]
卷期号:53 (2): 442-462 被引量:40
标识
DOI:10.1287/trsc.2018.0825
摘要

The split delivery vehicle routing problem with time windows (SDVRPTW) is a notoriously hard combinatorial optimization problem. First, it is hard to find a useful compact mixed-integer programming (MIP) formulation for the SDVRPTW. Standard modeling approaches either suffer from inherent symmetries (mixed-integer programs with a vehicle index) or cannot exactly capture all aspects of feasibility. Because of the possibility to visit customers more than once, the standard mechanisms to propagate load and time along the routes fail. Second, the lack of useful formulations has rendered any direct MIP-based approach impossible. Up to now, the most effective exact algorithms for the SDVRPTW have been branch-and-price-and-cut approaches using path-based formulations. In this paper, we propose a new and tailored branch-and-cut algorithm to solve the SDVRPTW. It is based on a new, relaxed compact model, in which some integer solutions are infeasible for the SDVRPTW. We use known and introduce some new classes of valid inequalities to cut off such infeasible solutions. One new class is path-matching constraints that generalize infeasible-path constraints. However, even with the valid inequalities, some integer solutions to the new compact formulation remain to be tested for feasibility. For a given integer solution, we build a generally sparse subnetwork of the original instance. On this subnetwork, all time-window-feasible routes can be enumerated, and a path-based residual problem then solved to decide on the selection of routes, the delivery quantities, and thereby the overall feasibility. All infeasible solutions need to be cut off. For this reason, we derive some strengthened feasibility cuts exploiting the fact that solutions often decompose into clusters. Computational experiments show that the new approach is able to prove optimality for several previously unsolved instances from the literature. The e-companion is available at https://doi.org/10.1287/trsc.2018.0825 .
最长约 10秒,即可获得该文献文件

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

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
兔兔完成签到 ,获得积分10
刚刚
大气小天鹅完成签到 ,获得积分10
9秒前
陈秋完成签到,获得积分10
10秒前
风清扬发布了新的文献求助10
13秒前
发个15分的完成签到 ,获得积分10
15秒前
melody完成签到 ,获得积分10
19秒前
地表飞猪完成签到,获得积分0
19秒前
天将明完成签到 ,获得积分10
20秒前
21秒前
酷酷一笑发布了新的文献求助10
26秒前
cheng完成签到 ,获得积分10
26秒前
yanjiuhuzu完成签到,获得积分10
35秒前
tengyve完成签到,获得积分10
48秒前
酷炫蛋挞完成签到 ,获得积分10
49秒前
candy6663339完成签到,获得积分10
49秒前
回首不再是少年完成签到,获得积分0
51秒前
酷酷一笑完成签到,获得积分10
53秒前
天天快乐应助科研通管家采纳,获得10
59秒前
isedu完成签到,获得积分10
59秒前
U9A完成签到,获得积分10
1分钟前
一亩蔬菜完成签到,获得积分10
1分钟前
Lucas应助科研人一枚采纳,获得10
1分钟前
hi完成签到,获得积分10
1分钟前
快乐的芷巧完成签到,获得积分10
1分钟前
酷酷小子完成签到 ,获得积分10
1分钟前
1分钟前
巴山完成签到,获得积分10
1分钟前
无花果应助ly采纳,获得10
1分钟前
loren313完成签到,获得积分0
1分钟前
玄学小生完成签到 ,获得积分10
1分钟前
小梦完成签到,获得积分10
1分钟前
白桃完成签到 ,获得积分10
1分钟前
王世卉完成签到,获得积分10
1分钟前
湖以完成签到 ,获得积分10
1分钟前
清脆的靖仇完成签到,获得积分10
1分钟前
lixiaoya完成签到,获得积分10
1分钟前
小洪俊熙完成签到,获得积分10
1分钟前
nicolaslcq完成签到,获得积分10
1分钟前
研友_Z119gZ完成签到 ,获得积分10
2分钟前
Cold-Drink-Shop完成签到,获得积分10
2分钟前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
Cognitive Neuroscience: The Biology of the Mind 1000
Technical Brochure TB 814: LPIT applications in HV gas insulated switchgear 1000
Immigrant Incorporation in East Asian Democracies 600
Nucleophilic substitution in azasydnone-modified dinitroanisoles 500
不知道标题是什么 500
A Preliminary Study on Correlation Between Independent Components of Facial Thermal Images and Subjective Assessment of Chronic Stress 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3968559
求助须知:如何正确求助?哪些是违规求助? 3513358
关于积分的说明 11167340
捐赠科研通 3248714
什么是DOI,文献DOI怎么找? 1794453
邀请新用户注册赠送积分活动 875065
科研通“疑难数据库(出版商)”最低求助积分说明 804664