Abstract
In order to overcome the problems of premature convergence frequently in Particle Swarm Optimization(PSO), an improved PSO is proposed(IPSO). After the update of the particle velocity and position, two positions from set of the current personal best position are closed at random. A new position is produced by the quadratic interpolation given through three positions, i.e., global best position and two other positions. The current personal best position and the global best position are updated by comparing with the new position. Simulation experimental results of six classic benchmark functions indicate that the new algorithm greatly improves the searching efficiency and the convergence rate of 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
Eberhart, R.C., Kennedy, J.: A new Optimizer using particles swarm theory. In: Proceedings Sixth International Symposium on Micro Machine and Human Science, Nagoya, Japan, pp. 39–43 (1995)
Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings IEEE International Conference on Neural Networks, Perth, pp. 1942–1948 (1995)
Shi, Y.H., Eberhart, R.C.: A modified particle swarm optimizer. In: IEEE International Conference on Evolutionary Computation, Anchorage, Alaska, May 4-9, pp. 69–73 (1998)
Kennedy, J.: The Particle swarm: Social Adaptation of Knowledge. In: Proceedings of the 1997 International Conference on Evolutionary Computation, pp. 303–308. IEEE Press (1997)
Cai, X.J., Cui, Z.H., Zeng, J.C.: Dispersed particle swarm optimization. Information Processing Letters, 231–235 (2008)
Luo, Q., Yi, D.: Co-evolving framework for robust particle swarm optimization. Applied Mathematics and Computation, 611–622 (2008)
Shi, Y., Everhart, R.C.: Empirical study of particle swarm optimization. In: Proceedings of Congress on Computational Intelligence, Washington DC, USA, pp. 1945–1950 (1999)
Sheloka, P., Siarry, P., Jayaraman, V.: Particle swarm and ant colony algorithms hybridized for improved continuous optimization. Applied Mathematics and Computation, 129–142 (2007)
Gao, S., Yang, J.Y.: Swarm Intelligence Algorithm and Applications, pp. 112–117. China Water Power Press, Beijing (2006)
Gao, S., Tang, K.Z., Jiang, X.Z., Yang, J.Y.: Convergence Analysis of Particle Swarm Optimization Algorithm. Science Technology and Engineering 6(12), 1625–1627 (2006)
Wang, Y.S., Li, J.L.: Centroid Particle Swarm Optimization Algorithm. Computer Engineering and Application 47(3), 34–37 (2011)
Chi, Y.C., Fang, J.: Improved Particle Swarm Optimization Algorithm Based on Niche and Crossover Operator. Journal of System Simulation 22(1), 111–114 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhou, F., Yu, H. (2013). An Improved Particle Swarm Optimization Algorithm with Quadratic Interpolation. In: Huang, DS., Jo, KH., Zhou, YQ., Han, K. (eds) Intelligent Computing Theories and Technology. ICIC 2013. Lecture Notes in Computer Science(), vol 7996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-39482-9_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-39482-9_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-39481-2
Online ISBN: 978-3-642-39482-9
eBook Packages: Computer ScienceComputer Science (R0)