Reverse Mutation for Optimization Learning Artificial Lemming Algorithm and Its Application in Engineering

Abstract

Complex engineering optimization problems often exhibit high-dimensional, multi-constraint, and nonlinear characteristics. Traditional deterministic optimization methods rely on gradient information and have limited optimization ranges, making it difficult to meet the requirements of efficient and accurate solutions. Intelligent optimization algorithms have become the core means of solving such problems. Aiming at the limitations of the standard artificial lemming algorithm (ALA), such as insufficient population diversity, premature convergence, weak local exploitation ability, and slow convergence speed, which make it difficult to meet the requirements of solving complex engineering optimization problems, this paper proposes a reverse mutation for optimization learning artificial lemming algorithm (RMALA). Based on the ALA algorithm, the algorithm integrates three strategies: Cauchy mutation, the improved salp swarm algorithm (ISSA), and reverse mutation for optimization learning. The Cauchy mutation is used to maintain population diversity and avoid premature convergence of the algorithm. The improved salp swarm algorithm enhances the local exploitation ability of the algorithm and improves the optimization accuracy. Reverse mutation for optimization learning guides the population toward the global optimal solution region and accelerates the convergence speed. The significant experimental results show that in the CEC2017 and CEC2022 standard test sets, as well as the three classic engineering constrained optimization problems of welded beams, cantilever beams, and pressure vessels, RMALA’s optimization accuracy is improved by more than 30% compared to the original ALA, and its convergence speed is improved by more than 25%. Its stability and robustness are better than those of five new swarm intelligence algorithms proposed in recent years. It can efficiently solve complex high-dimensional, nonlinear constrained optimization problems and has high significant engineering application value and academic innovation.