Premium
Bi‐objective missile rescheduling for a naval task group with dynamic disruptions
Author(s) -
Silav Ahmet,
Karasakal Orhan,
Karasakal Esra
Publication year - 2019
Publication title -
naval research logistics (nrl)
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.665
H-Index - 68
eISSN - 1520-6750
pISSN - 0894-069X
DOI - 10.1002/nav.21867
Subject(s) - schedule , heuristic , set (abstract data type) , computer science , missile , task (project management) , mathematical optimization , constraint (computer aided design) , operations research , mathematics , engineering , aerospace engineering , systems engineering , geometry , programming language , operating system
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 ϵ ‐ 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.