Competitive Coevolution-Based Improved Phasor Particle Swarm Optimization Algorithm for Solving Continuous Problems

Abstract

Particle swarm optimization (PSO) is a population-based heuristic algorithm that is widely used for optimization problems. Phasor PSO (PPSO), an extension of PSO, uses the phase angle θ to create a more balanced PSO due to its increased ability to adjust the environment without parameters like the inertia weight w. The PPSO algorithm performs well for small-sized populations but needs improvements for large populations in the case of rapidly growing complex problems and dimensions. This study introduces a competitive coevolution process to enhance the capability of PPSO for global optimization problems. Competitive coevolution disintegrates the problem into multiple sub-problems, and these sub-swarms coevolve for a better solution. The best solution is selected and replaced with the current sub-swarm for the next competition. This process increases population diversity, reduces premature convergence, and increases the memory efficiency of PPSO. Simulation results using PPSO, fuzzy-dominance-based many-objective particle swarm optimization (FMPSO), and improved competitive multi-swarm PPSO (ICPPSO) are generated to assess the convergence power of the proposed algorithm. The experimental results show that ICPPSO achieves a dominating performance. The ICPPSO results for the average fitness show average improvements of 15%, 20%, 30%, and 35% over PPSO and FMPSO. The Wilcoxon statistical significance test also confirms a significant difference in the performance of the ICPPSO, PPSO, and FMPSO algorithms at a 0.05 significance level.

Keywords

• particle swarm optimization
• phasor PSO
• PSO coevolution
• optimization
• multi-swarm