A new binary variant with transfer functions of Harris Hawks Optimization for binary wind turbine micrositing
Ayşe Beşkirli, İdiris Dağ
Abstract
Harris Hawks Optimization (HHO) is a new algorithm proposed in 2019 for nontrivial, nature-inspired optimization problems. The original version of the HHO algorithm was proposed to solve continuous optimization problems. This study suggested a new binary variant of the HHO for the binary wind turbine micrositing problem, which was named as HHObin. The HHObin algorithm proposed for converting the continuous version of the HHO algorithm into binary version is equipped with ceil (T1), ceilRound (T2), ceilFloor (T3), Roundfloor (T4), moduleBase A (T5), moduleBase B (T6), T7 and T8 transfer functions. Thus, the original HHO algorithm was converted to the HHObin algorithm for using to solve any binary problems. In this study, the HHObin algorithm developed for using in solving binary wind turbines was placed on the turbines at the constant wind velocity, at the angular constant wind velocity and at the angular variable wind velocity on a 2000 × 2000 area with different grid methods. The performance of the HHObin algorithm was compared with other studies in the literature. The results obtained showed that HHObin algorithm was more successful than other methods.