Grouping-Shuffling Particle Swarm Optimization: An Improved PSO for Continuous Optimization
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.
KeywordsParticle swarm optimization Shuffled frog leaping algorithm Evolution strategy Continuous optimization
Unable to display preview. Download preview PDF.
- 2.Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: IEEE International Conference Neural Networks, pp. 1942–1948 (1995)Google Scholar
- 3.Ebehtart, R.C., Kennedy, J.: A new optimizer using Particle swarm theory. In: Proceedings of the Sixth International Symposium on Micro Machine and Human Seienee, Nagoya, Japan, pp. 39–43 (1995)Google Scholar
- 8.Li, Y., Zhou, J., Yang, J., Liu, L., Qin, H., Yang, L.: The Chaos-based Shuffled Frog Leaping Algorithm and Its Application. In: Fourth International Conference on Natural Computation, vol. 1, pp. 481–485 (2008)Google Scholar