Line planning with equilibrium routing

Planning of lines and frequencies is a well-known problem in public transportation. Passengeroriented approaches to line planning often determine the lines to be established, the corresponding frequencies, and the passenger routing simultaneously. This integration of the planning steps yields better results than stepwise approaches which start with an estimation of the passengers’ paths by traffic-assignment procedures and then establish lines and frequencies accordingly. However, in presence of capacity constraints, integrated approaches aiming at a minimization of the total travel time may find solutions which force some passengers to make long detours. When such a line concept is realized in practice, passengers will most likely not accept such a solution but choose a shortest route among the available ones, leading to a violation of capacity constraints. For this reason, we develop a new integrated line planning model that allows every passenger to choose a shortest route among all available ones. We provide complexity results and an integer programming formulation for this model.

[1]  Michael R. Bussieck,et al.  A fast algorithm for near cost optimal line plans , 2004, Math. Methods Oper. Res..

[2]  Tim Roughgarden,et al.  Selfish routing and the price of anarchy , 2005 .

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

[4]  Martine Labbé,et al.  A Bilevel Model for Toll Optimization on a Multicommodity Transportation Network , 2000, Transp. Sci..

[5]  Herbert Sonntag,et al.  Ein heuristisches Verfahren zum Entwurf nachfrageorientierter Linienführung im öffentlichen Personennahverkehr , 1979, Z. Oper. Research.

[6]  Ravindra K. Ahuja,et al.  Network Flows , 2011 .

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

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

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

[10]  Tim Roughgarden Stackelberg Scheduling Strategies , 2004, SIAM J. Comput..

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

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

[13]  Michael Florian,et al.  Optimizing frequencies in a transit network: a nonlinear bi-level programming approach , 1995 .

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

[15]  Ariel Orda,et al.  Achieving network optima using Stackelberg routing strategies , 1997, TNET.

[16]  Michael R. Bussieck,et al.  Optimal Lines in Public Rail Transport , 1998 .

[17]  Leo G. Kroon,et al.  On solving multi-type railway line planning problems , 2006, Eur. J. Oper. Res..

[18]  L. A. Silman,et al.  Planning the route system for urban buses , 1974, Comput. Oper. Res..

[19]  Leo G. Kroon,et al.  A Branch-and-Cut Approach for Solving Railway Line-Planning Problems , 2004, Transp. Sci..

[20]  W. Lampkin,et al.  The Design of Routes, Service Frequencies, and Schedules for a Municipal Bus Undertaking: A Case Study , 1967 .

[21]  T. Başar,et al.  A Stackelberg Network Game with a Large Number of Followers , 2002 .