Micro-macro transformation of railway networks

Abstract This paper presents a bottom-up approach to automatic railway network simplification. Starting from a detailed microscopic level as it is used in railway simulation, the network is transformed by an algorithm to an aggregated level, i.e., to a macroscopic network, that is sufficient for long-term planning and optimization. Running and headway times are rounded to a user defined precision by a special cumulative method. After this “macrotization” trains from a given set of requests are added to the existing timetable by solving an optimal train path allocation problem. The objective of this problem is to maximize a sum of utilities of the allocated trains; the utility can be a constant, some monetary value, etc. The optimized schedule is re-transformed back to the microscopic level in such a way that it can be simulated without any conflicts between the train paths. We apply this algorithm to macrotize a microscopic network model of the highly frequented Simplon corridor in the Alps between Switzerland and Italy. To the best knowledge of the authors and confirmed by several railway practitioners this was the first time that track allocations that have been produced in a fully automatic way on a macroscopic scale fulfill the requirements of the originating microscopic model and withstand an evaluation in the microscopic simulation tool OpenTrack . Our micro–macro transformation method allows for a much faster planning and provides solutions of a quality that are at least comparable to the most sophisticated manual schedules. In this way meaningful scenario analyses can be carried out that pave the way towards a new level of decision support in railway planning.

[1]  Christian Liebchen,et al.  Periodic Timetable Optimization in Public Transport , 2006, OR.

[2]  Gabrio Curzio Caimi,et al.  Algorithmic decision suport for train scheduling in a large and highly utilised railway network , 2009 .

[3]  Thomas Schlechte,et al.  A Library for Train Timetabling Problems , 2008 .

[4]  S. Klabes,et al.  Algorithmic railway capacity allocation in a competitive European railway market , 2010 .

[5]  Dario Pacciarelli,et al.  Reordering and Local Rerouting Strategies to Manage Train Traffic in Real Time , 2008, Transp. Sci..

[6]  Matteo Fischetti,et al.  Modeling and Solving the Train Timetabling Problem , 2002, Oper. Res..

[7]  X. Cai,et al.  A fast heuristic for the train scheduling problem , 1994, Comput. Oper. Res..

[8]  Ralf Borndörfer,et al.  Optimization of macroscopic train schedules via TS-OPT , 2009 .

[9]  Frits C. R. Spieksma,et al.  A column generation approach to job grouping , 1996 .

[10]  Gerhart Potthoff,et al.  Die Zugfolge auf Strecken und in Bahnhöfen , 1962 .

[11]  Martin Grötschel,et al.  A Column-Generation Approach to Line Planning in Public Transport , 2007, Transp. Sci..

[12]  Markus Montigel Modellierung und Gewährleistung von Abhängigkeiten in Eisenbahnsicherungsanlagen , 1994 .

[13]  E. Spencer From the Library , 1936, British Journal of Ophthalmology.

[14]  Ralf Borndörfer,et al.  Models for Railway Track Allocation , 2007, ATMOS.

[15]  Jörn Pachl,et al.  Systemtechnik des Schienenverkehrs , 1999 .

[16]  Leo G. Kroon,et al.  Routing Trains Through Railway Stations: Model Formulation and Algorithms , 1996, Transp. Sci..

[17]  I. A. Hansen State-of-the-Art of Railway Operations Research , 2006 .

[18]  Gabrio Curzio Caimi Train Scheduling in a Large and Highly Utilised Railway Network , 2010, OR.

[19]  Ekkehard Wendler,et al.  Influence of ETCS on the capacity of lines , 2009 .

[20]  Berkan Erol,et al.  Models For The Train Timetabling Problem , 2009 .

[21]  Matthias Ehrgott,et al.  Routing Trains Through Railway Junctions: A New Set-Packing Approach , 2011, Transp. Sci..

[22]  Walter Ukovich,et al.  A Mathematical Model for Periodic Scheduling Problems , 1989, SIAM J. Discret. Math..

[23]  Thomas Siefer,et al.  Applying Multiscaling Analysis to Detect Capacity Resources in Railway Networks , 2008 .

[24]  Thomas Schlechte,et al.  TTPlib 2008 – A Library for Train Timetabling Problems , 2008 .

[25]  Christoph Helmberg,et al.  Towards Solving Very Large Scale Train Timetabling Problems by Lagrangian Relaxation , 2008, ATMOS.

[26]  Per Olov Lindberg,et al.  Railway Timetabling Using Lagrangian Relaxation , 1998, Transp. Sci..

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

[28]  Dario Pacciarelli,et al.  Centralized versus distributed systems to reschedule trains in two dispatching areas , 2010, Public Transp..

[29]  Paolo Toth,et al.  Solution of the Train Platforming Problem , 2011, Transp. Sci..

[30]  Francesco Corman,et al.  Rescheduling Dense Train Traffic over Complex Station Interlocking Areas , 2009, Robust and Online Large-Scale Optimization.