Skip to main content

Enhancing Global Search Ability of Quantum-Behaved Particle Swarm Optimization by Maintaining Diversity of the Swarm

  • Conference paper
Rough Sets and Current Trends in Computing (RSCTC 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4259))

Included in the following conference series:

Abstract

Premature convergence, the major problem that confronts evolu-tionary algorithms, is also encountered with the Particle Swarm Optimization (PSO) algorithm. Quantum-behaved Particle Swarm (QPSO), a novel variant of PSO, is a global-convergence-guaranteed algorithm and has a better search ability than the original PSO. But like PSO and other evolutionary optimization techniques, premature in QPSO is also inevitable. The reason for premature convergence in PSO or QPSO is that the information flow between particles makes the diversity of the population decline rapidly. In this paper, we propose Diversity-Maintained QPSO (DMQPSO). Before describing the new method, we first introduce the origin and development of PSO and QPSO. DMQPSO, along with the PSO and QPSO, is tested on several benchmark functions for performance comparison. The experiment results show that the DMQPSO outperforms the PSO and QPSO in many cases.

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

    Chapter  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  4. Clerc, M.: The Swarm and Queen: Towards a Deterministic and Adaptive Particle Swarm Optimization. In: Proc. 1999 Congress on Evolutionary Computation, Piscataway, NJ, 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 Transactions on Evolutionary Computation 6(1), 58–73 (2002)

    Article  Google Scholar 

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

    Google Scholar 

  7. Eberhart, R.C., Simpson, P., Dobbins, R.: Computational Intelligence PC Tools: Academic, ch. 6, pp. 39–43 (1996)

    Google Scholar 

  8. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. IEEE 1995 International Conference on Neural Networks, Piscataway, NJ, vol. IV, pp. 1942–1948 (1995)

    Google Scholar 

  9. Kennedy, J.: Sereotyping: Improving Particle Swarm Performance with Cluster Analysis. In: Proc. 2000 Congress on Evolutionary Computation, Piscataway, NJ, pp. 1507–1512 (2000)

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  12. Sun, J., Feng, B., Xu, W.-B.: Particle Swarm Optimization with Particles Having Quantum Behavior. In: Proc. 2004 Congress on Evolutionary Computation, Piscataway, NJ, pp. 325–331 (2004)

    Google Scholar 

  13. Sun, J., Xu, W.-B., Feng, B.: A Global Search Strategy of Quantum-behaved Particle Swarm Optimization. In: Proc. 2004 IEEE Conference on Cybernetics and Intelligent Systems, Singapore, pp. 111–115 (2004)

    Google Scholar 

  14. Sun, J., Xu, W.-B., Feng, B.: Adaptive Parameter Control for Quantum-behaved Particle Swarm Optimization on Individual Level. In: Proc. 2005 IEEE International Conference on Systems, Man and Cybernetics, Piscataway, NJ, pp. 3049–3054 (2005)

    Google Scholar 

  15. Sun, J., Xu, W.-B., Fang, W.: Quantum-Behaved Particle Swarm Optimization Algorithm with Controlled Diversity. In: Proc. 2006 International Conference on Computational Science (3), pp. 847–854 (2006)

    Google Scholar 

  16. Ursem, R.K.: Diversity-Guided Evolutionary Algorithms. In: Guervós, J.J.M., Adamidis, P.A., Beyer, H.-G., Fernández-Villacañas, J.-L., Schwefel, H.-P. (eds.) PPSN 2002. LNCS, vol. 2439, pp. 462–471. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  17. Riget, J., Vesterstrøm, J.S.: A Diversity-Guided Particle Swarm Optimizer-the ARPSO. Technical Report, University of Aarhus, Denmark (2002)

    Google Scholar 

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

    Google Scholar 

  19. Shi, Y., Eberhart, R.C.: A Modified Particle Swarm. In: Proc. 1998 IEEE International Conference on Evolutionary Computation, Piscataway, NJ, pp. 69–73 (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). Enhancing Global Search Ability of Quantum-Behaved Particle Swarm Optimization by Maintaining Diversity of the Swarm. In: Greco, S., et al. Rough Sets and Current Trends in Computing. RSCTC 2006. Lecture Notes in Computer Science(), vol 4259. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11908029_76

Download citation

  • DOI: https://doi.org/10.1007/11908029_76

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-47693-1

  • Online ISBN: 978-3-540-49842-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics