Route Choice on Transit Networks with Online Information at Stops

Passengers on a transit network with common lines are often faced with the problem of choosing between either to board the arriving bus or to wait for a faster one. Many assignment models are based on the classical assumption that at a given stop passengers board the first arriving carrier of a certain subset of the available lines, often referred to as the attractive set. In this case, it has been shown that, if the headway distributions are exponential, then an optimal subset of lines minimizing the passenger travel time can be easily determined. However, when online information on future arrivals of buses are posted at the stop, it is unlikely that the above classical assumption holds. In this case, passengers may choose to board a line that offers the best combination of displayed waiting time and expected travel time to their destination once boarded. In this paper, we propose a general framework for determining the probability of boarding each line available at a stop when online information on bus waiting times is provided to passengers. We will also show that the classical model without online information may be interpreted as a particular instance of the proposed framework, this way achieving an extension to general headway distributions. The impact of the availability of information regarding bus arrivals and that of the regularity of transit lines on the network loads, as well as on the passenger travel times, will be illustrated with small numerical examples.

[1]  Philippe Henri Joseph Marguier Optimal strategies in waiting for common bus lines , 1981 .

[2]  Mark A. Turnquist,et al.  Service frequency, schedule reliability and passenger wait times at transit stops , 1981 .

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

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

[5]  Michel Gendreau,et al.  Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks , 1992, Transp. Sci..

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

[7]  Richard C. Larson,et al.  Urban Operations Research , 1981 .

[8]  T. P. Hutchinson,et al.  A Behavioural Explanation of the Association Between Bus and Passenger Arrivals at a Bus Stop , 1975 .

[9]  D. Hasselström PUBLIC TRANSPORTATION PLANNING: A MATHEMATICAL PROGRAMMING APPROACH , 1981 .

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

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

[12]  Avishai Ceder,et al.  Passenger Waiting Strategies for Overlapping Bus Routes , 1984, Transp. Sci..

[13]  S Nguyen,et al.  An equilibrium-fixed point model for passenger assignment in congested transit networks , 1995 .

[14]  Michel Gendreau,et al.  Modeling Bus Stops in Transit Networks: A Survey and New Formulations , 2001, Transp. Sci..

[15]  Larry J. LeBlanc,et al.  Transit system network design , 1988 .