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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shelokar, P.S., Siarry, P., Jayaraman, V.K., Kulkarni, B.D.: Particle swarm and ant colony algorithms hybridized for improved continuous optimization. Applied Mathematics and Computation 188(1), 129–142 (2007)
Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: IEEE International Conference Neural Networks, pp. 1942–1948 (1995)
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)
Eusuff, M.M., Lansey, K.E.: Optimization of water distribution network design using the shuffled frog leaping algorithm. Journal of Water Resources Planning and Management 129(3), 210–225 (2003)
Elbeltagi, E., Hegazy, T., Grierson, D.: Comparison among five evolutionary-based optimization algorithms. Advanced Engineering Informatics 19(1), 43–53 (2005)
Alireza, R.V., Ali, H.M.: Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm. Soft Comput. 12, 435–452 (2008)
Elbehairy, H., Elbeltagi, E., Hegazy, T., Soudki, K.: Comparison of Two Evolutionary Algorithms for Optimization of Bridge Deck Repairs. Computer-Aided Civil and Infrastructure Engineering 21, 561–572 (2006)
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)
Eusuff, M.M., Lansey, K.E., Pasha, F.: Shuffled frog-leaping algorithm: a memetic meta-heuristic for discrete optimization. Engineering Optimization 38(2), 129–154 (2006)
Shi, Y., Eberhart, R.C.: Parameter Selection in Particle Swarm Optimization. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 591–600. Springer, Heidelberg (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, Y., Dong, X., Liu, J. (2010). Grouping-Shuffling Particle Swarm Optimization: An Improved PSO for Continuous Optimization. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13495-1_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-13495-1_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13494-4
Online ISBN: 978-3-642-13495-1
eBook Packages: Computer ScienceComputer Science (R0)