• Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Shortest Path Problems in a Stochastic and Dynamic Environment

Shortest Path Problems in a Stochastic and Dynamic Environment

Hardcover

Transportation GeneralGeneral ScienceProbability & Statistics

ISBN10: 1025084047
ISBN13: 9781025084046
Publisher: Hutson Street Press
Published: May 22 2025
Pages: 160
Weight: 0.89
Height: 0.44 Width: 6.14 Depth: 9.21
Language: English

In this research, we consider stochastic and dynamic transportation network problems. Particularly, we develop a variety of algorithms to solve the expected shortest path problem in addition to techniques for computing the total travel time distribution along a path in the network. First, we develop an algorithm for solving an independent expected shortest path problem. Next, we incorporate the inherent dependencies along successive links in two distinct ways to find the expected shortest path. Since the dependent expected shortest path problem cannot be solved with traditional deterministic approaches, we develop a heuristic based on the K-shortest path algorithm for this dependent stochastic network problem. Additionally, transient and asymptotic versions of the problem are considered. An algorithm to compute a parametric total travel time distribution for the shortest path is presented along with stochastically shortest path measures. The work extends the current literature on such problems by considering interactions on adjacent links.

1 different editions

Also available

Also from

Cho, Jae I.

Also in

Probability & Statistics