Mathematical Model and Heuristic Algorithm for Simultaneous Evacuation and Entrance Planning

Abstract

Numerous emergency situations, such as the terrorist attacks in France in 2015 and Belgium in 2016, have transpired throughout the world. Accordingly, research on evacuation plans for people experiencing terrorism, fire, and natural disaster has gained significant attention. However, previous researchers have primarily focused on evacuation planning. For responders, such as special weapons and tactics teams or firefighters, entrance planning is considered as important as evacuation planning for effective amelioration of dangerous situations. Therefore, this paper presents mathematical models that address the simultaneous evacuation of victims and entrance of responders. By developing the model based on the dynamic network flow model, the solution provides the optimal routes for evacuees and responders within a critical timeframe. However, the mathematical model has two weaknesses: difficulty solution interpretation and lengthy computation time. To overcome these problems, a heuristic algorithm based on the capacity constrained route planner is also developed. This study pioneers mathematical models and a heuristic algorithm that account for both evacuation and response plans.