A discrete binary version of the particle swarm algorithm
- 23 November 2002
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5, 4104-4108 vol.5
- https://doi.org/10.1109/icsmc.1997.637339
Abstract
The particle swarm algorithm adjusts the trajectories of a population of "particles" through a problem space on the basis of information about each particle's previous best performance and the best previous performance of its neighbors. Previous versions of the particle swarm have operated in continuous space, where trajectories are defined as changes in position on some number of dimensions. The paper reports a reworking of the algorithm to operate on discrete binary variables. In the binary version, trajectories are changes in the probability that a coordinate will take on a zero or one value. Examples, applications, and issues are discussed.Keywords
This publication has 3 references indexed in Scilit:
- Particle swarm optimizationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2014
- The particle swarm: social adaptation of knowledgePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- A new optimizer using particle swarm theoryPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002