A heuristic genetic algorithm for solving constrained Weapon-Target Assignment problem

The Weapon-Target Assignment (WTA) problem can be formulated as a nonlinear integer programming problem and is known to be NP-complete. Generic algorithm and heuristic algorithm are widely used for solving it but hardly be good enough considering the disadvantages of each. We firstly transform the nonlinear integer constrained WTA problem into a linear integer problem and suggest genetic algorithm with heuristic algorithm as the eugenic process for initial population. We present computational results of our proposed algorithm, which indicate that we can solve large instances (up to 200 weapons and targets)of the WTA problem optimally and it is efficiency than any of the algorithm alone.