基于遗传算法的联合火力WTA问题研究  

Analysis of Weapon Target Assignment Problem in Joint Fire Strike Solving by Genetic Algorithm

作　　者：杨山亮[1] 黄健[1] 刘洋[1] 鞠儒生[1] 

机构地区：[1]国防科技大学机电工程与自动化学院,湖南长沙410073

出　　处：《计算机仿真》2012年第3期61-63,136,共4页Computer Simulation

摘　　要：研究联合火力优化分配问题。联合火力是多种作战力量参战条件下的多武器-多目标对抗。由于火力分配受到多种条件的限制,分配方案又决定作战效果,而武器-目标分配(Weapon Target Assignment,WTA)是多个装备同类型武器的作战单元联合抗击多个目标进行的分配方法。针对WTA问题求解规模大和精度高的特点,传统算法均不能满足速度和精度的要求,在基本遗传算法的基础上,采用精英选择和动态遗传算子的改进算法,避免了过早收敛。利用WTA的数学模型进行仿真。仿真结果验证了算法的有效性。The assignment problem in joint fire strike is researched.Joint fire strike is a confrontment between multi-weapons and multi-targets involving various forces.The assignment affects the result significantly under a variety of conditions.Weapon-target assignment problem researches how to resist enemies based on the campaign units equipped with the same weapons.Considering the character of large scale and high precision in solving the WTA problem which can not be met by traditional algorithms,a Genetic Algorithm was put forward based on elite-selecting mechanism and dynamic inherited operator.This paper utilized the mathematical model of WTA to simulate,and the computational results demonstrate that it can get a satisfactory solution.

关 键 词：联合火力 武器-目标分配 遗传算法 精英选择 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术]