Affiliation:
1. School of Information Engineering, Tianjin University of Commerce, Tianjin 300134, China
Abstract
In recent years, optimization problems have received extensive attention from researchers, and metaheuristic algorithms have been proposed and applied to solve complex optimization problems. The wild horse optimizer (WHO) is a new metaheuristic algorithm based on the social behavior of wild horses. Compared with the popular metaheuristic algorithms, it has excellent performance in solving engineering problems. However, it still suffers from the problem of insufficient convergence accuracy and low exploration ability. This article presents an improved wild horse optimizer (I-WHO) with early warning and competition mechanisms to enhance the performance of the algorithm, which incorporates three strategies. First, the random operator is introduced to improve the adaptive parameters and the search accuracy of the algorithm. Second, an early warning strategy is proposed to improve the position update formula and increase the population diversity during grazing. Third, a competition selection mechanism is added, and the search agent position formula is updated to enhance the search accuracy of the multimodal search at the exploitation stage of the algorithm. In this article, 25 benchmark functions (Dim = 30, 60, 90, and 500) are tested, and the complexity of the I-WHO algorithm is analyzed. Meanwhile, it is compared with six popular metaheuristic algorithms, and it is verified by the Wilcoxon signed-rank test and four real-world engineering problems. The experimental results show that I-WHO has significantly improved search accuracy, showing preferable superiority and stability.
Funder
National Natural Science Foundation of China
Natural Science Foundation of Tianjin
Tianjin Research Innovation Project for Postgraduate Students
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference48 articles.
1. Improved Harris hawks optimization for non-convex function optimization and design optimization problems;Kang;Math. Comput. Simul.,2023
2. Agarwal, N., Shrivastava, N., and Pradhan, M. (2021, January 15–16). Ananya Algorithm: A Simple and New Optimization Algorithm for Engineering Optimization. Proceedings of the 2021 4th Biennial International Conference on Nascent Technologies in Engineering (ICNTE), Navi Mumbai, India.
3. Chaotic grey wolf optimization algorithm for constrained optimization problems;Kohli;J. Comput. Des. Eng.,2018
4. Emperor penguin optimizer: A comprehensive review based on state-of-the-art meta-heuristic algorithms;Khalid;Alex. Eng. J.,2023
5. Orchard Algorithm (OA): A New Meta-Heuristic Algorithm for Solving Discrete and Continuous Optimization Problems;Kaveh;Math. Comput. Simul.,2023