A Novel Hybrid Differential Evolution-based Hiking Optimization Algorithm.

Saved in:

Bibliographic Details
Title:	A Novel Hybrid Differential Evolution-based Hiking Optimization Algorithm.
Authors:	Sun, Kaizhen¹ sunkaizh12@163.com, Zhang, Yong¹ zy9091@163.com
Source:	Engineering Letters. May2026, Vol. 34 Issue 5, p1757-1771. 15p.
Subjects:	Differential evolution, Optimization algorithms, Metaheuristic algorithms, Algorithms, Mathematical optimization
Abstract:	The Hiking optimization algorithm (HOA) is an algorithm inspired by hiking. Aiming at the shortcomings of the original hiking optimization algorithm, such as easy to fall into local optimum and limited convergence accuracy of complex optimization problems, based on the performance enhancement of the hiking optimization algorithm, a hybrid differential evolution hiking optimization algorithm is proposed, which is called DEHOA. Firstly, by introducing the differential evolution crossover operator, the hiking optimization algorithm is deeply integrated with the crossover idea of differential evolution. The candidate solution is generated by the differential vector and the dimension crossover is performed, which significantly enhances the population diversity and search ability. Secondly, a dual-strategy parallel search of population information interaction optimization is designed to balance exploration and development. At the same time, the update mechanism of the original algorithm and the new solution generated by crossover are maintained, and the optimal solution is retained by greedy strategy selection. Finally, according to the requirements of different iteration stages, an adaptive boundary processing function is introduced to ensure that all boundary-crossing values are forced to be constrained within the upper and lower bounds, so as to avoid the generation of invalid solutions. The three strategies work together to effectively improve the global exploration ability and local convergence performance of the algorithm. In addition, in order to verify the optimization performance of DEHOA algorithm, DEHOA is compared with four advanced meta-heuristic algorithms on the test function CEC2022. Experiments show that the new algorithm shows better optimization accuracy and efficiency on multiple sets of benchmark test functions, and provides a more competitive solution for complex optimization scenarios. [ABSTRACT FROM AUTHOR]
	Copyright of Engineering Letters is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	The Hiking optimization algorithm (HOA) is an algorithm inspired by hiking. Aiming at the shortcomings of the original hiking optimization algorithm, such as easy to fall into local optimum and limited convergence accuracy of complex optimization problems, based on the performance enhancement of the hiking optimization algorithm, a hybrid differential evolution hiking optimization algorithm is proposed, which is called DEHOA. Firstly, by introducing the differential evolution crossover operator, the hiking optimization algorithm is deeply integrated with the crossover idea of differential evolution. The candidate solution is generated by the differential vector and the dimension crossover is performed, which significantly enhances the population diversity and search ability. Secondly, a dual-strategy parallel search of population information interaction optimization is designed to balance exploration and development. At the same time, the update mechanism of the original algorithm and the new solution generated by crossover are maintained, and the optimal solution is retained by greedy strategy selection. Finally, according to the requirements of different iteration stages, an adaptive boundary processing function is introduced to ensure that all boundary-crossing values are forced to be constrained within the upper and lower bounds, so as to avoid the generation of invalid solutions. The three strategies work together to effectively improve the global exploration ability and local convergence performance of the algorithm. In addition, in order to verify the optimization performance of DEHOA algorithm, DEHOA is compared with four advanced meta-heuristic algorithms on the test function CEC2022. Experiments show that the new algorithm shows better optimization accuracy and efficiency on multiple sets of benchmark test functions, and provides a more competitive solution for complex optimization scenarios. [ABSTRACT FROM AUTHOR]
ISSN:	1816093X