Optimal routing for maximizing the travel time reliability

Yueyue Fan*, Yu Nie

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

75 Scopus citations


Optimal path problems are important in many science and engineering fields. Performance criteria may vary in coping with uncertainty, such as expectation, reliability, value at risk, etc. In this paper, we will first summarize our recent work on a dynamic programming based optimal path algorithm for maximizing the time reliability. We then study the convergence properties of the algorithm by introducing two special successive approximation sequences. Finally we will show the connection between the maximum reliability problem and the shortest and k-shortest path problems.

Original languageEnglish (US)
Pages (from-to)333-344
Number of pages12
JournalNetworks and Spatial Economics
Issue number3-4
StatePublished - Sep 1 2006


  • Dynamic programming
  • Reliability
  • Shortest path problem
  • Stochastic networks
  • Successive approximation

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Optimal routing for maximizing the travel time reliability'. Together they form a unique fingerprint.

Cite this