Barebones Particle Swarm for Integer Programming Problems

The performance of two variants of particle swarm optimization (PSO) when applied to integer programming problems is investigated. The two PSO variants, namely, barebones particle swarm (BB) and the exploiting barebones particle swarm (BBExp) are compared with the standard PSO and standard differential evolution (DE) on several integer programming test problems. The results show that the BBExp seems to be an efficient alternative for solving integer programming problems