Route choice on transit networks with online information at stops

Transportation Science

Volumn 39, Issue 3, 2005, Pages 289-297

  Gentile, Guido ^a   Nguyen, Sang ^b   Pallottino, Stefano ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

^c UNIVERSITY OF PISA   (Italy)

Author keywords

Boarding probabilities at transit stops; Networks with common transit lines; Route choice with online information; Transit assignment

Indexed keywords

INFORMATION SCIENCE; MATHEMATICAL MODELS; PROBABILITY; PROBLEM SOLVING; SET THEORY; TRANSIT TIME DEVICES;

BOARDING PROBABILITIES AT TRANSIT STOPS; NETWORKS WITH COMMON TRANSIT LINES; ROUTE CHOICE WITH ONLINE INFORMATION; TRANSIT ASSIGNMENT;

ONLINE SYSTEMS;

EID: 25144446827     PISSN: 00411655     EISSN: 15265447     Source Type: Journal    
DOI: 10.1287/trsc.1040.0109     Document Type: Article

References (18)

1. Bouzaïenc-Ayari, B., M. Gendreau, S. Nguyen. 1995. An equilibrium-fixed point model for passenger assignment in congested transit networks. Publication 95-57, Centre de Recherhce sur les Transports, Université de Montréal, Canada.
2. Bouzaïene-Ayari, B., M. Gendreau, S. Nguyen. 2001. Modelling bus stops in transit networks: A survey and new formulations. Transportation Sci. 35 304-321.
3. Bowman, L. A., M. A. Turnquist. 1981. Service frequency, schedule reliability and passenger wait times at transit stops. Transportation Res. A 15(6) 465-471.
4. Chriqui, C., P. Robillard. 1975. Common bus line. Transportation Sci. 9(2) 115-121.
5. Gendreau, M. 1984. Une étude approfondie d'un modèle d'équilibre pour l'affectation des passagers dans les réseaux de transport en commun. Ph.D. thesis, Département d'informatique et de recherche opérationnelle, Université de Montréal, Canada.
6. Hasseltröm, D. 1981. Public transportation planning - A mathematical programming approach. Ph.D. thesis, Department of Business Administration, University of Gothenburg, Sweden.
7. Jolliffe, J. K., T. P. Hutchinson. 1975. A behavioral explanation of the association between bus and passenger arrivals at a bus stop. Transportation Sci. 9(3) 248-282.
8. Larson, R. C., A. R. Odoni. 1981. Urban Operations Research. Prentice-Hall, Englewoods Cliffs, NJ.
9. LeBlanc, L. J. 1988. Transit system network design. Transportation Res. B 22 383-390.
10. Marguier, P. H. J. 1981. Optimal strategies in waiting for common bus lines. Master's thesis, Department of Civil Engineering, MIT, Cambridge, MA.
11. Marguier, P. H. J., A. Ceder. 1984. Passenger waiting strategies for overlapping bus routes. Transportation Sci. 18(3) 207-230.
12. Nguyen, S., S. Pallottino. 1988. Equilibrium traffic assignment for large scale transit networks. Eur. J. Oper. Res. 37(2) 176-186.
13. Nguyen, S., S. Pallottino. 1989. Hyperpaths and shortest hyperpaths. B. Simeone, ed. Combinatorial Optimization, Vol. 1403. Lecture Notes in Mathematics. Springer-Verlag, Berlin, Germany, 258-271.
14. Nguyen, S., S. Pallottino, M. Gendreau. 1998. Implicit enumeration of hyperpaths in logit models for transit networks. Transportation Sci. 32(1) 54-64.
15. Seddon, P. A., M. P. Day. 1974. Bus passenger waiting times in Greater Manchester. Traffic Engrg. Control 15(9) 442-445.
16. Spiess, H. 1984. Contributions à la théorie et aux outils de planification des réseaux de transport urbain. Ph.D. thesis, Département d'informatique et de recherche opérationnelle, Université de Montréal, Canada.
17. Spiess, H., M. Florian. 1989. Optimal strategies: A new assignment model for transit networks. Transportation Res. B 23(2) 83-102.
18. Wu, J. H., M. Florian, P. Marcotte. 1994. Transit equilibrium assignment: A model and solution algorithms. Transportation Sci. 28(3) 193-203.