#### Filter Results:

- Full text PDF available (17)

#### Publication Year

1998

2017

- This year (1)
- Last 5 years (9)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Elise Miller-Hooks, Hani S. Mahmassani
- Transportation Science
- 2000

We 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… (More)

- Hao Tang, Elise Miller-Hooks
- Computers & OR
- 2005

- Elise Miller-Hooks
- Networks
- 2001

In congested transportation and data networks, travel (or transmission) times are time-varying quantities that are at best known a priori with uncertainty. In such stochastic, time-varying (or STV) networks, one can choose to use the a priori least-expected time (LET) path or one can make improved routing decisions en route as traversal times on traveled… (More)

- Elise Miller-Hooks, Hani S. Mahmassani
- European Journal of Operational Research
- 2003

Travel times in congested transportation networks are time-varying quantities that can at best be known a priori probabilistically. In such networks, the arc weights (travel times) are represented by random variables whose probability distribution functions vary with time. These networks are referred to herein as stochastic, time-varying, or STV, networks.… (More)

The selection of routes in a network along which to transport hazardous materials is explored, taking into consideration several key factors pertaining to the length of time of the transport and the risk of population exposure in the event of an incident. That travel time and risk measures are not constant over time and at best can be known with uncertainty… (More)

- Elise Miller-Hooks, Hani S. Mahmassani
- Computers & OR
- 1998

ÐIn this paper, two computationally ecient algorithms are presented for determining the least possible time paths for all origins to a single destination in networks where the arc weights are discrete random variables whose probability distribution functions vary with time. The ®rst algorithm determines the least possible time path from each node for each… (More)

- Lichun Chen, Elise Miller-Hooks
- Transportation Science
- 2012

- Sathaporn Opasanon, Elise Miller-Hooks
- European Journal of Operational Research
- 2006

In a recent paper, Opasanon and Miller-Hooks study multicriteria adaptive paths in stochastic time-varying networks. They propose a label correcting algorithm for finding the full set of efficient strategies. In this note we show that their algorithm is not correct, since it is based on a property that does not hold in general. Opasanon and Miller-Hooks… (More)

Title of Dissertation / Thesis: PERFORMANCE AND ANALYSIS OF SPOT TRUCK-LOAD PROCUREMENT MARKETS USING SEQUENTIAL AUCTIONS Miguel Andres Figliozzi, Ph.D., 2004 Dissertation / Thesis Directed By: Professor Hani Mahmassani, Civil and Environmental Engineering Department Competition in a transportation marketplace is studied under different supply/demand… (More)

- Elise Miller-Hooks, Sarah Stock Patterson
- J. Math. Model. Algorithms
- 2004

In this paper, a pseudopolynomial time algorithm is presented for solving the integral time-dependent quickest flow problem (TDQFP) and its multiple source and sink counterparts: the time-dependent evacuation and quickest transshipment problems. A more widely known, though less general version, is the quickest flow problem (QFP). The QFP has historically… (More)