IDEAS home Printed from https://ideas.repec.org/a/spr/pubtra/v8y2016i3d10.1007_s12469-016-0134-y.html
   My bibliography  Save this article

A reliability-based transit trip planning model under transit network uncertainty

Author

Listed:
  • Yang Chen

    (University of Illinois at Chicago)

  • Shu Yang

    (The University of Arizona)

  • Mengqi Hu

    (University of Illinois at Chicago)

  • Yao-Jan Wu

    (The University of Arizona)

Abstract

Transit, although an important public transportation mode, is not thoroughly utilized in the United States. To encourage the public to take transit, agencies have developed systems and tools that assist travelers in accessing and using information. Transit data modeling and trip planner system architecture developments have helped advance these systems, and the recent emergence of transit trip planning algorithms promises further enhancement. Conventional transit trip planning algorithms are usually developed based on graph theory. In order to utilize these algorithms, certain assumptions must be made to support these algorithms (e.g. buses always run on time). However, these assumptions may not be realistic. To overcome these limitations, our study develops an innovative transit trip planning model using chance constrained programming. Unlike previous studies, which only minimized passenger-experienced travel time, our study also considers transit service reliability. Additionally, in-vehicle travel time, transfer time, and walking time are all included as elements of passenger-experienced travel time. Our transit trip planning model avoids the assumptions of previous studies by incorporating transit service reliability and is capable of finding reliable transit paths with minimized passenger-experienced travel time. The algorithm can also suggest a buffer time before departure to ensure on-time arrivals at a given confidence level. General Transit Feed Specification data, collected around Tucson, Arizona, was used to model the transit network using a “node-link” scheme and estimate link-level travel time and travel time reliability. Three groups of experiments were developed to test the performance of the proposed model. The experiment results suggested that the optimal anticipated travel time increased with increasing on-time arrival confidence level and walking was preferred over direct bus transfers that involved out of direction travel. The proposed model can also include additional travel modes and can easily be extended to include intercity trip planning.

