An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability

Abstract Most schedule-based transit assignment models assume deterministic vehicle arrival/departure times, in contrast to random vehicle arrival assumption in frequency-based models. This assumption simplifies user route choice behavior and fails to capture users’ response to unreliable service. Moreover, the inherent inconvenience of transfers, primarily due to uncertain waiting time and failure probability, has always been a challenge in modeling transit networks, to the extent that determining an appropriate transfer penalty for heterogeneous user population is still a question when using planning models. This study aims to bridge the gap between frequency-based and schedule-based transit assignment models, and proposes a path algorithm in schedule-based transit networks with stochastic vehicle arrival times to model users’ adaptive behavior in response to unreliable service. Path reliability is modeled by link failure probability, and an online shortest path algorithm is developed to find a routing policy with minimum expected travel time given preferred arrival time to destination. Complexity analyses and computational tests indicate that the model has potential for application in large-scale transit networks. Numerical tests verify that the model assigns passengers to more reliable paths with lower transfer rate without a need for a large transfer penalty.

[1]  Mark Hickman,et al.  Trip-Based Path Algorithms Using the Transit Network Hierarchy , 2015 .

[2]  Nigel H. M. Wilson,et al.  A behavioural comparison of route choice on metro networks: Time, transfers, crowding, topology and socio-demographics , 2014 .

[3]  Jia Hao Wu,et al.  Transit Equilibrium Assignment: A Model and Solution Algorithms , 1994, Transp. Sci..

[4]  W. Y. Szeto,et al.  A new schedule-based transit assignment model with travel strategies and supply uncertainties , 2014 .

[5]  Carlo G. Prato,et al.  The Factor of Revisited Path Size , 2008 .

[6]  Pierluigi Coppola,et al.  Simulation-based evaluation of Advanced Public Transportation Information Systems (APTIS) , 2009 .

[7]  Umberto Crisalli,et al.  A schedule-based assignment model with explicit capacity constraints for congested transit networks , 2012 .

[8]  Umberto Crisalli,et al.  A mesoscopic transit assignment model including real-time predictive information on crowding , 2016, J. Intell. Transp. Syst..

[9]  Yu Jiang,et al.  Reliability-Based Transit Assignment for Congested Stochastic Transit Networks , 2011, Comput. Aided Civ. Infrastructure Eng..

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

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

[12]  Roberto Cominetti,et al.  A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria , 2006 .

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

[14]  Mark Hickman,et al.  PASSENGER TRAVEL TIME AND PATH CHOICE IMPLICATIONS OF REAL-TIME TRANSIT INFORMATION , 1995 .

[15]  Umberto Crisalli,et al.  A Doubly Dynamic Schedule-based Assignment Model for Transit Networks , 2001, Transp. Sci..

[16]  F P Clerq.  A PUBLIC TRANSPORT ASSIGNMENT METHOD , 1972 .

[17]  Stephen D. Boyles,et al.  Adaptive Transit Routing in Stochastic Time-Dependent Networks , 2016, Transp. Sci..

[18]  Bernard M. Levin,et al.  Determining fastest routes using fixed schedules , 1963, AFIPS '63 (Spring).

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

[20]  S. Travis Waller,et al.  On the online shortest path problem with limited arc cost dependencies , 2002, Networks.

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

[22]  P. Bovy,et al.  Path Size and Overlap in Multi-modal Transport Networks , 2005 .

[23]  Otto Anker Nielsen,et al.  A Stochastic Traffic Assignment Model Considering Differences in Passengers Utility Functions , 2000 .

[24]  Otto Anker Nielsen,et al.  Timetable-based simulation method for choice set generation in large-scale public transport networks , 2016 .

[25]  Shing Chung Josh Wong,et al.  A stochastic transit assignment model using a dynamic schedule-based network , 1999 .

[26]  Giorgio Gallo,et al.  Directed Hypergraphs and Applications , 1993, Discret. Appl. Math..

[27]  Shing Chung Josh Wong,et al.  A dynamic schedule-based model for congested transit networks , 2004 .

[28]  Liu Yang,et al.  Probit-Type Reliability-Based Transit Network Assignment , 2006 .

[29]  Yuqing Zhang,et al.  The multi-class schedule-based transit assignment model under network uncertainties , 2010, Public Transp..

[30]  Otto Anker Nielsen,et al.  Passenger delay models for rail networks , 2009 .

[31]  Robert B Dial,et al.  TRANSIT PATHFINDER ALGORITHM , 1967 .

[32]  Giovanni Andreatta,et al.  Stochastic shortest paths with recourse , 1988, Networks.

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

[34]  C. O. Tong,et al.  A computer model for finding the time-dependent minimum path in a transit system with fixed schedules , 1984 .

[35]  Federico Malucelli,et al.  A Modeling Framework for Passenger Assignment on a Transport Network with Timetables , 1998, Transp. Sci..

[36]  Shlomo Bekhor,et al.  Investigation of Stochastic Network Loading Procedures , 1998 .

[37]  Anthony Richardson,et al.  SEARCH MODELS AND CHOICE SET GENERATION , 1980 .

[38]  Mark D. Hickman,et al.  Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks , 1997, Transp. Sci..

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

[40]  Sang Nguyen,et al.  Route Choice on Transit Networks with Online Information at Stops , 2005, Transp. Sci..

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

[42]  Shlomo Bekhor,et al.  Applying Branch-and-Bound Technique to Route Choice Set Generation , 2006 .

[43]  Markus Friedrich,et al.  A Schedule-Based Transit Assignment Model Addressing the Passengers’ Choice Among Competing Connections , 2004 .

[44]  Carlo G. Prato,et al.  Route choice modeling: past, present and future research directions , 2009 .

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

[46]  Otto Anker Nielsen,et al.  Multimodal route choice models of public transport passengers in the Greater Copenhagen Area , 2017, EURO J. Transp. Logist..

[47]  Otto Anker Nielsen,et al.  A Large Scale Stochastic Multi-Class Schedule-Based Transit Model with Random Coefficients , 2004 .

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

[49]  Shlomo Bekhor,et al.  Evaluation of choice set generation algorithms for route choice models , 2006, Ann. Oper. Res..

[50]  Hai Yang,et al.  A stochastic user equilibrium assignment model for congested transit networks , 1999 .