Swarm intelligence
An adaptive pursuit strategy for allocating operator probabilities
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Evolutionary programming made faster
IEEE Transactions on Evolutionary Computation
The fully informed particle swarm: simpler, maybe better
IEEE Transactions on Evolutionary Computation
A Cooperative approach to particle swarm optimization
IEEE Transactions on Evolutionary Computation
Comprehensive learning particle swarm optimizer for global optimization of multimodal functions
IEEE Transactions on Evolutionary Computation
Diversity enhanced particle swarm optimization with neighborhood search
Information Sciences: an International Journal
Hi-index | 0.00 |
Traditional particle swarm optimization (PSO) suffers from the premature convergence problem, which usually results in PSO being trapped in local optima. This paper presents an adaptive learning PSO (ALPSO) based on a variant PSO learning strategy. In ALPSO, the learning mechanism of each particle is separated into three parts: its own historical best position, the closest neighbor and the global best one. By using this individual level adaptive technique, a particle can well guide its behavior of exploration and exploitation. A set of 21 test functions were used including un-rotated, rotated and composition functions to test the performance of ALPSO. From the comparison results over several variant PSO algorithms, ALPSO shows an outstanding performance on most test functions, especially the fast convergence characteristic.