混合自适应量子粒子群优化算法
详细信息    查看全文 | 推荐本文 |
  • 英文篇名:Hybrid adaptive quantum particle swarm optimization algorithm
  • 作者:赵国新 ; 陈志炼 ; 魏战红
  • 英文作者:ZHAO Guo-xin;CHEN Zhi-lian;WEI Zhan-hong;College of Information Technology,Beijing Institute of Petrochemical Technology;College of Information Science and Technology,Beijing University of Chemical Technology;
  • 关键词:量子粒子群优化算法 ; 收缩—扩张系数 ; 差分策略 ; Levy飞行策略
  • 英文关键词:quantum particle swarm optimization algorithm;;contraction-expansion coefficient;;differential strategy;;Levy flight strategy
  • 中文刊名:WXYJ
  • 英文刊名:Microelectronics & Computer
  • 机构:北京石油化工学院信息工程学院;北京化工大学信息科学与技术学院;
  • 出版日期:2019-07-05
  • 出版单位:微电子学与计算机
  • 年:2019
  • 期:v.36;No.422
  • 基金:北京市自然科学基金(4174089)
  • 语种:中文;
  • 页:WXYJ201907015
  • 页数:6
  • CN:07
  • ISSN:61-1123/TN
  • 分类号:83-87+93
摘要
为解决量子粒子群优化算法在迭代后期出现的种群多样性低导致的早熟收敛、陷入局部最优的问题,提出三点改进:(1)将收缩—扩张系数与适应度值联系起来,收缩—扩张系数会随着粒子的适应度值的改变而自适应调整;(2)使用差分策略更新粒子的随机位置,使得粒子向种群最优位置靠近;(3)粒子位置的更新加入Levy飞行策略,利用Levy飞行策略的偶尔长距离的跳跃,使得种群多样性增加,提高了跳出局部最优的能力,综合以上三点,提出一种混合自适应量子粒子群优化算法(HAQPSO).通过对比各个算法在6个典型函数的仿真测试结果表明:HAQPSO具有更好的全局收敛能力,且收敛精度、速度和稳定性都有明显的提升.
        To solve the problem of quantum particle swarm optimization algorithm appears the poor diversity of population at the end of iteration,three improvements are proposed:(1)associating the contraction-expansion coefficient with the fitness value,the contraction-expansion coefficient will adjust adaptively with the change of the fitness value of the particle;(2)differential strategy is used to update the random location of particles which makes the particle approach the optimal position of the population;.(3)updating particle position with Levy flight strategy,Levy flight strategy′s occasional long jumps are utilized to increase the diversity of population and the ability of jump out of the local optimum.A hybrid adaptive quantum particle swarm optimization(HAQPSO)algorithm is proposed based on the above three points.By comparing the simulation result of 6 typical functions shows that:Improved quantum particle swarm optimization algorithm has better global convergence ability than the quantum particle swarm optimization algorithm,and the convergence precision,speed and stability are improved obviously.
引文
[1]VAN DEN BERGH F.An analysis of particle swarm optimizers[D].Hatfield,South Africa:University of Pretoria,2002.
    [2]SUN J,FENG B,XU W B.Particle swarm optimization withparticles having quantum behavior[C]//Proceedings of 2004Congress on Evolutionary Computation.Piscataway,NJ,USA:IEEE,2004:325-331.
    [3]陈汉武,朱建锋,阮越.带交叉算子的量子粒子群优化算法[J].东南大学学报(自然科学版),2016,46(1):23-29.
    [4]关学忠,皇甫旭,李欣,等.基于正态云模型的自适应变异量子粒子群优化算法[J].电子设计工程,2016,24(8):64-67.
    [5]方伟,孙俊,谢振平.量子粒子群优化算法的收敛性分析及控制参数研究[J].物理学报,2010,59(6):3686-3694.
    [6]丁青锋,尹晓宇.差分进化算法综述[J].智能系统学报,2017,12(4):431-432.
    [7]CHECHKINA V,METZLER R,KLAFTER J,et al.Introduction to the theory of Levy flights[C]//Anomalous Transport:Foundations and Applications.Weinheim:John Wiley Sons,2008:129-162.
    [8]刘长平,叶春明.具有Levy飞行特征的蝙蝠算法[J].智能系统学报,2013,8(3):240-246.
    [9]ZHANG Y,WANG L,WU Q.Modified adaptive Cuckoo search(MACS)algorithm and formal description for global optimization[J].Int J of Computer Applications in Technology,2012,44(2):73-79.
    [10]张前图,房立清,赵玉龙.具有Levy飞行特征的双子群果蝇优化算法[J].计算机应用,2015,35(5):1348-1352.
    [11]徐建波,戴月明,严大虎.双自适应人工鱼群优化算法[J].微电子学与计算机,2018,35(4):54-57.
    [12]罗佳,唐斌.新型灰狼优化算法在函数优化中的应用[J].兰州理工大学学报,2016,43(3):96-101.
    [13]张慕雪,张达敏,何锐亮.基于模式搜索法的鸡群优化算法[J].微电子学与计算机,2018,35(4):46-52.

© 2004-2018 中国地质图书馆版权所有 京ICP备05064691号 京公网安备11010802017129号

地址:北京市海淀区学院路29号 邮编:100083

电话:办公室:(+86 10)66554848;文献借阅、咨询服务、科技查新:66554700