Heuristics Based Optimization for Multidepot Drone Location and Routing Problem to Detect Post-Earthquake Damages

Abstract

The aim of this research is to detect the post-disaster damage by drones as soon as possible so that decision makers can assign search and rescue teams effectively and efficiently. The main differences of this research from the others, which use drones in literature, are as: First, the regions are divided into grids and different importance values are assigned according to the number of buildings that are likely to be damaged and are vital for the response stage, such as hospitals, schools, and fire stations. Second, these importance levels are updated based on the day and time, which helps ordering the grids in a more realistic manner. Third, the depots are selected among the pre-determined candidate locations in accordance with the purpose of objective function. Fourth, detection times at grids are considered as uncertain. Fifth, two versions of Ant Colony Optimization (ACO) are developed as alternatives to exact solution tools. Last, sensitivity analyzes are performed by reducing the number of sorties, reducing the number of drones, and comparing day and night importance values for each instance. According to the results, only for very small-scale instances, exact solution tool was able to reach the optimal while both versions of ACO reached to similar results within a very less CPU times. Additionally, these ACO algorithms also found good results for the larger scaled problems. Then the performance of these ACO algorithms and the exact solution method are compared based on the CPU time and solution quality.