Bi-objective missile rescheduling for a naval task group with dynamic disruptions

Silav A., Karasakal O., KARASAKAL E.

NAVAL RESEARCH LOGISTICS, cilt.66, sa.7, ss.596-615, 2019 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 66 Sayı: 7
  • Basım Tarihi: 2019
  • Doi Numarası: 10.1002/nav.21867
  • Dergi Adı: NAVAL RESEARCH LOGISTICS
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.596-615
  • Anahtar Kelimeler: air defense, naval task group, rescheduling, weapon target allocation problem, DEFENSE, OPTIMIZATION, ASSIGNMENT, ALLOCATION, ALGORITHMS, STRATEGY
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

This paper considers the rescheduling of surface-to-air missiles (SAMs) for a naval task group (TG), where a set of SAMs have already been scheduled to intercept a set of anti-ship missiles (ASMs). In missile defense, the initial engagement schedule is developed according to the initial state of the defensive and attacking units. However, unforeseen events may arise during the engagement, creating a dynamic environment to be handled, and making the initial schedule infeasible or inefficient. In this study, the initial engagement schedule of a TG is assumed to be disrupted by the occurrence of a destroyed ASM, the breakdown of a SAM system, or an incoming new target ASM. To produce an updated schedule, a new biobjective mathematical model is formulated that maximizes the no-leaker probability value for the TG and minimizes the total deviation from the initial schedule. With the problem shown to be NP-hard, some special cases are presented that can be solved in polynomial time. We solve small size problems by the augmented epsilon-constraint method and propose heuristic procedures to generate a set of nondominated solutions for larger problems. The results are presented for different size problems and the total effectiveness of the model is evaluated.