Decomposition Strategies for Vehicle Routing Heuristics

启发式 合并(版本控制) 分解 车辆路径问题 计算机科学 数学优化 布线(电子设计自动化) 局部搜索(优化) 分解法(排队论) 启发式 数学 算法 离散数学 情报检索 生态学 计算机网络 生物
作者
Alberto Santini,Michael Schneider,Thibaut Vidal,Daniele Vigo
出处
期刊:Informs Journal on Computing 卷期号:35 (3): 543-559 被引量:11
标识
DOI:10.1287/ijoc.2023.1288
摘要

Decomposition techniques are an important component of modern heuristics for large instances of vehicle routing problems. The current literature lacks a characterization of decomposition strategies and a systematic investigation of their impact when integrated into state-of-the-art heuristics. This paper fills this gap: We discuss the main characteristics of decomposition techniques in vehicle routing heuristics, highlight their strengths and weaknesses, and derive a set of desirable properties. Through an extensive numerical campaign, we investigate the impact of decompositions within two algorithms for the capacitated vehicle routing problem: the Adaptive Large Neighborhood Search of Pisinger and Ropke (2007 ) and the Hybrid Genetic Search of Vidal et al. (2012 ). We evaluate the quality of popular decomposition techniques from the literature and propose new strategies. We find that route-based decomposition methods, which define subproblems by means of the customers contained in selected subsets of the routes of a given solution, generally appear superior to path-based methods, which merge groups of customers to obtain smaller subproblems. The newly proposed decomposition barycenter clustering achieves the overall best performance and leads to significant gains compared with using the algorithms without decomposition. History: Erwin Pesch, Area Editor for Heuristic Search and Approximation Algorithms. Funding: This work was supported by the U.S. Air Force [Grant FA9550-17-1-0234], the Ministerio de Ciencia e Innovación (Juan de la Cierva Formación), H2020 Marie Skłodowska-Curie Actions [Grant 945380], the Ministero dell’Università e della Ricerca [Grant 2015JJLC3E_002], the Conselho Nacional de Desenvolvimento Científico e Tecnológico [Grant 308528/2018-2], and the Fundação Carlos Chagas Filho de Amparo à Pesquisa do Estado do Rio de Janeiro [Grant E-26/202.790/2019]. Supplemental Material: The software that supports the findings of this study is available within the paper and its Supplemental Information ( https://pubsonline.informs.org/doi/suppl/10.1287/ijoc.2023.1288 ) as well as from the IJOC GitHub software repository ( https://github.com/INFORMSJoC/2022.0048 ) at ( http://dx.doi.org/10.5281/zenodo.7613129 ).
最长约 10秒,即可获得该文献文件

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

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
1秒前
mzhmhy发布了新的文献求助10
3秒前
李健的粉丝团团长应助ASA采纳,获得30
4秒前
Choi完成签到,获得积分0
4秒前
无辜如容发布了新的文献求助10
4秒前
123完成签到,获得积分10
5秒前
6秒前
单耳兔完成签到 ,获得积分10
6秒前
潇湘雪月发布了新的文献求助10
6秒前
故意的靳完成签到,获得积分10
8秒前
mzhmhy完成签到,获得积分10
8秒前
bkagyin应助wish采纳,获得10
12秒前
Afaq发布了新的文献求助10
12秒前
果粒多发布了新的文献求助10
13秒前
13秒前
无辜如容完成签到,获得积分10
14秒前
14秒前
17秒前
18秒前
ASA发布了新的文献求助30
18秒前
19秒前
情怀应助tingting9采纳,获得10
20秒前
FXQ123_范发布了新的文献求助10
20秒前
sun完成签到,获得积分20
20秒前
22秒前
彭于晏应助wldsd采纳,获得30
22秒前
量子星尘发布了新的文献求助10
22秒前
23秒前
23秒前
高一淼发布了新的文献求助10
24秒前
明道若昧完成签到,获得积分10
24秒前
上官若男应助mk采纳,获得10
25秒前
wish完成签到,获得积分10
27秒前
wish发布了新的文献求助10
29秒前
稍等一下完成签到 ,获得积分10
30秒前
momo发布了新的文献求助10
30秒前
32秒前
32秒前
liang白开完成签到,获得积分10
34秒前
mk发布了新的文献求助10
36秒前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
‘Unruly’ Children: Historical Fieldnotes and Learning Morality in a Taiwan Village (New Departures in Anthropology) 400
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
基于可调谐半导体激光吸收光谱技术泄漏气体检测系统的研究 350
Robot-supported joining of reinforcement textiles with one-sided sewing heads 320
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3989263
求助须知:如何正确求助?哪些是违规求助? 3531418
关于积分的说明 11253814
捐赠科研通 3270066
什么是DOI,文献DOI怎么找? 1804884
邀请新用户注册赠送积分活动 882084
科研通“疑难数据库(出版商)”最低求助积分说明 809136