Adaptive least-expected time paths in stochastic, time-varying transportation and data networks

DOI<35::AID-NET4>3.0.CO;2-G 10.1002/1097-0037(200101)37:1<35::AID-NET4>3.0.CO;2-GzbMath0997.90038OpenAlexW2092499098MaRDI QIDQ2709888

Elise D. Miller-Hooks

Publication date: 18 November 2002

Full work available at URL: https://doi.org/10.1002/1097-0037(200101)37:1<35::aid-net4>3.0.co;2-g

zbMATH Keywords

shortest pathsintelligent transportation systemsnetwork algorithmsoptimal routingdata networksdynamic stochastic networks

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Stochastic scheduling theory in operations research (90B36)

Related Items (15)

Meeting a deadline: shortest paths on stochastic directed acyclic graphs with information gathering ⋮ Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network ⋮ User equilibrium with recourse ⋮ Finding the most reliable strategy on stochastic and time-dependent transportation networks: a hypergraph based formulation ⋮ Multicriteria stochastic shortest path problem for electric vehicles ⋮ The constrained shortest path problem with stochastic correlated link travel times ⋮ Exact bidirectional algorithm for the least expected travel-time path problem on stochastic and time-dependent networks ⋮ Optimal information location for adaptive routing ⋮ Finding the \(K\) shortest hyperpaths ⋮ Multicriteria adaptive paths in stochastic, time-varying networks ⋮ Ranking paths in stochastic time-dependent networks ⋮ Optimizing route for hazardous materials logistics based on hybrid ant colony algorithm ⋮ Risk-Averse Shortest Path Interdiction ⋮ UTILIZING DISTRIBUTED LEARNING AUTOMATA TO SOLVE STOCHASTIC SHORTEST PATH PROBLEMS ⋮ Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks

This page was built for publication: Adaptive least-expected time paths in stochastic, time-varying transportation and data networks