A New Dynamic Particle Swarm Optimizer

  • Binbin Zheng
  • Yuanxiang Li
  • Xianjun Shen
  • Bojin Zheng
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4247)


This paper presents a new optimization model— Dynamic Particle Swarm Optimizer (DPSO). A new acceptance rule that based on the principle of minimal free energy from the statistical mechanics is introduced to the standard particle swarm optimizer. A definition of the entropy of the particle system is given. Then the law of entropy increment is applied to control the algorithm. Simulations have been done to illustrate the significant and effective impact of this new rule on the particle swarm optimizer.


Particle Swarm Optimization Particle Swarm Local Extremum Minimal Free Energy Standard Particle Swarm Optimizer 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)Google Scholar
  2. 2.
    Solis, F., Wets, R.: Minimization by random search techniques. Mathematics of Operations Research 6(11), 19–30 (1981)MATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Van den Bergh, F.: An Analysis of Particle Swam Optimizers. PhD thesis, University of Pretoria (2000)Google Scholar
  4. 4.
    Davis, L.: Genetic Algorithms and Simulated Annealing. Morgan Kaufmann, San Francisco (1987)MATHGoogle Scholar
  5. 5.
    Hu, T., Li, Y., Ding, W.: A new dynamical evolutionary algorithm based on the principle of minimal free energy. In: Kang, L. (ed.) International Symposium on Intelligent Computation and its Application, ISICA 2005, Wuhan, China, pp. 749–754 (2005)Google Scholar
  6. 6.
    Li, Y., Zou, X., Kang, L., Michalewicz, Z.: A new dynamical evolutionary algorithm based on statistical mechanics. Journal of Computer Science and Technology 18(3), 361–368 (2003)MATHCrossRefGoogle Scholar
  7. 7.
    Zbigniew, M.: Genetic algorithms + Data structures= Evolution programs. Springer, Berlin (1996)MATHGoogle Scholar
  8. 8.
    Ge, R.: The globally convexized filled functions for global optimization. Applied Mathematics and Computation 1(35), 131–158 (1990)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Binbin Zheng
    • 1
  • Yuanxiang Li
    • 1
  • Xianjun Shen
    • 1
  • Bojin Zheng
    • 2
  1. 1.State Key Lab. of Software EngineeringWuhan UniversityWuhanChina
  2. 2.College of Computer ScienceSouth-Central University For NationalitiesWuhanChina

Personalised recommendations