Skip to main content

A New Dynamic Particle Swarm Optimizer

  • Conference paper
Book cover Simulated Evolution and Learning (SEAL 2006)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4247))

Included in the following conference series:

  • 1431 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

  2. Solis, F., Wets, R.: Minimization by random search techniques. Mathematics of Operations Research 6(11), 19–30 (1981)

    Article  MATH  MathSciNet  Google Scholar 

  3. Van den Bergh, F.: An Analysis of Particle Swam Optimizers. PhD thesis, University of Pretoria (2000)

    Google Scholar 

  4. Davis, L.: Genetic Algorithms and Simulated Annealing. Morgan Kaufmann, San Francisco (1987)

    MATH  Google Scholar 

  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. 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)

    Article  MATH  Google Scholar 

  7. Zbigniew, M.: Genetic algorithms + Data structures= Evolution programs. Springer, Berlin (1996)

    MATH  Google Scholar 

  8. Ge, R.: The globally convexized filled functions for global optimization. Applied Mathematics and Computation 1(35), 131–158 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zheng, B., Li, Y., Shen, X., Zheng, B. (2006). A New Dynamic Particle Swarm Optimizer. In: Wang, TD., et al. Simulated Evolution and Learning. SEAL 2006. Lecture Notes in Computer Science, vol 4247. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11903697_61

Download citation

  • DOI: https://doi.org/10.1007/11903697_61

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47331-2

  • Online ISBN: 978-3-540-47332-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics