DocumentCode
3516466
Title
A study on the minimal number of particles for a simplified particle swarm optimization algorithm
Author
Lihu, Andrei ; Holban, Stefan
Author_Institution
Dept. of Comput. Sci., Politeh. Univ. of Timisoara, Timisoara, Romania
fYear
2011
fDate
19-21 May 2011
Firstpage
299
Lastpage
303
Abstract
Recent research on particle swarm optimization (PSO) emphasizes the need to simply this algorithm. This paper is a short study on finding the minimal number of particles in a simplified PSO. We have taken into consideration a social-only variant, Pedersen´s simplified PSO, and tested it with four popular optimization benchmark functions in order to discover which is the minimal number of particles that can be used in most optimization problems.
Keywords
particle swarm optimisation; Pedersen simplified particle swarm optimization algorithm; minimal number of particles; social-only variant particle swarm optimization algorithm; Benchmark testing; Convergence; Informatics; Java; Optimization; Particle swarm optimization; number of particles; optimization; particle; simplified; social-only; swarm;
fLanguage
English
Publisher
ieee
Conference_Titel
Applied Computational Intelligence and Informatics (SACI), 2011 6th IEEE International Symposium on
Conference_Location
Timisoara
Print_ISBN
978-1-4244-9108-7
Type
conf
DOI
10.1109/SACI.2011.5873018
Filename
5873018
Link To Document