Introduction - If you have any usage issues, please Google them yourself
PSO was originally introduced as an optimization technique for continuous space. in order to
extend the application to discrete spaces, Kennedy and Eberhart [43] proposed a discrete binary
version of PSO where a particle moves in a state space restricted to zero and one on each
dimension, in terms of the changes in probabilities that a bit will be in one state or the other.