TY - GEN
T1 - Inertial geometric particle swarm optimization
AU - Moraglio, Alberto
AU - Togelius, Julian
N1 - Copyright:
Copyright 2009 Elsevier B.V., All rights reserved.
PY - 2009
Y1 - 2009
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=70449955873&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449955873&partnerID=8YFLogxK
U2 - 10.1109/CEC.2009.4983182
DO - 10.1109/CEC.2009.4983182
M3 - Conference contribution
AN - SCOPUS:70449955873
SN - 9781424429592
T3 - 2009 IEEE Congress on Evolutionary Computation, CEC 2009
SP - 1973
EP - 1980
BT - 2009 IEEE Congress on Evolutionary Computation, CEC 2009
T2 - 2009 IEEE Congress on Evolutionary Computation, CEC 2009
Y2 - 18 May 2009 through 21 May 2009
ER -