|
Author | Disaster phase | Uncertain component | Model formulation | Solution technique |
|
Balcik and Beamon [21] | Preparation and response phase (maximal covering location model) | Demand and location of demand | Mixed-integer linear programming | GAMS/CPLEX |
|
Bozorgi-Amiri et al. [22] | Preparation and response phase (location-allocation model) | Demand and location, cost of procurement and transportation | Mixed-integer nonlinear programming | (Robust optimization) Particle swarm optimization metaheuristic |
|
Chang et al. [16] | Preparation and response phase (location-allocation model) | Demand and location of demand | Mixed-integer programming | Sample average approximation scheme ESRI ArcGIS 9.x to perform spatial data analysis |
|
Rawls and Turnquist [91] | Preparation and response phase (location-allocation model) | Demand and route reliability | Two models (1) Mixed-integer linear program (2) Mixed-integer nonlinear program | Lagrangian L-shaped method heuristic algorithm |
|
Rawls and Turnquist [19] | Preparation and response phase (dynamic allocation model) | Short term demand and demand location | Mixed-integer programming | Computation of the solution with CPLEX |
|
Horner and Downs [23] | Mitigation phase (warehouse location model) | — | Mixed-integer programming | C++ programming, spatial data managed by GIS and TransCAD simulation |
|
Dekle et al. [15] | Mitigation phase (maximal covering location model) | __ | Integer programming | Excel IP solver, ArcVIEW, GIS software simulation |
|
Zhang et al. [24] | Response phase (resource allocation model) | — | Integer programming | Local search heuristic |
|
Barzinpour and Esmaeili [27] | Preparation and response phase (location-allocation model) | — | Mixed-integer linear programming | Goal programming |
|
Rawls and Turnquist [92] | Preparation phase (facility location model) | Demand | Mixed-integer linear program | Lagrangian L-shaped method heuristic algorithm |
|
Jia et al. [29] | Response phase (maximal covering model) | — | Integer programming | Genetic algorithm and Lagrange relaxation heuristic |
|
Murali et al. [28] | Response phase (maximal covering location model) | Demand | Mixed-integer nonlinear programming | Coded simulated annealing heuristic in C++ using Microsoft Visual Studio 5.0 |
|
Lin et al. [20] | Response phase (location-allocation model) | — | Mixed-integer programming | Two-phase heuristic approach |
|
Tricoire et al. [93] | Recovery phase (maximal covering location model) | Demand | Mixed-integer nonlinear programming | Epsilon-constraint algorithm |
|
Yushimito et al. [94] | Preparation phase (facility location model) | — | Mixed-integer nonlinear programming | Voronoi-based heuristic algorithm |
|
Abounacer et al. [26] | Response phase (location-transportation model) | — | Mixed-integer programming | Exact algorithm |
|