带排序映射的量子粒子群优化算法求解WTA问题  

Quantum behaved particle swarm optimization algorithm for solving WTA problem with ordering mapping

作　　者：刘琨[1] 何建华[1] 黄炎[1] 梁云[1] 张烨[1] 

机构地区：[1]西北工业大学电子信息学院,西安710129

出　　处：《计算机应用研究》2016年第3期765-767,共3页Application Research of Computers

基　　金：航空科学基金资助项目(2013ZC53038)

摘　　要：针对武器—目标分配(WTA)问题及其特点,提出一种带排序映射的量子粒子群优化算法。首先通过武器系统对目标攻击过程中得到的毁伤收益建立了目标分配模型;然后根据该模型的约束特点,提出一种基于排序映射的编码调整方式,并引入一种非线性扩张收缩因子自适应调整方法;最后在算法中嵌入一种判断和避免搜索早熟和停滞的有效方法。通过仿真对比验证,该算法具有较高的收敛速度与稳定性。实验结果表明所提方法能有效求解WTA问题。In view of the weapon target assignment（ WTA） problem and its characteristics,this paper put forward a quantum particle swarm optimization algorithm with ordering mapping. First of all,it established a model of target assignment through the damage earnings which obtained in the process of weapon system attacking target. Then according to the constraint characteristics of the model,it presented a kind of coding adjustment mode which was based on ordering mapping,and introduced a kind of nonlinear expansion contraction factor adaptive adjustment method. In the end,it embedded an effective way which could judges and avoids searching precocity and stagnation in algorithm. Through comparison of simulation validation,the improved algorithm had superior speed of convergence and stability. The experimental results show that the proposed method can effectively solve the WTA problem.

关 键 词：目标分配 量子粒子群优化算法 排序映射 编码调整 扩张收缩因子 

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