Transportation Science 34, 198215.
MillerHooks, E. and H. Mahmassani (2000)
We consider stochastic, timevarying 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 timeinvariant 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, timevarying 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 timeadaptive 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.

Elise MillerHooks, Ph.D.
Professor
Bill & Eleanor Hazel Chair in Infrastructure Engineering
Phone: 703.993.1685
Email: miller@gmu.edu
Office: 4614 Nguyen Engineering Building
Address:
Sid and Reva Dewberry Department of Civil, Environmental and Infrastructure Engineering
George Mason University
4400 University Drive, MS 6C1
Fairfax, VA 22030
USA
More Publications
