Title
Hybrid Henry Gas Solubility Optimization Algorithm With Dynamic Cluster-To-Algorithm Mapping
Abstract
This paper discusses a new variant of Henry Gas Solubility Optimization (HGSO) Algorithm, called Hybrid HGSO (HHGSO). Unlike its predecessor, HHGSO allows multiple clusters serving different individual meta-heuristic algorithms (i.e., with its own defined parameters and local best) to coexist within the same population. Exploiting the dynamic cluster-to-algorithm mapping via penalized and reward model with adaptive switching factor, HHGSO offers a novel approach for meta-heuristic hybridization consisting of Jaya Algorithm, Sooty Tern Optimization Algorithm, Butterfly Optimization Algorithm, and Owl Search Algorithm, respectively. The acquired results from the selected two case studies (i.e., involving team formation problem and combinatorial test suite generation) indicate that the hybridization has notably improved the performance of HGSO and gives superior performance against other competing meta-heuristic and hyper-heuristic algorithms.
Year
DOI
Venue
2021
10.1007/s00521-020-05594-z
NEURAL COMPUTING & APPLICATIONS
Keywords
DocType
Volume
Hybrid meta-heuristic algorithm, Henry Gas Solubility Optimization Algorithm, Search-based Software Engineering
Journal
33
Issue
ISSN
Citations 
14
0941-0643
1
PageRank 
References 
Authors
0.35
40
4
Name
Order
Citations
PageRank
Kamal Z. Zamli121620.50
Md. Abdul Kader211.36
Saiful Azad3284.55
Bestoun S. Ahmed410.35