Shortest paths in stochastic networks with correlated link costs

The objective is to minimize expected travel time from any origin to a specific destination in a congestible network with correlated link costs. Each link is assumed to be in one of two possible conditions. Conditional probability density functions for link travel times are assumed known for each condition. Conditions over the traversed links are taken into account for determining the optimal routing strategy for the remaining trip. This problem is treated as a multistage adaptive feedback control process. Each stage is described by the physical state (the location of the current decision point) and the information state (the service level of the previously traversed links). Proof of existence and uniqueness of the solution to the basic dynamic programming equations and a solution procedure are provided.

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

[2]  Robert L. Smith,et al.  Fastest Paths in Time-dependent Networks for Intelligent Vehicle-Highway Systems Application , 1993, J. Intell. Transp. Syst..

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

[4]  Sumit Sarkar,et al.  A Relaxation-Based Pruning Technique for a Class of Stochastic Shortest Path Problems , 1996, Transp. Sci..

[5]  Cheng-Huang Hung.  On the inverse shortest path length problem , 2003 .

[6]  S. Sarkar,et al.  Stochastic Shortest Path Problems with Piecewise-Linear Concave Utility Functions , 1998 .

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

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

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

[10]  Didier Burton,et al.  On the Inverse Shortest Path Problem , 1993 .

[11]  T. Lindvall.  ON A ROUTING PROBLEM , 2004, Probability in the Engineering and Informational Sciences.

[12]  Robert E. Kalaba,et al.  Dynamic Programming and Modern Control Theory , 1966 .

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

[14]  Philippe L. Toint,et al.  On the use of an inverse shortest paths algorithm for recovering linearly correlated costs , 1994, Math. Program..

[15]  Hossein Soroush,et al.  Path Preferences and Optimal Paths in Probabilistic Networks , 1985, Transp. Sci..

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

[17]  Liping Fu,et al.  An adaptive routing algorithm for in-vehicle route guidance system with real-time information , 2001 .