IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v126y2019icp549-564.html
   My bibliography  Save this article

An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability

Author

Listed:
  • Khani, Alireza

Abstract

Most schedule-based transit assignment models assume deterministic vehicle arrival/departure times, in contrast to random vehicle arrival assumption in frequency-based models. This assumption simplifies user route choice behavior and fails to capture users’ response to unreliable service. Moreover, the inherent inconvenience of transfers, primarily due to uncertain waiting time and failure probability, has always been a challenge in modeling transit networks, to the extent that determining an appropriate transfer penalty for heterogeneous user population is still a question when using planning models. This study aims to bridge the gap between frequency-based and schedule-based transit assignment models, and proposes a path algorithm in schedule-based transit networks with stochastic vehicle arrival times to model users’ adaptive behavior in response to unreliable service. Path reliability is modeled by link failure probability, and an online shortest path algorithm is developed to find a routing policy with minimum expected travel time given preferred arrival time to destination. Complexity analyses and computational tests indicate that the model has potential for application in large-scale transit networks. Numerical tests verify that the model assigns passengers to more reliable paths with lower transfer rate without a need for a large transfer penalty.

Suggested Citation

  • Khani, Alireza, 2019. "An online shortest path algorithm for reliable routing in schedule-based transit networks considering transfer failure probability," Transportation Research Part B: Methodological, Elsevier, vol. 126(C), pages 549-564.
    • Handle: RePEc:eee:transb:v:126:y:2019:i:c:p:549-564
    DOI: 10.1016/j.trb.2019.04.009
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261517302771
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2019.04.009?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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. Hamdouch, Younes & Szeto, W.Y. & Jiang, Y., 2014. "A new schedule-based transit assignment model with travel strategies and supply uncertainties," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 35-67.
    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. 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. 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.
    6. 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.
    7. Marie Karen Anderson & Otto Anker Nielsen & Carlo Giacomo Prato, 2017. "Multimodal route choice models of public transport passengers in the Greater Copenhagen Area," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 6(3), pages 221-245, September.
    8. 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.
    9. Mark D. Hickman & David H. Bernstein, 1997. "Transit Service and Path Choice Models in Stochastic and Time-Dependent Networks," Transportation Science, INFORMS, vol. 31(2), pages 129-146, May.
    10. Poon, M. H. & Wong, S. C. & Tong, C. O., 2004. "A dynamic schedule-based model for congested transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 38(4), pages 343-368, May.
    11. Lam, W. H. K. & Gao, Z. Y. & Chan, K. S. & Yang, H., 1999. "A stochastic user equilibrium assignment model for congested transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 33(5), pages 351-368, June.
    12. 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.
    13. Hamdouch, Younes & Ho, H.W. & Sumalee, Agachai & Wang, Guodong, 2011. "Schedule-based transit assignment model with vehicle capacity and seat availability," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1805-1830.
    14. 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.
    15. 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.
    16. 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.
    17. Shlomo Bekhor & Moshe Ben-Akiva & M. Ramming, 2006. "Evaluation of choice set generation algorithms for route choice models," Annals of Operations Research, Springer, vol. 144(1), pages 235-247, April.
    18. Roberto Cominetti & José Correa, 2001. "Common-Lines and Passenger Assignment in Congested Transit Networks," Transportation Science, INFORMS, vol. 35(3), pages 250-267, August.
    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. 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.
    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. Pramesh Kumar & Alireza Khani, 2021. "Adaptive Park-and-ride Choice on Time-dependent Stochastic Multimodal Transportation Network," Networks and Spatial Economics, Springer, vol. 21(4), pages 771-800, December.
    2. Zhaoqi Zang & Xiangdong Xu & Kai Qu & Ruiya Chen & Anthony Chen, 2022. "Travel time reliability in transportation networks: A review of methodological developments," Papers 2206.12696, arXiv.org, revised Jul 2022.
    3. Redmond, Michael & Campbell, Ann Melissa & Ehmke, Jan Fabian, 2022. "Reliability in public transit networks considering backup itineraries," European Journal of Operational Research, Elsevier, vol. 300(3), pages 852-864.
    4. Gardner, Clara Brimnes & Nielsen, Sara Dorthea & Eltved, Morten & Rasmussen, Thomas Kjær & Nielsen, Otto Anker & Nielsen, Bo Friis, 2021. "Calculating conditional passenger travel time distributions in mixed schedule- and frequency-based public transport networks using Markov chains," Transportation Research Part B: Methodological, Elsevier, vol. 152(C), pages 1-17.
    5. López, David & Lozano, Angélica, 2020. "Shortest hyperpaths in a multimodal hypergraph with real-time information on some transit lines," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 541-559.

    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. 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.
    2. Sun, S. & Szeto, W.Y., 2018. "Logit-based transit assignment: Approach-based formulation and paradox revisit," Transportation Research Part B: Methodological, Elsevier, vol. 112(C), pages 191-215.
    3. Hamdouch, Younes & Szeto, W.Y. & Jiang, Y., 2014. "A new schedule-based transit assignment model with travel strategies and supply uncertainties," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 35-67.
    4. Du, Muqing & Chen, Anthony, 2022. "Sensitivity analysis for transit equilibrium assignment and applications to uncertainty analysis," Transportation Research Part B: Methodological, Elsevier, vol. 157(C), pages 175-202.
    5. Shang, Pan & Xiong, Yufan & Guo, Jifu & Xian, Kai & Yu, Yun & Xu, Han, 2024. "A modeling framework to integrate frequency - and schedule-based passenger assignment approaches for coordinated path choice and space-time trajectory estimation based on multi-source observations," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    6. S. Mahmassani, Hani & F. Hyland, Michael, 2016. "Gap-based transit assignment algorithm with vehicle capacity constraints: Simulation-based implementation and large-scale applicationAuthor-Name: Verbas, Ömer," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 1-16.
    7. Liu, Jiangtao & Zhou, Xuesong, 2016. "Capacitated transit service network design with boundedly rational agents," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 225-250.
    8. Binder, Stefan & Maknoon, Yousef & Bierlaire, Michel, 2017. "Exogenous priority rules for the capacitated passenger assignment problem," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 19-42.
    9. Shang, Pan & Li, Ruimin & Guo, Jifu & Xian, Kai & Zhou, Xuesong, 2019. "Integrating Lagrangian and Eulerian observations for passenger flow state estimation in an urban rail transit network: A space-time-state hyper network-based assignment approach," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 135-167.
    10. 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).
    11. 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.
    12. Wang, Zhichao & Jiang, Rui & Jiang, Yu & Gao, Ziyou & Liu, Ronghui, 2024. "Modelling bus bunching along a common line corridor considering passenger arrival time and transfer choice under stochastic travel time," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    13. 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.
    14. Canca, David & Andrade-Pineda, José Luis & De los Santos, Alicia & Calle, Marcos, 2018. "The Railway Rapid Transit frequency setting problem with speed-dependent operation costs," Transportation Research Part B: Methodological, Elsevier, vol. 117(PA), pages 494-519.
    15. 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.
    16. 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.
    17. Cats, Oded & West, Jens & Eliasson, Jonas, 2016. "A dynamic stochastic model for evaluating congestion and crowding effects in transit systems," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 43-57.
    18. 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.
    19. Chen, Kang & Yang, Zhongzhen & Notteboom, Theo, 2014. "The design of coastal shipping services subject to carbon emission reduction targets and state subsidy levels," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 192-211.
    20. Younes Hamdouch & Siriphong Lawphongpanich, 2010. "Congestion Pricing for Schedule-Based Transit Networks," Transportation Science, INFORMS, vol. 44(3), pages 350-366, August.

    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:eee:transb:v:126:y:2019:i:c:p:549-564. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.