DocumentCode
2460392
Title
The Latest vs. Averaged Recent Experience: Which Better Guides a PSO Algorithm?
Author
Acan, Adnan ; Unveren, Ahmet ; Bodur, Mehmet
Author_Institution
Eastern Mediterranean Univ., Mersin
fYear
0
fDate
0-0 0
Firstpage
414
Lastpage
419
Abstract
A particle swarm optimization strategy based on the use of learned experiences averaged over a number of iterations is presented. The personal and the global best solutions over a number of latest iterations are stored and averages of the stored solutions are used in the velocity computations. Experiments on real-parameter optimization problems published in CEC 2005 test suite demonstrate that the proposed strategy exhibits better performance than conventional PSO for most of the benchmarks, whereas the conventional PSO performed better for only the two non-continuous test cases.
Keywords
iterative methods; particle swarm optimisation; PSO algorithm; iterations; particle swarm optimization; velocity computations; Acceleration; Benchmark testing; Birds; Constraint optimization; Educational institutions; Evolutionary computation; Genetic algorithms; Marine animals; Particle swarm optimization; Performance evaluation;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2006. CEC 2006. IEEE Congress on
Conference_Location
Vancouver, BC
Print_ISBN
0-7803-9487-9
Type
conf
DOI
10.1109/CEC.2006.1688338
Filename
1688338
Link To Document