A capacitated network flow optimization approach for short notice evacuation planning

DOI10.1016/j.ejor.2012.06.004zbMath1253.90149OpenAlexW2094826018MaRDI QIDQ1927009

Tiravat Assavapokee, M. Reza Baharnemati, Gino J. Lim, Shabnam Zangeneh

Publication date: 29 December 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.2012.06.004

zbMATH Keywords

shortest pathevacuation planningtime-expanded networkcapacitated network flow problem

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Deterministic network models in operations research (90B10) Case-oriented studies in operations research (90B90)

Related Items (16)

An optimization approach for real time evacuation reroute planning ⋮ Models, solutions and enabling technologies in humanitarian logistics ⋮ 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 ⋮ 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 ⋮ Emergency evacuation of hazardous chemical accidents based on diffusion simulation ⋮ Emergency evacuation problem for a multi-source and multi-destination transportation network: mathematical model and case study ⋮ Optimal egress time calculation and path generation for large evacuation networks ⋮ Simultaneous evacuation and entrance planning in complex building based on dynamic network flows ⋮ A conflict-congestion model for pedestrian-vehicle mixed evacuation based on discrete particle swarm optimization algorithm ⋮ Evacuation network optimization model with Lane-based reversal and routing ⋮ A survey on models and algorithms for discrete evacuation planning network problems ⋮ Asymmetric flow networks ⋮ Optimising shelter location and evacuation routing operations: the critical issues

Cites Work

• A note on two problems in connexion with graphs
• The Quickest Transshipment Problem
• The dynamic transshipment problem
• Constructing Maximal Dynamic Flows from Static Flows
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A capacitated network flow optimization approach for short notice evacuation planning