Ant Colony Algorithm For Solving The WTA Problem

Weapon-Target Assignment Problem (WTA) is a typical problem for optimization, which requires finding proper engagement of weapons to targets aiming at minimizing the expected damage of own-force asset. With the development of the technology and its application in area of strategy, the weapon-target assignment problem has consequently received a great deal of attention in recent years. This paper emphasizes a research the solution of static WTA under the top shoot straight.Firstly, based on the analysis of the existing methods and recent development of WTA problem, static WTA problem and dynamic WTA problem are thoroughly studied in this paper. Then, the definition and the model of each WTA problem are presented.Secondly, aiming at non-differential, constrained, nonlinear characteristics of the WTA problem, ant colony algorithm is adopted to tackle the problem. Based on the existing improved ant colony algorithm, the further development of the algorithm is probed into. Main objective is to quicken the convergence rate and shorten the computation time of the algorithm. There are two strategies to achieve the expectation:1. Improvement of the selective strategy, stochastic method is adopted to increase the variety of solutions.2. Improvement of the pheromone renewal, pheromone declining is adopted.Finally, detailed realized steps are presented using ant colony algorithm to tackle the WTA problem. Simulation shows the validity of the improved algorithm. Compared with the traditional ant colony algorithm, the results show the better performance: higher precision, faster convergence, shorter computation time. Through an example of the WTA problem, detailed schemes are concluded considering the threaten coefficient or not.