首页 | 本学科首页   官方微博 | 高级检索  
   检索      

一种改进的量子粒子群算法
引用本文:彭广,方洋旺,张磊,刁兴华,徐洋.一种改进的量子粒子群算法[J].火力与指挥控制,2016(7):92-96.
作者姓名:彭广  方洋旺  张磊  刁兴华  徐洋
作者单位:空军工程大学航空航天工程学院,西安,710038
基金项目:中国博士后科学基金资助项目(2014M562630)
摘    要:量子粒子群算法是将量子计算与粒子群算法相结合的一种新的优化方法。首先利用相位角进行实数编码,将动态量子旋转门引入到粒子群算法中,采用自适应变异,提出了一种改进的量子粒子群算法。然后运用Pe-nalized函数和Ackley函数测试了该算法的性能。最后将该算法应用到武器目标分配模型中,获得了最优的分配方案。仿真研究表明,该算法具有收敛速度快、搜索能力强和稳定性高的特点。

关 键 词:量子粒子群算法  实数编码  动态量子旋转门  自适应变异  武器目标分配

Research on an Improved Quantum Particle Swarm Optimization Algorithm
Abstract:Quantum particle swarm optimization algorithm is a new algorithm based on the combination of quantum algorithm and particle swarm optimization algorithm. In this paper,an improved quantum particle swarm optimization algorithm is proposed:first,using the phase angle to encode quantum chromosome;second,the dynamic quantum rotation gate is introduced to particle swarm optimization;third,the adaptive mutation is applied. Furthermore,the performance of the algorithm is tested by Penalized function and Ackley function. Finally,the weapon target assignment model is solved by the improved quantum particle swarm optimization algorithm to obtain the optimal assignment. The simulative results show that the proposed algorithm has the characteristics of rapider convergence, powerful global search capability and better stability.
Keywords:quantum particle swarm optimization algorithm  real-coded  dynamic quantum rotation gate  adaptive mutation  weapon target assignment
本文献已被 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号