Analysis of facility protection strategies against an uncertain number of attacks: The stochastic R-interdiction median problem with fortification
Analysis of facility protection strategies against an uncertain number of attacks: The stochastic R-interdiction median problem with fortification
复制标题
DOI：
10.1016/j.cor.2010.06.002
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
F. Liberatore;M. P. Scaparra;Mark S. Daskin
中科院分区：
文献类型：
--
作者：
F. Liberatore;M. P. Scaparra;Mark S. Daskin
提出了随机设防r -阻断中值问题（S-RIMF）。该模型在设施之间最佳地分配防御资源，以尽量减少故意破坏的最坏影响。由于恐怖袭击和恶意行为的程度是不确定的，因此该问题处理的是随机数量的可能损失。开发了S-RIMF的最大覆盖型配方。由于问题规模随着问题输入的增加而迅速增长，我们提出了基于有效下界和上界计算的预处理技术，以加快求解实际规模的实例。我们还提出了基于启发式集中型规则的启发式方法。启发式算法能够为几乎所有考虑的问题实例找到最优解。大量的计算测试表明，最优算法和启发式算法都能很好地解决问题。最后，讨论了认识到可能的攻击数量的随机性的重要性。
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.