Novel Binary Particle Swarm Optimization

Abstract

In this study a new interpretation for the velocity of binary PSO was proposed, which is the rate of change in bits of particles. Also the main difficulty of older version of binary PSO which is choosing proper value for wis solved. The previous direction and previous state of each particle is also taken into account and helped finding good solutions for problems. This approach tested and returned quite satisfactory results in number of test problems. The binary PSO can be used in variety of applications, especially when the values of the search space are discrete like decision making, solving lot sizing problem, the traveling salesman problem, scheduling and routing.