Stochastic Network Interdiction
Operations Research
Defending Critical Infrastructure
Interfaces
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
Critical infrastructure protection: The vulnerability conundrum
Telematics and Informatics
A bilevel fixed charge location model for facilities under imminent attack
Computers and Operations Research
Deterministic network interdiction
Mathematical and Computer Modelling: An International Journal
The r-interdiction median problem with probabilistic protection and its solution algorithm
Computers and Operations Research
A Bilevel p-median model for the planning and protection of critical facilities
Journal of Heuristics
| Hi-index | 0.01 |
This paper focuses on the protection issues for supply systems involving random attacks, which are described as attacks whose targets cannot be predicted. We present the random-attack median fortification problem (RAMF) to identify the fortification strategy that minimizes the expected operation cost after random attacks. RAMF is formulated as an integer-linear program and solved directly using general-purpose MIP solver. Moreover, a more complex problem, the fortification median problem for disruptions caused by mixed types of attacks (FMMA), is introduced to find a balance between defending the worst-case attacks and random attacks. Solving FMMA can achieve good protection results, which are more practical in dealing with systems with mixed types of attacks, if the proportion between the types is properly estimated. We formulate FMMA as a non-linear bilevel program and extend a typical implicit enumeration (IE) algorithm to solve the problem. Finally, computational experiments demonstrate the effectiveness of both RAMF and FMMA in dealing with protective affairs involving random attacks. The efficiency of solving the formulations of RAMF and FMMA is also testified.