To Wait or Not to Wait---And Who Goes First? Delay Management with Priority Decisions
Transportation Science
Modeling Network Transition Constraints with Hypergraphs
Transportation Science
Modeling Network Transition Constraints with Hypergraphs
Transportation Science
Railway track allocation: models and methods
OR Spectrum
Computers and Operations Research
A set packing inspired method for real-time junction train routing
Computers and Operations Research
Dispatching and coordination in multi-area railway traffic management
Computers and Operations Research
Hi-index | 0.00 |
Traffic controllers regulate railway traffic by sequencing train movements and setting routes with the aim of ensuring smooth train behaviour and limiting, as much as possible, train delays. In this paper, we describe the implementation of a real-time traffic management system, called ROMA (Railway traffic Optimization by Means of Alternative graphs), to support controllers in the everyday task of managing disturbances. We make use of a branch-and-bound algorithm for sequencing train movements, while a local search algorithm is developed for rerouting optimization purposes. The compound problem of routing and sequencing trains is approached iteratively, computing an optimal train sequencing for given train routes and then improving this solution by locally rerouting some trains. An extensive computational study is carried out, based on a dispatching area of the Dutch railway network. We study practical size instances, and include in the model important operational constraints, including rolling stock and passenger connections. Different types of disturbances are analysed, including train delays and blocked tracks. Comparison with common dispatching practice shows the high potential of the system as an effective support tool to improve punctuality.