Skip to main content

The Initial Study on the Potential of Super-Sized Swarm in PSO

  • Conference paper
  • First Online:
Mendel 2015 (ICSC-MENDEL 2016)

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 378))

Included in the following conference series:

Abstract

In this initial study it is addressed the issue of population size for the PSO algorithm. For many years now it is understood that population size of several dozens is sufficient for the vast majority of optimization tasks. With strict limitation of cost function evaluations (CFEs) the setting is typically limited to adjusting the number of iterations of the algorithm. In this study it is investigated the possibility of using population of thousands of particles and its effect on the performance of the algorithm in limited CFEs. It is also proposed an alternative setting of acceleration constants in order to improve the performance of the PSO with super-sized population. The performance of the proposed method is tested on IEEE CEC 2013 benchmark set and compared with original PSO design and state of art methods.

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 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.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

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, pp. 69–73, 4–9 May 1998

    Google Scholar 

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

    Article  Google Scholar 

  4. Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm Intelligence. Morgan Kaufmann Publishers (2001)

    Google Scholar 

  5. van den Bergh, F., Engelbrecht, A.P.: A study of particle swarm optimization particle trajectories. Inf. Sci. 176(8), 937–971 (2006)

    Article  MATH  Google Scholar 

  6. Liang, J., Suganthan, P.N.: Dynamic multi-swarm particle swarm optimizer. In: Swarm Intelligence Symposium, SIS 2005, pp. 124–129 (2005)

    Google Scholar 

  7. Liang, J.J., Qin, A.K., Suganthan, P.N., Baskar, S.: Comprehensive learning particle swarm optimizer for global optimization of multimodal functions. IEEE Trans. Evol. Comput. 10(3), 281–295 (2006)

    Article  Google Scholar 

  8. Zhi-Hui, Z., Jun, Z., Yun, L., Yu-hui, S.: Orthogonal learning particle swarm optimization. IEEE Trans. Evol. Comput. 15(6), 832–847 (2011)

    Article  Google Scholar 

  9. Kennedy, J., Mendes, R.: Population structure and particle swarm performance. In: Proceedings of the 2002 Congress on Evolutionary Computation, CEC ‘02, 2002, pp. 1671–1676 (2002)

    Google Scholar 

  10. Liang, J.J., Qu, B.-Y., Suganthan, P.N., Hernández-Díaz, A.G.: Problem Definitions and Evaluation Criteria for the CEC 2013 Special Session and Competition on Real-Parameter Optimization, Technical Report 201212. Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report, Nanyang Technological University, Singapore (2013)

    Google Scholar 

  11. Nepomuceno F., Engelbrecht A.: A self-adaptive heterogeneous pso for real-parameter optimization. In: Proceedings of the IEEE International Conference on Evolutionary Computation (2013)

    Google Scholar 

  12. El-Abd M.: Testing a Particle Swarm Optimization and Artificial Bee Colony Hybrid algorithm on the CEC13 benchmarks. In: IEEE Congress on Evolutionary Computation, pp. 2215–2220 (2013)

    Google Scholar 

Download references

Acknowledgments

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. 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, VÅ B - Technical University of Ostrava, Czech Republic and by Internal Grant Agency of Tomas Bata University under the project No. IGA/FAI/2015/057.

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. (2015). The Initial Study on the Potential of Super-Sized Swarm in PSO. In: Matoušek, R. (eds) Mendel 2015. ICSC-MENDEL 2016. Advances in Intelligent Systems and Computing, vol 378. Springer, Cham. https://doi.org/10.1007/978-3-319-19824-8_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19824-8_10

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-19823-1

  • Online ISBN: 978-3-319-19824-8

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics