Weapon-Target Allocation and Scheduling for Air Defense

In this book, mathematical modeling and heuristic approaches are developed for surface-to-air weapon-target allocation problem with time varying single shot hit probabilities (SSHP) against linearly approaching threats. First, a nonlinear mathematical model for the problem is formulated to maximize sum of the weighted survival probabilities of assets to be defended. Next, nonlinear objective function and constraints are linearized. Time varying SSHP values are approximated with appropriate closed forms and adapted to the linear model obtained. This model is tested on different scenarios and results are compared with those of the original nonlinear model. It is observed that the linear model is solved much faster than the nonlinear model and produces reasonably good solutions. Addition to these mathematical model approaches, a construction heuristic is developed based on this scheme. An improvement heuristic that uses the solution of the construction heuristic is also proposed. Finally, all methods are tested on forty defense scenarios. Two fastest solution methods are compared on a large scenario and proposed as appropriate solution techniques.