.png){kind=icon}
.png){kind=icon}
Return
A collaboration-based particle swarm optimizer for global optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1007/s13042-018-0810-0.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces a collaboration-based particle swarm optimizer (PSO) by incorporating three new strategies: a global learning strategy, a probability of learning, and a worst replacement swarm update rule. Instead of learning from the personal historical best position and the global (or local) best position which was used by the classical PSO, a target particle learns from another randomly chosen particle and the global best one in the swarm. Instead of accepting a new velocity directly, the velocity updates according to a learning probability, according to which the velocity of the target particle in each dimension updates via learning from other particles or simply inherits its previous velocity component. Since each particle has the same chance to be selected as a leader, the worst particle might influence the whole swarm's performance. Therefore, the worst particle in the swarm in each update is moved to a new better position generated from another particle. The proposed algorithm is shown to be statistically significantly better than six other state-of-the-art PSO variants on 20 typical benchmark functions with three different dimensionalities.
Keywords:
Collaboration
Global learning
Particle swarm optimization
Learning probability
Worst replacement
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
2.7
Papers:
3.1K
Citations:
5.6K