Delay Management with Rerouting of Passengers

The question of delay management (DM) is whether trains should wait for a delayed feeder train or should depart on time. In classical DM models, passengers are assumed to take their originally planned routes. After the wait-depart decisions are made, passengers will certainly change to the best-possible route according to these decisions. In this paper, we propose a model where such a rerouting of passengers is incorporated in the DM process. To describe the problem, we represent it as an event-activity network similar to the one used in classical DM, with some additional events to incorporate origin and destination of the passengers. We present an integer programming formulation of this problem. Furthermore, we discuss the variant in which we assume fixed costs for maintaining connections, and we present a polynomial algorithm for the special case of only one origin-destination pair that we later use to derive a strong lower bound for the integer program. Finally, computational experiments based on real-world data from Netherlands Railways show that significant improvements with respect to the passengers' traveling times can be obtained by taking the rerouting of passengers into account in the model.

[1]  KroonLeo,et al.  The New Dutch Timetable , 2009 .

[2]  Sebastian Stiller,et al.  Online railway delay management: Hardness, simulation and computation , 2011, Simul..

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

[4]  Leena Suhl,et al.  Requirement for, and Design of, an Operations Control System for Railways , 1999 .

[5]  Rob M.P. Goverde,et al.  The Max-plus Algebra Approach To RailwayTimetable Design , 1998 .

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

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

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

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

[10]  Dennis Huisman,et al.  The New Dutch Timetable: The OR Revolution , 2008, Interfaces.

[11]  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.

[12]  Christian Liebchen,et al.  The First Optimized Railway Timetable in Practice , 2008, Transp. Sci..

[13]  Vinod Chachra,et al.  Applications of graph theory algorithms , 1979 .

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

[15]  Michael Gatto,et al.  On the Impact of Uncertainty on some Optimization Problems: Combinatorial Aspects of Delay Management and Robust Online Scheduling , 2007 .

[16]  B. Schutter,et al.  On max-algebraic models for transportation networks , 1998 .

[17]  Leena Suhl,et al.  Managing and Preventing Delays in Railway Traffic by Simulation and Optimization , 2001 .

[18]  Ralf Borndörfer,et al.  Discrete Optimization in Public Transportation , 2009 .

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

[20]  Michael Schachtebeck,et al.  Delay Management in Public Transportation: Capacities, Robustness, and Integration , 2010 .

[21]  Anita Schöbel,et al.  Capacity constraints in delay management , 2009, Public Transp..

[22]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[23]  Peter Widmayer,et al.  Online Delay Management on a Single Train Line , 2004, ATMOS.

[24]  Anita Schöbel,et al.  IP-based Techniques for Delay Management with Priority Decisions , 2008, ATMOS.