Optimal Routing in Time-Varying, Stochastic Networks: Algorithms and Implementations

Technical Report · Fri Aug 01 04:00:00 EDT 1997

OSTI ID:1194071

Miller-Hooks, Elise Deborah ^[1]

---

1. Univ. of Texas, Austin, TX (United States)

Travel time between an origin and destination is often the primary criterion in optimally routing vehicles such as ambulances, police cars, and vehicles carrying hazardous substances. Travel times in congested transportation networks are inherently time-varying and stochastic in nature. In order to optimally route vehicles, both the randomness and time-varying nature of the travel times must be considered. A consequence of recognizing the uncertainty in the travel times is that there may be, for wwwwwwany origin-destination pair, more than one path which have some positive probability of being shortest. Such paths are called Pareto-optimal. This dissertation addresses the problem of determining "superior" paths in networks where the arc weights are random variables whose probability distribution functions vary with time. Two basic approaches are taken for solving this problem, (1) generate all Pareto-optimal paths, and (2) efficiently determine "superior" paths for more specific characterizations of the problem.

• Research Organization: Univ. of Texas, Austin, TX (United States)
• Sponsoring Organization: USDOE
• Contributing Organization: Amarillo National Resource Center for Plutonium
• DOE Contract Number: FC04-95AL85832
• OSTI ID: 1194071
• Report Number(s): ANRCP--99002556
• Country of Publication: United States
• Language: English

Related Subjects

97 MATHEMATICS AND COMPUTING