IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v35y2001i3p250-267.html
   My bibliography  Save this article

Common-Lines and Passenger Assignment in Congested Transit Networks

Author

Listed:
  • Roberto Cominetti

    (Universidad de Chile, Departamento de Ingeniería Matemática and Centro de Modelamiento Matemático (UMR 2071 UCHILE-CNRS), Casilla 170/3 Correo 3, Santiago, Chile)

  • José Correa

    (Universidad de Chile, Departamento de Ingeniería Matemàtica and Centro de Modelamiento Matemàtico (UMR 2071 UCHILE-CNRS), Casilla 170/3 Correo 3, Santiago, Chile)

Abstract

We analyze a Wardrop equilibrium model for passenger assignment in general transit networks, including the effects of congestion over the passengers' choices. The model is based on the common-line paradigm, which is applied to general networks using a dynamic programming approach. Congestion is treated by means of a simplified bulk queue model described in the appendix. We provide a complete characterization of the set of equilibria in the common-line setting, including the conditions for existence and uniqueness. This characterization reveals the existence of ranges of flow in which a Braess-like paradox appears, and in which a flow increase does not affect the system performance as measured by transit times. The congested common-line model is used to state an equilibrium model for general transit networks, and to establish the existence of a network equilibrium.

Suggested Citation

  • Roberto Cominetti & José Correa, 2001. "Common-Lines and Passenger Assignment in Congested Transit Networks," Transportation Science, INFORMS, vol. 35(3), pages 250-267, August.
    • Handle: RePEc:inm:ortrsc:v:35:y:2001:i:3:p:250-267
    DOI: 10.1287/trsc.35.3.250.10154
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.35.3.250.10154
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.35.3.250.10154?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Nguyen, S. & Pallottino, S., 1988. "Equilibrium traffic assignment for large scale transit networks," European Journal of Operational Research, Elsevier, vol. 37(2), pages 176-186, November.
    2. Spiess, Heinz & Florian, Michael, 1989. "Optimal strategies: A new assignment model for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 23(2), pages 83-102, April.
    3. Jia Hao Wu & Michael Florian & Patrice Marcotte, 1994. "Transit Equilibrium Assignment: A Model and Solution Algorithms," Transportation Science, INFORMS, vol. 28(3), pages 193-203, August.
    4. Joaquín de Cea & Enrique Fernández, 1993. "Transit Assignment for Congested Public Transport Systems: An Equilibrium Model," Transportation Science, INFORMS, vol. 27(2), pages 133-147, May.
    5. Claude Chriqui & Pierre Robillard, 1975. "Common Bus Lines," Transportation Science, INFORMS, vol. 9(2), pages 115-121, May.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Xu, Zhandong & Xie, Jun & Liu, Xiaobo & Nie, Yu (Marco), 2020. "Hyperpath-based algorithms for the transit equilibrium assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    2. Cepeda, M. & Cominetti, R. & Florian, M., 2006. "A frequency-based assignment model for congested transit networks with strict capacity constraints: characterization and computation of equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 40(6), pages 437-459, July.
    3. Ren, Hualing & Song, Yingjie & Long, Jiancheng & Si, Bingfeng, 2021. "A new transit assignment model based on line and node strategies," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 121-142.
    4. Agostino Nuzzolo & Francesco Russo & Umberto Crisalli, 2001. "A Doubly Dynamic Schedule-based Assignment Model for Transit Networks," Transportation Science, INFORMS, vol. 35(3), pages 268-285, August.
    5. Cortés, Cristián E. & Jara-Moroni, Pedro & Moreno, Eduardo & Pineda, Cristobal, 2013. "Stochastic transit equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 51(C), pages 29-44.
    6. Nielsen, Otto Anker, 2000. "A stochastic transit assignment model considering differences in passengers utility functions," Transportation Research Part B: Methodological, Elsevier, vol. 34(5), pages 377-402, June.
    7. Tarun Rambha & Stephen D. Boyles & S. Travis Waller, 2016. "Adaptive Transit Routing in Stochastic Time-Dependent Networks," Transportation Science, INFORMS, vol. 50(3), pages 1043-1059, August.
    8. Jiang, Y. & Szeto, W.Y., 2016. "Reliability-based stochastic transit assignment: Formulations and capacity paradox," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 181-206.
    9. Padma Seetharaman, 2017. "Modelling risk aversion using a disaggregate stochastic process model in congested transit networks," Public Transport, Springer, vol. 9(3), pages 549-569, October.
    10. Li, Qianfei & (Will) Chen, Peng & (Marco) Nie, Yu, 2015. "Finding optimal hyperpaths in large transit networks with realistic headway distributions," European Journal of Operational Research, Elsevier, vol. 240(1), pages 98-108.
    11. Wu, Di & Yin, Yafeng & Lawphongpanich, Siriphong, 2011. "Pareto-improving congestion pricing on multimodal transportation networks," European Journal of Operational Research, Elsevier, vol. 210(3), pages 660-669, May.
    12. Codina, Esteve & Rosell, Francisca, 2017. "A heuristic method for a congested capacitated transit assignment model with strategies," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 293-320.
    13. Nair, Rahul & Miller-Hooks, Elise, 2014. "Equilibrium network design of shared-vehicle systems," European Journal of Operational Research, Elsevier, vol. 235(1), pages 47-61.
    14. Belgacem Bouzaïene-Ayari & Michel Gendreau & Sang Nguyen, 2001. "Modeling Bus Stops in Transit Networks: A Survey and New Formulations," Transportation Science, INFORMS, vol. 35(3), pages 304-321, August.
    15. Suman, Hemant & Larrain, Homero & Muñoz, Juan Carlos, 2021. "The impact of using a naïve approach in the limited-stop bus service design problem," Transportation Research Part A: Policy and Practice, Elsevier, vol. 149(C), pages 45-61.
    16. Cancela, Héctor & Mauttone, Antonio & Urquhart, María E., 2015. "Mathematical programming formulations for transit network design," Transportation Research Part B: Methodological, Elsevier, vol. 77(C), pages 17-37.
    17. Diana P. Moreno-Palacio & Carlos A. Gonzalez-Calderon & John Jairo Posada-Henao & Hector Lopez-Ospina & Jhan Kevin Gil-Marin, 2022. "Entropy-Based Transit Tour Synthesis Using Fuzzy Logic," Sustainability, MDPI, vol. 14(21), pages 1-25, November.
    18. Li, Guoyuan & Chen, Anthony, 2023. "Strategy-based transit stochastic user equilibrium model with capacity and number-of-transfers constraints," European Journal of Operational Research, Elsevier, vol. 305(1), pages 164-183.
    19. Esteve Codina, 2013. "A Variational Inequality Reformulation of a Congested Transit Assignment Model by Cominetti, Correa, Cepeda, and Florian," Transportation Science, INFORMS, vol. 47(2), pages 231-246, May.
    20. Zhang, Yu & Tang, Jiafu, 2018. "Itinerary planning with time budget for risk-averse travelers," European Journal of Operational Research, Elsevier, vol. 267(1), pages 288-303.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:ortrsc:v:35:y:2001:i:3:p:250-267. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.