Skip to main content
U.S. Department of Energy
Office of Scientific and Technical Information

Least expected time paths in stochastic, time-varying transportation networks

Technical Report ·
DOI:https://doi.org/10.2172/350896· OSTI ID:350896
 [1];  [2]
  1. Pennsylvania State Univ., University Park, PA (United States). Dept. of Civil and Environmental Engineering
  2. Univ. of Texas, Austin, TX (United States)
The authors consider stochastic, time-varying transportation networks, where the arc weights (arc travel times) are random variables with probability distribution functions that vary with time. Efficient procedures are widely available for determining least time paths in deterministic networks. In stochastic but time-invariant networks, least expected time paths can be determined by setting each random arc weight to its expected value and solving an equivalent deterministic problem. This paper addresses the problem of determining least expected time paths in stochastic, time-varying networks. Two procedures are presented. The first procedure determines the a priori least expected time paths from all origins to a single destination for each departure time in the peak period. The second procedure determines lower bounds on the expected times of these a priori least expected time paths. This procedure determines an exact solution for the problem where the driver is permitted to react to revealed travel times on traveled links en route, i.e. in a time-adaptive route choice framework. Modifications to each of these procedures for determining least expected cost (where cost is not necessarily travel time) paths and lower bounds on the expected costs of these paths are given. Extensive numerical tests are conducted to illustrate the algorithms` computational performance as well as the properties of the solution.
Research Organization:
Amarillo National Resource Center for Plutonium, TX (United States)
Sponsoring Organization:
USDOE, Washington, DC (United States)
DOE Contract Number:
FC04-95AL85832
OSTI ID:
350896
Report Number(s):
ANRCP--99002640; ON: DE99002640
Country of Publication:
United States
Language:
English

Similar Records

Optimal Routing in Time-Varying, Stochastic Networks: Algorithms and Implementations
Technical Report · Fri Aug 01 00:00:00 EDT 1997 · OSTI ID:1194071

Optimal routing of hazardous substances in time-varying, stochastic transportation networks
Technical Report · Wed Jul 01 00:00:00 EDT 1998 · OSTI ID:663396

Optimal improvement of networks to nuclear safeguards problems: an alternate view
Technical Report · Wed Aug 01 00:00:00 EDT 1979 · OSTI ID:5862078