+高级检索
面向多模态函数的自适应混沌爬山微粒群算法
DOI:
作者:
作者单位:

作者简介:

通讯作者:

基金项目:


An Adaptive Chaotic Hill-climbing Particle Swarm Optimization Algorithm for Multimodal Functions
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
    摘要:

    针对微粒群算法在多模态函数优化中难以找到全部极值点以及陷入局部最优和后期收敛速度慢等缺陷,提出了一种基于熵的自适应混沌爬山微粒群算法.算法根据熵的值来衡量种群多样性,当发现种群多样性匮乏时,采用动态混沌机制增强多样性;后期融入了局部收敛速度较快的爬山算法提高微粒群算法的后期收敛速度.4种典型多模态函数测试结果表明该算法在求解复杂多模态函数优化问题方面的可行性。

    Abstract:

    An adaptive chaotic hill-climbing particle swarm optimization was presented in order to overcome the unability to find all extreme points, local optimum and slow convergence speed at later time caused by Particle Swarm Optimization (PSO) in multimodal function optimization. An improved PSO was proposed , and the population of diversity was measured by entropy. A dynamic chaos mechanism was used to increase the diversity when there is a lack of population diversity, and a hill-climbing method was introduced to improve the convergence speed of PSO in later period. Four kinds of typical multimodal functions were chosen to test the performance of the improved algorithm in solving complex multimodal function optimization problems. The results show that the improved algorithm has better performance than the existing algorithms.

    参考文献
    相似文献
    引证文献
文章指标
  • PDF下载次数:
  • HTML阅读次数:
  • 摘要点击次数:
  • 引用次数:
引用本文

张英杰,郭会芳,付海滨,范朝冬.面向多模态函数的自适应混沌爬山微粒群算法[J].湖南大学学报:自然科学版,2013,40(2):77~81

复制
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期:
  • 出版日期:
作者稿件一经被我刊录用,如无特别声明,即视作同意授予我刊论文整体的全部复制传播的权利,包括但不限于复制权、发行权、信息网络传播权、广播权、表演权、翻译权、汇编权、改编权等著作使用权转让给我刊,我刊有权根据工作需要,允许合作的数据库、新媒体平台及其他数字平台进行数字传播和国际传播等。特此声明。
关闭