On solving quickest time problems in time-dependent, dynamic networks
From MaRDI portal
Publication:1876600
DOI10.1023/B:JMMA.0000026708.57419.6dzbMath1048.90048OpenAlexW2013731263MaRDI QIDQ1876600
Sarah Stock Patterson, Elise D. Miller-Hooks
Publication date: 20 August 2004
Published in: JMMA. Journal of Mathematical Modelling and Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/b:jmma.0000026708.57419.6d
dynamic networkstime-dependentevacuationquickest flowtransshipmentminimum cost network flowdynamic shortest path
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\) ⋮ Efficient contraflow algorithms for quickest evacuation planning ⋮ Models, solutions and enabling technologies in humanitarian logistics ⋮ Minimum parametric flow in time-dependent dynamic networks ⋮ A theoretical and experimental study of a new algorithm for minimum cost flow in dynamic graphs ⋮ Minimum‐cost flow problems having arc‐activation costs ⋮ Unnamed Item ⋮ Updating network flows given multiple, heterogeneous arc attribute changes ⋮ Flows over time in time-varying networks: optimality conditions and strong duality ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Optimising shelter location and evacuation routing operations: the critical issues
