مشخصات پژوهش

عنوان	A bi-level model and heuristic techniques with various neighborhood strategies for covering interdiction problem with fortification
نوع پژوهش	مقاله چاپ‌شده در مجلات علمی
کلیدواژه‌ها	,Interdiction facility location ,Bi-level optimization ,Variable neighborhood search algorithm Simulated annealing algorithm
چکیده	Supply or service networks are vulnerable to hazards that can stem from both unintentional and intentional human actions, as well as natural calamities. To ensure vital infrastructure resilience in these networks, address the interdiction facility location problem. Currently, diverse groups of attackers target supply and service systems to cause maximum disruption. Collaboration among attackers improves system vulnerability detection accuracy and realism. This research examines the challenges of interdiction location with different defense systems and heterogeneous attackers. To address this challenge, a mixed-integer non-linear bi-level programming model was considered. Heuristic optimization methods including variable neighborhood search, simulated annealing, and hybrid variable neighborhood search are used to efficiently solve the suggested model. The outcomes of our investigation suggest that implementing various protective methods leads to an escalation in system damage when attackers collaborate. Furthermore, the findings illustrate the efficacy of the suggested algorithms in resolving interdiction location issues within supply or service networks.
پژوهشگران	انور محمودی (نفر سوم)، زهرا حسین زاده (نفر دوم)، عبدالسلام قادری (نفر اول)