摘要
针对标准粒子群算法存在收敛速度慢和难以跳出局部最优等问题,提出了基于健康度的自适应过滤粒子群算法。首先,通过对粒子健康度的动态检测,区分粒子状态,处理并标记异常粒子,自适应过滤懒惰粒子位置,避免算法陷入局部最优;其次,利用引导因子更新全局最差粒子值,过滤异常粒子数,避免无效搜索,加快算法收敛速度。通过对11个标准函数进行仿真实验,并与标准粒子群和其他改进算法进行对比,结果表明,基于健康度的自适应过滤粒子群算法寻优精度高,收敛速度快。
Since the standard particle swarm optimization(PSO) algorithm converges slowly and is easy to fall into local optimization, this paper proposes the PSO algorithm with adaptive filter based on health degree(HAFPSO).Firstly, the algorithm can determine the particles state by detecting particle health degree and mark ill particles at the same time. In order to avoid invalid search, the algorithm adapts to filter the ill particles position and update a new position. In order to further improve the algorithm convergence speed and accuracy, the proposed algorithm adopts the guidance factor to update the global worst particle. Compared with standard particle swarm optimization and other optimization algorithms with 11 benchmark functions, the experimental results show that HAFPSO can improve convergence speed and accuracy significantly.
出处
《计算机科学与探索》
CSCD
北大核心
2018年第2期332-340,共9页
Journal of Frontiers of Computer Science and Technology
基金
江苏省高校研究生科研创新计划No.KYLX15_1169
江苏高校优势学科建设工程资助项目~~
关键词
粒子群算法
健康度
自适应过滤
懒惰粒子
引导因子
收敛速度
particle swarm optimization
health degree
adaptive filter
lazy particle
guidance factor
convergence speed