Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A network flow approach to a city emergency evacuation planning

A network flow approach to a city emergency evacuation planning Two network flow methods are presented in this paper to optimize a city emergency evacuation plan. The problem is to assign each resident of the city to one of the places of refuge (PR) in preparation for major disasters. We model the city as an undirected graph, and by solving a shortest path problem on this graph, we obtain the shortest evacuation plan. The second model takes the capacity limit on each PR explicitly into account. The problem can then be transformed into a minimal cost flow problem on a slightly modified graph. We can evaluate the efficiency of the current city evacuation plan by comparing this against the optimal solutions of the above stated problems. Also, various pieces of information obtainable from these solutions can be utilized in evaluating the current evacuation policy. In addition, sensitivity analysis can be performed to answer various what-if questions http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Systems Science Taylor & Francis

A network flow approach to a city emergency evacuation planning

International Journal of Systems Science , Volume 27 (10): 6 – Oct 1, 1996

A network flow approach to a city emergency evacuation planning

International Journal of Systems Science , Volume 27 (10): 6 – Oct 1, 1996

Abstract

Two network flow methods are presented in this paper to optimize a city emergency evacuation plan. The problem is to assign each resident of the city to one of the places of refuge (PR) in preparation for major disasters. We model the city as an undirected graph, and by solving a shortest path problem on this graph, we obtain the shortest evacuation plan. The second model takes the capacity limit on each PR explicitly into account. The problem can then be transformed into a minimal cost flow problem on a slightly modified graph. We can evaluate the efficiency of the current city evacuation plan by comparing this against the optimal solutions of the above stated problems. Also, various pieces of information obtainable from these solutions can be utilized in evaluating the current evacuation policy. In addition, sensitivity analysis can be performed to answer various what-if questions

Loading next page...
 
/lp/taylor-francis/a-network-flow-approach-to-a-city-emergency-evacuation-planning-S0v09Q2RQI

References (6)

Publisher
Taylor & Francis
Copyright
Copyright Taylor & Francis Group, LLC
ISSN
1464-5319
eISSN
0020-7721
DOI
10.1080/00207729608929296
Publisher site
See Article on Publisher Site

Abstract

Two network flow methods are presented in this paper to optimize a city emergency evacuation plan. The problem is to assign each resident of the city to one of the places of refuge (PR) in preparation for major disasters. We model the city as an undirected graph, and by solving a shortest path problem on this graph, we obtain the shortest evacuation plan. The second model takes the capacity limit on each PR explicitly into account. The problem can then be transformed into a minimal cost flow problem on a slightly modified graph. We can evaluate the efficiency of the current city evacuation plan by comparing this against the optimal solutions of the above stated problems. Also, various pieces of information obtainable from these solutions can be utilized in evaluating the current evacuation policy. In addition, sensitivity analysis can be performed to answer various what-if questions

Journal

International Journal of Systems ScienceTaylor & Francis

Published: Oct 1, 1996

There are no references for this article.