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