Rank-Based Self-Adaptive Inertia Weight Scheme to Enhance the Performance of Novel Binary Particle Swarm Optimization

Inertia weight is a significant parameter of the particle swarm optimization (PSO) algorithm. Its controllers the search capabilities of PSO and provides a balance between exploration and exploitation. There are a plethora of studies on inertia weight variants of continuous PSO (CPSO). However, a few numbers of studies have been presented for binary PSO (BPSO). In existing BPSO variants, despite different positions of particles, every individual is treated equally by ignoring the dispersion of particles in the search space. To deal with each particle according to its fitness value, we have proposed a Rank-based Self-adaptive Inertia Weight to enhance the performance of the Novel BPSO (NBPSO). The proposed algorithm controls the movement of particles by defining the ranks of each particle based on their fitness. The performance of the proposed algorithm is evaluated on four benchmark test functions. The experimental results show that the proposed method performs better than the compared algorithms in terms of convergence speed.