The highly uncertain and complex railway operations result in unpredictable operational dynamics to the railway system, such as uncertain delays, changing traffic flows, changes in traffic pattern, etc. In recent years, various algorithms have been developed to help dispatchers in making decisions during railway operation. However, these algorithms are short of the ability of providing solutions to the complicated traffic with operational dynamics. In order to deal with operational dynamics, a methodology using performance-based supervisory control is proposed to provide multiple rescheduling decisions over a wider area through the application of alternating rescheduling algorithms in appropriate sequences. The process of dynamic rescheduling is illustrated and implemented with the BRaVE simulator, and the rescheduling results have been evaluated with propagation of delays with respect to time. A case study on ECML is introduced to demonstrate how this process is realised, and it shows the improvement of delay recovery by applying alternating approaches.
Dynamic train rescheduling using alternating algorithms
2016-08-01
811095 byte
Conference paper
Electronic Resource
English
A new algorithm for train rescheduling using rescheduling pattern
IuD Bahn | 2006
|An algorithm for train rescheduling using rescheduling pattern description language R
British Library Conference Proceedings | 2006
|Research on Greedy Train Rescheduling Algorithm
British Library Conference Proceedings | 2009
|A Hybrid Train Traffic Rescheduling Simulator
IuD Bahn | 1995
|A Hybrid Train Traffic Rescheduling Simulator
Online Contents | 1995
|