Hybrid Henry gas solubility optimization algorithm with dynamic cluster-to-algorithm mapping

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...

Full description

Saved in:
Bibliographic Details
Published inNeural computing & applications Vol. 33; no. 14; pp. 8389 - 8416
Main Authors Zamli, Kamal Z., Kader, Md. Abdul, Azad, Saiful, Ahmed, Bestoun S.
Format Journal Article
LanguageEnglish
Published London Springer London 01.07.2021
Springer Nature B.V
Subjects
Online AccessGet full text
ISSN0941-0643
1433-3058
1433-3058
DOI10.1007/s00521-020-05594-z

Cover

More Information
Summary: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.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0941-0643
1433-3058
1433-3058
DOI:10.1007/s00521-020-05594-z