Online Stochastic Routing Incorporating Real-Time Traffic Information

In this paper, online stochastic routing policies are developed to identify the optimal next action (path choice) at the current decision node (intersection) for travelers on the basis of their preference for future paths with the shortest travel time, the lowest travel time variability, or a combination, given the network conditions. A modified label-correcting algorithm is provided to solve for the shortest path that results from the proposed routing policies. Its running time is bounded by O(mn2), where m and n are the number of arcs and nodes, respectively, in the network. Since real-time traffic information is usually available with a certain level of accuracy, the proposed online routing policy integrates an existing information fusion model, which provides real-time short-term arc travel time distributions by considering information accuracy. Numerical experiments are used to demonstrate the performance of the proposed routing policies and algorithms, as well as the impacts of real-time information accuracy on the online stochastic routing.

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

[2]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[3]  Chelsea C. White,et al.  Optimal vehicle routing with real-time traffic information , 2005, IEEE Transactions on Intelligent Transportation Systems.

[4]  Bin Ran,et al.  Temporal and Spatial Variability of Travel Time , 2002 .

[5]  Michael P. Wellman,et al.  Path Planning under Time-Dependent Uncertainty , 1995, UAI.

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

[7]  Sean R Eddy,et al.  What is dynamic programming? , 2004, Nature Biotechnology.

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

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

[10]  John N. Tsitsiklis,et al.  Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs , 1993, Oper. Res..

[11]  Giovanni Andreatta,et al.  Stochastic shortest paths with recourse , 1988, Networks.

[12]  J. Croucher.  A note on the stochastic shortest‐route problem , 1978 .

[13]  Song Gao,et al.  Optimal routing policy problems in stochastic time-dependent networks , 2006 .

[14]  Chelsea C. White,et al.  State space reduction for nonstationary stochastic shortest path problems with real-time traffic information , 2005, IEEE Transactions on Intelligent Transportation Systems.

[15]  Elise Miller-Hooks,et al.  Least possible time paths in stochastic, time-varying networks , 1998, Comput. Oper. Res..

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

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

[18]  Adaptive least-expected time paths in stochastic, time-varying transportation and data networks , 2001 .

[19]  Elise Miller-Hooks,et al.  Adaptive least-expected time paths in stochastic, time-varying transportation and data networks , 2001, Networks.

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

[21]  Lili Du,et al.  An adaptive information fusion model to predict the short-term link travel time distribution in dynamic traffic networks , 2012 .

[22]  J. Scott Provan,et al.  A polynomial‐time algorithm to find shortest paths with recourse , 2003, Networks.