改进蚁群算法求解火力分配优化  

Weapon-target Assignment Problem Based on Improved ACA

作　　者：刘建新[1] 宋以胜[2] 卢厚清[2] 何雷[2] 

机构地区：[1]南京工程学院,江苏南京211167 [2]解放军理工大学工程兵工程学院,江苏南京210007

出　　处：《数学的实践与认识》2009年第20期92-99,共8页Mathematics in Practice and Theory

摘　　要：描述了火力分配问题(W TA)及其数学模型,简要介绍了基本蚁群算法,着重分析了其不足,并在移动选择策略上进行了改进,借鉴了遗传算法中的交叉、变异增加了解的多样性,拓展了搜索空间.针对W TA问题,提出了一种解决该问题的新颖等价方式,并着重说明了算法的具体实现步骤.通过M ATLAB程序仿真实验验证了该思路的正确性、高效性及简单易操作性.Weapon-target assignment problem （WTA） was described and its mathematic model was established. Ant colony algorithm （ACA） was introduced briefly; aiming at its defects, the strategy to select the next node was improved. Crossover and mutation in GAs were introduced into ACA, and the search space was opened up. A novel and equivalence method was proposed for WTA, and the steps to realize the algorithm were described in details. The simulation in MATLAB program verified the validity, efficient and simple to operate.

关 键 词：火力分配(WTA) 改进蚁群算法 交叉 变异 

分 类 号：E911[军事] O241[理学—计算数学]