OPTIMIZATION OF THE ALLOCATION OF MULTIPLE ATTACK AIRCRAFT AGAINST MULTIPLE GROUND TARGETS

This work addresses the allocation of multiple aircraft to multiple ground targets in the context of Static Weapon-Target Assignment (SWTA). The classical formulation is nonlinear and integer, due to the multiplicative combination of the probabilities of success and the operational constraints of resources. A modeling in Mixed Integer Linear Programming (MILP) is proposed, based on pre-processing of the probabilities of success and the construction of allocation patterns. The exact MILP performance is compared with the Relax-and-Fix heuristic, a Genetic Algorithm and Monte Carlo simulations. The results demonstrate MILP's superiority in solution quality and computational time in all tested instances, including scenarios with up to 300 targets resolved in less than 2.5 seconds, evidencing feasibility for near-real-time mission planning.