Public transit corridor assignment assuming congestion due to passenger boarding and alighting. (English) Zbl 1162.90380

Summary: This paper proposes a formulation of deterministic equilibrium in a public transit corridor that takes into account the congestion effect as perceived directly in travel times. The identification of the relationship between flows and travel times includes time at transit stops for passenger boarding and alighting. A simple case is analyzed that demonstrates the existence of equilibria in which identical users adopt different travel strategies, and a method is supplied for determining such an equilibrium. To find the general case assignment for a corridor, an assignment algorithm based on incremental flow increases is also presented. Finally, the algorithm is implemented in a simple corridor. The results show that identical users faced with the same trip must be allowed to take different decisions for an equilibrium assignment to exist.


90B20 Traffic problems in operations research
60K30 Applications of queueing theory (congestion, allocation, storage, traffic, etc.)
Full Text: DOI


[1] Abdulaal M, LeBlanc LJ (1979) Methods for combining modal split and equilibrium assignment models. Transp Sci 13:292–314
[2] Chriqui C, Robillard P (1975) Common bus lines. Transp Sci 9:115–121
[3] Cominetti R, Correa J (2001) Common-lines and passenger assignment in congested transit networks. Transp Sci 35(3):250–267 · Zbl 1160.90328
[4] De Cea J, Fernández E (1993) Transit assignment for congested public transport systems: an equilibrium model. Transp Sci 27(2):133–147 · Zbl 0788.90030
[5] Dial RB (1967) Transit pathfinder algorithms. Highw Res Rec 205:67–85
[6] Fearnside K, Draper DP (1971) Public transport assigning–a new approach. Traffic Eng Control 298–299
[7] Florian M (1977) A traffic equilibrium model of travel by car and public transit models. Transp Sci 8:166–179
[8] Gendreau M (1984) Ettude approfundie d’un modèle d’equilibre pour l’affectation de passagers dans les réseaux de transports en commun. Pub. 384, Centre de Recherche sur les Transports, Université de Montréal
[9] Goodman J, Laube M, Schwenk J (1997) Issues in bus rapid transit. Report for the Federal Transit Administration
[10] Larrain (2006) Asignación en un Corredor de Transporte Público, Considerando Congestión en los Tiempos de Viaje. Master Thesis. Escuela de Ingeniería. Pontificia Universidad Católica de Chile
[11] Le Clercq F (1972) A public transport assigning model. Traffic Eng Control 91–96
[12] Pang JM, Chan D (1982) Iterative methods for variational and complementary problems. Math Program 24:284–313 · Zbl 0499.90074
[13] Schwarcz S (2004) Service design for heavy demand corridors: limited-stop bus service. MST Thesis, MIT
[14] Silverman NC, Orosz T, Zicklin A (1998) Limited-stop bus service at New York city transit. J Transp Eng 124(6):503–509
[15] Spiess H (1984) Contribution à la théorie et aux outils de planification des réseaux de transport urbains. Pub. 382, Centre de Recherche sur les Transports, Université de Montréal
[16] Sun A, Hickman M (2005) The real-time stop-skipping problem. Journal of Intelligent Transportation Systems 9(2):91–109 · Zbl 1068.90541
[17] Turnquist MA (1979) Zone scheduling of urban bus routes. Transp Eng J 105(1):1–13
[18] Vuchic V, Bruun EC, Krstanoski N, Shin YE (1994) The bus transit system: its underutilized potential. University of Pennsylvania Report for the Federal Transit Administration
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.