Swarms in Dynamic Environments

Charged particle swarm optimization (CPSO) is well suited to the dynamic search problem since inter-particle repulsion maintains population diversity and good tracking can be achieved with a simple algorithm. This work extends the application of CPSO to the dynamic problem by considering a bi-modal parabolic environment of high spatial and temporal severity. Two types of charged swarms and an adapted neutral swarm are compared for a number of different dynamic environments which include extreme ‘needle-inthe-haystack’ cases. The results suggest that charged swarms perform best in the extreme cases, but neutral swarms are better optimizers in milder environments.

• Type: Conference
• Year: 2003
• Where: GECCO
• Authors: T. M. Blackwell
• Keywords: Dynamic Search Problem, GECCO 2003, Neutral Swarms, Particle Swarm Optimization