Cell-transmission-based evacuation planning with rescue teams

Authors:
Alf Kimms;Klaus-Christian Maassen
Affiliations:
Mercator School of Management, University of Duisburg---Essen, Duisburg, Germany 47048;Mercator School of Management, University of Duisburg---Essen, Duisburg, Germany 47048
Venue:
Journal of Heuristics
Year:
2012

Citing 6
Cited 0

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A Linear Programming Model for the Single Destination System Optimum Dynamic Traffic Assignment Problem

Transportation Science
Global Optimization of Emergency Evacuation Assignments

Interfaces
Contraflow Transportation Network Reconfiguration for Evacuation Route Planning

IEEE Transactions on Knowledge and Data Engineering
Optimization and simulation of traffic flows in the case of evacuating urban areas

OR Spectrum
A fast heuristic approach for large-scale cell-transmission-based evacuation route planning

Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The basic ideas of the Cell-Transmission-Model (CTM) by Daganzo (Transp. Res., Part B 28, 269---287, 1994) were used in numerous publications dealing with evacuation planning in urban areas. However, none of them consider the assignment of rescue teams which will be needed in case of fire fighting, bomb disposal or evacuating public buildings like hospitals. In such scenarios, traffic capacities are limited and have to be used as efficiently as possible to reduce danger for the population. Rescue teams usually have to enter the network in opposite driving direction to evacuating vehicles so that difficulties in traffic routing are unavoidable. In this paper, we will introduce an extension for the CTM-based Evacuation Planning Model by Kimms and Maassen (2012) which allows to integrate rescue team (contra-)flow into evacuation planning simultaneously. We formulate our approach in such a way that it should be applicable in most real-world cases. We also present a three-staged heuristic procedure which was able to solve real world cases with up to 8750 vehicles within reasonable time.