Large‐scale zone‐based evacuation planning—Part I: Models and algorithms
From MaRDI portal
(Redirected from Publication:6087069)
Abstract: In zone-based evacuation planning, the region to evacuate is divided into zones and each zone must be assigned a path to safety and departure times along the path. Zone-based evacuations are highly desirable in practice because they allow emergency services to communicate evacuation orders and to control the evacuation more accurately. Zone-based evacuations may also be combined with contraflows (to maximize the network capacities) and may impose additional constraints on the evacuation path (e,g,. path convergence) and the departure times (e.g., non-preemption). This paper presents a systematic study large-scale zone-based evacuation planning, both from an effectiveness and a computational standpoint. It reviews existing optimization algorithms, and presents new ones, and evaluates them, on a real, large-scale case study, both from a macroscopic standpoint and through microscopic simulations under a variety of assumptions. The results provide some unique perspectives on the strengths and weaknesses of each approach and the implications of evacuation functionalities. The paper also suggests new directions for future research in zone-based evacuation and beyond in order to address the fundamental challenges by emergency services around the world.
Recommendations
- <scp>Large‐scale</scp> zone‐based evacuation planning, Part <scp>II</scp>: Macroscopic and microscopic evaluations
- Evacuation planning by earliest arrival contraflow
- Continuous time dynamic contraflow models and algorithms
- Continuous dynamic contraflow approach for evacuation planning
- Modeling demand management strategies for evacuations
Cites work
- A capacitated network flow optimization approach for short notice evacuation planning
- A column-generation approach for joint mobilization and evacuation planning
- A method to optimize evacuation instructions
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- Aggregate-level demand management in evacuation planning
- Decomposition algorithms for the design of a nonsimultaneous capacitated evacuation tree network
- scientific article; zbMATH DE number 1714716 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- On generating maximal nondominated Benders cuts
- Pattern-based evacuation planning for urban areas
- Shortest Path Problems with Resource Constraints
- The building evacuation problem with shared information
Cited in
(7)- Bilevel traffic evacuation model and algorithm design for large-scale activities
- Efficient algorithms for abstract flow with partial switching
- scientific article; zbMATH DE number 5870351 (Why is no real title available?)
- Pattern-based evacuation planning for urban areas
- <scp>Large‐scale</scp> zone‐based evacuation planning, Part <scp>II</scp>: Macroscopic and microscopic evaluations
- Temporally repeated maximum dynamic flow with intermediate storage
- Optimizing evacuation via budget constrained maximum dynamic flow with speed variation and intermediate storage
This page was built for publication: Large‐scale zone‐based evacuation planning—Part I: Models and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6087069)
