IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v137y2020icp541-559.html
   My bibliography  Save this article

Shortest hyperpaths in a multimodal hypergraph with real-time information on some transit lines

Author

Listed:
  • López, David
  • Lozano, Angélica

Abstract

This paper presents an algorithm to find multimodal shortest hyperpaths in a transport system where transit arrival is random (i.e. random-arrival transit system), while real-time information on vehicle arrivals is only available for some lines and modes. When the algorithm is queried, there is a short horizon where real-time information is accurate, and past this the most reliable information for estimating the arrivals is to use a random distribution specific to the lines. This problem occurs frequently in emerging cities where the transit schedules are not maintained. A Combined Real-Time Hypergraph is constructed to model the multimodal transport system where all the public transport modes have random arrivals and real-time information on arrivals is available for some lines of some modes. In order to model the period of time when some lines have real-time information, the composition of the head nodes of hyperarcs changes over time. The algorithm is tested on a real-life transport system where we change the number of lines with available real-time information to assess the performance of the algorithm in different scenarios. We found that incrementing the number of lines with real-time information does not impact the performance.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transa:v:137:y:2020:i:c:p:541-559
    DOI: 10.1016/j.tra.2019.09.020
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965856417310066
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.tra.2019.09.020?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. Liu, Yang & Blandin, Sebastien & Samaranayake, Samitha, 2019. "Stochastic on-time arrival problem in transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 119(C), pages 122-138.
    2. Häme, Lauri & Hakula, Harri, 2013. "Dynamic journeying under uncertainty," European Journal of Operational Research, Elsevier, vol. 225(3), pages 455-471.
    3. Elise D. Miller-Hooks & Hani S. Mahmassani, 2000. "Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks," Transportation Science, INFORMS, vol. 34(2), pages 198-215, May.
    4. 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.
    5. Bradley Casey & Ashish Bhaskar & Hao Guo & Edward Chung, 2014. "Critical Review of Time-Dependent Shortest Path Algorithms: A Multimodal Trip Planner Perspective," Transport Reviews, Taylor & Francis Journals, vol. 34(4), pages 522-539, July.
    6. Lozano, Angélica & Storchi, Giovanni, 2002. "Shortest viable hyperpath in multimodal networks," Transportation Research Part B: Methodological, Elsevier, vol. 36(10), pages 853-874, December.
    7. Ziliaskopoulos, Athanasios & Wardell, Whitney, 2000. "An intermodal optimum path algorithm for multimodal networks with dynamic arc travel times and switching delays," European Journal of Operational Research, Elsevier, vol. 125(3), pages 486-502, September.
    8. Lozano, Angelica & Storchi, Giovanni, 2001. "Shortest viable path algorithm in multimodal networks," Transportation Research Part A: Policy and Practice, Elsevier, vol. 35(3), pages 225-241, March.
    9. 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.
    10. Maadi, Saeed & Schmöcker, Jan-Dirk, 2017. "Optimal hyperpaths with non-additive link costs," Transportation Research Part B: Methodological, Elsevier, vol. 105(C), pages 235-248.
    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. 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.
    2. 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.
    3. Rahul Nair & Elise Miller-Hooks, 2016. "Equilibrium design of bicycle sharing systems: the case of Washington D.C," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 321-344, August.
    4. Zweers, Bernard G. & van der Mei, Rob D., 2022. "Minimum costs paths in intermodal transportation networks with stochastic travel times and overbookings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 178-188.
    5. Androutsopoulos, Konstantinos N. & Zografos, Konstantinos G., 2009. "Solving the multi-criteria time-dependent routing and scheduling problem in a multimodal fixed scheduled network," European Journal of Operational Research, Elsevier, vol. 192(1), pages 18-28, January.
    6. Linzhong Liu & Haibo Mu & Juhua Yang, 2017. "Toward algorithms for multi-modal shortest path problem and their extension in urban transit network," Journal of Intelligent Manufacturing, Springer, vol. 28(3), pages 767-781, March.
    7. 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.
    8. 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.
    9. Miller-Hooks, Elise & Mahmassani, Hani, 2003. "Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks," European Journal of Operational Research, Elsevier, vol. 146(1), pages 67-82, April.
    10. Li, Zhaojin & Liu, Ya & Yang, Zhen, 2021. "An effective kernel search and dynamic programming hybrid heuristic for a multimodal transportation planning problem with order consolidation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    11. Ishfaq, Rafay & Sox, Charles R., 2011. "Hub location-allocation in intermodal logistic networks," European Journal of Operational Research, Elsevier, vol. 210(2), pages 213-230, April.
    12. Azadian, Farshid & Murat, Alper E. & Chinnam, Ratna Babu, 2012. "Dynamic routing of time-sensitive air cargo using real-time information," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(1), pages 355-372.
    13. Andrew Ensor & Felipe Lillo, 2016. "Colored-Edge Graph Approach for the Modeling of Multimodal Transportation Systems," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(01), pages 1-21, February.
    14. Michael Redmond & Ann Melissa Campbell & Jan Fabian Ehmke, 2020. "Data-driven planning of reliable itineraries in multi-modal transit networks," Public Transport, Springer, vol. 12(1), pages 171-205, March.
    15. Bielli, Maurizio & Boulmakoul, Azedine & Mouncif, Hicham, 2006. "Object modeling and path computation for multimodal travel systems," European Journal of Operational Research, Elsevier, vol. 175(3), pages 1705-1730, December.
    16. 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.
    17. Liang, Wen Yau & Huang, Chun-Che & Lin, Yin-Chen & Chang, Tsun Hsien & Shih, Meng Hao, 2013. "The multi-objective label correcting algorithm for supply chain modeling," International Journal of Production Economics, Elsevier, vol. 142(1), pages 172-178.
    18. Deng, Yuntian & Shao, Shiping & Mittal, Archak & Twumasi-Boakye, Richard & Fishelson, James & Gupta, Abhishek & Shroff, Ness B., 2022. "Incentive design and profit sharing in multi-modal transportation networks," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 1-21.
    19. Saeed Maadi & Jan-Dirk Schmöcker, 2020. "Route choice effects of changes from a zonal to a distance-based fare structure in a regional public transport network," Public Transport, Springer, vol. 12(3), pages 535-555, October.
    20. 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.

    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:transa:v:137:y:2020:i:c:p:541-559. 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/547/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.