MILP-Based Optimization of the Extended Real- Time Railway Traffic Management Problem

László Lindenmaier, S. Aradi, Tamás Bécsi, I. Lövétei
{"title":"MILP-Based Optimization of the Extended Real- Time Railway Traffic Management Problem","authors":"László Lindenmaier, S. Aradi, Tamás Bécsi, I. Lövétei","doi":"10.1109/SACI55618.2022.9919542","DOIUrl":null,"url":null,"abstract":"The conflict-free preplanned railway timetable often results in conflicting trains due to traffic perturbation. Therefore, the real-time railway traffic management problem arises that requires the rerouting and rescheduling of the trains. The optimization aims to minimize the secondary delays assigned to the trains solving the traffic management problem. In this paper, we propose a mixed-integer linear programming model extending the previous works in this field with a safety-relevant signaling concept, the so-called overlaps. The proposed model provides a strategic decision minimizing the delay propagation that is safer and more feasible considering the actual railway traffic regulations. The results are verified through a simulation environment highlighting the impact of overlaps in different infrastructures and scenarios.","PeriodicalId":105691,"journal":{"name":"2022 IEEE 16th International Symposium on Applied Computational Intelligence and Informatics (SACI)","volume":"201 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 IEEE 16th International Symposium on Applied Computational Intelligence and Informatics (SACI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SACI55618.2022.9919542","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The conflict-free preplanned railway timetable often results in conflicting trains due to traffic perturbation. Therefore, the real-time railway traffic management problem arises that requires the rerouting and rescheduling of the trains. The optimization aims to minimize the secondary delays assigned to the trains solving the traffic management problem. In this paper, we propose a mixed-integer linear programming model extending the previous works in this field with a safety-relevant signaling concept, the so-called overlaps. The proposed model provides a strategic decision minimizing the delay propagation that is safer and more feasible considering the actual railway traffic regulations. The results are verified through a simulation environment highlighting the impact of overlaps in different infrastructures and scenarios.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于milp的扩展实时铁路交通管理问题优化
由于交通干扰,无冲突的预先计划的铁路时刻表经常导致列车冲突。因此,铁路交通的实时管理问题就产生了,这就需要对列车进行改道和重新调度。优化的目标是最小化分配给列车的二次延误,从而解决交通管理问题。在本文中,我们提出了一个混合整数线性规划模型,扩展了该领域的先前工作,并引入了与安全相关的信号概念,即所谓的重叠。该模型结合实际轨道交通规则,提供了一种更安全、更可行的最小化延迟传播的策略决策。通过模拟环境验证了结果,突出了不同基础设施和场景中重叠的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Similarity-based Personalized Risk Calculation Adaptive Receding Horizon Control For Nonlinear Systems Exemplified by Two Coupled van der Pol Oscillators A Numerical Model and a Code Development for Photogeneration Rate Calculation for a Dye Sensitized Solar Cell Modal and Experimental Analysis of Satellites used for Side-Airbag System Research on Data Sufficiency and Model Validity toward AI for Critical Systems
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1