Table of Contents
Journal of Artificial Evolution and Applications
Volume 2008 (2008), Article ID 654184, 10 pages
http://dx.doi.org/10.1155/2008/654184
Research Article

A Simplified Recombinant PSO

Department of Computing, Goldsmiths, University of London, New Cross, London SE14 6NW, UK

Received 20 July 2007; Accepted 3 December 2007

Academic Editor: Riccardo Poli

Copyright © 2008 Dan Bratton and Tim Blackwell. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Simplified forms of the particle swarm algorithm are very beneficial in contributing to understanding how a particle swarm optimization (PSO) swarm functions. One of these forms, PSO with discrete recombination, is extended and analyzed, demonstrating not just improvements in performance relative to a standard PSO algorithm, but also significantly different behavior, namely, a reduction in bursting patterns due to the removal of stochastic components from the update equations.