A Hybrid Optimization Algorithm with Multi-Strategy Integration and Multi-Subpopulation Cooperation for Engineering Problem Solving

To solve the limitations of single optimization algorithms, such as premature convergence, insufficient global exploration, and high susceptibility to local optima, a Hybrid Optimization Algorithm (HOA) based on multi-subpopulation collaboration and multi-strategy fusion is proposed. The HOA uses Logistic chaotic mapping for population initialization to enhance uniformity and diversity. The population is then divided into four subpopulations; each is optimized independently using different strategies, including the genetic algorithm (GA), Gray Wolf Optimizer (GWO), self-attention mechanism, and k-nearest neighbor graph (kNN). This design leverages the strengths of individual algorithms while mitigating their respective limitations. An elite information exchange mechanism facilitates knowledge transfer by randomly reassigning elite individuals across subpopulations at fixed iteration intervals. Additionally, global optimization strategies including differential evolution (DE), Simulated Annealing (SA), Local Search (LS), and time of arrival (TOA) position adjustment are integrated to balance exploration and exploitation, thereby enhancing convergence accuracy and the ability to escape local optima. Evaluated on the CEC2017 benchmark suite and real-world engineering problems, the HOA demonstrates superior performance in convergence speed, accuracy, and robustness compared to single-algorithm approaches—notably, HOA ranks 1st in 30-dimensional CEC2017 functions. By effectively integrating multiple optimization strategies, the HOA provides an effective and reliable solution to complex optimization challenges.