Creating a Binary AHA Algorithm with Varied Transfer Function
摘要
To solve binary problems different optimization algorithms are converted to their binary version. In this research, we developed a binary optimization technique employing a different transfer function using the Artificial Hummingbird algorithm. This study compares various transfer functions having S-shaped or V-shaped to determine which one performs better while creating a new binary algorithm. The new algorithm is evaluated using benchmark functions. A comparative study of this newly formed algorithm is also given in this paper.