Analysis of maritime air defence scenarios

In this paper, we examine scenarios of maritime air defence where the threats can be of different types i.e., characterized by varying different single shot probabilities of hit. We develop a methodology that integrates constrained optimization calculus, dynamic programming and a genetic algorithm to determine the optimal allocation of interceptors that globally maximize the probability of raid annihilation. We call this strategy the Heterogeneous tactic. We show that the improvement in the probability of raid annihilation could exceed thirty percent for one scenario examined, relative to a Shoot-Look-Shoot tactic with fixed size salvos.