Article ID: | iaor20114990 |
Volume: | 45 |
Issue: | 6 |
Start Page Number: | 523 |
End Page Number: | 539 |
Publication Date: | Jul 2011 |
Journal: | Transportation Research Part A |
Authors: | Kimms A, Bretschneider S |
Keywords: | programming: integer, networks: flow |
Real life situations like floods, hurricanes or chemical accidents may cause the evacuation of a certain area to rescue the affected population. To enable a fast and a safe evacuation a basic mixed‐integer evacuation model has been developed that provides a reorganization of the traffic routing of a certain area for the case of an evacuation. This basic problem of evacuation minimizes the evacuation‐time while prohibiting conflicts within intersections. Our evacuation model is a dynamic network flow problem with additional variables for the number and direction of used lanes and with additional complicating constraints. Because of the size of the time‐expanded network, the computational effort required by standard software is already very high for tiny instances. To deal with realistic instances we propose a heuristic approach.