Inertial Particle Swarm Optimization

Authors

Abstract

Geometric particle swarm optimization (GPSO) is a recently
introduced formal generalization of a simplified form of traditional
particle swarm optimization (PSO) without the inertia term that
applies naturally to both continuous and combinatorial spaces. In
this paper, we propose an extension of GPSO, the inertial GPSO
(IGPSO), that generalizes the traditional PSO endowed with the full
equation of motion of particles to generic search spaces. We then
formally derive the specific IGPSO for the Hamming space associated
with binary strings and present experimental results for this new
algorithm.

Conference

IEEE Congress on Evolutionary Computation, January 2009