Binary Particle Swarm Optimisers: toolbox, derivations, and mathematical insights

Abstract : A canonical Particle Swarm Optimisation model requires only three algebraic operators, namely "modifying a velocity", "combining three velocities ", and "applying a velocity to a position", which can have a lot of explicit transcriptions. In particular, for binary optimisation, it is possible to define a toolbox of specific ones, and to derive then some à la carte optimisers that can be, for example, extremely efficient only on some kind of problems, or on the contrary just reasonably efficient but very robust. For "amatheurs" who would like to better understand the behaviour of binary PSO algorithms an Appendix gives some theoretical results.
Document type :
Preprints, Working Papers, ...
42 pages. 2005


https://hal.archives-ouvertes.fr/hal-00122809
Contributor : Maurice Clerc <>
Submitted on : Friday, January 5, 2007 - 10:13:54 AM
Last modification on : Thursday, January 11, 2007 - 9:26:36 PM

File

Binary_PSO.pdf
fileSource_public_author

Identifiers

  • HAL Id : hal-00122809, version 1

Citation

Maurice Clerc. Binary Particle Swarm Optimisers: toolbox, derivations, and mathematical insights. 42 pages. 2005. <hal-00122809>

Export

Share

Metrics

Consultation de
la notice

591

Téléchargement du document

239