Modeling Bus Stops in Transit Networks: A Survey and New Formulations
Published Online:1 Aug 2001https://doi.org/10.1287/trsc.35.3.304.10148
References
- Methods for combining modal split and equilibrium assignment models. Transportation Sci. (1979) 13:292–314Link, Google Scholar
- , Mark Rouens. A method for the analysis of transit networks. Second European Congress on Operations Research (1976) (North-Holland, Amsterdam, The Netherlands) Google Scholar
- TRUST: A LISP program for the analysis of transit route configurations. Transportation Res. Record (1990) 1283:125–135Google Scholar
- Modélisation des arrêts multiples d'autobus pour les réseaux de transport en commun. (1988) . M.S. thesis Département de Génie Industriel, École Polytechnique de MontréalGoogle Scholar
- An equilibrium-fixed point model for passenger assignment in congested transit networks. (1995) . Publication CRT-95-57, CRT, Université de MontréalGoogle Scholar
- Über Eineindeutige, Stetige Transformationen von Flächen. Sich. Math. Ann. (1910) 67:176–180Crossref, Google Scholar
- Réseau de transport en commun: Structure informatique et affectation. (1974) . Ph.D. thesis Dép. d'I.R.O., Université de MontréalGoogle Scholar
- Common bus lines. Transportation Sci. (1975) 9:115–121Link, Google Scholar
- Traffic equilibrium and variational inequalities. Transportation Sci. (1980) 14:42–54Link, Google Scholar
- Transit pathfinder algorithm. Highway Res. Record (1967) 205:67–85Google Scholar
- Public transport assignment—A new approach. Traffic Engrg. Control (1971) 298–299Google Scholar
- Étude approfondie d'un modéle d'équilibre pour l'affectation des passagers dans les réseaux de transport en commun. (1984) . Ph.D. thesis Dép. d'I.R.O., Université de MontréalGoogle Scholar
- The allocation of buses in heavily utilized networks with overlapping routes. Transportation Res. (1982) 16B:221–232Crossref, Google Scholar
- Finite-dimentional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications. Math. Programming (1990) 48:161–220Crossref, Google Scholar
- Queuing Systems Vol. I: Theory (1975) (John Wiley, New York) Google Scholar
- The design of routes, service frequencies and schedules for municipal bus undertaking: A case study. Oper. Res. Quart. (1967) 18:375–397Crossref, Google Scholar
- Transept: A bus model. Traffic Engrg. Control (1976) 17:14–17Google Scholar
- A public transport assignment model. Traffic Engrg. Control (1972) 91–96Google Scholar
- Passenger waiting strategies for overlapping bus routes. Transportation Sci. (1984) 18:207–230Link, Google Scholar
- , Simeone B. Hyperpaths and shortest hyperpaths. Combinatorial Optimization. Lecture Notes in Mathematics, 1403 (1989) (>Springer-Verlag)258–271Crossref, Google Scholar
- Equilibrium traffic assignment for large scale transit networks. Eur. J. Oper. Res. (1988) 37:176–186Crossref, Google Scholar
- Iterative Solution of Nonlinear Equations in Several Variables (1970) (Academic Press, New York) Google Scholar
- Stochastic delays in transportation terminals: New results in the theory and application of bulk queues. (1981) . Ph.D. thesis Department of Civil Engineering, M.I.T., Boston, MAGoogle Scholar
- Interactive graphic system for transit route optimization. Transportation Res. Record (1976) 619Google Scholar
- Existence, uniqueness and stability of traffic equilibria. Transportation Res. (1979) 13B:295–304Crossref, Google Scholar
- Contribution à la théorie et aux outils de planification des réseaux de transport urbain. (1984) . Ph.D. thesis Dép. d'I.R.O., Université de MontréalGoogle Scholar
- Optimal strategies: A new assignment model for transit network. Transportation Res. B (1989) 83–102Crossref, Google Scholar
- Some theoretical aspects of road traffic research. Proc. Institute of Civil Engineers (1952) 325–378Part II 1Crossref, Google Scholar
- A simplicial decomposition method for the transit equilibrium assignment problem. Ann. Oper. Res. (1993) 44:245–260Crossref, Google Scholar
- Transit equilibrium assignment: A model and solution algorithms. Transportation Sci. (1994) 28:193–203Link, Google Scholar

