Skip to main content

Gaining a Better Quality Depending on More Exploration in PSO

  • Conference paper
  • 655 Accesses

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

Abstract

We present a potential extension for particle swarm optimization (PSO) to gain better optimization quality on the basis of our agent-based approach of steering metaheuristics during runtime [1]. PSO as population-based metaheuristic is structured in epochs: in each step and for each particle, the point in the search space and the velocity of the particles are computed due to current local and global best and prior velocity. During this optimization process the PSO explores the search space only sporadically. If the swarm “finds” a local minimum the particles’ velocity slows down and the probability to “escape” from this point reduces significantly. In our approach we show how to speed up the swarm to unvisited areas in the search space and explore more regions without losing the best found point and the quality of the result. We introduce a new extension of the PSO for gaining a higher quality of the found solution, which can be steered and influenced by an agent.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   72.00
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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bogon, T., Lattner, A.D., Lorion, Y., Timm, I.J.: An Agent-based Approach for Dynamic Combination and Adaptation of Metaheuristics. In: Schumann, M., Kolbe, L.M., Breitner, M.H., Frerichs, A. (eds.) Multikonferenz Wirtschaftsinformatik 2010, February 23-25, pp. 2345–2357. Univ.-Verl. Göttingen and Niedersächsische Staats-und Universitätsbibliothek, Göttingen and Göttingen (2010)

    Google Scholar 

  2. Bogon, T., Poursanidis, G., Lattner, A.D., Timm, I.J.: Automatic Parameter Configuration of Particle Swarm Optimization by Classification of Function Features. In: Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Groß, R., Şahin, E., Sayama, H., Stützle, T. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 554–555. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Bratton, D., Kennedy, J.: Defining a standard for particle swarm optimization. In: Swarm Intelligence Symposium, pp. 120–127 (2007)

    Google Scholar 

  4. Brits, R., Engelbrecht, A., Van Den Bergh, F.: Locating multiple optima using particle swarm optimization. Applied Mathematics and Computation 189(2), 1859–1883 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  5. Eiben, A.E., Schippers, C.A.: On evolutionary exploration and exploitation. Fundam. Inf. 35(1-4), 35–50 (1998)

    MATH  Google Scholar 

  6. Gerdes, I., Klawonn, F., Kruse, R.: Evolutionäre Algorithmen: Genetische Algorithmen - Strategien und Optimierungsverfahren - Beispielanwendungen; [mit Online-Service zum Buch], 1st edn. Vieweg, Wiesbaden (2004), http://www.worldcat.org/oclc/76440323

  7. Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of the 1995 IEEE International Conference on Neural Network, Perth, Australia, pp. 1942–1948 (1995)

    Google Scholar 

  8. Li, X., Fu, H., Zhang, C.: A Self-Adaptive Particle Swarm Optimization Algorithm. In: International Conference on Computer Science and Software Engineering, vol. 5, pp. 186–189 (2008), http://doi.ieeecomputersociety.org/10.1109/CSSE.2008.142

  9. Liu, S.H., Mernik, M., Bryant, B.R.: To explore or to exploit: An entropy-driven approach for evolutionary algorithms. International Journal of Knowledge-Based and Intelligent Engineering Systems 13(3), 185–206 (2009), http://dx.doi.org/10.3233/KES-2009-0184

    Google Scholar 

  10. Lorion, Y., Bogon, T., Timm, I.J., Drobnik, O.: An Agent Based Parallel Particle Swarm Optimization - APPSO. In: Swarm Intelligence Symposium IEEE (SIS 2009), Piscataway (NJ) USA, pp. 52–59 (March 2009)

    Google Scholar 

  11. Talbi, E.G.: Metaheuristics: From design to implementation. Wiley, Hoboken (2009), http://www.gbv.de/dms/ilmenau/toc/598135170.PDF

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bogon, T., Endres, M., Timm, I.J. (2012). Gaining a Better Quality Depending on More Exploration in PSO. In: Timm, I.J., Guttmann, C. (eds) Multiagent System Technologies. MATES 2012. Lecture Notes in Computer Science(), vol 7598. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33690-4_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33690-4_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33689-8

  • Online ISBN: 978-3-642-33690-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics