Procedia Engineering · 2010 · 31 citations · 14 references
Natural SciencesEmergency PlanningEmergency ManagementEvacuation PlanningOptimizationEvacuation ProceduresNetwork Flow AlgorithmsNetwork FlowsShortest Path AlgorithmsCellular Automata Evacuation ModelsCellular Automaton ModelingEmergency EvacuationEmergency Evacuation ModelingEvacuation ModelingNetwork Flow FormulationsNetwork Flow ModelsShortest Path Problems
We apply network flow techniques to find good exit selections for evacuees in an emergency evacuation. More precisely, we present two algorithms for computing exit distributions using both classical flows and flows over time which are well known from combinatorial optimization. The performance of these new proposals is compared to a simple shortest path approach and to a best response dynamics approach by using a cellular automaton model.
14
A note on two problems in connexion with graphs
E. Dijkstra · Numerische Mathematik · 1959 · 23.8K citations
Network Flows: Theory, Algorithms, and Applications.
David K. Smith, Ravindra K. Ahuja, Thomas L. Magnanti et al. · Journal of the Operational Research Society · 1994 · 8.2K citations · Full text
Network flows: Theory, algorithms and applications
Discrete Applied Mathematics · 1994 · 2.6K citations
Maximal Flow Through a Network
L. R. Ford, D. R. Fulkerson · Canadian Journal of Mathematics · 1956 · 2.3K citations · Full text