Path search techniques for transportation networks with time-dependent, stochastic arc costs

In this paper we propose a technique for determining the set of pareto optimal paths and associated probability distributions, as well as the minimum path length distribution for all nodes to a given destination for a directed, cyclic or acyclic network where the arc lengths are given by independent, discrete random variables, whose distributions vary with time and are known. We suggest several approaches for selecting one path from the set of pareto optimal paths determined by the algorithm and discuss some heuristic procedures for further eliminating some paths from consideration.<<ETX>>

[1]  Vidyadhar G. Kulkarni,et al.  Shortest paths in stochastic networks with ARC lengths having discrete distributions , 1993, Networks.

[2]  Hani S. Mahmassani,et al.  Time dependent, shortest-path algorithm for real-time intelligent vehicle highway system applications , 1993 .

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

[4]  Douglas R. Shier,et al.  A factoring approach for the stochastic shortest path problem , 1991, Oper. Res. Lett..

[5]  John N. Tsitsiklis,et al.  An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..

[6]  Jonathan F. Bard,et al.  ARC reduction and path preference in stochastic acyclic networks , 1991 .

[7]  V. G. Kulkarni,et al.  Shortest paths in networks with exponentially distributed arc lengths , 1986, Networks.

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

[9]  Refael Hassin,et al.  On Shortest Paths in Graphs with Random Weights , 1985, Math. Oper. Res..

[10]  Jerzy Kamburowski,et al.  Technical Note - A Note on the Stochastic Shortest Route Problem , 1985, Oper. Res..

[11]  G. S. Fishman.  Estimating Network Characteristics in Stochastic Activity Networks , 1985 .

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

[13]  Hossein Soroush,et al.  Optimal paths in probabilistic networks: A case with temporary preferences , 1985, Comput. Oper. Res..

[14]  James J. Solberg,et al.  The Stochastic Shortest Route Problem , 1980, Oper. Res..

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

[16]  Andrew W. Shogan.  Bounding distributions for a stochastic pert network , 1977, Networks.

[17]  U. Pape,et al.  Implementation and efficiency of Moore-algorithms for the shortest route problem , 1974, Math. Program..

[18]  George B. Kleindorfer,et al.  Bounding Distributions for a Stochastic Acyclic Network , 1971, Oper. Res..

[19]  John M. Burt,et al.  Conditional Monte Carlo: A Simulation Technique for Stochastic Network Analysis , 1971 .

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

[21]  Van Slyke,et al.  MONTE CARLO METHODS AND THE PERT PROBLEM , 1963 .

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