Rescheduling models for network-wide railway traffic management

In the last decades of railway operations research, microscopic models have been intensively studied to support traffic operators in managing their dispatching areas. However, those models result in long computation times for large and highly utilized networks. The problem of controlling country-wide traffic is still open since the coordination of local areas is hard to tackle in short time and there are multiple interdependencies between trains across the whole network. This work is dedicated to the development of new macroscopic models that are able to incorporate traffic management decisions. Objective of this paper is to investigate how different level of detail and number of operational constraints may affect the applicability of models for networkwide rescheduling in terms of quality of solutions and computation time. We present four different macroscopic models and test them on the Dutch national timetable. The macroscopic models are compared with a state-of-the-art microscopic model. Trade-off between computation time and solution quality is discussed on various disturbed traffic conditions.

[1]  Dario Pacciarelli,et al.  Bi-objective conflict detection and resolution in railway traffic management , 2012 .

[2]  Dario Pacciarelli,et al.  Dispatching and coordination in multi-area railway traffic management , 2014, Comput. Oper. Res..

[3]  Rob M.P. Goverde,et al.  Railway Timetable Stability Analysis Using Max-plus System Theory , 2007 .

[4]  Matthias Müller-Hannemann,et al.  Stochastic Delay Prediction in Large Train Networks , 2011, ATMOS.

[5]  J Jacobs Reducing delays by means of computer-aided 'on-the-spot' rescheduling , 2004 .

[6]  A. Radtke,et al.  On a model predictive control algorithm for dynamic railway network management , 2012 .

[7]  Andrea D'Ariano,et al.  Conflict Resolution and Train Speed Coordination for Solving Real-Time Timetable Perturbations , 2007, IEEE Transactions on Intelligent Transportation Systems.

[8]  Sung-Pil Hong,et al.  An appraisal of a column-generation-based algorithm for centralized train-conflict resolution on a metropolitan railway network , 2011 .

[9]  Andrea D'Ariano,et al.  Improving real-time train dispatching: Models, algorithms and applications , 2008 .

[10]  Andrew Nash,et al.  Railroad simulation using OpenTrack , 2004 .

[11]  Francesco Corman,et al.  Effectiveness of dynamic reordering and rerouting of trains in a complicated and densely occupied station area , 2011 .

[12]  Dario Pacciarelli,et al.  Job-shop scheduling with blocking and no-wait constraints , 2002, Eur. J. Oper. Res..

[13]  Marco Pranzo,et al.  An Advanced Real-Time Train Dispatching System for Minimizing the Propagation of Delays in a Dispatching Area Under Severe Disturbances , 2009 .

[14]  Dario Pacciarelli,et al.  Discrete Optimization A branch and bound algorithm for scheduling trains in a railway network , 2007 .

[15]  J. S. Hooghiemstra Design Of Regular Interval Timetables For StrategicAnd Tactical Railway Planning , 1970 .

[16]  Rob M.P. Goverde,et al.  A delay propagation algorithm for large-scale railway traffic networks , 2010 .

[17]  Anita Schöbel,et al.  Integer Programming Approaches for Solving the Delay Management Problem , 2004, ATMOS.

[18]  Johanna Törnquist Krasemann Design of an Effective Algorithm for Fast Response to the Rescheduling of Railway Traffic During Disturbances , 2012 .

[19]  Anita Schöbel,et al.  To Wait or Not to Wait - And Who Goes First? Delay Management with Priority Decisions , 2010, Transp. Sci..

[20]  Jan A. Persson,et al.  N-tracked railway traffic re-scheduling during disturbances , 2007 .

[21]  Norio Tomii,et al.  Train Rescheduling Algorithm Which Minimizes Passengers' Dissatisfaction , 2005, IEA/AIE.