Heuristic concentration for the p-median: an example demonstrating how and why it works
Computers and Operations Research
Reliability Models for Facility Location: The Expected Failure Cost Case
Transportation Science
Survivable network design under optimal and heuristic interdiction scenarios
Journal of Global Optimization
A bilevel mixed-integer program for critical infrastructure protection planning
Computers and Operations Research
Optimal Allocation of Protective Resources in Shortest-Path Networks
Transportation Science
Optimal Allocation of Protective Resources in Shortest-Path Networks
Transportation Science
Critical infrastructure protection: The vulnerability conundrum
Telematics and Informatics
A bilevel fixed charge location model for facilities under imminent attack
Computers and Operations Research
Vulnerability based robust protection strategy selection in service networks
Computers and Industrial Engineering
The r-interdiction median problem with probabilistic protection and its solution algorithm
Computers and Operations Research
Computers and Industrial Engineering
Protection issues for supply systems involving random attacks
Computers and Operations Research
Hi-index | 0.01 |
We present the Stochastic R-Interdiction Median Problem with Fortification (S-RIMF). This model optimally allocates defensive resources among facilities to minimize the worst-case impact of an intentional disruption. Since the extent of terrorist attacks and malicious actions is uncertain, the problem deals with a random number of possible losses. A max-covering type formulation for the S-RIMF is developed. Since the problem size grows very rapidly with the problem inputs, we propose pre-processing techniques based on the computation of valid lower and upper bounds to expedite the solution of instances of realistic size. We also present heuristic approaches based on heuristic concentration-type rules. The heuristics are able to find an optimal solution for almost all the problem instances considered. Extensive computational testing shows that both the optimal algorithm and the heuristics are very successful at solving the problem. Finally, a discussion of the importance of recognizing the stochastic nature of the number of possible attacks is provided.