Skip to main content
SpringerLink
Log in

Finding the \(\mathrm{K}\) Mean-Standard Deviation Shortest Paths Under Travel Time Uncertainty

  • Research
  • Published:
Networks and Spatial Economics Aims and scope Submit manuscript

Abstract

The mean-standard deviation shortest path problem (MSDSPP) incorporates the travel time variability into the routing optimization. The idea is that the decision-maker wants to minimize the travel time not only on average, but also to keep their variability as small as possible. Its objective is a linear combination of mean and standard deviation of travel times. This study focuses on the problem of finding the best-\(K\) optimal paths for the MSDSPP. We denote this problem as the KMSDSPP. When the travel time variability is neglected, the KMSDSPP reduces to a \(K\)-shortest path problem with expected routing costs. This paper develops two methods to solve the KMSDSPP, including a basic method and a deviation path-based method. To find the \(k+1\)th optimal path, the basic method adds \(k\) constraints to exclude the first-\(k\) optimal paths. Additionally, we introduce the deviation path concept and propose a deviation path-based method. To find the \(k+1\)th optimal path, the solution space that contains the \(k\)th optimal path is decomposed into several subspaces. We just need to search these subspaces to generate additional candidate paths and find the \(k+1\)th optimal path in the set of candidate paths. Numerical experiments are implemented in several transportation networks, showing that the deviation path-based method has superior performance than the basic method, especially for a large value of \(K\). Compared with the basic method, the deviation path-based method can save 90.1% CPU running time to find the best \(1000\) optimal paths in the Anaheim network.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Algorithm 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Algorithm 2
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19
Fig. 20
Fig. 21

Similar content being viewed by others

Data Availability

The code is available on reasonable request from the corresponding author.

