广义列车单元调车问题的求解算法

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Franck Kamenga , Paola Pellegrini , Joaquin Rodriguez , Boubekeur Merabet
{"title":"广义列车单元调车问题的求解算法","authors":"Franck Kamenga ,&nbsp;Paola Pellegrini ,&nbsp;Joaquin Rodriguez ,&nbsp;Boubekeur Merabet","doi":"10.1016/j.ejtl.2021.100042","DOIUrl":null,"url":null,"abstract":"<div><p>This paper proposes different algorithms to tackle the Generalized Train Unit Shunting Problem (G-TUSP). This is the pre-operational problem of managing rolling stock in a station, between arrivals and departures. It includes four sub-problems: the Train Matching Problem, the Track Assignment Problem, the Shunting Routing Problem, and the Shunting Maintenance Problem. In our algorithms, we consider different combinations for the integrated or sequential solutions of these sub-problems, typically considered independently in the literature. We assess the performance of the algorithms proposed in real-life and fictive instances representing traffic in Metz-Ville station, which includes four shunting yards. It is a main junction between two dense traffic lines in the east of France. In a thorough experimental analysis, we study the contribution of each sub-problem to the difficulty of the G-TUSP, and we identify the best algorithms. The outcomes of our algorithms are superior to solutions manually designed by experienced railway practitioners.</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.100042","citationCount":"3","resultStr":"{\"title\":\"Solution algorithms for the generalized train unit shunting problem\",\"authors\":\"Franck Kamenga ,&nbsp;Paola Pellegrini ,&nbsp;Joaquin Rodriguez ,&nbsp;Boubekeur Merabet\",\"doi\":\"10.1016/j.ejtl.2021.100042\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper proposes different algorithms to tackle the Generalized Train Unit Shunting Problem (G-TUSP). This is the pre-operational problem of managing rolling stock in a station, between arrivals and departures. It includes four sub-problems: the Train Matching Problem, the Track Assignment Problem, the Shunting Routing Problem, and the Shunting Maintenance Problem. In our algorithms, we consider different combinations for the integrated or sequential solutions of these sub-problems, typically considered independently in the literature. We assess the performance of the algorithms proposed in real-life and fictive instances representing traffic in Metz-Ville station, which includes four shunting yards. It is a main junction between two dense traffic lines in the east of France. In a thorough experimental analysis, we study the contribution of each sub-problem to the difficulty of the G-TUSP, and we identify the best algorithms. The outcomes of our algorithms are superior to solutions manually designed by experienced railway practitioners.</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.100042\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EURO Journal on Transportation and Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2192437621000145\",\"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/S2192437621000145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 3

摘要

本文提出了解决广义列车单元分流问题(G-TUSP)的算法。这是在车站到达和离开之间管理铁路车辆的操作前问题。它包括四个子问题:列车匹配问题、轨道分配问题、调车路线问题和调车维修问题。在我们的算法中,我们考虑这些子问题的积分或顺序解的不同组合,通常在文献中独立考虑。我们在现实生活和虚构的实例中评估了所提出的算法的性能,这些实例代表了Metz-Ville车站的交通,其中包括四个分流场。它是法国东部两条密集交通线路之间的主要枢纽。在深入的实验分析中,我们研究了每个子问题对g - tasp难度的贡献,并确定了最佳算法。我们的算法的结果优于由经验丰富的铁路从业人员手工设计的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Solution algorithms for the generalized train unit shunting problem

This paper proposes different algorithms to tackle the Generalized Train Unit Shunting Problem (G-TUSP). This is the pre-operational problem of managing rolling stock in a station, between arrivals and departures. It includes four sub-problems: the Train Matching Problem, the Track Assignment Problem, the Shunting Routing Problem, and the Shunting Maintenance Problem. In our algorithms, we consider different combinations for the integrated or sequential solutions of these sub-problems, typically considered independently in the literature. We assess the performance of the algorithms proposed in real-life and fictive instances representing traffic in Metz-Ville station, which includes four shunting yards. It is a main junction between two dense traffic lines in the east of France. In a thorough experimental analysis, we study the contribution of each sub-problem to the difficulty of the G-TUSP, and we identify the best algorithms. The outcomes of our algorithms are superior to solutions manually designed by experienced railway practitioners.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术官方微信