A reliability-based transit trip planning model under transit network uncertainty

Transit, although an important public transportation mode, is not thoroughly utilized in the United States. To encourage the public to take transit, agencies have developed systems and tools that assist travelers in accessing and using information. Transit data modeling and trip planner system architecture developments have helped advance these systems, and the recent emergence of transit trip planning algorithms promises further enhancement. Conventional transit trip planning algorithms are usually developed based on graph theory. In order to utilize these algorithms, certain assumptions must be made to support these algorithms (e.g. buses always run on time). However, these assumptions may not be realistic. To overcome these limitations, our study develops an innovative transit trip planning model using chance constrained programming. Unlike previous studies, which only minimized passenger-experienced travel time, our study also considers transit service reliability. Additionally, in-vehicle travel time, transfer time, and walking time are all included as elements of passenger-experienced travel time. Our transit trip planning model avoids the assumptions of previous studies by incorporating transit service reliability and is capable of finding reliable transit paths with minimized passenger-experienced travel time. The algorithm can also suggest a buffer time before departure to ensure on-time arrivals at a given confidence level. General Transit Feed Specification data, collected around Tucson, Arizona, was used to model the transit network using a “node-link” scheme and estimate link-level travel time and travel time reliability. Three groups of experiments were developed to test the performance of the proposed model. The experiment results suggested that the optimal anticipated travel time increased with increasing on-time arrival confidence level and walking was preferred over direct bus transfers that involved out of direction travel. The proposed model can also include additional travel modes and can easily be extended to include intercity trip planning.

[1]  Richard Pavley,et al.  A Method for the Solution of the Nth Best Path Problem , 1959, JACM.

[2]  Shing Chung Josh Wong,et al.  Estimation of time-dependent origin–destination matrices for transit networks , 1998 .

[3]  L. B. Fu,et al.  Expected Shortest Paths in Dynamic and Stochastic Traf c Networks , 1998 .

[4]  Markus Friedrich,et al.  Timetable-Based Transit Assignment Using Branch and Bound Techniques , 2001 .

[5]  Zhong-Ren Peng,et al.  Schedule-Based Path-Finding Algorithms for Transit Trip-Planning Systems , 2002 .

[6]  Zhong-Ren Peng,et al.  Object-Oriented Geographic Information System Data Model for Transit Trip-Planning Systems , 2002 .

[7]  Subhash Suri,et al.  Finding the k shortest simple paths , 2007, ALENEX.

[8]  Nigel H. M. Wilson,et al.  Schedule-Based Dynamic Transit Modeling: Theory and Applications (Operations Research/Computer Science Interfaces, 28) , 2004 .

[9]  Umberto Crisalli,et al.  The Schedule-Based Approach in Dynamic Transit Modelling: A General Overview , 2004 .

[10]  Zhaowang Ji,et al.  Path finding under uncertainty , 2005 .

[11]  Christopher R. Cherry,et al.  Design of a map-based transit itinerary planner , 2006 .

[12]  J. Y. Yen,et al.  Finding the K Shortest Loopless Paths in a Network , 2007 .

[13]  Desheng Dash Wu,et al.  Enterprise Risk Management Models , 2010 .

[14]  Alan Borning,et al.  Location-Aware Tools for Improving Public Transit Usability , 2010, IEEE Pervasive Computing.

[15]  Zhong-Ren Peng,et al.  Development of Web-Based Transit Trip-Planning System Based on Service-Oriented Architecture , 2011 .

[16]  Zhaowang Ji,et al.  Multi-objective alpha-reliable path finding in stochastic networks with correlated link costs: A simulation-based multi-objective genetic algorithm approach (SMOGA) , 2011, Expert Syst. Appl..

[17]  Stephane Hess,et al.  A Review on Transit Assignment Modelling Approaches to Congested Networks: A New Perspective , 2012 .

[18]  Paolo Giaccone,et al.  Timely Data Delivery in a Realistic Bus Network , 2012, IEEE Transactions on Vehicular Technology.

[19]  Satish Chandra,et al.  Speed Distribution Curves for Pedestrians During Walking and Crossing , 2013 .

[20]  Teresa Wu,et al.  A single-loop deterministic method for reliability-based design optimization , 2013 .

[21]  Qingquan Li,et al.  Finding Reliable Shortest Paths in Road Networks Under Uncertainty , 2013 .

[22]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[23]  Kari Watkins,et al.  An experiment evaluating the impacts of real-time transit information on bus riders in Tampa, Florida , 2014 .

[24]  Arif S. Malik,et al.  Travel Time Reliability Using the Hasofer–Lind–Rackwitz–Fiessler Algorithm and Kernel Density Estimation , 2014 .

[25]  Fang Wu,et al.  Exact algorithms for multi-criteria multi-modal shortest path with transfer delaying and arriving time-window in urban transit network , 2014 .

[26]  Gregory S. Macfarlane,et al.  The impact of real-time information on bus ridership in New York City , 2015 .

[27]  Yao-Jan Wu,et al.  Mixture Models for Fitting Freeway Travel Time Distributions and Measuring Travel Time Reliability , 2016 .

[28]  Shu Yang,et al.  Moving Ahead to Mixture Models for Fitting Freeway Travel Time Distributions and Measuring Travel Time Reliability , 2016 .