A humanitarian logistics model for disaster relief operation considering network failure and standard relief time: A case study on San Francisco district

• We propose a multi-depot LRP model considering road closure and unsatisfied demand.
• The model includes multiple use of vehicles and standard relief time constraints.
• We extend the LRP model to a two-stage stochastic program with multiple scenarios.
• A variable neighborhood search algorithm is devised to solve large instances.
• Standard relief time and network failure lead to employ extra depots and vehicles.

We propose a multi-depot location-routing model considering network failure, multiple uses of vehicles, and standard relief time. The model determines the locations of local depots and routing for last mile distribution after an earthquake. The model is extended to a two-stage stochastic program with random travel time to ascertain the locations of distribution centers. Small instances have been solved to optimality in GAMS. A variable neighborhood search algorithm is devised to solve the deterministic model. Computational results of our case study show that the unsatisfied demands can be significantly reduced at the cost of higher number of local depots and vehicles.