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

Elise D. Miller*, Hani S. Mahmassani, Athanasios Ziliaskopoulos

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

7 Scopus citations

Abstract

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.

Original languageEnglish (US)
Pages (from-to)1716-1721
Number of pages6
JournalProceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume2
StatePublished - Dec 1 1994

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering

Fingerprint Dive into the research topics of 'Path search techniques for transportation networks with time-dependent, stochastic arc costs'. Together they form a unique fingerprint.

Cite this