Finding Least Cost Hyperpaths in Multimodal Transit Networks

This paper presents a least cost hyperpath algorithm that captures the complexities that arise in a transit network because of the number of transfers, the standing and overcrowding penalties, the availability of walking and biking in addition to the transit modes, and the mode-specific limitations such as availability of bike parking. The problem was formulated as a mathematical program, and then a hybrid label setting–correcting algorithm was proposed as a solution. The multi-modal time- and approach-dependent algorithm does not require spatial or temporal expansion of the network; this feature results in good computational performance for large-scale applications. Scenario runs performed on the large-scale Chicago Transit Authority network, in Illinois, validate the accuracy and performance of the algorithm.

[1]  Hyunsoo Noh,et al.  Capacitated Schedule-Based Transit Assignment Using a Capacity Penalty Cost , 2013 .

[2]  Siriphong Lawphongpanich,et al.  Congestion Pricing for Schedule-Based Transit Networks , 2010, Transp. Sci..

[3]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[4]  Mark Hickman,et al.  Hyperpaths in Network Based on Transit Schedules , 2012 .

[5]  Hani S. Mahmassani,et al.  Dynasmart-IP: Dynamic Traffic Assignment Meso-Simulator for Intermodal Networks , 2002 .

[6]  Michael Florian,et al.  Optimal strategies: A new assignment model for transit networks , 1989 .

[7]  Siriphong Lawphongpanich,et al.  Schedule-based transit assignment model with travel strategies and capacity constraints , 2008 .

[8]  Daniele Pretolani,et al.  Finding the K shortest hyperpaths , 2005, Comput. Oper. Res..

[9]  K. Cooke,et al.  The shortest route through a network with time-dependent internodal transit times , 1966 .

[10]  Fred W. Glover,et al.  A New Polynomially Bounded Shortest Path Algorithm , 1985, Oper. Res..

[11]  Hani S. Mahmassani,et al.  An extension of labeling techniques for finding shortest path trees , 2009, Eur. J. Oper. Res..

[12]  H. W. Ho,et al.  Schedule-based transit assignment model with vehicle capacity and seat availability , 2011 .

[13]  Athanasios K. Ziliaskopoulos.  Optimum path algorithms on multidimensional networks: Analysis, design, implementation and computational experience. , 1996 .

[14]  Enrique Fernández,et al.  Transit Assignment for Congested Public Transport Systems: An Equilibrium Model , 1993, Transp. Sci..

[15]  Hani S. Mahmassani,et al.  Dynamic Trip Assignment-Simulation Model for Intermodal Transportation Networks , 2001 .

[16]  Hani S. Mahmassani,et al.  Optimal Allocation of Service Frequencies over Transit Network Routes and Time Periods , 2013 .

[17]  P. Robillard,et al.  Common Bus Lines , 1975 .

[18]  Daniele Pretolani,et al.  Bicriterion shortest hyperpaths in random time‐dependent networks , 2003 .

[19]  S. Pallottino,et al.  Hyperpaths and shortest hyperpaths , 1989 .

[20]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[21]  Yu Nie,et al.  Finding optimal hyperpaths in large transit networks with realistic headway distributions , 2015, Eur. J. Oper. Res..

[22]  Fumitaka Kurauchi,et al.  A quasi-dynamic capacity constrained frequency-based transit assignment model , 2008 .

[23]  Hani S. Mahmassani,et al.  Integrated Frequency Allocation and User Assignment in Multimodal Transit Networks , 2015 .

[24]  Stefano Pallottino,et al.  Equilibrium traffic assignment for large scale transit networks , 1988 .

[25]  Fumitaka Kurauchi,et al.  Frequency-based transit assignment considering seat capacities , 2011 .

[26]  Athanasios K. Ziliaskopoulos,et al.  An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays , 2000, Eur. J. Oper. Res..

[27]  José R. Correa,et al.  Common-Lines and Passenger Assignment in Congested Transit Networks , 2001, Transp. Sci..

[28]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[29]  Hani S. Mahmassani,et al.  Dynamic Assignment-Simulation Methodology for Multimodal Urban Transit Networks , 2015 .