A modified multi swarm particle swarm optimization algorithm using an adaptive factor selection strategy

Abstract

In the present study, we suggest a modified version of heterogeneous multi-swarm particle swarm optimization (MSPSO) algorithm, that allows the amelioration of its performance by introducing an adaptive inertia weight approach. In order to bring about a balance between the exploration and exploitation characteristics of MSPSO allowing to promote information exchange amongst the subswarms. However, the classical MSPSO algorithm search behavior has not always been optimal in finding the optimal solution to certain problems, which results in falling into local optimum leading to premature convergence. The most advantages of the MSPSO there are easy to implement and there are few parameters to adjust. The inertia weight (w) is one of the most Particle Swarm Optimization’s (PSO) parameters. Controlling this parameter could facilitate the convergence and prevent an explosion of the swarm. To overcome the above limitations, this paper proposes a heterogeneous multi swarm PSO algorithm based on PSO number selection approach centred on the idea of particle swarm referred to as Multi-Swarm Particle Swarm Optimization algorithm with Factor selection strategy (FMSPSO). In the various process implementations of the particle swarm search, different parameter selection strategies are adopted to ameliorate the global search ability. The proposed FMSPSO is able to improve the population’s diversity and better explore the entire feature space. The statistical test and indicators that are reported in the specialized literature demonstrate that the suggested approach is superior in terms of efficiency to nine other popular PSO algorithms in solving the optimization problem of complex problems. The approach suggests that FMSPSO reaches a very promising performance for solving different types of optimization problems, leading eventually to higher solution accuracy.