3.3.1. Binary EHO

Hakli et al. [123] proposed a new binary variant of EHO (BinEHO) for solving binary optimization problems. Through a dimension rate (DR) parameter and mutation process, BinEHO strengthened the compromise between exploitation and exploration. In order to prove the robustness and accuracy of BinEHO, it was compared with various binary variants in three different binary optimization problems. The results concluded that BinEHO outperformed the other binary algorithm variants.
