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秒前
优雅夕阳完成签到 ,获得积分10
12秒前
Jasper应助光亮的自行车采纳,获得10
12秒前
miki完成签到,获得积分10
13秒前
量子星尘发布了新的文献求助10
14秒前
糖宝完成签到 ,获得积分10
21秒前
KX2024完成签到,获得积分10
24秒前
松松发布了新的文献求助20
27秒前
nusiew完成签到,获得积分10
27秒前
huiluowork完成签到 ,获得积分10
28秒前
陶醉的翠霜完成签到 ,获得积分10
28秒前
28秒前
冷静如松完成签到 ,获得积分10
35秒前
37秒前
浮云完成签到 ,获得积分10
38秒前
屈岂愈完成签到,获得积分10
39秒前
53秒前
Pupil完成签到,获得积分10
53秒前
偏偏意气用事完成签到,获得积分10
54秒前
安安完成签到,获得积分10
58秒前
cttc完成签到,获得积分10
59秒前
Chnimike完成签到 ,获得积分10
59秒前
1分钟前
红茸茸羊完成签到 ,获得积分10
1分钟前
年轻千愁完成签到 ,获得积分10
1分钟前
liu完成签到,获得积分10
1分钟前
量子星尘发布了新的文献求助10
1分钟前
Wanyeweiyu完成签到,获得积分10
1分钟前
Fury完成签到 ,获得积分10
1分钟前
风中幻梦完成签到,获得积分10
1分钟前
bigpluto完成签到,获得积分10
1分钟前
1分钟前
是谁还没睡完成签到 ,获得积分10
1分钟前
盘尼西林发布了新的文献求助10
1分钟前
zzz完成签到 ,获得积分10
1分钟前
dktrrrr完成签到,获得积分10
1分钟前
科研通AI2S应助科研通管家采纳,获得10
1分钟前
丘比特应助科研通管家采纳,获得20
1分钟前
1分钟前
ccc完成签到,获得积分10
1分钟前
高分求助中
【提示信息,请勿应助】关于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小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 4038066
求助须知:如何正确求助?哪些是违规求助? 3575779
关于积分的说明 11373801
捐赠科研通 3305584
什么是DOI,文献DOI怎么找? 1819239
邀请新用户注册赠送积分活动 892655
科研通“疑难数据库(出版商)”最低求助积分说明 815022