A Two-Step Method for the Operation Rescheduling Problem at the Railway Marshalling Station

IF 2.5 4区 工程技术 Q2 ENGINEERING, ELECTRICAL & ELECTRONIC
Liang Ma, Jin Guo, Yuanli Bao, Shumei Tao
{"title":"A Two-Step Method for the Operation Rescheduling Problem at the Railway Marshalling Station","authors":"Liang Ma,&nbsp;Jin Guo,&nbsp;Yuanli Bao,&nbsp;Shumei Tao","doi":"10.1049/itr2.70023","DOIUrl":null,"url":null,"abstract":"<p>Current research on the operation planning problem at the railway marshalling station are mainly dependent on the assumption of correct and unaltered input data. However, due to force majeure disturbances such as train delays, engine breakdown, and so on, the operation plan may easily fail. To increase the robustness of the operation plan, we propose a two-step method for solving the operation rescheduling problem at the marshalling station, the first step is to create a static model in order to maximise the efficiency of the operation plan, and the second step is to reschedule the static plans and unexecuted plan caused by unexpected disturbances. A lexicographic multi-objective model is built to reduce disturbance perturbation while maximising station benefits. An iteration optimisation approach with initial solutions is designed to solve the whole model iteratively, and each sub-model is solved by the heuristic backtracking algorithm with constraint propagation (CPr) mechanism called CPr-HBT. Some real-life cases from Shijiazhuang marshalling station of the China Railway show that the proposed two-step method increases the robustness of the operation plans effectively, rescheduling the failed operation plans takes 60 s at most, and CPr-HBT is more efficient than the other algorithms without CPr or heuristics.</p>","PeriodicalId":50381,"journal":{"name":"IET Intelligent Transport Systems","volume":"19 1","pages":""},"PeriodicalIF":2.5000,"publicationDate":"2025-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1049/itr2.70023","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IET Intelligent Transport Systems","FirstCategoryId":"5","ListUrlMain":"https://ietresearch.onlinelibrary.wiley.com/doi/10.1049/itr2.70023","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"ENGINEERING, ELECTRICAL & ELECTRONIC","Score":null,"Total":0}
引用次数: 0

Abstract

Current research on the operation planning problem at the railway marshalling station are mainly dependent on the assumption of correct and unaltered input data. However, due to force majeure disturbances such as train delays, engine breakdown, and so on, the operation plan may easily fail. To increase the robustness of the operation plan, we propose a two-step method for solving the operation rescheduling problem at the marshalling station, the first step is to create a static model in order to maximise the efficiency of the operation plan, and the second step is to reschedule the static plans and unexecuted plan caused by unexpected disturbances. A lexicographic multi-objective model is built to reduce disturbance perturbation while maximising station benefits. An iteration optimisation approach with initial solutions is designed to solve the whole model iteratively, and each sub-model is solved by the heuristic backtracking algorithm with constraint propagation (CPr) mechanism called CPr-HBT. Some real-life cases from Shijiazhuang marshalling station of the China Railway show that the proposed two-step method increases the robustness of the operation plans effectively, rescheduling the failed operation plans takes 60 s at most, and CPr-HBT is more efficient than the other algorithms without CPr or heuristics.

Abstract Image

Abstract Image

Abstract Image

铁路编组站作业重新调度问题的两步法
目前对铁路编组站运行规划问题的研究主要依赖于输入数据正确不变的假设。但是,由于火车延误、发动机故障等不可抗力干扰,操作计划很容易失败。为了提高调度计划的鲁棒性,提出了一种分两步求解编组站调度问题的方法,第一步是建立静态模型,使调度计划的效率最大化,第二步是对静态计划和因意外干扰而导致的未执行计划进行重新调度。建立了一个词典学多目标模型,以减少干扰,同时使站点利益最大化。设计了一种带初始解的迭代优化方法,迭代求解整个模型,并采用带有约束传播(CPr)机制的启发式回溯算法求解各子模型。中铁石家庄编组站的实际案例表明,所提出的两步法有效地提高了调度计划的鲁棒性,对失败的调度计划的重新调度最多需要60 s,并且CPr- hbt比其他没有CPr或启发式算法的算法效率更高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
IET Intelligent Transport Systems
IET Intelligent Transport Systems 工程技术-运输科技
CiteScore
6.50
自引率
7.40%
发文量
159
审稿时长
3 months
期刊介绍: IET Intelligent Transport Systems is an interdisciplinary journal devoted to research into the practical applications of ITS and infrastructures. The scope of the journal includes the following: Sustainable traffic solutions Deployments with enabling technologies Pervasive monitoring Applications; demonstrations and evaluation Economic and behavioural analyses of ITS services and scenario Data Integration and analytics Information collection and processing; image processing applications in ITS ITS aspects of electric vehicles Autonomous vehicles; connected vehicle systems; In-vehicle ITS, safety and vulnerable road user aspects Mobility as a service systems Traffic management and control Public transport systems technologies Fleet and public transport logistics Emergency and incident management Demand management and electronic payment systems Traffic related air pollution management Policy and institutional issues Interoperability, standards and architectures Funding scenarios Enforcement Human machine interaction Education, training and outreach Current Special Issue Call for papers: Intelligent Transportation Systems in Smart Cities for Sustainable Environment - https://digital-library.theiet.org/files/IET_ITS_CFP_ITSSCSE.pdf Sustainably Intelligent Mobility (SIM) - https://digital-library.theiet.org/files/IET_ITS_CFP_SIM.pdf Traffic Theory and Modelling in the Era of Artificial Intelligence and Big Data (in collaboration with World Congress for Transport Research, WCTR 2019) - https://digital-library.theiet.org/files/IET_ITS_CFP_WCTR.pdf
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信