Naval Air Defense Planning problem: A novel formulation and heuristics
研究了海军防空规划问题，通过混合整数非线性规划建模并开发启发式算法，快速求解舰船机动与武器传感器调度方案，最大化己方生存概率。
Abstract 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.