Evacuation Planning Optimization Based on a Multi-Objective Artificial Bee Colony Algorithm

Abstract

Evacuation is an important activity for reducing the number of casualties and amount of damage in disaster management. Evacuation planning is tackled as a spatial optimization problem. The decision-making process for evacuation involves high uncertainty, conflicting objectives, and spatial constraints. This study presents a Multi-Objective Artificial Bee Colony (MOABC) algorithm, modified to provide a better solution to the evacuation problem. The new approach combines random swap and random insertion methods for neighborhood search, the two-point crossover operator, and the Pareto-based method. For evacuation planning, two objective functions were considered to minimize the total traveling distance from an affected area to shelters and to minimize the overload capacity of shelters. The developed model was tested on real data from the city of Kigali, Rwanda. From computational results, the proposed model obtained a minimum fitness value of 5.80 for capacity function and 8.72 × 108 for distance function, within 161 s of execution time. Additionally, in this research we compare the proposed algorithm with Non-Dominated Sorting Genetic Algorithm II and the existing Multi-Objective Artificial Bee Colony algorithm. The experimental results show that the proposed MOABC outperforms the current methods both in terms of computational time and better solutions with minimum fitness values. Therefore, developing MOABC is recommended for applications such as evacuation planning, where a fast-running and efficient model is needed.