A network flow approach to a city emergency evacuation planning
From MaRDI portal
Publication:4717403
DOI10.1080/00207729608929296zbMath0863.94040OpenAlexW2057656582MaRDI QIDQ4717403
Publication date: 1 December 1996
Published in: International Journal of Systems Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207729608929296
network flowundirected graphshortest path problemminimal cost flow problemcity emergency evacuation plan
Related Items (17)
Bloch constant and variation of branch points ⋮ Scheduling evacuation operations ⋮ Extremal functions for Boch constants ⋮ Robust flows with losses and improvability in evacuation planning ⋮ A class of numerical algorithm for impact degree assessment of emergency systems ⋮ Modeling emergency response operations: a theory building survey ⋮ A novel method for planning a staged evacuation ⋮ Capacity provisioning for evacuation on path networks ⋮ OR/MS research in disaster operations management ⋮ A stochastic programming approach for Shelter location and evacuation planning ⋮ Optimization and simulation of traffic flows in the case of evacuating urban areas ⋮ Algorithms for time-dependent bicriteria shortest path problems ⋮ Regularized optimization with spatial coupling for robust decision making ⋮ Evacuation network optimization model with Lane-based reversal and routing ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Network redesign for efficient crowd flow and evacuation ⋮ An integrated and dynamic optimisation model for the multi-level emergency logistics network in anti-bioterrorism system
Cites Work
This page was built for publication: A network flow approach to a city emergency evacuation planning
