Low-Level Modeling for Routing and Scheduling Trains through Busy Railway Stations with Expandable Coupling/Decoupling Mechanism

Q. Dang, T. Bourdeaud'huy, K. Mesghouni, A. Toguyéni
{"title":"Low-Level Modeling for Routing and Scheduling Trains through Busy Railway Stations with Expandable Coupling/Decoupling Mechanism","authors":"Q. Dang, T. Bourdeaud'huy, K. Mesghouni, A. Toguyéni","doi":"10.7763/ijmo.2020.v10.763","DOIUrl":null,"url":null,"abstract":"Abstract—This paper studies train routing and scheduling problem for busy railway stations. The train routing problem is to assign each train to a route through the railway station and to a platform in the station. The train scheduling problem is to determine timing and ordering plans for all trains on the assigned train routes. Our objective is to allow trains to be routed in dense areas that are reaching saturation. Unlike traditional methods that allocate all resources to setup a route for a train until the route is freed, our work focuses on the use of resources as trains progress through the railway node. This technique allows a larger number of trains to be routed simultaneously in a railway node and thus reduces their current saturation. In this paper, we consider that trains can be coupled or decoupled and trains can pass through the railway station without stopping at any platform. To deal with this problem, this study proposes an abstract model and a mixed-integer linear programming formulation to solve it. The method is illustrated on a didactic example.","PeriodicalId":134487,"journal":{"name":"International Journal of Modeling and Optimization","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Modeling and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.7763/ijmo.2020.v10.763","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Abstract—This paper studies train routing and scheduling problem for busy railway stations. The train routing problem is to assign each train to a route through the railway station and to a platform in the station. The train scheduling problem is to determine timing and ordering plans for all trains on the assigned train routes. Our objective is to allow trains to be routed in dense areas that are reaching saturation. Unlike traditional methods that allocate all resources to setup a route for a train until the route is freed, our work focuses on the use of resources as trains progress through the railway node. This technique allows a larger number of trains to be routed simultaneously in a railway node and thus reduces their current saturation. In this paper, we consider that trains can be coupled or decoupled and trains can pass through the railway station without stopping at any platform. To deal with this problem, this study proposes an abstract model and a mixed-integer linear programming formulation to solve it. The method is illustrated on a didactic example.
具有可扩展耦合/解耦机制的繁忙火车站列车路线调度低级建模
摘要:本文研究了繁忙火车站的列车路线和调度问题。列车路线问题是给每列火车分配一条通过火车站和车站站台的路线。列车调度问题是确定所有列车在指定的列车路线上的时间和排序计划。我们的目标是让列车在接近饱和的密集地区行驶。与传统方法分配所有资源为列车设置路线直到路线被释放不同,我们的工作侧重于列车通过铁路节点时的资源使用。这种技术允许在一个铁路节点上同时路由更多的列车,从而降低了它们的电流饱和。在本文中,我们考虑列车可以耦合或解耦,并且列车可以不停靠任何站台而通过火车站。为了解决这一问题,本文提出了一个抽象模型和一个混合整数线性规划公式。通过一个教学实例说明了该方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信