基于蚁群算法的防空C^3I系统火力分配模型研究  

Study on Weapon-Target Assignment Model of Air Defense C^3I System Based on Ant Colony Algorithm

作　　者：孔令鹏[1] 王玉生[1] 王海峰[1] 

机构地区：[1]防空兵指挥学院,河南郑州450052

出　　处：《指挥控制与仿真》2006年第2期60-63,共4页Command Control & Simulation

基　　金：军队"2110工程"防空作战实验室重点基金项目资助(012010)

摘　　要：针对当前火力分配问题实现难度大的特点,分析各种火力分配优化方法的优缺点,运用新型蚁群算法尝试解决WTA问题。建立了基于蚁群算法的火力分配优化模型,描述了解火力分配问题的一般步骤,通过实例给出了算法,解决了WTA问题。并与匈牙利法相比较,结果表明该方法的合理性和有效性,特别是在武器—目标数较大时,其效率要高于常用的匈牙利法。In allusion to the trait that weapon-target assignment problem （WTA） is difficult to realize, many optimization methods to solve optimum model and their advantages and shortages are analyzed, this paper attempts to solve the problem by making use of a new algorithm -An ant colony algorithm. An optimization model of weapon-target assignment problem （WTA） based on the ant colony algorithm and the common steps about solving the problem is given in this paper. Through an example, it is solved. The simulation result, compared with Hungary method, indicate its rationality and validity, especially when the number of weapon-target is bigger, its effectiveness is excelled to Hungary method illustrated through results.

关 键 词：防空C3I系统 蚁群算法 火力分配 优化模型 匈牙利法 

分 类 号：E211[军事—军队指挥学]