A maximal multiple coverage and network restoration problem for disaster recovery

The recovery of physically damaged infrastructure after disasters is critical to efficiently deliver disaster relief supplies and emergency services. The physical damage to road infrastructure from disasters can result in decreased road link capacities and an inability to meet the community's emergency demand. This paper provides an infrastructure restoration plan for delivering critical services after disasters. We present a maximal multiple coverage and network recovery problem for the recovery and restoration of infrastructure systems after disasters. In the model, recovery crews make damaged arcs available by repairing components over a time horizon in a disrupted network. The model relocates emergency responders using the available arcs in the network to maximize multiple coverage of emergency service demand over the time horizon. We present two heuristics for the model. The first uses the Lagrangian and the linear programming relaxation solutions of the problem, and the second uses an integer rounding procedure applied to the linear programming relaxation solution. We test the model using a real-world example representing the road infrastructure and emergency services of the Bronx Borough in New York, NY during Hurricane Sandy. The results demonstrate that the integer rounding heuristic is effective in identifying near-optimal solutions. Our computational study suggests that our model can aid emergency managers in achieving their goals by scheduling effective restoration activities for real-time disaster recovery and long-term recovery planning.