z-logo
open-access-imgOpen Access
A Simplified Recombinant PSO
Author(s) -
Dan Bratton,
Tim Blackwell
Publication year - 2008
Publication title -
journal of artificial evolution and applications
Language(s) - English
Resource type - Journals
eISSN - 1687-6237
pISSN - 1687-6229
DOI - 10.1155/2008/654184
Subject(s) - particle swarm optimization , swarm behaviour , multi swarm optimization , mathematical optimization , reduction (mathematics) , metaheuristic , computer science , mathematics , geometry
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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom