Capacity provisioning for evacuation on path networks

DOI10.1002/net.22118zbMath1529.90012OpenAlexW4288759802MaRDI QIDQ6179704

Unnamed Author, Robert Benkoczi

Publication date: 18 December 2023

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.22118

zbMATH Keywords

facility locationcapacity allocation problemevacuation problemsink location problemminmax criteriondynamic flow in networkcapacity scheduling

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Minimax problems in mathematical programming (90C47) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• An \(O(n \log^2 n)\) algorithm for the optimal sink location problem in dynamic tree networks
• Improved algorithms for computing minmax regret sinks on dynamic path and tree networks
• Multiple sink location problems in dynamic path networks
• Evacuation planning using multiobjective evolutionary optimization approach
• Minsum \(k\)-sink problem on dynamic flow path networks
• Minsum \(k\)-sink problem on path networks
• Improved algorithms for computing \(k\)-sink on dynamic flow path networks
• The Quickest Transshipment Problem
• Integrating simulation modelling and GIS: spatial decision support systems for evacuation planning
• Sink Evacuation on Trees with Dynamic Confluent Flows
• A network flow approach to a city emergency evacuation planning
• Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

This page was built for publication: Capacity provisioning for evacuation on path networks