caa a22 4500 467928541 CHVBK 20180406152936.0 cr unu---uuuuu 170328e20060901xx s 000 0 eng 10.1007/s11067-006-9287-6 doi (NATIONALLICENCE)springer-10.1007/s11067-006-9287-6 Optimal Routing for Maximizing the Travel Time Reliability [Elektronische Daten] [Yueyue Fan, Yu Nie] 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. Springer Science + Business Media, LLC, 2006 Shortest path problem nationallicence Dynamic programming nationallicence Stochastic networks nationallicence Reliability nationallicence Successive approximation nationallicence Fan Yueyue Department of Civil and Environmental Engineering, University of California, 95616, Davis, CA, USA aut Nie Yu Department of Civil and Environmental Engineering, University of California, 95616, Davis, CA, USA aut Networks and Spatial Economics Kluwer Academic Publishers 6/3-4(2006-09-01), 333-344 1566-113X 6:3-4<333 2006 6 11067 https://doi.org/10.1007/s11067-006-9287-6 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/s11067-006-9287-6 text/html Onlinezugriff via DOI NATIONALLICENCE 700 1- Fan Yueyue Department of Civil and Environmental Engineering, University of California, 95616, Davis, CA, USA aut NATIONALLICENCE 700 1- Nie Yu Department of Civil and Environmental Engineering, University of California, 95616, Davis, CA, USA aut NATIONALLICENCE 773 0- Networks and Spatial Economics Kluwer Academic Publishers 6/3-4(2006-09-01), 333-344 1566-113X 6:3-4<333 2006 6 11067 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer