Reliability Theory Model and Expected Life Shortest Path in Stochastic and Time-Dependent Networks

We consider the priori expected shortest path problem from a single origin to a single destination for each departure time in stochastic and time-dependent networks. Such problem requires more than standard shortest path techniques. First, we transform this problem into the problem of systemic reliability, and identify a weaker consistent reliability condition that insures the validity of generalized dynamic-programming method based on reliability priority. Furthermore, we propose a new dominance discriminance, which makes the parameter in traditional discriminance drop from two dimensions to one dimension and reduces the possibility of not doing dominance compare among paths. Finally, we present the expected life shortest path algorithm.

[1]  Nico Vandaele,et al.  A QUEUEING BASED TRAFFIC FLOW MODEL , 2000 .

[2]  Ali Haghani,et al.  A dynamic vehicle routing problem with time-dependent travel times , 2005, Comput. Oper. Res..

[3]  M. Best,et al.  Sensitivity Analysis for Mean-Variance Portfolio Problems , 1991 .

[4]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[5]  Christos Alexopoulos.  State space partitioning methods for stochastic shortest path problems , 1997 .

[6]  Pravin Varaiya,et al.  Travel-Time Reliability as a Measure of Service , 2003 .

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

[8]  D. S. Berry,et al.  Distribution of Vehicle Speeds and Travel Times , 1951 .

[9]  Adam M. Finkel,et al.  A Simple Formula for Calculating the “Mass Density” of a Lognormally Distributed Characteristic: Applications to Risk Analysis , 1990 .

[10]  Bin Ran,et al.  Essentially best routes in dynamic and stochastic transportation network , 2002 .

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

[12]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[13]  Mark S. Daskin,et al.  Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms , 1992, Transp. Sci..

[14]  David P. Morton,et al.  Stochastic Vehicle Routing with Random Travel Times , 2003, Transp. Sci..

[15]  Song Gao,et al.  Optimal routing policy problems in stochastic time-dependent networks. I. Framework and taxonomy , 2002, Proceedings. The IEEE 5th International Conference on Intelligent Transportation Systems.

[16]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[17]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[18]  Norman C. Beaulieu,et al.  An optimal lognormal approximation to lognormal sum distributions , 2004, IEEE Transactions on Vehicular Technology.

[19]  J. Doob.  Stochastic processes , 1953 .

[20]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[21]  M. Pirlot.  General local search methods , 1996 .

[22]  Gilbert Laporte,et al.  The vehicle routing problem: An overview of exact and approximate algorithms , 1992 .

[23]  N. H. Hakansson.,et al.  On the use of mean-variance and quadratic approximations in implementing dynamic investment strategies: a comparison of returns and investment policies , 1993 .

[24]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

[25]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Capacitated Arc Routing Problem , 2000, Oper. Res..

[26]  D Heidemann,et al.  A queueing theory approach to speed-flow-density relationships , 1996 .

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

[28]  Natarajan Gautam,et al.  Deriving Link Travel - Time Distributions via Stochastic Speed Processes , 2004, Transp. Sci..

[29]  James MacGregor Smith,et al.  Modeling Vehicular Traffic Flow using M/G/C/C State Dependent Queueing Models , 1997, Transp. Sci..

[30]  Tan Guo.  Shortest Path Algorithm in Time-Dependent Networks , 2002 .

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

[32]  Tom Van Woensel.  4 models for uninterrupted traffic flows: a queueing approach , 2003 .

[33]  谷口 栄一,et al.  City logistics : network modelling and intelligent transport systems , 2001 .

[34]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[35]  Michel Gendreau,et al.  Vehicle dispatching with time-dependent travel times , 2003, Eur. J. Oper. Res..

[36]  Ward Whitt,et al.  Comparison methods for queues and other stochastic models , 1986 .

[37]  Michael Mitzenmacher,et al.  Improved results for route planning in stochastic transportation , 2000, SODA '01.

[38]  Peter J. Bickel,et al.  Day-to-Day Travel-Time Trends and Travel-Time Prediction from Loop-Detector Data , 2000 .