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

Elise D. Miller; Hani S. Mahmassani; Athanasios Ziliaskopoulos

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

Civil and Environmental Engineering

Research output: Contribution to journal › Conference article › peer-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 language	English (US)
Pages (from-to)	1716-1721
Number of pages	6
Journal	Proceedings of the IEEE International Conference on Systems, Man and Cybernetics
Volume	2
State	Published - 1994
Event	Proceedings of the 1994 IEEE International Conference on Systems, Man and Cybernetics. Part 1 (of 3) - San Antonio, TX, USA Duration: Oct 2 1994 → Oct 5 1994

ASJC Scopus subject areas

Control and Systems Engineering
Hardware and Architecture

Cite this

@article{b89742c15f6f49798c49596dfb9caf2b,

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

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.",

author = "Miller, {Elise D.} and Mahmassani, {Hani S.} and Athanasios Ziliaskopoulos",

year = "1994",

language = "English (US)",

volume = "2",

pages = "1716--1721",

journal = "Proceedings of the IEEE International Conference on Systems, Man and Cybernetics",

issn = "0884-3627",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Proceedings of the 1994 IEEE International Conference on Systems, Man and Cybernetics. Part 1 (of 3) ; Conference date: 02-10-1994 Through 05-10-1994",

}

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

Y1 - 1994

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 - Conference article

AN - SCOPUS:0028740864

SN - 0884-3627

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

T2 - Proceedings of the 1994 IEEE International Conference on Systems, Man and Cybernetics. Part 1 (of 3)

Y2 - 2 October 1994 through 5 October 1994

ER -

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

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this