Suggested Citation

  • Yang Chen & Shu Yang & Mengqi Hu & Yao-Jan Wu, 2016. "A reliability-based transit trip planning model under transit network uncertainty," Public Transport, Springer, vol. 8(3), pages 477-496, December.
    • Handle: RePEc:spr:pubtra:v:8:y:2016:i:3:d:10.1007_s12469-016-0134-y
    DOI: 10.1007/s12469-016-0134-y
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s12469-016-0134-y
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s12469-016-0134-y?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. Bi Chen & William Lam & Agachai Sumalee & Qingquan Li & Hu Shao & Zhixiang Fang, 2013. "Finding Reliable Shortest Paths in Road Networks Under Uncertainty," Networks and Spatial Economics, Springer, vol. 13(2), pages 123-148, June.
    2. Fu, Liping & Rilett, L. R., 1998. "Expected shortest paths in dynamic and stochastic traffic networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(7), pages 499-516, September.
    3. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    4. Brakewood, Candace & Barbeau, Sean & Watkins, Kari, 2014. "An experiment evaluating the impacts of real-time transit information on bus riders in Tampa, Florida," Transportation Research Part A: Policy and Practice, Elsevier, vol. 69(C), pages 409-422.
    5. Wong, S. C. & Tong, C. O., 1998. "Estimation of time-dependent origin-destination matrices for transit networks," Transportation Research Part B: Methodological, Elsevier, vol. 32(1), pages 35-48, January.
    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. PeCoy, Michael D. & Redmond, Michael A., 2023. "Flight reliability during periods of high uncertainty," Journal of Air Transport Management, Elsevier, vol. 106(C).
    2. 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.
    3. Christina Iliopoulou & Konstantinos Kepaptsoglou & Eleni Vlahogianni, 2019. "Metaheuristics for the transit route network design problem: a review and comparative analysis," Public Transport, Springer, vol. 11(3), pages 487-521, October.

    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. A. Arun Prakash & Karthik K. Srinivasan, 2017. "Finding the Most Reliable Strategy on Stochastic and Time-Dependent Transportation Networks: A Hypergraph Based Formulation," Networks and Spatial Economics, Springer, vol. 17(3), pages 809-840, September.
    2. Chen, Bi Yu & Li, Qingquan & Lam, William H.K., 2016. "Finding the k reliable shortest paths under travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 189-203.
    3. Chen, Bi Yu & Chen, Xiao-Wei & Chen, Hui-Ping & Lam, William H.K., 2020. "Efficient algorithm for finding k shortest paths based on re-optimization technique," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    4. Zhou, Bo & Eskandarian, Azim, 2006. "A Non-Deterministic Path Generation Algorithm for Traffic Networks," 47th Annual Transportation Research Forum, New York, New York, March 23-25, 2006 208047, Transportation Research Forum.
    5. Prakash, A. Arun, 2018. "Pruning algorithm for the least expected travel time path on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 127-147.
    6. Shen, Liang & Shao, Hu & Wu, Ting & Fainman, Emily Zhu & Lam, William H.K., 2020. "Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 144(C).
    7. Maocan Song & Lin Cheng & Huimin Ge & Chao Sun & Ruochen Wang, 2024. "Finding the $$\mathrm{K}$$ K Mean-Standard Deviation Shortest Paths Under Travel Time Uncertainty," Networks and Spatial Economics, Springer, vol. 24(2), pages 395-423, June.
    8. Axel Parmentier, 2019. "Algorithms for non-linear and stochastic resource constrained shortest path," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 89(2), pages 281-317, April.
    9. Levering, Nikki & Boon, Marko & Mandjes, Michel & Núñez-Queija, Rudesindo, 2022. "A framework for efficient dynamic routing under stochastically varying conditions," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 97-124.
    10. Nielsen, Lars Relund & Andersen, Kim Allan & Pretolani, Daniele, 2014. "Ranking paths in stochastic time-dependent networks," European Journal of Operational Research, Elsevier, vol. 236(3), pages 903-914.
    11. Häme, Lauri & Hakula, Harri, 2013. "Dynamic journeying under uncertainty," European Journal of Operational Research, Elsevier, vol. 225(3), pages 455-471.
    12. Tong, C.O. & Wong, S.C., 1998. "A stochastic transit assignment model using a dynamic schedule-based network," Transportation Research Part B: Methodological, Elsevier, vol. 33(2), pages 107-121, April.
    13. Yang, Baiyu & Miller-Hooks, Elise, 2004. "Adaptive routing considering delays due to signal operations," Transportation Research Part B: Methodological, Elsevier, vol. 38(5), pages 385-413, June.
    14. Huili Zhang & Yinfeng Xu & Xingang Wen, 2015. "Optimal shortest path set problem in undirected graphs," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 511-530, April.
    15. Zhijian Wang & Jianpeng Yang & Qiang Zhang & Li Wang, 2022. "Risk-Aware Travel Path Planning Algorithm Based on Reinforcement Learning during COVID-19," Sustainability, MDPI, vol. 14(20), pages 1-25, October.
    16. Daria Dzyabura & Srikanth Jagabathula, 2018. "Offline Assortment Optimization in the Presence of an Online Channel," Management Science, INFORMS, vol. 64(6), pages 2767-2786, June.
    17. Davood Shishebori & Lawrence Snyder & Mohammad Jabalameli, 2014. "A Reliable Budget-Constrained FL/ND Problem with Unreliable Facilities," Networks and Spatial Economics, Springer, vol. 14(3), pages 549-580, December.
    18. Ehmke, Jan Fabian & Campbell, Ann M. & Thomas, Barrett W., 2018. "Optimizing for total costs in vehicle routing in urban areas," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 116(C), pages 242-265.
    19. Melchiori, Anna & Sgalambro, Antonino, 2020. "A branch and price algorithm to solve the Quickest Multicommodity k-splittable Flow Problem," European Journal of Operational Research, Elsevier, vol. 282(3), pages 846-857.
    20. Luss, Hanan & Wong, Richard T., 2005. "Graceful reassignment of excessively long communications paths in networks," European Journal of Operational Research, Elsevier, vol. 160(2), pages 395-415, January.

    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:spr:pubtra:v:8:y:2016:i:3:d:10.1007_s12469-016-0134-y. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.