Road network emergency accessibility planning after a major earthquake

Abstract

In the aftermath of disasters such as major earthquakes, several roads may be blocked by rubble and the population tends to search refugee in certain gathering points of the city. Road network accessibility becomes an important issue for logistic operations, specially on the first days after the quake, when the relief distribution is crucial for survival. This study focused on the Road Emergency Rehabilitation Problem, divided into the Road Network Accessibility Problem (RNAP) and the Work-troops Scheduling Problem (WSP). The first one consists in finding traversable paths for relief teams to reach the population, and the later generates a repairing schedule to improve access to refugee areas. The contributions of this study are two-fold: we present the process of transcribing satellite imagery data into graphs, and mathematical formulations for the RNAP and WSP, along with heuristics to solve the WSP. The proposed methods are able to handle large-scale graphs in an acceptable running time for real scenarios. They are tested on simulated instances and on the graph of Port-au-Prince, with more than 10,000 vertices and edges. The Port-au-Prince graph was generated from satellite images obtained by the International Charter “Space and Major Disasters” a few hours after the 2010 earthquake.

Keywords

• 90B06 Transportation, logistics
• 90B10 Network models, deterministic
• 90B90 Case-oriented studies
• 90C11 Mixed integer programming
• 90C90 Applications of mathematical programming