一种并行的自适应量子粒子群算法  

Method of Parallel Adaptive Quantum Particle Swarm Optimization

作　　者：熊智挺[1] 谭阳红[1] 易如方[1] 陈赛华[1] 

机构地区：[1]湖南大学电气与信息工程学院,长沙410082

出　　处：《计算机系统应用》2011年第8期47-51,71,共6页Computer Systems & Applications

基　　金：国家自然科学基金(60876022;50925727);高技术与发展基金(2006AA04A104);湖南省自然基金(07JJ6132);中央高校基本科研业务费

摘　　要：针对粒子群算法存在易陷入局部最优解的问题,提出了一种并行的自适应量子粒子群算法。通过共享粒子的两个极值,将改进后的自适应粒子群算法和边界变异的量子粒子群算法并行搜索,有效地克服了标准粒子群算法的缺陷。测试结果表明,该算法在精度和全局最优解的找寻速度方面有了很大的提高。A new parallel adaptive quantum particle swarm opitimzation algorithm is proposed in this paper to solve the problem that standard particle swarm optimization（PSO） algorithm may easily trap into local optimal points and may obtain exact solutions at the late of the iteration with difficultly. By sharing the two extreme values of the particles, the proposed method is able to adaptively search their optimum solutions in parallel by combination of an improved adaptive PSO with a quantum Particle Swarm Optimization of boundary variation. It is proved effectively to overcome the shortcomings of standard PSO. Test results show that the accuracy and the velocity of global search for optimal solutions have been greatly improved.

关 键 词：自适应粒子群算法 量子粒子群算法 并行搜索 

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