带时间窗的广义车辆路径问题的大邻域搜索与精确方法

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Dorian Dumez , Christian Tilk , Stefan Irnich , Fabien Lehuédé , Olivier Péton
{"title":"带时间窗的广义车辆路径问题的大邻域搜索与精确方法","authors":"Dorian Dumez ,&nbsp;Christian Tilk ,&nbsp;Stefan Irnich ,&nbsp;Fabien Lehuédé ,&nbsp;Olivier Péton","doi":"10.1016/j.ejtl.2021.100040","DOIUrl":null,"url":null,"abstract":"<div><p>Delivery options are at the heart of the generalized vehicle routing problem with time windows (GVRPTW) allowing that customer requests are shipped to alternative delivery locations which can also have different time windows. Recently, the vehicle routing problem with delivery options was introduced into the scientific literature. It extends the GVRPTW by capacities of shared locations and by specifying service-level constraints defined by the customers’ preferences for delivery options. The vehicle routing problem with delivery options also generalizes the vehicle routing problem with home roaming delivery locations and the vehicle routing problem with multiple time windows. For all these GVRPTW variants, we present a widely applicable matheuristic that relies on a large neighborhood search (LNS) employing several problem-tailored destruction operators. Most of the time, the LNS performs relatively small and fast moves, but when the solution has not been improved for many iterations, a larger destruction move is applied to arrive in a different region of the search space. Moreover, an adaptive layer of the LNS embeds two exact components: First, a set-partitioning formulation is used to combine previously found routes to new solutions. Second, the Balas-Simonetti neighborhood is adapted to further improve already good solutions. These new components are in the focus of our work and we perform an exhaustive computational study to evaluate four configurations of the new matheuristic on several benchmark instances of the above-mentioned variants. On all the benchmark sets, our matheuristic is competitive with the previous state-of-the-art methods. In summary, the four configurations provide 81 new best-known solutions.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":null,"pages":null},"PeriodicalIF":2.1000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/j.ejtl.2021.100040","citationCount":"10","resultStr":"{\"title\":\"Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows\",\"authors\":\"Dorian Dumez ,&nbsp;Christian Tilk ,&nbsp;Stefan Irnich ,&nbsp;Fabien Lehuédé ,&nbsp;Olivier Péton\",\"doi\":\"10.1016/j.ejtl.2021.100040\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Delivery options are at the heart of the generalized vehicle routing problem with time windows (GVRPTW) allowing that customer requests are shipped to alternative delivery locations which can also have different time windows. Recently, the vehicle routing problem with delivery options was introduced into the scientific literature. It extends the GVRPTW by capacities of shared locations and by specifying service-level constraints defined by the customers’ preferences for delivery options. The vehicle routing problem with delivery options also generalizes the vehicle routing problem with home roaming delivery locations and the vehicle routing problem with multiple time windows. For all these GVRPTW variants, we present a widely applicable matheuristic that relies on a large neighborhood search (LNS) employing several problem-tailored destruction operators. Most of the time, the LNS performs relatively small and fast moves, but when the solution has not been improved for many iterations, a larger destruction move is applied to arrive in a different region of the search space. Moreover, an adaptive layer of the LNS embeds two exact components: First, a set-partitioning formulation is used to combine previously found routes to new solutions. Second, the Balas-Simonetti neighborhood is adapted to further improve already good solutions. These new components are in the focus of our work and we perform an exhaustive computational study to evaluate four configurations of the new matheuristic on several benchmark instances of the above-mentioned variants. On all the benchmark sets, our matheuristic is competitive with the previous state-of-the-art methods. In summary, the four configurations provide 81 new best-known solutions.</p></div>\",\"PeriodicalId\":45871,\"journal\":{\"name\":\"EURO Journal on Transportation and Logistics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/j.ejtl.2021.100040\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EURO Journal on Transportation and Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2192437621000121\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192437621000121","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 10

摘要

配送选项是带时间窗口的广义车辆路线问题(GVRPTW)的核心,该问题允许将客户请求运送到具有不同时间窗口的备选配送地点。近年来,具有配送选项的车辆路线问题被引入科学文献。它通过共享位置的容量和指定由客户的交付选项首选项定义的服务级别约束来扩展GVRPTW。具有送货选项的车辆路线问题也推广了具有家庭漫游送货地点的车辆路线问题和具有多个时间窗口的车辆路线问题。对于所有这些GVRPTW变体,我们提出了一种广泛适用的数学方法,该方法依赖于使用几个针对问题的销毁算子的大邻域搜索(LNS)。大多数情况下,LNS执行相对较小和快速的移动,但是当解决方案在许多迭代中没有得到改进时,应用更大的破坏移动来到达搜索空间的不同区域。此外,LNS的自适应层嵌入了两个精确的组件:首先,使用集合划分公式将先前找到的路由组合为新的解决方案。第二,对Balas-Simonetti社区进行了调整,以进一步改善已经很好的解决方案。这些新组件是我们工作的重点,我们执行了详尽的计算研究,以在上述变体的几个基准实例上评估新数学的四种配置。在所有基准集上,我们的数学方法与以前最先进的方法具有竞争力。总之,这四种配置提供了81种新的知名解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Hybridizing large neighborhood search and exact methods for generalized vehicle routing problems with time windows

Delivery options are at the heart of the generalized vehicle routing problem with time windows (GVRPTW) allowing that customer requests are shipped to alternative delivery locations which can also have different time windows. Recently, the vehicle routing problem with delivery options was introduced into the scientific literature. It extends the GVRPTW by capacities of shared locations and by specifying service-level constraints defined by the customers’ preferences for delivery options. The vehicle routing problem with delivery options also generalizes the vehicle routing problem with home roaming delivery locations and the vehicle routing problem with multiple time windows. For all these GVRPTW variants, we present a widely applicable matheuristic that relies on a large neighborhood search (LNS) employing several problem-tailored destruction operators. Most of the time, the LNS performs relatively small and fast moves, but when the solution has not been improved for many iterations, a larger destruction move is applied to arrive in a different region of the search space. Moreover, an adaptive layer of the LNS embeds two exact components: First, a set-partitioning formulation is used to combine previously found routes to new solutions. Second, the Balas-Simonetti neighborhood is adapted to further improve already good solutions. These new components are in the focus of our work and we perform an exhaustive computational study to evaluate four configurations of the new matheuristic on several benchmark instances of the above-mentioned variants. On all the benchmark sets, our matheuristic is competitive with the previous state-of-the-art methods. In summary, the four configurations provide 81 new best-known solutions.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.60
自引率
0.00%
发文量
24
审稿时长
129 days
期刊介绍: The EURO Journal on Transportation and Logistics promotes the use of mathematics in general, and operations research in particular, in the context of transportation and logistics. It is a forum for the presentation of original mathematical models, methodologies and computational results, focussing on advanced applications in transportation and logistics. The journal publishes two types of document: (i) research articles and (ii) tutorials. A research article presents original methodological contributions to the field (e.g. new mathematical models, new algorithms, new simulation techniques). A tutorial provides an introduction to an advanced topic, designed to ease the use of the relevant methodology by researchers and practitioners.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信