Skip to main content

Particle Swarms for Multimodal Optimization

  • Conference paper
Book cover Adaptive and Natural Computing Algorithms (ICANNGA 2007)

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

Included in the following conference series:

Abstract

In this paper, five previous Particle Swarm Optimization (PSO) algorithms for multimodal function optimization are reviewed. A new and a successful PSO based algorithm, named as CPSO is proposed. CPSO enhances the exploration and exploitation capabilities of PSO by performing search using a random walk and a hill climbing components. Furthermore, one of the previous PSO approaches is improved incredibly by means of a minor adjustment. All algorithms are compared over a set of well-known benchmark functions.

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. Beasley, D., Bull, D.R., Martin, R.R.: A Sequential Niching Technique for Multimodal Function Optimization. Evolutionary Computation 1(2), 101–125 (1993)

    Article  Google Scholar 

  2. van den Bergh, F.: An Analysis of Particle Swarm Optimizers. PhD Thesis, Department of Computer Science, University of Pretoria, Pretoria, South Africa (2002)

    Google Scholar 

  3. van den Bergh, F., Englebrecht, A.P.: A study of particle swarm optimization particle trajectories. Information Sciences 176, 937–971 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  4. Brits, R., Engelbrecht, A.P., van den Bergh, F.: Solving Systems of Unconstrained Equations using Particle Swarm Optimization. In: Int. Conf. on Sys., Man and Cyber., vol. 3, p. 6 (2002)

    Google Scholar 

  5. Brits, R., Engelbrecht, A.P., van den Bergh, F.: A niching particle swarm optimizer. In: Proc. 4th Asia-Pacific Conf. on Simulated Evolution and Learning, vol. 2, pp. 692–696 (2002)

    Google Scholar 

  6. Eberhart, R.C., Shi, Y.: Comparing inertia weights and constriction factors in particle swarm optimization. In: Proc. of the IEEE Congress on Evolutionary Comp., pp. 84–88 (2000)

    Google Scholar 

  7. Kennedy, J., Eberhart, R.C.: Particle Swarm Optimization. In: Proc. IEEE Int. Conf. on N.N., pp. 1942–1948 (1995)

    Google Scholar 

  8. Li, J.-P., Balazs, M.E., Parks, G.T., Clarkson, P.J.: A Genetic Algorithm using Species Conservation for Multimodal Function Optimization. Journal of Evolutionary Computation 10(3), 207–234 (2002)

    Article  Google Scholar 

  9. Li, X.-D.: Adaptively Choosing Neighbourhood Bests Using Species in a Particle Swarm Optimizer for Multimodal Function Optimization. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 105–116. Springer, Heidelberg (2004)

    Google Scholar 

  10. Løvbjerg, M., Rasmussen, T.K., Krink, T.: Hybrid Particle Swarm Optimizer with Breeding and Subpopulations. In: Proc. of the Genetic and Evolutionary Comp. Conf., vol. 1, pp. 469–476 (2001)

    Google Scholar 

  11. Ozcan, E., Mohan, C.K.: Particle Swarm Optimization: Surfing the Waves. In: Proc. of IEEE Congress on Evolutionary Computation, Piscataway, NJ, pp. 1939–1944 (1999)

    Google Scholar 

  12. Parsopoulos, K.E., Vrahatis, M.N.: Modification of the particle swarm optimizer for locating all the global minima. In: Proc. of the ICANNGA, pp. 324–327 (2001)

    Google Scholar 

  13. Parsopoulos, K.E., Vrahatis, M.N.: UPSO: A Unified Particle Swarm Optimization Scheme. In: Proc. of the Int. Conf. of Computational Methods in Sci. and Eng. Lecture Series on Comp. and Computational Sci., vol. 1, pp. 868–873 (2004)

    Google Scholar 

  14. Schoeman, I.L., Engelbrecht, A.P.: A Parallel Vector-Based Particle Swarm Optimizer. In: Proc. of the International Conf. on Neural Networks and Genetic Algorithms, pp. 268–271 (2005)

    Google Scholar 

  15. Sotiropoulos, D.G., Plagianakos, V.P., Vrahatis, M.N.: An evolutionary algorithm for minimizing multimodal functions. In: Proc. of the Fifth Hellenic- European Conf. on Comp. Math. and its App., vol. 2, pp. 496–500 (2002)

    Google Scholar 

  16. Streichert, F., Stein, G., Ulmer, H., Zell, A.: A clustering based niching EA for multimodal search spaces. In: Liardet, P., Collet, P., Fonlupt, C., Lutton, E., Schoenauer, M. (eds.) EA 2003. LNCS, vol. 2936, pp. 293–304. Springer, Heidelberg (2004)

    Google Scholar 

  17. Ursem, R.K.: Multinational evolutionary algorithms. In: Proc. of the 1999 Congress of Evolutionary Computation (CEC-1999), vol. 3, pp. 1633–1640 (1999)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bartlomiej Beliczynski Andrzej Dzielinski Marcin Iwanowski Bernardete Ribeiro

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Özcan, E., Yılmaz, M. (2007). Particle Swarms for Multimodal Optimization. In: Beliczynski, B., Dzielinski, A., Iwanowski, M., Ribeiro, B. (eds) Adaptive and Natural Computing Algorithms. ICANNGA 2007. Lecture Notes in Computer Science, vol 4431. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71618-1_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71618-1_41

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71589-4

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics