A reliability model applied to emergency service vehicle location
Operations Research
The Data-Correcting Algorithm for the Minimization of Supermodular Functions
Management Science
Reliability Models for Facility Location: The Expected Failure Cost Case
Transportation Science
The Effect of Supply Disruptions on Supply Chain Design Decisions
Transportation Science
The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms
INFORMS Journal on Computing
Reliable facility location design under disruptions
Computers and Operations Research
Process Location and Product Distribution with Uncertain Yields
Operations Research
Facility Location Decisions with Random Disruptions and Imperfect Estimation
Manufacturing & Service Operations Management
Super facilities versus chaining in mitigating disruptions impacts
Computers and Industrial Engineering
International Journal of Computer Applications in Technology
Computers and Industrial Engineering
An Efficient Approach for Solving Reliable Facility Location Models
INFORMS Journal on Computing
Unreliable point facility location problems on networks
Discrete Applied Mathematics
Hi-index | 0.00 |
Reliable facility location models consider unexpected failures with site-dependent probabilities, as well as possible customer reassignment. This paper proposes a compact mixed integer program (MIP) formulation and a continuum approximation (CA) model to study the reliable uncapacitated fixed charge location problem (RUFL), which seeks to minimize initial setup costs and expected transportation costs in normal and failure scenarios. The MIP determines the optimal facility locations as well as the optimal customer assignments and is solved using a custom-designed Lagrangian relaxation (LR) algorithm. The CA model predicts the total system cost without details about facility locations and customer assignments, and it provides a fast heuristic to find near-optimum solutions. Our computational results show that the LR algorithm is efficient for mid-sized RUFL problems and that the CA solutions are close to optimal in most of the test instances. For large-scale problems, the CA method is a good alternative to the LR algorithm that avoids prohibitively long running times.