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

Authors:
A. Kimms;K.-C. Maassen
Affiliations:
Department of Technology and Operations Management, Mercator School of Management, University of Duisburg–Essen, Duisburg Germany;Department of Technology and Operations Management, Mercator School of Management, University of Duisburg–Essen, Duisburg Germany
Venue:
Networks
Year:
2012

Citing 6
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
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
Heuristic shortest path algorithms for transportation applications: state of the art

Computers and Operations Research
A generalization of Dijkstra's shortest path algorithm with applications to VLSI routing

Journal of Discrete Algorithms
Optimization and simulation of traffic flows in the case of evacuating urban areas

OR Spectrum

Cell-transmission-based evacuation planning with rescue teams

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The cell-transmission-model by Daganzo (1994) was introduced as a traffic simulation model. Its basic ideas were picked up recently to formulate optimization models for evacuation planning. These optimization models were capable of generating high quality evacuation plans, but computational effort and computational requirements, especially in dimensions of real-world applications, were very high. To extend adaptability to much larger evacuation scenarios, a fast heuristic procedure will be presented. In a computational study, we will demonstrate the effectiveness of our approach in several real-world scenarios of different road network size, population distribution, and risk distribution, respectively. © 2012 Wiley Periodicals, Inc. NETWORKS, 2012 © 2012 Wiley Periodicals, Inc.