Article ID: | iaor20119352 |
Volume: | 216 |
Issue: | 1 |
Start Page Number: | 57 |
End Page Number: | 69 |
Publication Date: | Jan 2012 |
Journal: | European Journal of Operational Research |
Authors: | Kimms A, Bretschneider S |
Keywords: | networks: flow, programming: dynamic, programming: integer |
The population of an urban area may be in danger due to disasters like floods, hurricanes, chemical or nuclear accidents. This requires decisions to protect the affected population. One decision may be to evacuate the affected area. For the exceptional case of an evacuation an approach to reorganize the traffic routing of the endangered area is developed. In this paper a two‐stage heuristic solution approach for a pattern‐based mixed integer dynamic network flow model is presented. The model restructures the traffic routing such that the evacuees leave the evacuation area as safe as possible and as early as possible within the considered time horizon.