A Simplified Recombinant PSO

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...

Full description

Saved in:
Bibliographic Details
Published in:Journal of artificial evolution and applications 2008-01, Vol.2008 (1)
Main Authors: Bratton, Dan, Blackwell, Tim
Format: Article
Language:English
Subjects:
Behavior
Design specifications
Optimization algorithms
Social interaction
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1687-6229
1687-6237
DOI:10.1155/2008/654184