A new variant of the Particle Swarm Optimization (PSO) algorithm is presented in this paper. It uses a well-known measure of problem hardness, the Fitness-Distance Correlation, to modify the position of the swarm attractors, both global and local to single particles. The goal of the algorithm is to make the fitness landscape between each particle's positions and their attractors as smooth as possible. Experimental results, obtained on 15 out of the 25 test functions belonging to the test suite used in CEC-2005 numerical optimization competition, show that this new PSO version is generally competitive, and in some cases, better than standard PSO.
Azzini, A., Cagnoni, S., Vanneschi, L. (2010). FDC-based particle swarm optimization. In Artificial life and evolutionary computation : proceedings of Wivace 2008 : Venice, Italy, 8–10 september 2008 (pp.59-68). World Scientific Publishing [10.1142/9789814287456_0005].
FDC-based particle swarm optimization
VANNESCHI, LEONARDO
2010
Abstract
A new variant of the Particle Swarm Optimization (PSO) algorithm is presented in this paper. It uses a well-known measure of problem hardness, the Fitness-Distance Correlation, to modify the position of the swarm attractors, both global and local to single particles. The goal of the algorithm is to make the fitness landscape between each particle's positions and their attractors as smooth as possible. Experimental results, obtained on 15 out of the 25 test functions belonging to the test suite used in CEC-2005 numerical optimization competition, show that this new PSO version is generally competitive, and in some cases, better than standard PSO.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
