EHHGSO: Enhancing Hybrid Hugo Gas Solubility Optimization Algorithm Using Backtracking Technique

Metaheuristic algorithms play a pivotal role in solving complex optimization problems. This study addresses a common challenge faced by such algorithms, i.e., getting trapped in local optima. This problem hampers the efficacy of metaheuristic algorithms in achieving globally optimal solutions. This limitation is also observed in Hybrid Henry Gas Solubility Optimization Algorithm (HHGSO)-a new metaheuristic based algorithm-which employs a cluster-based approach for population management. While this approach fosters exploration by diversifying the search process, it lacks adaptiveness in cluster assignments and the potentiality of hybridization with other algorithms. These shortcomings hinder the algorithm's ability to effectively escape local optima and harness the strengths of diverse optimization techniques. To mitigate these challenges, this study proposed an Enhanced HHGSO (EHHGSO) algorithm, an advanced hybridization of HHGSO. Here, a novel backtracking based technique is incorporated that can detect the trapping into local optima and can escape from it. Empirical findings substantiate the efficacy of EHHGSO in comparison to its ancestor, HHGSO for various benchmark functions.