Route Choice on Transit Networks with Online Information at Stops

References

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