A Genetic Binary Particle Swarm Optimization Model

In this paper, a genetic binary particle swarm optimization (GBPSO) model is proposed, and its performance is compared with the regular binary particle swarm optimizer (PSO), introduced by Kennedy and Eberhart. In the original model, the size of the swarm was fixed. In our model, we introduce birth and death operations in order to make the population very dynamic. Since birth and mortality rates change naturally with time, our model allows oscillations in the size of the population. Compared to the original PSO model, and genetic algorithms, our strategy proposes a more natural simulation of the social behavior of intelligent animals. The experimental results show that compared to original PSO, our GBPSO model can reach broader domains in the search space and converge faster in very high dimensional and complex environments.