Self-Organizing Migrating Algorithm Pareto

Abstract

In this paper, we propose a new method named Pareto-based self-organizing migrating algorithm (SOMA Pareto), in which the algorithm is divided into the Organization, Migration, and Update processes. The important key in the Organization process is the application of the Pareto Principle to select the Migrant and the Leader, increasing the performance of the algorithm. The adaptive PRT, Step, and PRTVector parameters are applied to enhance the ability to search for promising subspaces and then to focus on exploiting that subspaces. Based on the testing results on the well-known benchmark suites such as CEC'13, CEC'15, and CEC'17, the superior performance of the proposed algorithm compared to the SOMA family and the state-of-the-art algorithms such as variant DE and PSO are confirmed. These results demonstrate that SOMA Pareto is an effective, promising algorithm.