Trajectory-Adaptive Routing in Dynamic Networks with Dependent Random Link Travel Times

This paper studies the problem of finding the trajectory-adaptive routing policies with minimum expected disutility in a stochastic time-dependent network where all link travel times are temporally and spatially correlated. It is shown that Bellman’s principle is invalid if the optimality or non-dominance of a routing policy and its sub-policies is defined with respect to the universal set of travel time probabilistic outcomes. An exact algorithm is designed to find optimal trajectory-adaptive routing policies based on a new property for which Bellman’s principle holds. A comparison is made between the results of the optimal trajectory-adaptive routing policies and the optimal paths in the same test networks to investigate the benefit of being adaptive to information.

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

[2]  Bi Yu Chen,et al.  Reliable shortest path finding in stochastic networks with spatial correlated link travel times , 2012, Int. J. Geogr. Inf. Sci..

[3]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[4]  Sebastien Blandin,et al.  A Tractable Class of Algorithms for Reliable Routing in Stochastic Networks , 2011 .

[5]  Moshe Ben-Akiva,et al.  Routing Policy Choice Set Generation in Stochastic Time-Dependent Networks , 2014 .

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

[7]  Elise Miller-Hooks,et al.  Adaptive routing considering delays due to signal operations , 2004 .

[8]  J. Tsitsiklis,et al.  Stochastic shortest path problems with recourse , 1996 .

[9]  Song Gao,et al.  Best Routing Policy Problem in Stochastic Time-Dependent Networks , 2002 .

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

[11]  Xing Wu,et al.  Reliable a Priori Shortest Path Problem with Limited Spatial and Temporal Dependencies , 2009 .

[12]  Matthias Ehrgott,et al.  Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks , 2009, Oper. Res. Lett..

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

[14]  Elise Miller-Hooks,et al.  Multicriteria adaptive paths in stochastic, time-varying networks , 2006, Eur. J. Oper. Res..

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

[16]  Song Gao,et al.  Optimal paths in dynamic networks with dependent random link travel times , 2012 .

[17]  S. Hoogendoorn,et al.  Shortest Paths in Stochastic Time-Dependent Networks with Link Travel Time Correlation , 2013 .

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

[19]  He Huang,et al.  Real-time traveler information for optimal adaptive routing in stochastic time-dependent networks , 2012 .

[20]  Yueyue Fan,et al.  Shortest paths in stochastic networks with correlated link costs , 2005 .

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

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

[23]  Daniele Pretolani,et al.  A directed hypergraph model for random time dependent shortest paths , 2000, Eur. J. Oper. Res..

[24]  Y. Nie,et al.  Shortest path problem considering on-time arrival probability , 2009 .

[25]  Song Gao,et al.  Spatiotemporal Link Speed Correlations , 2013 .