References

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows - theory, algorithms and applications

  • Androutsopoulos KN, Zografos KG (2008) Solving the -shortest path problem with time windows in a time varying network. Oper Res Lett 36:692–695

    Article  MathSciNet  Google Scholar 

  • Babaei M, Rajabi-Bahaabadi M, Shariat-Mohaymany A (2016) Estimation of travel time reliability in large-scale networks. Transp Lett 8:229–240

    Article  Google Scholar 

  • Bellman R (1958) On a routing problem. Quart Appl Math 16:87–90

    Article  MathSciNet  Google Scholar 

  • Brucker PJ, Hamacher HW (1989) k-optimal solution sets for some polynomially solvable scheduling problems. Eur J Oper Res 41:194–202

    Article  MathSciNet  Google Scholar 

  • Chen BY, Chen X-W, Chen H-P, Lam WHK (2020) Efficient algorithm for finding k shortest paths based on re-optimization technique. Transp Res E 133

  • Chen X-W, Chen BY, Lam WHK, Tam ML, Ma W (2021) A bi-objective reliable path-finding algorithm for battery electric vehicle routing. Expert Syst Appl 182

  • Chen BY, Li Q, Lam WHK (2016) Finding the k reliable shortest paths under travel time uncertainty. Transp Res Part B Methodological 94:189–203

    Article  Google Scholar 

  • Chen BY, Lam WH, Sumalee A, Li Q, Shao H, Fang Z (2013) Finding Reliable Shortest paths in Road Networks under uncertainty. Netw Spat Econ

  • Chen Y-L, Yang H-H (2004) Finding the first K shortest paths in a time-window network. Comput Oper Res 31:499–513

    Article  MathSciNet  Google Scholar 

  • Chen A, Zhou Z (2010) The α-reliable mean-excess traffic equilibrium model with stochastic travel times. Transp Res Part B Methodological 44:493–513

    Article  Google Scholar 

  • Chondrogiannis T, Bouros P, Gamper J, Leser U, Blumenthal DB (2020) Finding k-shortest paths with limited overlap. VLDB J 29:1023–1047

    Article  Google Scholar 

  • Eppstein D (1998) FINDING THE k SHORTEST PATHS. SIAM J Comput 2:652–673

    Article  MathSciNet  Google Scholar 

  • Guazzelli CS, Cunha CB (2018) Exploring K-best solutions to enrich network design decision-making. Omega 78:139–164

    Article  Google Scholar 

  • Guerriero F, Musmanno R, Lacagnina V, Pecorella A (2001) A class of label-correcting methods for the K Shortest paths Problem. Oper Res 49:423–429

    Article  MathSciNet  Google Scholar 

  • Guo H, Hou X, Cao Z, Zhang J (2021a) GP3: gaussian process path planning for Reliable Shortest path in Transportation Networks. IEEE Trans. Intell. Transp. Syst. 1–16

  • Guo H, Hou X, Peng Q (2021b) CTD: cascaded temporal difference learning for the Mean-Standard deviation shortest path problem. IEEE Trans Intell Transp Syst 1–19

  • Hershberger J, Maxel M, Suri S (2007) Finding the k shortest simple paths. ACM Trans Algorithms 3:45–es

  • Khani A, Boyles SD (2015) An exact algorithm for the mean–standard deviation shortest path problem. Transp Res B Meth 81:252–266

    Article  Google Scholar 

  • Lawler EL (1976) Combinatorial optimization:networks and matroids. Holt, Rinehart & Winston, New York

    Google Scholar 

  • Leão AAS, Cherri LH, Arenales MN (2014) Determining the K-best solutions of knapsack problems. Comput Oper Res 49:71–82

    Article  MathSciNet  Google Scholar 

  • Lo HK, Luo XW, Siu BWY (2006) Degradable transport network: travel time budget of travelers with heterogeneous risk aversion. Transp Res B-Meth 40:792–806

    Article  Google Scholar 

  • Moghanni A, Pascoal M, Godinho MT (2021) Finding shortest and dissimilar paths. Int Trans Oper Res 29:1573–1601

    Article  MathSciNet  Google Scholar 

  • Sen S, Pillai R, Joshi S, Rathi AK (2001) A Mean-Variance Model for Route Guidance in Advanced traveler Information systems. Transport Sci 35:37–49

    Article  Google Scholar 

  • Shahabi M, Unnikrishnan A, Boyles SD (2013) An outer approximation algorithm for the robust shortest path problem. Transp Res E 58:52–66

    Article  Google Scholar 

  • Shen L, Shao H, Wu T, Fainman EZ, Lam WHK (2020) Finding the reliable shortest path with correlated link travel times in signalized traffic networks under uncertainty. Transp Res E 144

  • Shier DR (1979) On algorithms for finding the k shortest paths in a network. Networks 9:195–214

    Article  MathSciNet  Google Scholar 

  • Sivakumar RA, Batta R (1994) The Variance-Constrained Shortest Path Problem 28:309–316

  • Song M, Cheng L (2022b) A generalized Benders decomposition approach for the mean-standard deviation shortest path problem. Transp Lett 1–11

  • Song M, Cheng L (2022) An augmented Lagrangian relaxation method for the mean-standard deviation based vehicle routing problem. Knowl Based Syst 247:108736

    Article  Google Scholar 

  • Taylor MAP (2013) Travel through time: the story of research on travel time reliability. Transportmetrica B: Transport Dynamics 1:174–194

    Google Scholar 

  • van der Poort ES, Libura M, Sierksma G, van der Veen JAA (1999) Solving the k-best traveling salesman problem. Comput Oper Res 26:409–425

    Article  MathSciNet  Google Scholar 

  • Xing T, Zhou XS (2011) Finding the most reliable path with and without link travel time correlation: a lagrangian substitution based approach. Transp Res B - Meth 45:1660–1679

    Article  Google Scholar 

  • Xu W, He S, Song R, Chaudhry SS (2012) Finding the K shortest paths in a schedule-based transit network. Comput Oper Res 39:1812–1826

    Article  MathSciNet  Google Scholar 

  • Yang H-H, Chen Y-L (2006) Finding K shortest looping paths with waiting time in a time–window network. Appl Math Model 30:458–465

    Article  Google Scholar 

  • Yang LX, Zhou XS (2014) Constraint reformulation and a lagrangian relaxation-based solution algorithm for a least expected time path problem. Transp Res B-Meth 59:22–44

    Article  CAS  Google Scholar 

  • Yang LX, Zhou XS (2017) Optimizing on-time arrival probability and percentile travel time for elementary path finding in time-dependent transportation networks: Linear mixed integer programming reformulations. Transp Res B-Meth 96:68–91

    Article  Google Scholar 

  • Yen JY (1971) Finding the k shortest loopless paths in a network. Manag Sci

  • Zang Z, Xu X, Qu K, Chen R, Chen A (2022) Travel time reliability in transportation networks: a review of methodological developments. Transp Res Part C Emerg Technol  143. https://doi.org/10.1016/j.trc.2022.103866

  • Zhang Y, Khani A (2019) An algorithm for reliable shortest path problem with travel time correlations. Transp Res Part B Methodological 121:92–113

    Article  CAS  Google Scholar 

  • Zhang Y, Shen Z-JM, Song S (2016) Parametric search for the bi-attribute concave shortest path problem. Transp Res Part B Methodological 94:150–168

    Article  Google Scholar 

  • Zhang Y, Shen M, Song Z-J (2017) Lagrangian relaxation for the reliable shortest path problem with correlated link travel times. Transp Res B - Meth 104:501–521

    Article  Google Scholar 

  • Zhang Y, Song S, Shen Z-JM, Wu C (2018) Robust shortest path problem with distributional uncertainty. IEEE Trans Intell Transp Syst 19:1080–1090

    Article  Google Scholar 

  • Zhang J, Zhuang J, Behlendorf B (2018) Stochastic shortest path network interdiction with a case study of Arizona–Mexico border. Reliab Eng Syst Safe 179:62–73

    Article  Google Scholar 

  • Zijpp NJvd, Catalano SF (2005) Path enumeration by finding the constrained K-shortest paths. Transp Res Part B Methodological 39:545–563

    Article  Google Scholar 

Download references

Funding

This research is supported by the National Natural Science Foundation of China (No. 52172318, No. 52131203).

Author information

Authors and Affiliations

  1. School of Automotive and Traffic Engineering, Jiangsu University, Zhenjiang, Jiangsu, China

    Maocan Song, Huimin Ge, Chao Sun & Ruochen Wang

  2. School of Transportation, Southeast University, Jiangning District, Nanjing, Jiangsu, China

    Lin Cheng

Authors
  1. Maocan Song
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Lin Cheng
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Huimin Ge
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chao Sun
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Ruochen Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Contributions

Maocan Song: Conceptualization, Methodology, Writing original draft preparation; Lin Cheng: Supervision; Huimin Ge: Review & editing; Chao Sun: Visualization; Ruochen Wang: Review & editing.

Corresponding author

Correspondence to Lin Cheng.

Ethics declarations

Ethical Approval

Not applicable.

Competing Interests

The authors declare no competing interests.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Song, M., Cheng, L., Ge, H. et al. Finding the \(\mathrm{K}\) Mean-Standard Deviation Shortest Paths Under Travel Time Uncertainty. Netw Spat Econ (2024). https://doi.org/10.1007/s11067-024-09618-2

Download citation

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11067-024-09618-2

Keywords

Search

Navigation