Chaos PSO with super-sized swarm—initial study

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper it is investigated the possibility of improving the performance of PSO algorithm with super-sized population. The performance fo canonical PSO with super-sized swarm has been investigated previously and showed promising results. In this study four different chaotic systems are used as pseudo-random number generators for the PSO algorithm. The IEEE CEC’13 benchmark set is used to evaluate the performance of the method.

Cite

CITATION STYLE

APA

Pluhacek, M., Senkerik, R., & Zelinka, I. (2016). Chaos PSO with super-sized swarm—initial study. In Advances in Intelligent Systems and Computing (Vol. 427, pp. 527–535). Springer Verlag. https://doi.org/10.1007/978-3-319-29504-6_49

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free