Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs

DOI10.1287/opre.41.1.91zbMath0771.90045OpenAlexW2106074913MaRDI QIDQ5288142

Harilaos N. Psaraftis, John N. Tsitsiklis

Publication date: 9 August 1993

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.41.1.91

zbMATH Keywords

shortest pathacyclic networksindependent Markov process

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15)

Related Items (15)

Linear programming formulation for strategic dynamic traffic assignment ⋮ Adaptive park-and-ride choice on time-dependent stochastic multimodal transportation network ⋮ Routing with delays when storage is costly ⋮ The dynamic shortest path problem with anticipation ⋮ Dynamic vehicle routing: Status and prospects ⋮ Extreme value distributions for two kinds of path sums of Markov chain ⋮ The covering Canadian traveller problem ⋮ Dynamic journeying under uncertainty ⋮ Optimal information location for adaptive routing ⋮ Exact algorithms for the stochastic shortest path problem with a decreasing deadline utility function ⋮ Optimal decisions in stochastic graphs with uncorrelated and correlated edge weights ⋮ Vehicle dispatching with time-dependent travel times ⋮ Path comparisons for a priori and time-adaptive decisions in stochastic, time-varying networks ⋮ An application of Lemke's method to a class of Markov decision problems ⋮ Dynamic shortest path in stochastic dynamic networks: Ship routing problem

This page was built for publication: Dynamic Shortest Paths in Acyclic Networks with Markovian Arc Costs