Skip to main content

Multiple Choice Strategy for PSO Algorithm Enhanced with Dimensional Mutation

  • Conference paper
Artificial Intelligence and Soft Computing (ICAISC 2015)

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

Included in the following conference series:

  • 2014 Accesses

Abstract

In this study the promising Multiple-choice strategy for PSO (MC-PSO) is enhanced with the blind search based single dimensional mutation. The MC-PSO utilizes principles of heterogeneous swarms with random behavior selection. The performance previously tested on both large-scale and fast optimization is significantly improved by this approach. The newly proposed algorithm is more robust and resilient to premature convergence than both original PSO and MC-PSO. The performance is tested on four typical benchmark functions with variety of dimension settings.

This work was supported by Grant Agency of the Czech Republic - GACR P103/15/06700S, further by financial support of research project NPU I No. MSMT-7778/2014 by the Ministry of Education of the Czech Republic and also by the European Regional Development Fund under the Project CEBIA-Tech No. CZ.1.05/2.1.00/03.0089, partially supported by Grant of SGS No. SP2015/142 and SP2015/141 of VSB - Technical University of Ostrava, Czech Republic and by Internal Grant Agency of Tomas Bata University under the project No. IGA/FAI/2015/057.

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.: Particle swarm optimization. In: IEEE International Conference on Neural Networks, pp. 1942–1948 (1995)

    Google Scholar 

  2. Yuhui, S., Eberhart, R.: A modified particle swarm optimizer. In: IEEE World Congress on Computational Intelligence, May 4-9, pp. 69–73 (1998)

    Google Scholar 

  3. Kennedy, J.: The particle swarm: social adaptation of knowledge. In: IEEE International Conference on Evolutionary Computation, pp. 303–308 (1997)

    Google Scholar 

  4. Nickabadi, A., Ebadzadeh, M.M., Safabakhsh, R.: A novel particle swarm optimization algorithm with adaptive inertia weight. Applied Soft Computing 11(4), 3658–3670 (2011)

    Article  Google Scholar 

  5. Dorigo, M.: Ant Colony Optimization and Swarm Intelligence. Springer (2006)

    Google Scholar 

  6. Storn, R., Price, K.: Differential Evolution A Simple and Efficient Heuristic for global Optimization over Continuous Spaces. Journal of Global Optimization 11(4), 341–359 (1997)

    Article  MathSciNet  Google Scholar 

  7. de Oca, M.A.M., Pena, J., Stutzle, T., Pinciroli, C., Dorigo, M.: Heterogeneous particle swarm optimizers. In: IEEE Congress on Evolutionary Computation CEC 2009, pp. 698–705 (2009)

    Google Scholar 

  8. Engelbrecht, A.P.: Heterogeneous Particle Swarm Optimization. In: Dorigo, M., et al. (eds.) ANTS 2010. LNCS, vol. 6234, pp. 191–202. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  9. Zelinka, I.: SOMA Self-Organizing Migrating Algorithm. In: New Optimization Techniques in Engineering. STUDFUZZ, vol. 141, pp. 167–217. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  10. Pluhacek, M., Senkerik, R., Zelinka, I.: Multiple Choice Strategy A Novel Approach for Particle Swarm Optimization Preliminary Study. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L.A., Zurada, J.M. (eds.) ICAISC 2013, Part II. LNCS, vol. 7895, pp. 36–45. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  11. Pluhacek, M., Senkerik, R., Zelinka, I.: Investigation on the performance of a new multiple choice strategy for PSO Algorithm in the task of large scale optimization problems. In: 2013 IEEE Congress on Evolutionary Computation (CEC), June 20-23, pp. 2007–(2011)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Michal Pluhacek .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Pluhacek, M., Senkerik, R., Zelinka, I., Davendra, D. (2015). Multiple Choice Strategy for PSO Algorithm Enhanced with Dimensional Mutation. In: Rutkowski, L., Korytkowski, M., Scherer, R., Tadeusiewicz, R., Zadeh, L., Zurada, J. (eds) Artificial Intelligence and Soft Computing. ICAISC 2015. Lecture Notes in Computer Science(), vol 9119. Springer, Cham. https://doi.org/10.1007/978-3-319-19324-3_34

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19324-3_34

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19323-6

  • Online ISBN: 978-3-319-19324-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics