.png){kind=icon}
返回
Composite Particle Swarm Optimizer With Historical Memory for Function Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TCYB.2015.2424836.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Particle swarm optimization (PSO) algorithm is a population-based stochastic optimization technique. It is characterized by the collaborative search in which each particle is attracted toward the global best position (gbest) in the swarm and its own best position (pbest). However, all of particles' historical promising pbests in PSO are lost except their current pbests. In order to solve this problem, this paper proposes a novel composite PSO algorithm, called historical memorybased PSO (HMPSO), which uses an estimation of distribution algorithm to estimate and preserve the distribution information of particles' historical promising pbests. Each particle has three candidate positions, which are generated from the historical memory, particles' current pbests, and the swarm's gbest. Then the best candidate position is adopted. Experiments on 28 CEC2013 benchmark functions demonstrate the superiority of HMPSO over other algorithms.
Keyword:
Estimation of distribution algorithm (EDA)
historical memory
particle swarm optimization (PSO)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
1.1W
被引数:
5.0W
机构
引用论文
Introduction: Practices, Strategies, and Methodologies of Experimental Control in Historical Perspective.png)
Archimedes
OAAI
ArchimedesIF0
OAAI分享收藏An adaptive particle swarm optimization method based on clustering一种基于聚类的自适应粒子群优化方法SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
PREAI
分享收藏
查看更多内容