多群协同PSO优化算法的WTA问题求解  

Multi Swarms Cooperative Particle Swarm Optimization for Solving WTA Problem

作　　者：肖嵘[1] 赵成旺[2] 王护利[2] 檀朝彬[2] 

机构地区：[1]廊坊广播电视大学成教部,河北廊坊065000 [2]炮兵指挥学院三系,河北廊坊065000

出　　处：《计算机仿真》2010年第9期12-14,28,共4页Computer Simulation

摘　　要：在现代作战指挥的研究中,武器目标分配(WTA)问题是一种典型的NP问题,针对基本粒子群(PSO)算法易于陷于局部最优解的情况,为提高速度和求解精度,提出用多群协同PSO算法求解WTA问题,设计了一种新的种群生成编码方法,缩小了可行解空间,并给出了采用多群协同PSO算法进行求解WTA问题的详细步骤。对于大规模WTA问题,将三群协同、四群协同PSO算法与基本PSO算法进行了比较,仿真结果表明了多群协同PSO算法当WTA问题规模较大时,在求解精度、收敛速度方面的优越性,能够有效求解WTA复杂而困难的问题。Weapon-Target Assignment problem （WTA） is NP hard. Using Multi Swarms Cooperative Particle Swarm Optimization （PSO） to solve WTA problems is proposed. A new coding way of original swarm is established,which reduced the solution space. To avoid drawbacks of basic PSO for solving WTA problem,such as being subject to falling into local optimization and being poor in performance in precision,Multi Swarms Cooperative Particle Swarm Optimization is introduced. Simulation results demonstrate that the algorithm can converge to the ideal steady state with high speed and provide practical solutions,especially when the scale of WTA problem is big.

关 键 词：武器目标分配 粒子群算法 协同 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]