An Improved Particle Swarm Optimization Algorithm with Quadratic Interpolation

  • Fengli Zhou
  • Haiping Yu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7996)


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.


Particle Swarm Optimization Convergence Speed Quadratic Interpolation Global Optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    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)Google Scholar
  2. 2.
    Kennedy, J., Eberhart, R.C.: Particle swarm optimization. In: Proceedings IEEE International Conference on Neural Networks, Perth, pp. 1942–1948 (1995)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    Cai, X.J., Cui, Z.H., Zeng, J.C.: Dispersed particle swarm optimization. Information Processing Letters, 231–235 (2008)Google Scholar
  6. 6.
    Luo, Q., Yi, D.: Co-evolving framework for robust particle swarm optimization. Applied Mathematics and Computation, 611–622 (2008)Google Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Sheloka, P., Siarry, P., Jayaraman, V.: Particle swarm and ant colony algorithms hybridized for improved continuous optimization. Applied Mathematics and Computation, 129–142 (2007)Google Scholar
  9. 9.
    Gao, S., Yang, J.Y.: Swarm Intelligence Algorithm and Applications, pp. 112–117. China Water Power Press, Beijing (2006)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    Wang, Y.S., Li, J.L.: Centroid Particle Swarm Optimization Algorithm. Computer Engineering and Application 47(3), 34–37 (2011)Google Scholar
  12. 12.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Fengli Zhou
    • 1
  • Haiping Yu
    • 1
  1. 1.Faculty of Information EngineeringCity College Wuhan University of Science and TechnologyWuhanChina

Personalised recommendations