A Dynamic Hierarchical Improved Tyrannosaurus Optimization Algorithm with Hybrid Topology Structure

Abstract

Aiming at the problems of the Tyrannosaurus optimization algorithm, of poor search accuracy, insufficient global search capability, and ease of falling into local optimality, a dynamic hierarchical improved Tyrannosaurus optimization algorithm (DHTROA) with hybrid topology structure is proposed. Initially, a chaotic opposition-based learning approach is selected to start the population, ensuring a more uniform distribution of prey across the solution area and boosting population diversity; later, a dynamic hybrid bi-population strategy is introduced to divide the initial population into an ‘advantaged group’ and a ‘disadvantaged group’ to improve the efficiency of individual information exchange. Finally, the ‘advantaged group’ and ‘disadvantaged group’ are hunted synchronously; for the ‘advantaged group’, the position update is carried out using the cellular ring topology strategy, and for the ‘disadvantaged group’, the original algorithm is run in accordance with the main loop process. For the problem of the constant running rate of the Tyrannosaurus in the original algorithm, an adaptive running rate strategy is proposed, which enhances the ability of global optimization, and at the same time, the shortcomings of the original algorithm’s ‘failure’ strategy are improved in order to enhance the original algorithm to jump out of extrema. DHTROA was tested for performance with nine optimization algorithms in different dimensions of the CEC2017 test function. The efficiency of these enhancements was confirmed through the Wilcoxon rank sum test and Friedman test, while DHTROA was utilized for six engineering optimization challenges of differing complexities. The experimental results show that DHTROA has improved greatly in convergence speed, optimality search accuracy, global search ability, and stability, and the excellent engineering optimization performance also proves the excellent robustness of DHTROA.