Abstract
Infrastructures such as power stations, water systems, railways, highways, subway stations, and roads play an important role in ensuring that the network operates safely and effectively. In this study, we aim to develop a fortification plan to protect the nodes and links from destructive attacks. However, there is often a degree of uncertainty concerning the exact location or degree of the attack. To address this problem, we suggest a trilevel robust shortesth path problem based on the defender–attacker–defender model. In this model, the primary defender provides protection plan against attacks, while the attacker identifies weaknesses and attacks non-fortified components. Lastly, the inner defender determines the shortest path between the source and sink of the interdicted network. To solve the problem efficiently, we resort to a column-and-constraint generation algorithm. Several benchmark examples from the literature are used to demonstrate the effectiveness of our model. Despite the inherent complexity of the problem, we demonstrate that using careful analysis of worst-case attack scenarios, we can develop a successful fortification plan within a reasonable computational time.
Similar content being viewed by others
References
Altner, D. S., Ergun, Ö., & Uhan, N. A. (2010). The maximum flow network interdiction problem: Valid inequalities, integrality gaps, and approximability. Operations Research Letters, 38(1), 33–38.
Ansari, M., Borrero, J. S., & Lozano, L. (2023). Robust minimum-cost flow problems under multiple ripple effect disruptions. INFORMS Journal on Computing, 35(1), 83–103.
Azaiez, M. N. (2009). A Bayesian model for a game of information in optimal attack/defense strategies. Game Theoretic Risk Analysis of Security Threats, 99–123.
Bayrak, H., & Matthew, D. B. (2008). Shortest path network interdiction with asymmetric information. Networks: An International Journal, 52(3), 133–140.
Beck, Y., Bienstock, D., Schmidt, M., & Thürauf, J. (2023a). On a computationally ill-behaved bilevel problem with a continuous and nonconvex lower level. Journal of Optimization Theory and Applications, 1–20.
Beck, Y., Ljubić, I., & Schmidt, M. (2023b). A survey on bilevel optimization under uncertainty. European Journal of Operational Research.
Bertsimas, D., & Sim, M. (2004). The price of robustness. Operations Research, 52(1), 35–53.
Bier, V., & Gutfraind, A. (2019). Risk analysis beyond vulnerability and resilience-characterizing the defensibility of critical systems. European Journal of Operational Research, 276(2), 626–636.
Bier, V. M., & Hausken, K. (2013). Defending and attacking a network of two arcs subject to traffic congestion. Reliability Engineering and System Safety, 112, 214–224.
Borrero, J. S., Prokopyev, O. A., & Sauré, D. (2016). Sequential shortest path interdiction with incomplete information. Decision Analysis, 13(1), 68–98.
Borrero, J. S., Prokopyev, O. A., & Sauré, D. (2019). Sequential interdiction with incomplete information and learning. Operations Research, 67(1), 72–89.
Brown, G. G., Carlyle, W. M., Salmeron, J., & Wood, K. (2005). Analyzing the vulnerability of critical infrastructure to attack and planning defenses. Emerging Theory, Methods, and Applications, 102–123.
Brown, G., Carlyle, M., Salmerón, J., & Wood, K. (2006). Defending critical infrastructure. Interfaces, 36(6), 530–544.
Cappanera, P., & Scaparra, M. P. (2011). Optimal allocation of protective resources in shortest-path networks. Transportation Science, 45(1), 64–80.
Chopra, S. S., & Khanna, V. (2015). Interconnectedness and interdependencies of critical infrastructures in the us economy: Implications for resilience. Physica A: Statistical Mechanics and its Applications, 436, 865–877.
Church, R. L., & Scaparra, M. P. (2007). Protecting critical assets: The r-interdiction median problem with fortification. Geographical Analysis, 39(2), 129–146.
Church, R. L., Scaparra, M. P., & Middleton, R. S. (2004). Identifying critical infrastructure: The median and covering facility interdiction problems. Annals of the Association of American Geographers, 94(3), 491–502.
Delforge, D., Below, R., Jones, R., & Speybroek. N. (2021). Cred crunch 66—disasters year in review 2021. Centre for Research on the Epidemiology of Disasters.
Di Nguyen, H., & Smith, J. C. (2022). Network interdiction with asymmetric cost uncertainty. European Journal of Operational Research, 297(1), 239–251.
Döyen, A., Aras, N., & Barbarosoğlu, G. (2012). A two-echelon stochastic facility location model for humanitarian relief logistics. Optimization Letters, 6, 1123–1145.
Fulkerson, D. R., & Harding, G. C. (1977). Maximizing the minimum source-sink path subject to a budget constraint. Mathematical Programming, 13(1), 116–118.
Ghorbani-Renani, N., González, A. D., Barker, K., & Morshedlou, N. (2020). Protection–interdiction–restoration: Tri-level optimization for enhancing interdependent network resilience. Reliability Engineering and System Safety, 199, 106907.
Hausken, K., & Levitin, G. (2012). Review of systems defense and attack models. International Journal of Performability Engineering, 8(4).
Hausken, K., Bier, V. M., & Zhuang, J. (2008). Defending against terrorism, natural disaster, and all hazards. In Game theoretic risk analysis of security threats (pp. 65–97). Springer.
Hausken, K. (2017). Defense and attack for interdependent systems. European Journal of Operational Research, 256(2), 582–591.
Hausken, K. (2019). Defence and attack of complex interdependent systems. Journal of the Operational Research Society, 70(3), 364–376.
Hausken, K., & He, F. (2016). On the effectiveness of security countermeasures for critical infrastructures. Risk Analysis, 36(4), 711–726.
Huang, D., Mao, Z., Fang, K., & Chen, L. (2021). Solving the shortest path interdiction problem via reinforcement learning. International Journal of Production Research, 1–18.
Insurance Bureau of Canada. (2022). Insured losses from 2021 floods in bc now \$675 million. Retrieved June 15, 2022, from http://www.ibc.ca/bc/resources/media-centre/media-releases/insured-losses-from-2021-floods-in-bc-now-675-million/.
Israeli, E., & Wood, R. K. (2002). Shortest-path network interdiction. Networks: An International Journal, 40(2), 97–111.
Keçici, S., Aras, N., & Verter, V. (2012). Incorporating the threat of terrorist attacks in the design of public service facility networks. Optimization Letters, 6, 1101–1121.
Kennedy, K. T., Deckro, R. F., Moore, J. T., & Hopkinson, K. M. (2011). Nodal interdiction. Mathematical and Computer Modelling, 54(11–12), 3116–3125.
Koks, E. E., Rozenberg, J., Zorn, C., Tariverdi, M., Michalis Vousdoukas, S. A., Fraser, J. W. H., & Hallegatte, S. (2019). A global multi-hazard risk analysis of road and railway infrastructure assets. Nature Communications, 10(1), 1–11.
Lappas, N. H., & Gounaris, C. E. (2018). Robust optimization for decision-making under endogenous uncertainty. Computers & Chemical Engineering, 111, 252–266.
Lou, Y., & Zhang, L. (2011). Defending transportation networks against random and targeted attacks. Transportation Research Record, 2234(1), 31–40.
News, BBC. (2017). British airways: Thousands disrupted as flights axed amid it crash. Retrieved March 30, 2023, from https://www.bbc.com/news/uk-4006986.
Nohadani, O., & Sharma, K. (2018). Optimization under decision-dependent uncertainty. SIAM Journal on Optimization, 28(2), 1773–1795.
Peeta, S., Sibel Salman, F., Gunnec, D., & Viswanath, K. (2010). Pre-disaster investment decisions for strengthening a highway network. Computers & Operations Research, 37(10), 1708–1719.
Prince, M., Cole Smith, J., & Geunes, J. (2013). A three-stage procurement optimization problem under uncertainty. Naval Research Logistics (NRL), 60(5), 395–412.
Reggiani, A., Nijkamp, P., & Lanzi, D. (2015). Transport resilience and vulnerability: The role of connectivity. Transportation Research Part A: Policy and Practice, 81, 4–15.
Sadeghi, S., Seifi, A., & Azizi, E. (2017). Trilevel shortest path network interdiction with partial fortification. Computers & Industrial Engineering, 106, 400–411.
Sarhadi, H., Tulett, D. M., & Verma, M. (2017). An analytical approach to the protection planning of a rail intermodal terminal network. European Journal of Operational Research, 257(2), 511–525.
Smith, J. C., Prince, M., & Geunes, J. (2013). Modern network interdiction problems and algorithms. In Handbook of combinatorial optimization (pp. 1949–1987). New York: Springer.
Smith, J. C., Lim, C., & Sudargho, F. (2007). Survivable network design under optimal and heuristic interdiction scenarios. Journal of global optimization, 38(2), 181–199.
Smith, J. C., & Song, Y. (2020). A survey of network interdiction models and algorithms. European Journal of Operational Research, 283(3), 797–811.
Veremyev, A., Prokopyev, O. A., & Pasiliao, E. L. (2014). An integer programming framework for critical elements detection in graphs. Journal of Combinatorial Optimization, 28, 233–273.
Veremyev, A., Prokopyev, O. A., & Pasiliao, E. L. (2015). Critical nodes for distance-based connectivity and related problems in graphs. Networks, 66(3), 170–195.
von Stackelberg, H. et al. (1952). Theory of the market economy.
Walteros, J. L., Veremyev, A., Pardalos, P. M., & Pasiliao, E. L. (2019). Detecting critical node structures on graphs: A mathematical programming approach. Networks, 73(1), 48–88.
Wollmer, R. (1964). Removing arcs from a network. Operations Research, 12(6), 934–940.
Wood, R. K. (2011). Bilevel network interdiction models: Formulations and solutions.
Wu, B., Tang, A., & Jie, W. (2016). Modeling cascading failures in interdependent infrastructures under terrorist attacks. Reliability Engineering & System Safety, 147, 1–8.
Yuan, W., Zhao, L., & Zeng, B. (2014). Optimal power grid protection through a defender–attacker–defender model. Reliability Engineering & System Safety, 121, 83–89.
Zeng, B., & Wang, W. (2022). Two-stage robust optimization with decision dependent uncertainty. arXiv:2203.16484.
Zeng, B., & Zhao, L. (2013). Solving two-stage robust optimization problems using a column-and-constraint generation method. Operations Research Letters, 41(5), 457–461.
Zhang, K., Li, X., & Jin, M. (2022). Efficient solution methods for a general r-interdiction median problem with fortification. INFORMS Journal on Computing, 34(2), 1272–1290.
Funding
This study was funded by Social Sciences and Humanities Research Council (SSHRC) with Grant Number GR020535. The research of Michel FATHI has been supported by a University of North Texas College of Business Summer Research Grant and the Cross-Border Threat Screening and Supply Chain Defense (CBTS) Center for U.S. Department of Homeland Security (DHS) Summer Research Program for Minority Serving Institutions.
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
Michel Fathi is guest editor of Annals of Operations Research—Special Issue: Applications of Operations Research and Data Science in Disrupting Illicit Markets. Amin Ahmadi Digehsara declares that he has no conflict of interest. Amir Ardestani-Jaafari declares that he has no conflict of interest. Shumail Mazahir declares that he has no conflict of interest.
Ethical approval
This article does not contain any studies with human participants or animals performed by any of the authors.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Ahmadi Digehsara, A., Ardestani-Jaafari, A., Mazahir, S. et al. Two-stage nodal network interdiction under decision-dependent uncertainty. Ann Oper Res 335, 665–687 (2024). https://doi.org/10.1007/s10479-023-05630-w
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-023-05630-w