Delay resistant line planning with a view towards passenger transfers

The line planning step, as part of the public transportation planning process, is an elementary problem. When generating public transportation systems in a conventional fashion, the line planning problem is one of the first to solve. Hence, subsequent problems rely on the solution of the line planning problem. Line planning has been studied from various perspectives and is understood very well. Still, the effect of this planning step on to the next ones has only received minor attention. In this paper, we study the effect of transfers on the delay resistance and propose a line planning model which provides a good basis for a delay resistant transportation system. To this end, the concept of preferable paths from the direct travelers line planning model is further extended. The model includes the routing of passengers in order to minimize passenger transfers. A column generation approach is shown to properly solve the proposed model. As such, this is the first line planning model which detailedly routes the passengers and is still tractable on realistically sized instances. Finally, it is shown that minimizing the passenger transfers at the line planning stage contributes to an increasing delay resistance in the public transportation system.

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

[2]  Michael R. Bussieck,et al.  Discrete optimization in public rail transport , 1997, Math. Program..

[3]  Marie Schmidt.  Integrating Routing Decisions in Network Problems , 2011, OR.

[4]  J. Desrosiers,et al.  A Primer in Column Generation , 2005 .

[5]  Dirk Cattrysse,et al.  Robust railway station planning: An interaction between routing, timetabling and platforming , 2013, J. Rail Transp. Plan. Manag..

[6]  Nico M. van Dijk,et al.  Cost optimal allocation of rail passenger lines , 1998, Eur. J. Oper. Res..

[7]  Melvyn Sim,et al.  The Price of Robustness , 2004, Oper. Res..

[8]  Ruslan Sadykov,et al.  Column Generation based Primal Heuristics , 2010, Electron. Notes Discret. Math..

[9]  Finding delay-resistant line concepts using a game-theoretic approach , 2013 .

[10]  Dimitris Bertsimas,et al.  Optimization over integers , 2005 .

[11]  Anita Schöbel,et al.  Recovery-to-optimality: A new two-stage approach to robustness with an application to aperiodic timetabling , 2014, Comput. Oper. Res..

[12]  Leena Suhl,et al.  A note on the online nature of the railway delay management problem , 2011, Networks.

[13]  Anita Schöbel,et al.  Line planning in public transportation: models and methods , 2012, OR Spectr..

[14]  Nigel H. M. Wilson,et al.  Bus network design , 1986 .

[15]  Anita Schöbel,et al.  Evaluating line concepts using travel times and robustness , 2013, Public Transp..

[16]  Matteo Fischetti,et al.  Fast Approaches to Improve the Robustness of a Railway Timetable , 2009, Transp. Sci..

[17]  Marc E. Pfetsch,et al.  Models for fare planning in public transport , 2012, Discret. Appl. Math..

[18]  Dennis Huisman,et al.  Delay Management with Rerouting of Passengers , 2012, Transp. Sci..

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

[20]  Guy Desaulniers,et al.  Chapter 2 Public Transit , 2007, Transportation.

[21]  Marie Schmidt,et al.  The Complexity of Integrating Routing Decisions in Public Transportation Models , 2010, ATMOS.

[22]  P. Kreuzer,et al.  Optimal lines for railway systems , 1997 .

[23]  Marc Goerigk,et al.  An experimental comparison of periodic timetabling models , 2013, Comput. Oper. Res..

[24]  Martin W. P. Savelsbergh,et al.  Branch-and-Price: Column Generation for Solving Huge Integer Programs , 1998, Oper. Res..

[25]  Markus Montigel.  Operations Control System in the Lotschberg Base Tunnel , 2009 .

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

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

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

[29]  Paolo Toth,et al.  Nominal and robust train timetabling problems , 2012, Eur. J. Oper. Res..

[30]  Stephen Perkins,et al.  Efficiency in Railway Operations and Infrastructure Management , 2015 .

[31]  Leonardo Lamorgese,et al.  An Exact Decomposition Approach for the Real-Time Train Dispatching Problem , 2015, Oper. Res..

[32]  Matthias Ehrgott,et al.  Railway track allocation: models and methods , 2011, OR Spectr..

[33]  Anita Schöbel,et al.  Improving the modulo simplex algorithm for large-scale periodic timetabling , 2013, Comput. Oper. Res..

[34]  Paolo Toth,et al.  Non-cyclic train timetabling and comparability graphs , 2010, Oper. Res. Lett..

[35]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[36]  Rolf H. Möhring,et al.  The modeling power of the periodic event scheduling problem: railway timetables-and beyond , 2004 .

[37]  J. Y. Yen.  Finding the K Shortest Loopless Paths in a Network , 1971 .

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

[39]  Johanna Törnquist Krasemann,et al.  Improved Railway Timetable Robustness for Reduced Traffic Delays – a MILP approach , 2015 .

[40]  Lucas P. Veelenturf,et al.  An overview of recovery models and algorithms for real-time railway rescheduling , 2014 .