Integer and combinatorial optimization
Integer and combinatorial optimization
The Lagrangian Relaxation Method for Solving Integer Programming Problems
Management Science
Reliability Models for Facility Location: The Expected Failure Cost Case
Transportation Science
A bilevel mixed-integer program for critical infrastructure protection planning
Computers and Operations Research
The Effect of Supply Disruptions on Supply Chain Design Decisions
Transportation Science
Reliable Facility Location Design Under the Risk of Disruptions
Operations Research
Hi-index | 0.01 |
Distribution networks have been facing an increased exposure to risk of unpredicted disruptions causing significant economic forfeitures. At the same time, the existing literature features very few studies which examine the impact of facility fortification for improving network reliability. In this paper, we present two related models for design of reliable distribution networks: a reliable P-median problem (RPMP) and a reliable uncapacitated fixed-charge location problem (RUFL). Both models consider heterogenous facility failure probabilities, one layer of supplier backup, and facility fortification within a finite budget. Both RPMP and RUFL are formulated as nonlinear integer programming models and proved to be NP-hard. We develop Lagrangian relaxation-based (LR) solution algorithms and demonstrate their computational efficiency. We compare the effectiveness of the LR-based solutions to that of the solutions obtained by a myopic policy which aims to fortify most reliable facilities regardless of the demand topology. Finally, we discuss an alternative way to assess the effectiveness of the design solutions by using the rate of return on fortification investment.