基于信息素递减的蚁群算法的WTA问题求解

武器目标分配(weapon target assignment,WTA)问题是一个典型的优化问题,需将武器根据迎击目标进行合理分配,使我方损失最小.结合WTA问题的特点,采用求解复杂优化问题的蚁群算法求解该问题.针对WTA问题求解规模大,精度高,实时性强的需求,在基本蚁群算法的基础上,采用基于信息素递减的改进蚁群算法.给出了求解WTA问题改进算法的详细步骤,通过仿真试验验证了算法的有效性.同时,对于大规模WTA问题,改进蚁群算法与基本蚁群算法进行了比较,结果表明改进算法求解精度更高,收敛速度更快,能适应现代军事应用的要求.

An Ant Colony Algorithm Based on Pheromone Declining for Solving the WTA Problem

Weapon Target Assignment Problem is a typical problem of optimization. It is to find a proper assignment of weapons to targets with the objective of minimizing the expected damage of own-force asset. Considering the character of the WTA problem, the paper solves the WTA problem by the Ant Colony Algorithm used to solve the hard combinatorial optimization problems. Because of the large scale of the WTA problem, high precision and real-time in solving the WTA problem, an Ant Colony Algorithm based on pheromone declining is used to solve this problem. The detailed steps of this algorithm are given. The simulation has verified its effectiveness. Compared with the traditional Ant Colony Algorithm, experiments demonstrate that the improved ant colony algorithm gets more accurate result and converges more quickly for the large scale WTA problem. It satisfies the requirement of modern war.