In particle swarm optimization (PSO), the inertia weight is an important parameter for controlling its search capability. There have been intensive studies of the inertia weight in continuous optimization, but little attention has been paid to the binary case. This paper comprehensively investigates the effect of the inertia weight on the performance of binary PSO (BPSO), from both theoretical and empirical perspectives. A mathematical model is proposed to analyze the behavior of BPSO, based on which several lemmas and theorems on the effect of the inertia weight are derived. Our research findings suggest that in the binary case, a smaller inertia weight enhances the exploration capability while a larger inertia weight encourages exploitation. Consequently, this paper proposes a new adaptive inertia weight scheme for BPSO. This scheme allows the search process to start first with exploration and gradually move toward exploitation by linearly increasing the inertia weight. The experimental results on 0/1 knapsack problems show that the BPSO with the new increasing inertia weight scheme performs significantly better than that with the conventional decreasing and constant inertia weight schemes. This paper verifies the efficacy of increasing inertia weight in BPSO.
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
An Analysis of the Inertia Weight Parameter for Binary Particle Swarm Optimization
