Optimal egress time calculation and path generation for large evacuation networks

DOI10.1007/s10479-012-1225-zzbMath1260.90044OpenAlexW2040746933MaRDI QIDQ1945097

Mukesh Rungta, M. Reza Baharnemati, Gino J. Lim

Publication date: 2 April 2013

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-012-1225-z

zbMATH Keywords

evacuation planningdynamic network flow problemminimum cost flowsshort notice evacuation

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (3)

An optimization approach for real time evacuation reroute planning ⋮ An integrated emergency response model for toxic gas release accidents based on cellular automata ⋮ Optimal egress time calculation and path generation for large evacuation networks

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A survey of dynamic network flows
• A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique
• A capacitated network flow optimization approach for short notice evacuation planning
• Optimal egress time calculation and path generation for large evacuation networks
• The Quickest Transshipment Problem

This page was built for publication: Optimal egress time calculation and path generation for large evacuation networks