A Tractable Class of Algorithms for Reliable Routing in Stochastic Networks

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  H. Frank,et al.  Shortest Paths in Probabilistic Graphs , 1969, Oper. Res..

[3]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[4]  T. H. Savits,et al.  The IFRA Closure Problem , 1976 .

[5]  Didier Sornette,et al.  Numerical Inversion of the Laplace Transform , 1981 .

[6]  Rae Baxter,et al.  Acknowledgments.-The authors would like to , 1982 .

[7]  David Assaf,et al.  Closure of Phase Type Distributions Under Operations Arising in Reliability Theory , 1982 .

[8]  Ronald Prescott Loui,et al.  Optimal paths in graphs with stochastic or multidimensional weights , 1983, Commun. ACM.

[9]  Randolph W. Hall,et al.  The Fastest Path through a Network with Random Time-Dependent Travel Times , 1986, Transp. Sci..

[10]  Ariel Orda,et al.  Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length , 1990, JACM.

[11]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[12]  Jean-Pierre Aubin,et al.  Viability theory , 1991 .

[13]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[14]  John N. Tsitsiklis,et al.  Neuro-Dynamic Programming , 1996, Encyclopedia of Machine Learning.

[15]  Vittorio Astarita,et al.  A CONTINUOUS TIME LINK MODEL FOR DYNAMIC NETWORK LOADING BASED ON TRAVEL TIME FUNCTION , 1996 .

[16]  L. B. Fu,et al.  Expected Shortest Paths in Dynamic and Stochastic Traf c Networks , 1998 .

[17]  Hani S. Mahmassani,et al.  Least Expected Time Paths in Stochastic, Time-Varying Transportation Networks , 1999, Transp. Sci..

[18]  S. Travis Waller,et al.  On the online shortest path problem with limited arc cost dependencies , 2002, Networks.

[19]  Brian C. Dean,et al.  Algorithms for minimum‐cost paths in time‐dependent networks with waiting policies , 2004, Networks.

[20]  G. Milovanović,et al.  Numerical Inversion of the Laplace Transform , 2005 .

[21]  R. Kalaba,et al.  Arriving on Time , 2005 .

[22]  Yueyue Fan,et al.  Optimal Routing for Maximizing the Travel Time Reliability , 2006 .

[23]  Y. Nie,et al.  Arriving-on-time problem : Discrete algorithm that ensures convergence , 2006 .

[24]  Y. Nie,et al.  Arriving-on-Time Problem , 2006 .

[25]  Haim Kaplan,et al.  Better Landmarks Within Reach , 2007, WEA.

[26]  Peter Sanders,et al.  Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks , 2008, WEA.

[27]  Alexandre M. Bayen,et al.  Estimating arterial traffic conditions using sparse probe data , 2010, 13th International IEEE Conference on Intelligent Transportation Systems.

[28]  A. Bayen,et al.  A traffic model for velocity data assimilation , 2010 .

[29]  Amos Fiat,et al.  Highway dimension, shortest paths, and provably efficient algorithms , 2010, SODA '10.

[30]  Transportation Research Part B , .