Abstract
A shuffled complex evolution of particle swarm optimization algorithm called SCE-PSO is introduced in this paper. In the SCE-PSO, a population of points is sampled randomly in the feasible space. Then the population is partitioned into several complexes, which is made to evolve based on PSO. At periodic stages in the evolution, the entire population is shuffled and points are reassigned to complexes to ensure information sharing. Both theoretical and numerical studies of the SCE-PCO are presented. Five optimization problems with commonly used functions are utilized for evaluating the performance of the proposed algorithm, and the performance of the proposed algorithm is compared to PSO to demonstrate its efficiency.
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
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, Piscataway, NJ, pp. 1942–1948 (1995)
Eberhart, R.C., Kennedy, J.: A new optimizer using particle swarm theory. In: Proceedings of the Sixth International Symposium on Micromachine and Human Science, Nagoya, Japan, pp. 39–43 (1995)
Angeline, P.J.: Using selection to improve particle swarm optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation (CEC 1998), Anchorage, Alaska, USA, pp. 84–89 (1998)
Løvbjerg, M., Rasmussen, T.K., Krink, T.: Hybrid particle swarm optimiser with breeding and subpopulations. In: Proceedings of the Genetic and Evolutionary Computation Conference (2001)
Parsopoulos, K.E., Plagianakos, V.P., Magoulas, G.D., Vrahatis, M.N.: Improving particle swarm optimizer by function "stretching". Advances in Convex Analysis and Global Optimization, 445–457 (2001)
Parsopoulos, K.E., Plagianakos, V.P., Magoulas, G.D., Vrahatis, M.N.: Stretching technique for obtaining global minimizers through particle swarm optimization. In: Proceedings of the Workshop on Particle Swarm Optimization, Indianapolis, IN (2001)
Parsopoulos, K.E., Vrahatis, M.N.: Initializing the particle swarm optimizer using the nonlinear simplex Method. In: Advances in Intelligent Systems, Fuzzy Systems, Evolutionary Computation, pp. 216–221. WSEAS Press (2002)
Higashi, N., Iba, H.: Particle swarm optimization with gaussian mutation. In: Proceedings of the IEEE Swarm Intelligence Symposium 2003, Indianapolis, Indiana, USA, pp. 72–79 (2003)
Shi, X., Lu, Y., Zhou, C., Lee, H., Lin, W., Liang, Y.: Hybrid evolutionary algorithms based on PSO and GA. In: Proceedings of IEEE Congress on Evolutionary Computation 2003, Canberra, Australia, pp. 2393–2399 (2003)
Wang, X.H., Li, J.J.: Hybrid particle swarm optimization with simulated annealing. In: Proceedings of the International Conference on Machine Learning and Cybernetics, Shanghai, pp. 2402–2405 (2004)
Duan, Q.Y., Sorooshian, S., Gupta, V.K.: Effective and efficient global optimization for conceptual rainfall-runoff models. Water Resources Research 28, 1015–1031 (1992)
Van den Bergh, F.: An analysis of particle swarm optimizers. Department of Computer Science, University of Pretoria, South Africa (2002)
Trelea, I.C.: The particle swarm optimization algorithm: convergence analysis and parameter selection. Information Processing Letters 85, 317–325 (2003)
Clerc, M.: The swarm and the queen: towards a deterministic and adaptive particle swarm optimization. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1951–1957 (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Yan, J., Tiesong, H., Chongchao, H., Xianing, W., Faling, G. (2007). A Shuffled Complex Evolution of Particle Swarm Optimization Algorithm. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71618-1_38
Download citation
DOI: https://doi.org/10.1007/978-3-540-71618-1_38
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-71589-4
Online ISBN: 978-3-540-71618-1
eBook Packages: Computer ScienceComputer Science (R0)