Research Online

Logo

Goldsmiths - University of London

A Simplified Recombinant PSO

Bratton, Daniel and Blackwell, Tim M.. 2008. A Simplified Recombinant PSO. Journal of Artificial Evolution and Applications, 2008, pp. 1-10. ISSN 1687-6229 [Article]

[img]
Preview
Text (A Simplified Recombinant PSO)
654184.pdf - Published Version
Available under License Creative Commons Attribution.

Download (1MB) | Preview

Abstract or Description

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.

Item Type:

Article

Identification Number (DOI):

https://doi.org/10.1155/2008/654184

Departments, Centres and Research Units:

Computing
Research Office > REF2014

Dates:

DateEvent
2008Published

Item ID:

6627

Date Deposited:

05 Mar 2012 08:53

Last Modified:

09 Jul 2018 17:17

Peer Reviewed:

Yes, this version has been peer-reviewed.

URI:

http://research.gold.ac.uk/id/eprint/6627

View statistics for this item...

Edit Record Edit Record (login required)