Binary hybrid particle swarm optimization withwavelet mutation

Abstract

Particle swarm optimization (PSO) is an evolutionary algorithmin which individuals, called particles, move around a multi-dimensional problem space at different directions (trajectories) and speeds (velocities) to find the best solution.A particle movement is based on its previous best result and the previous best result of the entire population. In one of PSO variants – the HPSOWM [4], a mutation process based on wavelet theory was added to the original PSO to prevent premature conclusion of the best solution. This hybrid PSO has improved solution stability and quality over the original algorithm as well as many other hybrid PSO algorithms. However, it is limited to work on a continuous problem space. In this paper, we propose Binary Hybrid Particle Swarm Optimization withWavelet Mutation (BHPSPWM) – a reworked version of such algorithm which operates on binary-based problem space. The movement mechanisms of particles as well as the mutation process have been transformed. The new algorithm was applied in training block-based neural network (BBNN) as well as finding solutions for several mathematical functions. The results showed significant improvement over genetic algorithms.