یک مدل برنامه نویسی bi-level برای حفاظت از تأسیسات سلسله مراتبی تحت حملات قریب الوقوع
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|78475||2015||15 صفحه PDF||سفارش دهید||12490 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : Computers & Operations Research, Volume 64, December 2015, Pages 210–224
Disorders caused by deliberate sabotage and terrorist attacks have always been considered as a major threat by the governments. Hence, identifying and planning for strengthening of critical facilities have become a priority for more security and safety. This paper presents a bi-level formulation of the r-interdiction median problem with fortification for critical hierarchical facilities. In the developed bi-level formulation, the defender, as the leader, decides to protect a certain number of facilities in each level of the hierarchical system in order to minimize the impact of the most disruptive attacks to unprotected facilities. On the other hand the attacker, as the follower, with full information about protected facilities, makes his interdiction plan to maximize the total post-attack cost incurred to the defender. We develop three metaheuristic algorithms and an exhaustive enumeration method to solve the introduced problem. Extensive computational tests on a set of randomly generated instances demonstrate the effectiveness of the developed algorithms.