An improved grey wolf optimization algorithm based on scale-free network topology

Abstract

The grey wolf optimizer is a novel intelligent optimization algorithm that has become popular due to its low number of parameters, fast convergence speed, and simplicity. However, the classical algorithm, with its update strategy allowing wolves to learn only from the alpha wolves, often leads to premature convergence and lower convergence accuracy. Therefore, in this paper, an improved grey wolf optimization algorithm based on scale-free network topology (SFGWO) is proposed to address these issues. The improved algorithm first employs a strategy for formulating a population based on a scale-free network topology, where interaction between wolves is limited to topological neighbors, which helps enhance the exploration capabilities of the algorithm. Second, a neighbor learning strategy is introduced to capture individual diversity, facilitating the solution space exploration. Finally, an adaptive individual regeneration strategy is adopted to balance the exploration and exploitation processes and reduce the risk of falling into local optima. The proposed algorithm is evaluated through simulation experiments using 23 classical and the CEC2019 benchmark functions. The experimental results demonstrate that the SFGWO algorithm excels in terms of solution accuracy and exploration capabilities. The applicability and effectiveness of the SFGWO algorithm are further validated through testing on three practical engineering problems.

Keywords

• Grey wolf optimizer
• Scale-free network topology
• Neighborhood learning
• Adaptive individual regeneration