Abstract
We consider same model of planning the defense of edges of a supply network. The vertices of the network represent the consumers and the providers of a resource, while the edges allow us to transmit the resource without delays and capacity constraints. The Defender commits a bounded budget to protect some of the edges, aiming to minimize the damage that is caused by the destruction of the unprotected edges. To measure the damage, we apply the value of the total resource deficit caused by the worst-case scenario of partial network destruction. The Defender’s problem falls into the family of “Defender–Attacker” problems that are formalized as the minimax mixed-integer programming problems. To find an optimal Defender’s solution, we suggest some two cut generation schemes based on a reformulation of the problem as a mixed-integer problem with exponentially many constraints.
This is a preview of subscription content, log in via an institution to check access.
REFERENCES
M. Grötschel, C. L. Monma, and M. Stoer, “Design of Survivable Networks,” Handb. Oper. Res. Manage. Sci. 7, 617–672 (1995).
D. S. Callaway, M. E. J. Newman, S. H. Strogatz, and D. J. Watts, “Network Robustness and Fragility: Percolation on Random Graphs.,” Phys. Rev. Lett. 85, 5468–5471 (2000).
A. Nagurney and Q. Qiang, “Fragile Networks: Identifying Vulnerabilities and Synergies in an Uncertain World,” Internat. Trans. Oper. Res. 19 (1–2), 123–160 (2009).
G. Brown, M. Carlyle, J. Salmerón, and K. Wood, “Defending Critical Infrastructure,” Interfaces 36 (6), 530–544 (2006).
M. P. Scaparra and R. L. Church, “A Bilevel Mixed-Integer Program for Critical Infrastructure Protection Planning,” Comput. Oper. Res. 35, 1905–1923 (2008).
B. Golden, “A Problem in Network Interdiction,” Naval Res. Logist. Quart.25 (4), 711–713 (1978).
R. K. Wood, “Deterministic Network Interdiction,” Math. Comput. Model.17 (2), 1–18 (1993).
S. Sadeghi, A. Seifi, and E. Azizi, “Trilevel Shortest Path Network Interdiction with Partial Fortification,” Comput. Ind. Eng. 106, 400–411 (2017).
L. Dong, L. Xu-Chen, Y. Xiang-Tao, and W. Fei, “A Model for Allocating Protection Resources in Military Logistics Distribution System Based on Maximal Covering Problem,” in 2010 International Conference on Logistic Systems and Intellectual Management, Harbin, China, January 9–10, 2010 , Vol. 1 (IEEE, Piscataway, New Jersey, 2010), pp. 98–101.
E. V. Alekseeva and Yu. A. Kochetov, “Metaheuristics and Exact Methods for the Discrete \( (r|p)\)–Centroid Problem,” in Metaheuristics for Bi-Level Optimization (Springer, Berlin, 2013), pp. 189–219.
M. C. Roboredo, L. Aizemberg, and A. A. Pessoa, “An Exact Approach for the \(r \)-Interdiction Covering Problem with Fortification,” Cent. European J. Oper. Res. 27, 111–131 (2019).
M. C. Roboredo and A. A. Pessoa, “A Branch-and-Cut Algorithm for the Discrete \((r|p) \)-Centroid Problem,” European J. Oper. Res.224 (1), 101–109 (2013).
Gurobi Optimizer Reference Manual (Gurobi Optimization, 2020). Available at http://www.gurobi.com/documentation/9.0/refman/index.html (accessed May 25, 2020).
Funding
The authors were supported by the Russian Science Foundation (project no. 17–11–01021).
Author information
Authors and Affiliations
Corresponding authors
Additional information
Translated by I.A. Davydov
Rights and permissions
About this article
Cite this article
Beresnev, V.L., Melnikov, A.A. Planning a Defense That Minimizes a Resource Deficit in the Worst-Case Scenario of Supply Network Destruction. J. Appl. Ind. Math. 14, 416–429 (2020). https://doi.org/10.1134/S1990478920030023
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1134/S1990478920030023