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

Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks

Author

Listed:
  • Sang Nguyen

    (Département d'informatique et de recherche opérationnelle et Centre de recherche sur les transports, Université de Montréal C.P. 6128, succursale centre-ville Montréal H3C 3J7, Canada)

  • Stefano Pallottino

    (Istituto di Elettronica, Universitá di Perugia, via G. Duranti 1/A1-06131, Perugia, Italy)

  • Michel Gendreau

    (Département d'informatique et de recherche opérationnelle et Centre de recherche sur les transports, Université de Montréal C.P. 6128, succursale centre-ville Montréal H3C 3J7, Canada)

Abstract

This paper investigates the application of a logit model to urban transit networks where every set of competitive transit lines is described by a particular graph structure called hyperpath. It shows that a sequential form of the logit model transcends the inherent limitations of the global form while retaining the algorithmic advantages similar to those obtained with the ordinary logit model for private vehicle networks.

Suggested Citation

  • Sang Nguyen & Stefano Pallottino & Michel Gendreau, 1998. "Implicit Enumeration of Hyperpaths in a Logit Model for Transit Networks," Transportation Science, INFORMS, vol. 32(1), pages 54-64, February.
    • Handle: RePEc:inm:ortrsc:v:32:y:1998:i:1:p:54-64
    DOI: 10.1287/trsc.32.1.54
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/trsc.32.1.54
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.32.1.54?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
    ---><---

    Citations

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


    Cited by:

    1. Elnaz Miandoabchi & Reza Farahani & W. Szeto, 2012. "Bi-objective bimodal urban road network design using hybrid metaheuristics," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 20(4), pages 583-621, December.
    2. Valentina Trozzi & Guido Gentile & Ioannis Kaparias & Michael Bell, 2015. "Effects of Countdown Displays in Public Transport Route Choice Under Severe Overcrowding," Networks and Spatial Economics, Springer, vol. 15(3), pages 823-842, September.
    3. 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.
    4. Alireza Khani & Mark Hickman & Hyunsoo Noh, 2015. "Trip-Based Path Algorithms Using the Transit Network Hierarchy," Networks and Spatial Economics, Springer, vol. 15(3), pages 635-653, September.
    5. 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.
    6. Wu, Jianjun & Qu, Yunchao & Sun, Huijun & Yin, Haodong & Yan, Xiaoyong & Zhao, Jiandong, 2019. "Data-driven model for passenger route choice in urban metro network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 524(C), pages 787-798.
    7. Chai, Huajun, 2019. "Dynamic Traffic Routing and Adaptive Signal Control in a Connected Vehicles Environment," Institute of Transportation Studies, Working Paper Series qt9ng3z8vn, Institute of Transportation Studies, UC Davis.
    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. Gentile, Guido & Papola, Natale & Persia, Luca, 2005. "Advanced pricing and rationing policies for large scale multimodal networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 39(7-9), pages 612-631.
    10. 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.
    11. 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.
    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. Liu, Qi & Chow, Joseph Y.J., 2022. "Efficient and stable data-sharing in a public transit oligopoly as a coopetitive game," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 64-87.
    14. Jean-Christophe Foltête & Amaud Piombini, 2010. "Deviations in Pedestrian Itineraries in Urban Areas: A Method to Assess the Role of Environmental Factors," Environment and Planning B, , vol. 37(4), pages 723-739, August.
    15. Elnaz Miandoabchi & Reza Farahani & Wout Dullaert & W. Szeto, 2012. "Hybrid Evolutionary Metaheuristics for Concurrent Multi-Objective Design of Urban Road and Public Transit Networks," Networks and Spatial Economics, Springer, vol. 12(3), pages 441-480, September.
    16. Luca D’Acierno & Marilisa Botte, 2021. "Railway System Design by Adopting the Merry-Go-Round (MGR) Paradigm," Sustainability, MDPI, vol. 13(4), pages 1-21, February.
    17. Bellei, Giuseppe & Gentile, Guido & Papola, Natale, 2002. "Network pricing optimization in multi-user and multimodal context with elastic demand," Transportation Research Part B: Methodological, Elsevier, vol. 36(9), pages 779-798, November.
    18. Shuangyan Li & Yijing Liang & Zhenjie Wang & Dezhi Zhang, 2021. "An Optimization Model of a Sustainable City Logistics Network Design Based on Goal Programming," Sustainability, MDPI, vol. 13(13), pages 1-20, July.
    19. D'Acierno, Luca & Gallo, Mariano & Montella, Bruno, 2006. "Optimisation models for the urban parking pricing problem," Transport Policy, Elsevier, vol. 13(1), pages 34-48, January.
    20. 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.
    21. Nielsen, Lars Relund & Pretolani, Daniele & Andersen, Kim Allan, 2004. "Finding the K shortest hyperpaths using reoptimization," CORAL Working Papers L-2004-04, University of Aarhus, Aarhus School of Business, Department of Business Studies.
    22. Mohammad Nurul Hassan & Taha Hossein Rashidi & Neema Nassir, 2021. "Consideration of different travel strategies and choice set sizes in transit path choice modelling," Transportation, Springer, vol. 48(2), pages 723-746, April.

    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:32:y:1998:i:1:p:54-64. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.