Abstract
Due to the deficiency of characteristics of objective function, such as the function derivative, the solutions can only be iterated according to the evolutionary equations of Particle Swarm Optimization (PSO) with the finite information about current swarm state. But in the evolutionary process of PSO, the distribution characteristics of solutions of the objective function are hidden in the many and many fitness evaluations while the evolutionary equations are iterating. The evolutionary strategies, including the balance strategy between the exploration and exploitation, the re-initialization strategy and the generation strategy of new solution from the elite particles, are designed innovatively according to the distribution characteristics of the swarm solutions extracting statistically from the historical evaluations. The experimental results show that these strategies are effective for the optimization precise and efficiency in the early evolutionary process although the complexity of time and space are increased lightly than that of the standard PSO.
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.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, pp. 1942–1948. IEEE, Perth (1995)
Clerc, M.: Stagnation analysis in particle swarm optimization or what happens when nothing happens, http://clerc.maurice.free.fr/pso/stagnationanalysis
Liang, J., Qin, A., Suganthan, P., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Transactions on Evolutionary Computation 10(3), 281–295 (2006)
Kennedy, J., Mendes, R.: Neighborhood topologies in fully informed and best-of-neighborhood particle swarms. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Application and Reviews 36(4), 515–519 (2006)
Mendes, R., Kennedy, J., Neves, J.: The fully informed particle swarm: simpler, may be better. IEEE Transactions on Evolutionary Computation 8(3), 204–210 (2004)
Hsieh, S., Sun, T., Liu, C., Tsai, S.: Efficient population utilization strategy for particle swarm optimizer. IEEE Transaction on Systems, Man and Cybernetics, Part B: Cybernetics 39(2), 444–456 (2009)
Helwig, S., Wanka, R.: Theoretical Analysis of Initial Particle Swarm Behavior. In: Rudolph, G., Jansen, T., Lucas, S., Poloni, C., Beume, N. (eds.) PPSN 2008. LNCS, vol. 5199, pp. 889–898. Springer, Heidelberg (2008)
Said, M., Ahamed, A.: Hybrid periodic boundary condition for particle swarm optimization. IEEE Transactions on Antennas and Propagation 55(11), 3251–3256 (2007)
Tang, Y., Wang, Z.-D., Fang, J.-A.: Feedback Learning Particle Swarm Optimization. Applied Soft Computing 11, 4713–4725 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hu, W., Hu, Jj., Zhang, X. (2012). The Improved Particle Swarm Optimization Based on Swarm Distribution Characteristics. In: Lei, J., Wang, F.L., Deng, H., Miao, D. (eds) Artificial Intelligence and Computational Intelligence. AICI 2012. Lecture Notes in Computer Science(), vol 7530. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33478-8_85
Download citation
DOI: https://doi.org/10.1007/978-3-642-33478-8_85
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33477-1
Online ISBN: 978-3-642-33478-8
eBook Packages: Computer ScienceComputer Science (R0)