• ورود به سامانه
      مشاهده مورد 
      •   صفحهٔ اصلی
      • نشریات انگلیسی
      • Advances in Industrial Engineering
      • Volume 51, Issue 1
      • مشاهده مورد
      •   صفحهٔ اصلی
      • نشریات انگلیسی
      • Advances in Industrial Engineering
      • Volume 51, Issue 1
      • مشاهده مورد
      JavaScript is disabled for your browser. Some features of this site may not work without it.

      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

      (ندگان)پدیدآور
      Parvassi, Seyed ParsaBashirzadeh, RezaKhoshalhan, Farid
      Thumbnail
      دریافت مدرک مشاهده
      FullText
      اندازه فایل: 
      705.4کیلوبایت
      نوع فايل (MIME): 
      PDF
      نوع مدرک
      Text
      Research Paper
      زبان مدرک
      English
      نمایش کامل رکورد
      چکیده
      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.
      کلید واژگان
      Full coverage
      Probabilistic protection
      r-interdiction median problem
      Stackelberg game
      Tri-level programming
      Logistics and Supply Chain and Inventory Control

      شماره نشریه
      1
      تاریخ نشر
      2017-04-01
      1396-01-12
      ناشر
      University of Tehran
      سازمان پدید آورنده
      Department of Industrial Engineering, Khajeh Nasir Toosi University of Technology, Tehran, Iran
      Department of Industrial Engineering, Khajeh Nasir Toosi University of Technology, Tehran, Iran
      Department of Industrial Engineering, Khajeh Nasir Toosi University of Technology, Tehran, Iran

      شاپا
      2423-6896
      2423-6888
      URI
      https://dx.doi.org/10.22059/jieng.2017.61893
      https://jieng.ut.ac.ir/article_61893.html
      https://iranjournals.nlai.ir/handle/123456789/257587

      مرور

      همه جای سامانهپایگاه‌ها و مجموعه‌ها بر اساس تاریخ انتشارپدیدآورانعناوینموضوع‌‌هااین مجموعه بر اساس تاریخ انتشارپدیدآورانعناوینموضوع‌‌ها

      حساب من

      ورود به سامانهثبت نام

      تازه ترین ها

      تازه ترین مدارک
      © کليه حقوق اين سامانه برای سازمان اسناد و کتابخانه ملی ایران محفوظ است
      تماس با ما | ارسال بازخورد
      قدرت یافته توسطسیناوب