Binary Particle Swarm Optimisers: toolbox, derivations, and mathematical insights
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)