%0 Journal Article
%T Presentation of a Tri-level Covering Fortification Model in Order to Protect Facility Against Disturbance in r-interdiction Median Problem with the Approach of Stackelberg Game
%J Advances in Industrial Engineering
%I University of Tehran
%Z 2423-6896
%A Parvassi, Seyed Parsa
%A Bashirzadeh, Reza
%A Khoshalhan, Farid
%D 2017
%\ 03/21/2017
%V 51
%N 1
%P 45-58
%! Presentation of a Tri-level Covering Fortification Model in Order to Protect Facility Against Disturbance in r-interdiction Median Problem with the Approach of Stackelberg Game
%K Full coverage
%K Probabilistic protection
%K r-interdiction median problem
%K Stackelberg game
%K Tri-level programming
%R 10.22059/jieng.2017.61893
%X In this paper, a tri-level defense facility location model for full coverage in r-interdiction median problem is delivered. The purpose of this model is to design a proper service system in a way that after a worst case scenario of disturbance, they can utilize their full capacity of providing services. Hence, we have considered the defense facilities to provide extra protection for service facilities, and the goal is to optimally locate these facilities. The tri-level model is proposed based on leader-follower games as defender-attacker-defender framework. After the disturbance caused by the attacker, with the purpose of ensuring the operation of service facilities, the defender tries to establish a number of defense facilities in potential locations. Locating these facilities is carried with respect to the establishment of fixed cost of facilities and systemâ€™s current cost. It should be noted that each service facility must be at least within the coverage range of at least one defense facility (first level).So, systemâ€™s current costs can be defined based on the worst-case scenario of disturbance caused by the attacker. The problem is modeled as a static Stackelberg game between the attacker (level 2) and defender (level 3). In order to solve the model, two approaches have been used. In the first approach, explicit enumeration method is used for the first and second levels and an exact approach is used for the third level. In the second approach, hybrid methods consisting of genetic algorithm, explicit exact enumeration and exact approach have been used to solve the problem in a reasonable time. Comparing the proposed meta-heuristic to the exact approach in some samples, the numerical results show a quite satisfactory of this algorithm.
%U https://jieng.ut.ac.ir/article_61893_54f1afc8fe32d9f8a320fb71e83acc75.pdf