Pattern-based evacuation planning for urban areas
From MaRDI portal
Publication:421705
DOI10.1016/j.ejor.2011.07.015zbMath1237.90036MaRDI QIDQ421705
Sarah Bretschneider, Alf Kimms
Publication date: 14 May 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2011.07.015
90B06: Transportation, logistics and supply chain management
90C59: Approximation methods and heuristics in mathematical programming
90B99: Operations research and management science
Related Items
Large‐scale zone‐based evacuation planning—Part I: Models and algorithms, A joint demand and supply management approach to large scale urban evacuation planning: evacuate or shelter-in-place, staging and dynamic resource allocation, Elementary modelling and behavioural analysis for emergency evacuations using social media, A multi-period shelter location-allocation model with evacuation orders for flood disasters, A column-generation approach for joint mobilization and evacuation planning, Disaster preparedness in Humanitarian logistics: a collaborative approach for resource management in floods, An integrated emergency response model for toxic gas release accidents based on cellular automata, Bi-objective safe and resilient urban evacuation planning, The stochastic queue core problem, evacuation networks, and state-dependent queues, A conflict-congestion model for pedestrian-vehicle mixed evacuation based on discrete particle swarm optimization algorithm, Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\), A survey on models and algorithms for discrete evacuation planning network problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization and simulation of traffic flows in the case of evacuating urban areas
- A survey of dynamic network flows
- Complexity analysis for maximum flow problems with arc reversals
- Multi-objective evacuation routing in transportation networks
- Transient flows in networks
- A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem
- An Introduction to Network Flows over Time
- Note—Some Equivalent Objectives for Dynamic Network Flow Problems
- Constructing Maximal Dynamic Flows from Static Flows