Capacity constraints in delay management

We consider (small) disturbances of a railway system. In case of such delays, one has to decide if connecting trains should wait for delayed feeder trains or if they should depart on time, i.e. which connections should be maintained and which can be dropped. Finding such wait-depart decisions (minimizing e.g. the average delay of the passengers) is called the delay management problem. In the literature, the limited capacity of the tracks (meaning that no two trains can use the same piece of track at the same time) has so far been neglected in the delay management problem. In this paper we present models and first results integrating these important constraints. We develop algorithmic approaches that have been tested at a real-world example provided by Deutsche Bahn AG.

[1]  Bernd Heidergott,et al.  Towards a (Max,+) Control Theory for Public Transportation Networks , 2001, Discret. Event Dyn. Syst..

[2]  Eckehard Schnieder,et al.  Dispatching of train operations using genetic algorithms , 2004 .

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

[4]  Johanna Törnquist,et al.  Computer-based decision support for railway traffic scheduling and dispatching: A review of models and algorithms , 2005, ATMOS.

[5]  Anita Schöbel,et al.  Optimization in Public Transportation - Stop Location, Delay Management and Tariff Zone Design in a Public Transportation Network , 2006, Optimization and its applications.

[6]  Peter Brucker,et al.  Scheduling railway traffic at a construction site , 2002 .

[7]  Anita Schöbel,et al.  DisKon - Disposition und Konfliktlösungsmanagement für die beste Bahn , 2005 .

[8]  Anita Schöbel,et al.  A Model for the Delay Management Problem based on Mixed-Integer-Programming , 2001, ATMOS.

[9]  Serafino Cicerone,et al.  Dynamic Algorithms for Recoverable Robustness Problems , 2008, ATMOS.

[10]  J. Jacobs,et al.  Reducing delays by means of computer-aided ‘ onthe-spot , 2004 .

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

[12]  Paolo Toth,et al.  A Survey of Optimization Models for Train Routing and Scheduling , 1998, Transp. Sci..

[13]  Belarmino Adenso-Díaz,et al.  On-line timetable re-scheduling in regional train services , 1999 .

[14]  Alain Billionnet,et al.  Using Integer Programming to Solve the Train-Platforming Problem , 2003, Transp. Sci..

[15]  Leo Kroon,et al.  Algorithmic Methods for Railway Optimization, International Dagstuhl Workshop, Dagstuhl Castle, Germany, June 20-25, 2004, 4th International Workshop, ATMOS 2004, Bergen, Norway, September 16-17, 2004, Revised Selected Papers , 2007, ATMOS.

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

[17]  Anthony Wren,et al.  Computer Scheduling of Public Transportation: Urban Passenger Vehicle and Crew Scheduling , 1981 .

[18]  Peter Widmayer,et al.  Railway Delay Management: Exploring Its Algorithmic Complexity , 2004, SWAT.

[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]  Leo G. Kroon,et al.  Routing Trains Through Railway Stations: Model Formulation and Algorithms , 1996, Transp. Sci..

[21]  E. Schnieder,et al.  Automated Dispatching Of Train OperationsUsing Genetic Algorithms , 2004 .

[22]  Leon Peeters,et al.  The Computational Complexity of Delay Management , 2005, WG.

[23]  Anita Schöbel,et al.  To Wait or Not to Wait? The Bicriteria Delay Management Problem in Public Transportation , 2007, Transp. Sci..

[24]  Martine Labbé,et al.  Optimization models for the single delay management problem in public transportation , 2008, Eur. J. Oper. Res..