一种基于蚁群算法的防空C^3I目标分配  

Ant Colony Optimization Algorithm for Target Assignment in Air-Defense C^3I System

作　　者：刘少伟[1] 王洁[1] 张琳[1] 

机构地区：[1]空军工程大学导弹学院,陕西三原713800

出　　处：《上海航天》2008年第1期57-60,共4页Aerospace Shanghai

摘　　要：针对防空指挥、控制、通信和信息(C3I)系统的目标分配问题,在信息素更新中引入最优蚂蚁保留策略,提出了一种基于蚁群算法(ACO)的目标分配优化方法,给出了算法的步骤和参数确定原则。算例表明:与模拟退火算法(SA)相比,该算法的寻优能力强、收敛速度快。An optimization method based on ant colony optimization algorithm was put forward for the targets assignment problem in air-defense C^3I system in this paper, in which an elitist strategy was used to update the pheromone.The steps of the algorithm and rules of parameter determination were presented.The computation results of some samples showed that this method had high ability in finding optimal solution and quick convergence that compared to SA.

关 键 词：防空C3I系统 目标分配 蚁群算法 优化 信息素更新 

分 类 号：E91[军事]