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

Finding the k reliable shortest paths under travel time uncertainty

Author

Listed:
  • Chen, Bi Yu
  • Li, Qingquan
  • Lam, William H.K.

Abstract

This paper investigates the problem of finding the K reliable shortest paths (KRSP) in stochastic networks under travel time uncertainty. The KRSP problem extends the classical K loopless shortest paths problem to the stochastic networks by explicitly considering travel time reliability. In this study, a deviation path approach is established for finding K α-reliable paths in stochastic networks. A deviation path algorithm is proposed to exactly solve the KRSP problem in large-scale networks. The A* technique is introduced to further improve the KRSP finding performance. A case study using real traffic information is performed to validate the proposed algorithm. The results indicate that the proposed algorithm can determine KRSP under various travel time reliability values within reasonable computational times. The introduced A* technique can significantly improve KRSP finding performance.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:transb:v:94:y:2016:i:c:p:189-203
    DOI: 10.1016/j.trb.2016.09.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261516302521
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2016.09.013?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. Carrion, Carlos & Levinson, David, 2012. "Value of travel time reliability: A review of current evidence," Transportation Research Part A: Policy and Practice, Elsevier, vol. 46(4), pages 720-741.
    2. Lam, William H.K. & Shao, Hu & Sumalee, Agachai, 2008. "Modeling impacts of adverse weather conditions on a road network with uncertainties in demand and supply," Transportation Research Part B: Methodological, Elsevier, vol. 42(10), pages 890-910, December.
    3. Srinivasan, Karthik K. & Prakash, A.A. & Seshadri, Ravi, 2014. "Finding most reliable paths on networks with correlated and shifted log–normal travel times," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 110-128.
    4. Tsung-Sheng Chang & Linda K. Nozick & Mark A. Turnquist, 2005. "Multiobjective Path Finding in Stochastic Dynamic Networks, with Application to Routing Hazardous Materials Shipments," Transportation Science, INFORMS, vol. 39(3), pages 383-399, August.
    5. 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.
    6. 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.
    7. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    8. Xing, Tao & Zhou, Xuesong, 2011. "Finding the most reliable path with and without link travel time correlation: A Lagrangian substitution based approach," Transportation Research Part B: Methodological, Elsevier, vol. 45(10), pages 1660-1679.
    9. 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.
    10. Yang, Lixing & Zhou, Xuesong, 2014. "Constraint reformulation and a Lagrangian relaxation-based solution algorithm for a least expected time path problem," Transportation Research Part B: Methodological, Elsevier, vol. 59(C), pages 22-44.
    11. H. Frank, 1969. "Shortest Paths in Probabilistic Graphs," Operations Research, INFORMS, vol. 17(4), pages 583-599, August.
    12. 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.
    13. Wu, Xing & (Marco) Nie, Yu, 2011. "Modeling heterogeneous risk-taking behavior in route choice: A stochastic dominance approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 45(9), pages 896-915, November.
    14. Beaud, Mickael & Blayac, Thierry & Stéphan, Maïté, 2016. "The impact of travel time variability and travelers’ risk attitudes on the values of time and reliability," Transportation Research Part B: Methodological, Elsevier, vol. 93(PA), pages 207-224.
    15. Khani, Alireza & Boyles, Stephen D., 2015. "An exact algorithm for the mean–standard deviation shortest path problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 252-266.
    16. Wu, Xing, 2015. "Study on mean-standard deviation shortest path problem in stochastic and time-dependent networks: A stochastic dominance based approach," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 275-290.
    17. Robert Geisberger & Peter Sanders & Dominik Schultes & Christian Vetter, 2012. "Exact Routing in Large Road Networks Using Contraction Hierarchies," Transportation Science, INFORMS, vol. 46(3), pages 388-404, August.
    18. Engelson, Leonid & Fosgerau, Mogens, 2016. "The cost of travel time variability: Three measures with properties," Transportation Research Part B: Methodological, Elsevier, vol. 91(C), pages 555-564.
    19. Tan, Zhijia & Yang, Hai & Guo, Renyong, 2014. "Pareto efficiency of reliability-based traffic equilibria and risk-taking behavior of travelers," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 16-31.
    20. Nie, Yu (Marco) & Wu, Xing, 2009. "Shortest path problem considering on-time arrival probability," Transportation Research Part B: Methodological, Elsevier, vol. 43(6), pages 597-613, July.
    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. Zhang, Yuli & Max Shen, Zuo-Jun & Song, Shiji, 2017. "Lagrangian relaxation for the reliable shortest path problem with correlated link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 501-521.
    2. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    3. Shao, Feng & Shao, Hu & Wang, Dongle & Lam, William H.K. & Cao, Shuhan, 2023. "A generative model for vehicular travel time distribution prediction considering spatial and temporal correlations," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 621(C).
    4. 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).
    5. 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).
    6. Wanxiang Wang & Ruijun Guo, 2022. "Travel Time Reliability of Highway Network under Multiple Failure Modes," Sustainability, MDPI, vol. 14(12), pages 1-18, June.
    7. Shi, Ning & Zhou, Shaorui & Wang, Fan & Tao, Yi & Liu, Liming, 2017. "The multi-criteria constrained shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 101(C), pages 13-29.
    8. Elías Escobar-Gómez & J.L. Camas-Anzueto & Sabino Velázquez-Trujillo & Héctor Hernández-de-León & Rubén Grajales-Coutiño & Eduardo Chandomí-Castellanos & Héctor Guerra-Crespo, 2019. "A Linear Programming Model with Fuzzy Arc for Route Optimization in the Urban Road Network," Sustainability, MDPI, vol. 11(23), pages 1-18, November.
    9. 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.
    10. Zhang, Yufeng & Khani, Alireza, 2019. "An algorithm for reliable shortest path problem with travel time correlations," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 92-113.

    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. Zhang, Yuli & Max Shen, Zuo-Jun & Song, Shiji, 2017. "Lagrangian relaxation for the reliable shortest path problem with correlated link travel times," Transportation Research Part B: Methodological, Elsevier, vol. 104(C), pages 501-521.
    3. 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.
    4. Wu, Xing, 2015. "Study on mean-standard deviation shortest path problem in stochastic and time-dependent networks: A stochastic dominance based approach," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 275-290.
    5. 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).
    6. Zhang, Yufeng & Khani, Alireza, 2019. "An algorithm for reliable shortest path problem with travel time correlations," Transportation Research Part B: Methodological, Elsevier, vol. 121(C), pages 92-113.
    7. Yang, Lixing & Zhang, Yan & Li, Shukai & Gao, Yuan, 2016. "A two-stage stochastic optimization model for the transfer activity choice in metro networks," Transportation Research Part B: Methodological, Elsevier, vol. 83(C), pages 271-297.
    8. Yang, Lixing & Zhou, Xuesong, 2017. "Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations," Transportation Research Part B: Methodological, Elsevier, vol. 96(C), pages 68-91.
    9. 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.
    10. Xu, Xiangdong & Chen, Anthony & Cheng, Lin & Yang, Chao, 2017. "A link-based mean-excess traffic equilibrium model under uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 95(C), pages 53-75.
    11. Khani, Alireza & Boyles, Stephen D., 2015. "An exact algorithm for the mean–standard deviation shortest path problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 252-266.
    12. Zhang, Yuli & Shen, Zuo-Jun Max & Song, Shiji, 2016. "Parametric search for the bi-attribute concave shortest path problem," Transportation Research Part B: Methodological, Elsevier, vol. 94(C), pages 150-168.
    13. Tan, Zhijia & Yang, Hai & Guo, Renyong, 2014. "Pareto efficiency of reliability-based traffic equilibria and risk-taking behavior of travelers," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 16-31.
    14. 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.
    15. Shahabi, Mehrdad & Unnikrishnan, Avinash & Boyles, Stephen D., 2013. "An outer approximation algorithm for the robust shortest path problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 58(C), pages 52-66.
    16. Prakash, A. Arun & Seshadri, Ravi & Srinivasan, Karthik K., 2018. "A consistent reliability-based user-equilibrium problem with risk-averse users and endogenous travel time correlations: Formulation and solution algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 114(C), pages 171-198.
    17. A. Arun Prakash & Karthik K. Srinivasan, 2018. "Pruning Algorithms to Determine Reliable Paths on Networks with Random and Correlated Link Travel Times," Transportation Science, INFORMS, vol. 52(1), pages 80-101, January.
    18. Arun Prakash, A., 2020. "Algorithms for most reliable routes on stochastic and time-dependent networks," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 202-220.
    19. 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.
    20. Xiangfeng Ji & Xuegang (Jeff) Ban & Mengtian Li & Jian Zhang & Bin Ran, 2017. "Non-expected Route Choice Model under Risk on Stochastic Traffic Networks," Networks and Spatial Economics, Springer, vol. 17(3), pages 777-807, 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:transb:v:94:y:2016:i:c:p:189-203. 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.