Grouping-Shuffling particle swarm optimization: an improved PSO for continuous optimization

Authors:
Yinghai Li;Xiaohua Dong;Ji Liu
Affiliations:
College of Hydraulic & Environmental Engineering, China Three Gorges University, Yichang, Hubei, China;College of Hydraulic & Environmental Engineering, China Three Gorges University, Yichang, Hubei, China;College of Hydraulic & Environmental Engineering, China Three Gorges University, Yichang, Hubei, China
Venue:
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Year:
2010

Citing 4
Cited 0

Parameter Selection in Particle Swarm Optimization

EP '98 Proceedings of the 7th International Conference on Evolutionary Programming VII
Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm

Soft Computing - A Fusion of Foundations, Methodologies and Applications
The Chaos-Based Shuffled Frog Leaping Algorithm and Its Application

ICNC '08 Proceedings of the 2008 Fourth International Conference on Natural Computation - Volume 01
Comparison among five evolutionary-based optimization algorithms

Advanced Engineering Informatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a novel population-based evolution algorithm named grouping-shuffling particle swarm optimization (GSPSO) by hybridizing particle swarm optimization (PSO) and shuffled frog leaping algorithm (SFLA) for continuous optimization problems In the proposed algorithm, each particle automatically and periodically executes grouping and shuffling operations in its flight learning evolutionary process By testing on 4 benchmark functions, the numerical results demonstrate that, the optimization performance of the proposed GSPSO is much better than PSO and SFLA The GSPSO can both avoid the PSO's shortage that easy to get rid of the local optimal solution and has faster convergence speed and higher convergence precision than the PSO and SFLA.