Skip to main content
SpringerLink
Log in

Optimal paths planning in dynamic transportation networks with random link travel times

  • Published:
Journal of Central South University Aims and scope Submit manuscript

Abstract

A theoretical study was conducted on finding optimal paths in transportation networks where link travel times were stochastic and time-dependent (STD). The methodology of relative robust optimization was applied as measures for comparing time-varying, random path travel times for a priori optimization. In accordance with the situation in real world, a stochastic consistent condition was provided for the STD networks and under this condition, a mathematical proof was given that the STD robust optimal path problem can be simplified into a minimum problem in specific time-dependent networks. A label setting algorithm was designed and tested to find travelers’ robust optimal path in a sampled STD network with computation complexity of O(n 2+n·m). The validity of the robust approach and the designed algorithm were confirmed in the computational tests. Compared with conventional probability approach, the proposed approach is simple and efficient, and also has a good application prospect in navigation system.

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

Similar content being viewed by others

References

  1. The fourth comprehensive transportation survey office. General report of the fourth comprehensive traffic survey in shanghai [R]. Shanghai: Shanghai Construction and Traffic Committee, 2010. (in Chinese).

    Google Scholar 

  2. LENG Jun-qiang, ZHANG Ya-ping, ZHANG Qian, ZHAO Ying-ping. Integrated reliability of travel time and capacity of urban road network under ice and snowfall conditions [J]. Journal of Central South University: Science and Technology (English Edition), 2010, 17: 419–424.

    Article  Google Scholar 

  3. HE Huang, GAO Song. Optimal paths in dynamic networks with dependent random link travel times [J]. Transportation Research Part B: Methodological, 2012, 46(5): 579–598.

    Article  MathSciNet  Google Scholar 

  4. CHENG E, GROSSMAN J W, LIPTAK L. Distance formula and shortest paths for the (n, k)-star graphs [J]. Information Sciences, 2010, 180(9): 1671–1680.

    Article  MATH  MathSciNet  Google Scholar 

  5. GAO Yuan. Shortest path problem with uncertain arc lengths [J]. Computers & Mathematics with Applications, 2011, 62(6): 2591–2600.

    Article  MATH  MathSciNet  Google Scholar 

  6. ZHU X, WILHELM W E. A three-stage approach for the resource-constrained shortest path as a sub-problem in column generation [J]. Computers & Operations Research, 2012, 39(2): 164–178.

    Article  MATH  MathSciNet  Google Scholar 

  7. AIN A, SALEHIPOUR A. Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem [J]. Applied Mathematics Letters, 2012, 25(1): 1–5.

    Article  MathSciNet  Google Scholar 

  8. CHITRA C, SUBBARAJI P. A non-dominated sorting genetic algorithm solution for shortest path routing problem in computer networks [J]. Expert Systems with Applications, 2012, 39(1): 1518–1525.

    Article  Google Scholar 

  9. MILLER-HOOKS E D, MAHMASSANI H S. Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks [J]. European Journal of Operational Research, 2003, 146(1): 67–82.

    Article  MATH  MathSciNet  Google Scholar 

  10. HALL R W. The fastest path through a network with random time-dependent travel times [J]. Transportation Science, 1986, 20(3): 182–188.

    Article  Google Scholar 

  11. MILLER-HOOKS E D, MAHMASSANI H S. Least expected time paths in stochastic, time-varying transportation networks [J]. Transportation Science, 2000, 34(2): 198–215.

    Article  MATH  Google Scholar 

  12. WELLMAN M P. Path planning under time-dependent uncertainty [C]// Proceedings of the 11th Conference on Uncertainty in Artificial Intelligence. Montreal, Quebec, Canada, 1995: 18–20.

    Google Scholar 

  13. HASUIKE T. Robust shortest path problem based on a confidence interval in fuzzy bi-criteria decision making [J]. Information Sciences, 2013, 221(1): 520–533

    Article  MathSciNet  Google Scholar 

  14. KARASAN O E, PINAR M C, YAMAN H. The robust shortest path problem with interval data [R]. Bilkent, Ankara, Turkey: Bilkent University, Department of Industrial Engineering, 2001.

    Google Scholar 

  15. BERTSIMAS D, SIM M. Robust discrete optimization and network flows [J]. Mathematical Programming, 2002, 98(1/2/3): 49–71.

    MathSciNet  Google Scholar 

  16. SIM M. Robust optimization [D]. Cambridge, Massachusetts, USA: Massachusetts Institute of Technology, 2004.

    Google Scholar 

  17. JOSE’ALEM D, MORABITO R. Production planning in furniture settings via robust optimization [J]. Computers & Operations Research, 2012, 39(2): 139–150.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Key Laboratory of Road and Traffic Engineering of the Ministry of Education (Tongji University), Shanghai, 201804, China

    Shi-chao Sun  (孙世超), Zheng-yu Duan  (段征宇) & Dong-yuan Yang  (杨东援)

Authors
  1. Shi-chao Sun  (孙世超)
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zheng-yu Duan  (段征宇)
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dong-yuan Yang  (杨东援)
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Zheng-yu Duan  (段征宇).

Additional information

Foundation item: Project(71001079) supported by the National Natural Science Foundation of China

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sun, Sc., Duan, Zy. & Yang, Dy. Optimal paths planning in dynamic transportation networks with random link travel times. J. Cent. South Univ. 21, 1616–1623 (2014). https://doi.org/10.1007/s11771-014-2103-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11771-014-2103-4

Key words

Search

Navigation