Advertisement

An Improved Probability Particle Swarm Optimization Algorithm

  • Qiang Lu
  • Xuena Qiu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6145)

Abstract

This paper deals with the problem of unconstrained optimization. An improved probability particle swarm optimization algorithm is proposed. Firstly, two normal distributions are used to describe the distributions of particle positions, respectively. One is the normal distribution with the global best position as mean value and the difference between the current fitness and the global best fitness as standard deviation while another is the distribution with the previous best position as mean value and the difference between the current fitness and the previous best fitness as standard deviation. Secondly, a disturbance on the mean values is introduced into the proposed algorithm. Thirdly, the final position of particles is determined by employing a linear weighted method to cope with the sampled information from the two normal distributions. Finally, benchmark functions are used to illustrate the effectiveness of the proposed algorithm.

Keywords

Normal distribution probability particle swarm optimization evolutionary computation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: IEEE International Conference on Neural Network, pp. 1942–1948. IEEE Press, New York (1995)Google Scholar
  2. 2.
    Eberhart, R.C., Kennedy, J.: A New Optimizer Using Particle Swarm Theory. In: 6th International Symposium on Micro Machine and Human Science, pp. 39–43. IEEE Press, New York (1995)CrossRefGoogle Scholar
  3. 3.
    Lu, Q., Chen, R.-Q., Yu, J.-S.: Quantum Continuous Particle Swarm Optimization Algorithm and Its Application. System Engineering-Theory and Practice 28, 122–130 (2008)Google Scholar
  4. 4.
    Liu, B., Wang, L., Jin, Y.-H.: Improved Particle Swarm Optimization Combined with Chaos. Chaos, Solitons and Fractals 25, 1261–1271 (2005)zbMATHCrossRefGoogle Scholar
  5. 5.
    Shelokar, P.S., Siarry, P., Jayaraman, V.K.: Particle Swarm and Ant Colony Algorithms Hybridized for Improved Continuous Optimization. Applied Mathematics and Computation 188, 129–142 (2005)CrossRefMathSciNetGoogle Scholar
  6. 6.
    Kennedy, J.: Bare Bones Particle Swarms. In: Swarm Intelligence Symposium, pp. 80–87. IEEE Press, New York (2003)Google Scholar
  7. 7.
    Lu, Q., Qiu, X., Liu, S.: A Discrete Particle Swarm Optimization Algorithm with Fully Communicated Information. In: ACM/SIGEVO Summit on Genetic and Evolutionary Computation, pp. 393–400. ACM Press, New York (2009)CrossRefGoogle Scholar
  8. 8.
    Lu, Q., Liu, S., Qiu, X.: Design and Realization of Particle Swarm Optimization Based on Pheromone Mechanism. Acta Automatica Sinica 35, 1410–1419 (2009)CrossRefGoogle Scholar
  9. 9.
    Krohiling, R.A.: Gaussian Particle Swarm with Jumps. In: IEEE Congress on Evolutionary Computation, pp. 1226–1231. IEEE Press, New York (2005)CrossRefGoogle Scholar
  10. 10.
    Krohiling, R.A., Mendel, E.: Bare Bones Particle Swarm Optimization with Gaussian or Cauchy jumps. In: IEEE Congress on Evolutionary Computation, pp. 3285–3291. IEEE Press, New York (2009)CrossRefGoogle Scholar
  11. 11.
    Secrest, B.R., Lamont, G.B.: Visualizing Particle Swarm Optimization-Gaussian Particle Swarm Optimization. In: Swarm Intelligence Symposium, pp. 198–204. IEEE Press, New York (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Qiang Lu
    • 1
  • Xuena Qiu
    • 2
  1. 1.School of AutomationHangzhou Dianzi UniversityHangzhouChina
  2. 2.School of TelecommunicationNingbo University of TechnologyNingboChina

Personalised recommendations