A Simple Butterfly Particle Swarm Optimization Algorithm with the Fitness-based Adaptive Inertia Weight and the Opposition-based Learning Average Elite Strategy
Affiliations: College of Information Science and Engineering, Guilin University of Technology, Guilin, China. d2015mg@qq.com
Correspondence:
[†]
Address for correspondence: College of Information Science and Engineering, Guilin University of Technology, 12 Jiangan Road, 541004 Guilin China.
Note: [*] Also works: School of Computer Science, Wuhan University, Wuhan, China.
Note: [‡] Also works: Guangxi key Laboratory of Embedded Technology and Intelligent System, Guilin University of Technology, Guilin, China.
Abstract: Particle swarm optimization (PSO) is a population-based stochastic optimization technique that can be applied to solve optimization problems. However, there are some defects for PSO, such as easily trapping into local optimum, slow velocity of convergence. This paper presents the simple butterfly particle swarm optimization algorithm with the fitness-based adaptive inertia weight and the opposition-based learning average elite strategy (SBPSO) to accelerate convergence speed and jump out of local optimum. SBPSO has the advantages of the simple butterfly particle swarm optimizer to increase the probability of finding the global optimum in the course of searching. Moreover, SBPSO benefits from the simple particle swarm (sPSO) to accelerate convergence speed. Furthermore, SBPSO adopts the opposition-based learning average elite to enhance the diversity of the particles in order to jump out of local optimum. Additionally, SBPSO generates the fitness-based adaptive inertia weight ω to adapt to the evolution process. Eventually, SBPSO presents a approach of random mutation location to enhance the diversity of the population in case of the position out of range. Experiments have been conducted with eleven benchmark optimization functions. The results have demonstrated that SBPSO outperforms than that of the other five recent proposed PSO in obtaining the global optimum and accelerating the velocity of convergence.
