TY - JOUR

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

AU - Miller, Elise D.

AU - Mahmassani, Hani S.

AU - Ziliaskopoulos, Athanasios

PY - 1994/12/1

Y1 - 1994/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028740864&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028740864&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0028740864

VL - 2

SP - 1716

EP - 1721

JO - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

JF - Proceedings of the IEEE International Conference on Systems, Man and Cybernetics

SN - 0884-3627

ER -