Naval Air Defense Planning problem: A novel formulation and heuristics

Date

2024-01-01

Author

Arslan, Caner
Karasakal, Orhan
Kırca, Ömer

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

103
views

0
downloads

Cite This

This article focuses on air defense in maritime environment, which involves protecting friendly naval assets from aerial threats. Specifically, we define and address the Naval Air Defense Planning (NADP) problem, which consists of maneuvering decisions of the ships and scheduling weapons and sensors to the threats in order to maximize the total expected survival probability of friendly units. The NADP problem is more realistic and applicable than previous studies, as it considers features such as sensor assignment requirements, weapon and sensor blind sectors, sequence-dependent setup times, and ship's infrared/radar signature. In this study, a mixed-integer nonlinear programming model of the NADP problem is presented and heuristic solution approaches are developed. Computational results demonstrate that these heuristic approaches are both fast and efficient in solving the NADP problem.

Subject Keywords

missile scheduling, naval air defense, weapon target assignment

URI

https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85189964547&origin=inward
https://hdl.handle.net/11511/109323

Collections

Graduate School of Natural and Applied Sciences, Article