Expected shortest paths in dynamic and stochastic traffic networks

Research output: Contribution to journalArticle

200 Citations (Scopus)

Abstract

The dynamic and stochastic shortest path problem (DSSPP) is defined as finding the expected shortest path in a traffic network where the link travel times are modeled as a continuous-time stochastic process. The objective of this paper is to examine the properties of the problem and to identify a technique that can be used to solve the DSSPP given information that will be available in networks with Intelligent Transportation System (ITS) capabilities. The paper first identifies a set of relationships between the mean and variance of the travel time of a given path and the mean and variance of the dynamic and stochastic link travel times on these networks. Based on these relationships it is shown that the DSSPP is computationally intractable and traditional shortest path algorithms cannot guarantee an optimal solution. A heuristic algorithm based on the k-shortest path algorithm is subsequently proposed to solve the problem. Lastly, the trade-off between solution quality and computational efficiency of the proposed algorithm is demonstrated on a realistic network from Edmonton, Alberta.

Original languageEnglish (US)
Pages (from-to)499-516
Number of pages18
JournalTransportation Research Part B: Methodological
Volume32
Issue number7
DOIs
StatePublished - Jan 1 1998
Externally publishedYes

Fingerprint

Travel time
traffic
travel
Heuristic algorithms
Computational efficiency
Random processes
transportation system
guarantee
heuristics
Shortest path
efficiency
time

Keywords

  • Dynamic and stochastic network
  • Intelligent Transportation Systems
  • Route Guidance Systems
  • Shortest path problem
  • Traffic network
  • k-shortest path problem

ASJC Scopus subject areas

  • Transportation
  • Management Science and Operations Research

Cite this

Expected shortest paths in dynamic and stochastic traffic networks. / Fu, Liping; Rilett, Laurence R.

In: Transportation Research Part B: Methodological, Vol. 32, No. 7, 01.01.1998, p. 499-516.

Research output: Contribution to journalArticle

@article{d324b549a9d94df7a4e7ae5f15523a06,
title = "Expected shortest paths in dynamic and stochastic traffic networks",
abstract = "The dynamic and stochastic shortest path problem (DSSPP) is defined as finding the expected shortest path in a traffic network where the link travel times are modeled as a continuous-time stochastic process. The objective of this paper is to examine the properties of the problem and to identify a technique that can be used to solve the DSSPP given information that will be available in networks with Intelligent Transportation System (ITS) capabilities. The paper first identifies a set of relationships between the mean and variance of the travel time of a given path and the mean and variance of the dynamic and stochastic link travel times on these networks. Based on these relationships it is shown that the DSSPP is computationally intractable and traditional shortest path algorithms cannot guarantee an optimal solution. A heuristic algorithm based on the k-shortest path algorithm is subsequently proposed to solve the problem. Lastly, the trade-off between solution quality and computational efficiency of the proposed algorithm is demonstrated on a realistic network from Edmonton, Alberta.",
keywords = "Dynamic and stochastic network, Intelligent Transportation Systems, Route Guidance Systems, Shortest path problem, Traffic network, k-shortest path problem",
author = "Liping Fu and Rilett, {Laurence R}",
year = "1998",
month = "1",
day = "1",
doi = "10.1016/S0191-2615(98)00016-2",
language = "English (US)",
volume = "32",
pages = "499--516",
journal = "Transportation Research, Series B: Methodological",
issn = "0191-2615",
publisher = "Elsevier Limited",
number = "7",

}

TY - JOUR

T1 - Expected shortest paths in dynamic and stochastic traffic networks

AU - Fu, Liping

AU - Rilett, Laurence R

PY - 1998/1/1

Y1 - 1998/1/1

N2 - The dynamic and stochastic shortest path problem (DSSPP) is defined as finding the expected shortest path in a traffic network where the link travel times are modeled as a continuous-time stochastic process. The objective of this paper is to examine the properties of the problem and to identify a technique that can be used to solve the DSSPP given information that will be available in networks with Intelligent Transportation System (ITS) capabilities. The paper first identifies a set of relationships between the mean and variance of the travel time of a given path and the mean and variance of the dynamic and stochastic link travel times on these networks. Based on these relationships it is shown that the DSSPP is computationally intractable and traditional shortest path algorithms cannot guarantee an optimal solution. A heuristic algorithm based on the k-shortest path algorithm is subsequently proposed to solve the problem. Lastly, the trade-off between solution quality and computational efficiency of the proposed algorithm is demonstrated on a realistic network from Edmonton, Alberta.

AB - The dynamic and stochastic shortest path problem (DSSPP) is defined as finding the expected shortest path in a traffic network where the link travel times are modeled as a continuous-time stochastic process. The objective of this paper is to examine the properties of the problem and to identify a technique that can be used to solve the DSSPP given information that will be available in networks with Intelligent Transportation System (ITS) capabilities. The paper first identifies a set of relationships between the mean and variance of the travel time of a given path and the mean and variance of the dynamic and stochastic link travel times on these networks. Based on these relationships it is shown that the DSSPP is computationally intractable and traditional shortest path algorithms cannot guarantee an optimal solution. A heuristic algorithm based on the k-shortest path algorithm is subsequently proposed to solve the problem. Lastly, the trade-off between solution quality and computational efficiency of the proposed algorithm is demonstrated on a realistic network from Edmonton, Alberta.

KW - Dynamic and stochastic network

KW - Intelligent Transportation Systems

KW - Route Guidance Systems

KW - Shortest path problem

KW - Traffic network

KW - k-shortest path problem

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

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

U2 - 10.1016/S0191-2615(98)00016-2

DO - 10.1016/S0191-2615(98)00016-2

M3 - Article

VL - 32

SP - 499

EP - 516

JO - Transportation Research, Series B: Methodological

JF - Transportation Research, Series B: Methodological

SN - 0191-2615

IS - 7

ER -