Constraint Optimization GA and Its Application to Constrained WTA Problem

Abstract

In the actual weapon-target allocation (WTA) problem, weapons can not be randomly paired with incoming targets since their launching zones are limited. Though genetic algorithm (GA) with various modifications has been developed for WTA problems, the spatial constraints are always ignored. In the paper a genetic algorithm (GA) based approach is developed to solve the WTA problem subject to spatial constraints, where each chromosome is encoded as a binary matrix with forbidden bits to address problem constraints, and corresponding crossover and mutation operators are designed to guarantee each chromosome a valid solution to the WTA problem through the whole evolving process. Simulation results verify the feasibility of the proposed approach.