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

Modeling Bus Stops in Transit Networks: A Survey and New Formulations

Author

Listed:
  • Belgacem Bouzaïene-Ayari

    (Centre de Recherche sur les Transports and Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, C.P. 6128, Succursale Centre-ville, Montréal, Canada H3C 3J7)

  • Michel Gendreau

    (Centre de Recherche sur les Transports and Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, C.P. 6128, Succursale Centre-ville, Montréal, Canada H3C 3J7)

  • Sang Nguyen

    (Centre de Recherche sur les Transports and Département d'Informatique et de Recherche Opérationnelle, Université de Montréal, C.P. 6128, Succursale Centre-ville, Montréal, Canada H3C 3J7)

Abstract

In this paper, we undertake a detailed study of the bus stop problem in congested transit networks. In the first part of the paper, we present and discuss the bus stop models existing in the literature. In the second part, we propose a new general model for which we prove a number of good properties and we give equivalent formulations. Then, we examine two special cases of the general model. In the first case, the line capacities are considered limited and therefore they can not be exceeded by the on-board passenger flows. In the second case, the strict capacity constraints are relaxed in order to obtain a stop model that can be easily integrated into an assignment model to predict the global passenger behavior in transit networks.

Suggested Citation

  • 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.
    • Handle: RePEc:inm:ortrsc:v:35:y:2001:i:3:p:304-321
    DOI: 10.1287/trsc.35.3.304.10148
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.35.3.304.10148
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.35.3.304.10148?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. Han, Anthony F. & Wilson, Nigel H. M., 1982. "The allocation of buses in heavily utilized networks with overlapping routes," Transportation Research Part B: Methodological, Elsevier, vol. 16(3), pages 221-232, June.
    2. 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.
    3. 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.
    4. Stella Dafermos, 1980. "Traffic Equilibrium and Variational Inequalities," Transportation Science, INFORMS, vol. 14(1), pages 42-54, February.
    5. Philippe H. J. Marguier & Avishai Ceder, 1984. "Passenger Waiting Strategies for Overlapping Bus Routes," Transportation Science, INFORMS, vol. 18(3), pages 207-230, August.
    6. 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.
    7. Smith, M. J., 1979. "The existence, uniqueness and stability of traffic equilibria," Transportation Research Part B: Methodological, Elsevier, vol. 13(4), pages 295-304, December.
    8. Claude Chriqui & Pierre Robillard, 1975. "Common Bus Lines," Transportation Science, INFORMS, vol. 9(2), pages 115-121, May.
    9. Mustafa Abdulaal & Larry J. LeBlanc, 1979. "Methods for Combining Modal Split and Equilibrium Assignment Models," Transportation Science, INFORMS, vol. 13(4), pages 292-314, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Trozzi, Valentina & Gentile, Guido & Bell, Michael G.H. & Kaparias, Ioannis, 2013. "Dynamic user equilibrium in public transport networks with passenger congestion and hyperpaths," Transportation Research Part B: Methodological, Elsevier, vol. 57(C), pages 266-285.
    2. Hamdouch, Younes & Lawphongpanich, Siriphong, 2008. "Schedule-based transit assignment model with travel strategies and capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 42(7-8), pages 663-684, August.
    3. 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.
    4. Larsen, Odd I. & Sunde, yvind, 2008. "Waiting time and the role and value of information in scheduled transport," Research in Transportation Economics, Elsevier, vol. 23(1), pages 41-52, January.
    5. 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.
    6. 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.
    7. 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.
    8. 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.
    9. Batarce, Marco, 2016. "Estimation of urban bus transit marginal cost without cost data," Transportation Research Part B: Methodological, Elsevier, vol. 90(C), pages 241-262.
    10. 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.
    11. 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.
    12. Cortés, Cristián E. & Donoso, Pedro & Gutiérrez, Leonel & Herl, Daniel & Muñoz, Diego, 2023. "A recursive stochastic transit equilibrium model estimated using passive data from Santiago, Chile," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    13. Gilbert Laporte & Juan Mesa & Francisco Ortega & Ignacio Sevillano, 2005. "Maximizing Trip Coverage in the Location of a Single Rapid Transit Alignment," Annals of Operations Research, Springer, vol. 136(1), pages 49-63, April.
    14. 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.

    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. 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.
    3. Sang Nguyen & Stefano Pallottino & Federico Malucelli, 2001. "A Modeling Framework for Passenger Assignment on a Transport Network with Timetables," Transportation Science, INFORMS, vol. 35(3), pages 238-249, August.
    4. 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.
    5. 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.
    6. 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.
    7. Kenetsu Uchida & Agachai Sumalee & David Watling & Richard Connors, 2007. "A Study on Network Design Problems for Multi-modal Networks by Probit-based Stochastic User Equilibrium," Networks and Spatial Economics, Springer, vol. 7(3), pages 213-240, September.
    8. 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.
    9. Younes Hamdouch & Siriphong Lawphongpanich, 2010. "Congestion Pricing for Schedule-Based Transit Networks," Transportation Science, INFORMS, vol. 44(3), pages 350-366, August.
    10. Hamdouch, Younes & Lawphongpanich, Siriphong, 2008. "Schedule-based transit assignment model with travel strategies and capacity constraints," Transportation Research Part B: Methodological, Elsevier, vol. 42(7-8), pages 663-684, August.
    11. Roberto Cominetti & José Correa, 2001. "Common-Lines and Passenger Assignment in Congested Transit Networks," Transportation Science, INFORMS, vol. 35(3), pages 250-267, August.
    12. Martínez, Héctor & Mauttone, Antonio & Urquhart, María E., 2014. "Frequency optimization in public transportation systems: Formulation and metaheuristic approach," European Journal of Operational Research, Elsevier, vol. 236(1), pages 27-36.
    13. 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.
    14. 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.
    15. 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.
    16. 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.
    17. Fan, Yinchao & Ding, Jianxun & Liu, Haoxiang & Wang, Yu & Long, Jiancheng, 2022. "Large-scale multimodal transportation network models and algorithms-Part I: The combined mode split and traffic assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    18. Nassir, Neema & Hickman, Mark & Ma, Zhen-Liang, 2019. "A strategy-based recursive path choice model for public transit smart card data," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 528-548.
    19. Guido Gentile & Sang Nguyen & Stefano Pallottino, 2005. "Route Choice on Transit Networks with Online Information at Stops," Transportation Science, INFORMS, vol. 39(3), pages 289-297, August.
    20. 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.

    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:304-321. 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.