A Hybrid Search Algorithm of Ant Colony Optimization and Genetic Algorithm Applied to Weapon-Target Assignment Problems

摘要

Weapon-Target Assignment (WTA) problems are to find a proper assignment of weapons to targets with the objective of minimizing the expected damage of own-force asset. In this paper, a novel hybrid algorithm of ant colony optimization (ACO) and genetic algorithm is proposed to solve WTA problems. The proposed algorithm is to enhance the search performance of genetic algorithms by embedded ACO so as to have locally optimal offspring. This algorithm is successfully applied to WTA problems. From our simulations for those tested problems, the proposed algorithm has the best performance when compared to other existing search algorithms.