Aggregation Methods for Railway Networks

In this paper a bottom-up approach of automatic simplification of a railway network is presented. Starting from a very detailed, microscopic level, as it is used in railway simulation, the network is transformed by an algorithm to a less detailed level (macroscopic network), that is sufficient for long-term planning and optimization. In addition running and headway times are rounded to a pre-chosen time discretization by a special cumulative method, which we will present and analyse in this paper. After the transformation we fill the network with given train requests to compute an optimal slot allocation. Then the optimized schedule is re-transformed into the microscopic level and can be simulated without any conflicts occuring between the slots. The algorithm is used to transform the network of the very dense Simplon corridor between Swiss and Italy. With our aggregation it is possible for the first time to generate a profit maximal and conflict free timetable for the corridor across a day by a simultaneously optimization run.

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

[2]  Paolo Toth,et al.  04. Solution of the Train Platforming Problem , 2007 .

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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