IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v335y2024i2d10.1007_s10479-023-05630-w.html
   My bibliography  Save this article

Two-stage nodal network interdiction under decision-dependent uncertainty

Author

Listed:
  • Amin Ahmadi Digehsara

    (University of British Columbia)

  • Amir Ardestani-Jaafari

    (University of British Columbia)

  • Shumail Mazahir

    (Universite Côte d’Azur)

  • Michel Fathi

    (University of North Texas)

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.

Suggested Citation

  • Amin Ahmadi Digehsara & Amir Ardestani-Jaafari & Shumail Mazahir & Michel Fathi, 2024. "Two-stage nodal network interdiction under decision-dependent uncertainty," Annals of Operations Research, Springer, vol. 335(2), pages 665-687, April.
  • Handle: RePEc:spr:annopr:v:335:y:2024:i:2:d:10.1007_s10479-023-05630-w
    DOI: 10.1007/s10479-023-05630-w
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-023-05630-w
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-023-05630-w?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Bier, Vicki & Gutfraind, Alexander, 2019. "Risk analysis beyond vulnerability and resilience – characterizing the defensibility of critical systems," European Journal of Operational Research, Elsevier, vol. 276(2), pages 626-636.
    2. Smith, J. Cole & Song, Yongjia, 2020. "A survey of network interdiction models and algorithms," European Journal of Operational Research, Elsevier, vol. 283(3), pages 797-811.
    3. Kaike Zhang & Xueping Li & Mingzhou Jin, 2022. "Efficient Solution Methods for a General r -Interdiction Median Problem with Fortification," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1272-1290, March.
    4. Kjell Hausken & Fei He, 2016. "On the Effectiveness of Security Countermeasures for Critical Infrastructures," Risk Analysis, John Wiley & Sons, vol. 36(4), pages 711-726, April.
    5. Hausken, Kjell, 2017. "Defense and attack for interdependent systems," European Journal of Operational Research, Elsevier, vol. 256(2), pages 582-591.
    6. Mehdi Ansari & Juan S. Borrero & Leonardo Lozano, 2023. "Robust Minimum-Cost Flow Problems Under Multiple Ripple Effect Disruptions," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 83-103, January.
    7. Juan S. Borrero & Oleg A. Prokopyev & Denis Sauré, 2019. "Sequential Interdiction with Incomplete Information and Learning," Operations Research, INFORMS, vol. 67(1), pages 72-89, January.
    8. Gerald Brown & Matthew Carlyle & Javier Salmerón & Kevin Wood, 2006. "Defending Critical Infrastructure," Interfaces, INFORMS, vol. 36(6), pages 530-544, December.
    9. Sarhadi, Hassan & Tulett, David M. & Verma, Manish, 2017. "An analytical approach to the protection planning of a rail intermodal terminal network," European Journal of Operational Research, Elsevier, vol. 257(2), pages 511-525.
    10. Reggiani, Aura & Nijkamp, Peter & Lanzi, Diego, 2015. "Transport resilience and vulnerability: The role of connectivity," Transportation Research Part A: Policy and Practice, Elsevier, vol. 81(C), pages 4-15.
    11. Nguyen, Di H. & Smith, J. Cole, 2022. "Network interdiction with asymmetric cost uncertainty," European Journal of Operational Research, Elsevier, vol. 297(1), pages 239-251.
    12. Paola Cappanera & Maria Paola Scaparra, 2011. "Optimal Allocation of Protective Resources in Shortest-Path Networks," Transportation Science, INFORMS, vol. 45(1), pages 64-80, February.
    13. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    14. Richard Wollmer, 1964. "Removing Arcs from a Network," Operations Research, INFORMS, vol. 12(6), pages 934-940, December.
    15. Mike Prince & J. Cole Smith & Joseph Geunes, 2013. "A three‐stage procurement optimization problem under uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(5), pages 395-412, August.
    16. Kjell Hausken, 2019. "Defence and attack of complex interdependent systems," Journal of the Operational Research Society, Taylor & Francis Journals, vol. 70(3), pages 364-376, March.
    17. E. E. Koks & J. Rozenberg & C. Zorn & M. Tariverdi & M. Vousdoukas & S. A. Fraser & J. W. Hall & S. Hallegatte, 2019. "A global multi-hazard risk analysis of road and railway infrastructure assets," Nature Communications, Nature, vol. 10(1), pages 1-11, December.
    18. Alexander Veremyev & Oleg A. Prokopyev & Eduardo L. Pasiliao, 2014. "An integer programming framework for critical elements detection in graphs," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 233-273, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Yan, Xihong & Ren, Xiaorong & Nie, Xiaofeng, 2022. "A budget allocation model for domestic airport network protection," Socio-Economic Planning Sciences, Elsevier, vol. 82(PB).
    2. Ramamoorthy, Prasanna & Jayaswal, Sachin & Sinha, Ankur & Vidyarthi, Navneet, 2024. "An exact method for trilevel hub location problem with interdiction," European Journal of Operational Research, Elsevier, vol. 319(3), pages 696-710.
    3. Leitner, Markus & Ljubić, Ivana & Monaci, Michele & Sinnl, Markus & Tanınmış, Kübra, 2023. "An exact method for binary fortification games," European Journal of Operational Research, Elsevier, vol. 307(3), pages 1026-1039.
    4. Hausken, Kjell, 2024. "Fifty Years of Operations Research in Defense," European Journal of Operational Research, Elsevier, vol. 318(2), pages 355-368.
    5. Leonardo Lozano & J. Cole Smith, 2017. "A Backward Sampling Framework for Interdiction Problems with Fortification," INFORMS Journal on Computing, INFORMS, vol. 29(1), pages 123-139, February.
    6. Li, Qing & Li, Mingchu & Zhang, Runfa & Gan, Jianyuan, 2021. "A stochastic bilevel model for facility location-protection problem with the most likely interdiction strategy," Reliability Engineering and System Safety, Elsevier, vol. 216(C).
    7. Annunziata Esposito Amideo & Stefano Starita & Maria Paola Scaparra, 2019. "Assessing Protection Strategies for Urban Rail Transit Systems: A Case-Study on the Central London Underground," Sustainability, MDPI, vol. 11(22), pages 1-21, November.
    8. Xiang, Yin, 2023. "Minimizing the maximal reliable path with a nodal interdiction model considering resource sharing," Reliability Engineering and System Safety, Elsevier, vol. 239(C).
    9. Juan S. Borrero & Leonardo Lozano, 2021. "Modeling Defender-Attacker Problems as Robust Linear Programs with Mixed-Integer Uncertainty Sets," INFORMS Journal on Computing, INFORMS, vol. 33(4), pages 1570-1589, October.
    10. Beck, Yasmine & Ljubić, Ivana & Schmidt, Martin, 2023. "A survey on bilevel optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 311(2), pages 401-426.
    11. Chaya Losada & M. Scaparra & Richard Church & Mark Daskin, 2012. "The stochastic interdiction median problem with disruption intensity levels," Annals of Operations Research, Springer, vol. 201(1), pages 345-365, December.
    12. Wei, Ningji & Walteros, Jose L., 2022. "Integer programming methods for solving binary interdiction games," European Journal of Operational Research, Elsevier, vol. 302(2), pages 456-469.
    13. Starita, Stefano & Scaparra, Maria Paola, 2016. "Optimizing dynamic investment decisions for railway systems protection," European Journal of Operational Research, Elsevier, vol. 248(2), pages 543-557.
    14. Kübra Tanınmış & Markus Sinnl, 2022. "A Branch-and-Cut Algorithm for Submodular Interdiction Games," INFORMS Journal on Computing, INFORMS, vol. 34(5), pages 2634-2657, September.
    15. Parajuli, Anubhuti & Kuzgunkaya, Onur & Vidyarthi, Navneet, 2017. "Responsive contingency planning of capacitated supply networks under disruption risks," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 102(C), pages 13-37.
    16. Wang, Shuliang & Gu, Xifeng & Luan, Shengyang & Zhao, Mingwei, 2021. "Resilience analysis of interdependent critical infrastructure systems considering deep learning and network theory," International Journal of Critical Infrastructure Protection, Elsevier, vol. 35(C).
    17. Bose, Gautam & Konrad, Kai A., 2020. "Devil take the hindmost: Deflecting attacks to other defenders," Reliability Engineering and System Safety, Elsevier, vol. 204(C).
    18. Li, Qing & Li, Mingchu & Gong, Zhongqiang & Tian, Yuan & Zhang, Runfa, 2022. "Locating and protecting interdependent facilities to hedge against multiple non-cooperative limited choice attackers," Reliability Engineering and System Safety, Elsevier, vol. 223(C).
    19. Hunt, Kyle & Zhuang, Jun, 2024. "A review of attacker-defender games: Current state and paths forward," European Journal of Operational Research, Elsevier, vol. 313(2), pages 401-417.
    20. Shen, Yeming & Sharkey, Thomas C. & Szymanski, Boleslaw K. & Wallace, William (Al), 2021. "Interdicting interdependent contraband smuggling, money and money laundering networks," Socio-Economic Planning Sciences, Elsevier, vol. 78(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:annopr:v:335:y:2024:i:2:d:10.1007_s10479-023-05630-w. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.