Skip to main content

Quantum-Behaved Particle Swarm Optimization Algorithm with Controlled Diversity

  • Conference paper

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

Abstract

Premature convergence, the major problem that confronts evolutionary algorithms, is also encountered with the Particle Swarm Optimization (PSO) algorithm. In the previous work [11], [12], [13], the Quantum-behaved Particle Swarm (QPSO) is proposed. This novel algorithm is a global-convergence-guaranteed and has a better search ability than the original PSO. But like other evolutionary optimization technique, premature in the QPSO is also inevitable. In this paper, we propose a method of controlling the diversity to enable particles to escape the sub-optima more easily. Before describing the new method, we first introduce the origin and development of the PSO and QPSO. The Diversity-Controlled QPSO, along with the PSO and QPSO is tested on several benchmark functions for performance comparison. The experiment results testify that the DCQPSO outperforms the PSO and QPSO.

Keywords

  • Particle Swarm Optimization
  • Particle Swarm
  • Evolutionary Computation
  • Particle Swarm Optimization Algorithm
  • Premature Convergence

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.

References

  1. Angeline, P.J.: Evolutionary Optimization Versus Particle Swarm Optimization: Philosophy and performance Differences. In: Porto, V.W., Waagen, D. (eds.) EP 1998. LNCS, vol. 1447, pp. 601–610. Springer, Heidelberg (1998)

    CrossRef  Google Scholar 

  2. Van den Bergh, F., Engelbrecht, A.P.: A New Locally Convergent Particle Swarm Optimizer. In: 2002 IEEE International Conference on systems, Man and Cybernetics (2002)

    Google Scholar 

  3. Van den Bergh, F.: An Analysis of Particle Swarm Optimizers. PhD Thesis. University of Pretoria (November 2001)

    Google Scholar 

  4. Clerc, M.: The Swarm and Queen: Towards a Deterministic and Adaptive Particle Swarm Optimization. In: Proc. Congress on Evolutionary Computation 1999, pp. 1951–1957 (1999)

    Google Scholar 

  5. Clerc, M., Kennedy, J.: The Particle Swarm: Explosion, Stability, and Convergence in a Multi-dimensional Complex Space. IEEE Transaction on Evolutionary Computation (6), 58–73 (2002)

    Google Scholar 

  6. Engelbrecht, A.P., Ismail, A.: Training product unit neural networks. Stability Control: Theory APPL. 2(1-2), 59–74

    Google Scholar 

  7. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. IEEE Int’l Conference on Neural Networks, vol. IV, pp. 1942–1948. IEEE Service Center, Piscataway (1995)

    CrossRef  Google Scholar 

  8. Kennedy, J.: Sereotyping: Improving Particle Swarm Performance with cluster analysis. In: Proc. 2000 Congress on Evolutionary Computation, pp. 1507–1512 (2000)

    Google Scholar 

  9. Kennedy, J.: Small worlds and Mega-minds: Effects of Neighborhood Topology on Particle Swarm Performance. In: Proc. Congress on Evolutionary Computation 1999, pp. 1931–1938 (1999)

    Google Scholar 

  10. Suganthan, P.N.: Particle Swarm Optimizer with Neighborhood Operator. In: Proc. 1999 Congress on Evolutionary Computation, pp. 1958–1962 (1999)

    Google Scholar 

  11. Sun, J., et al.: Particle Swarm Optimization with Particles Having Quantum Behavior. In: Proc. 2004 Congress on Evolutionary Computation, pp. 325–331 (2004)

    Google Scholar 

  12. Sun, J., et al.: A Global Search Strategy of Quantum-behaved Particle Swarm Optimization. In: Proc. 2004 IEEE Conference on Cybernetics and Intelligent Systems (2004)

    Google Scholar 

  13. Sun, J., et al.: Adaptive Parameter Control for Quantum-behaved Particle Swarm Optimization on Individual Level. In: Proceedings of 2005 IEEE International Conference on Systems, Man and Cybernetics, pp. 3049–3054 (2005)

    Google Scholar 

  14. Ursem, R.K.: Diversity-Guided Evolutionary Algorithms. In: Proceedings of The Parallel Problem Solving from Nature Conference 2001 (2001)

    Google Scholar 

  15. Vesterstrom, J., Riget, J., Krink, T.: Division of Labor in Particle Swarm Optimization. In: IEEE 2002 Proceedings of the Congress on Evolutionary Computation (2002)

    Google Scholar 

  16. Shi, Y., Eberhart, R.: Empirical Study of Particle Swarm optimization. In: Proc. of Congress on Evolutionary Computation, pp. 1945–1950 (1999)

    Google Scholar 

  17. Shi, Y., Eberhart, R.C.: A Modified Particle Swarm. In: Proc. 1998 IEEE International Conference on Evolutionary Computation, pp. 1945–1950 (1998)

    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

Sun, J., Xu, W., Fang, W. (2006). Quantum-Behaved Particle Swarm Optimization Algorithm with Controlled Diversity. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758532_110

Download citation

  • DOI: https://doi.org/10.1007/11758532_110

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-34383-7

  • Online ISBN: 978-3-540-34384-4

  • eBook Packages: Computer ScienceComputer Science (R0)