The r-interdiction median problem with probabilistic protection and its solution algorithm

Authors:
Yueni Zhu;Zheng Zheng;Xiaoyi Zhang;Kaiyuan Cai
Affiliations:
School of Automation Science and Electrical Engineering, Beihang University, Beijing 100191, China;School of Automation Science and Electrical Engineering, Beihang University, Beijing 100191, China and Science and Technology on Aircraft Control Laboratory, Beihang University, Beijing 100191, Ch ...;School of Automation Science and Electrical Engineering, Beihang University, Beijing 100191, China;School of Automation Science and Electrical Engineering, Beihang University, Beijing 100191, China
Venue:
Computers and Operations Research
Year:
2013

Citing 6
Cited 1

Stochastic Network Interdiction

Operations Research
Bi-Level Optimisation Using Genetic Algorithm

ICAIS '02 Proceedings of the 2002 IEEE International Conference on Artificial Intelligence Systems (ICAIS'02)
Practical Bilevel Optimization: Algorithms and Applications (Nonconvex Optimization and Its Applications)

Practical Bilevel Optimization: Algorithms and Applications (Nonconvex Optimization and Its Applications)
A bilevel mixed-integer program for critical infrastructure protection planning

Computers and Operations Research
Analysis of facility protection strategies against an uncertain number of attacks: The stochastic R-interdiction median problem with fortification

Computers and Operations Research
Deterministic network interdiction

Mathematical and Computer Modelling: An International Journal

Protection issues for supply systems involving random attacks

Computers and Operations Research

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper discusses the critical infrastructure protection problem in supply systems regarding potential intentional attacks. Considering that the protection of a facility cannot be always successful, we present the r-interdiction median problem with probabilistic protection. Defensive resources are allocated according to the degree of importance of service facilities. Computational experiments demonstrate the benefits brought by centralizing resources to a few critical sites, as well as the importance of introducing probabilistic factors. Furthermore, we discuss the problem in a scenario of multiple interdictors. It is found that the worst-case interdictions made by multiple interdictors may cause much more serious system impairment than a single interdictor. Such losses can sometimes be effectively alleviated by adjustment of fortification plans. To solve the problem, we propose an iterated greedy search method which produces good approximations to optimal fortification strategies rather fast, even for instances of considerable size.