BinEHO: a new binary variant based on elephant herding optimization algorithm

One of the new optimization techniques proposed in recent years is elephant herding optimization (EHO) algorithm. Despite its short history, EHO has been used to solve many engineering and real-world problems by attracting researcher attention with its advantages such as efficient global search ability, having fewer control parameters and ease of implementation. However, there is no remarkable binary variant of EHO algorithm in the literature. A new binary approach based on EHO algorithm is proposed in this study. The newer binary variant of EHO named as BinEHO is binarized with preserving the search ability of basic EHO. The main purpose of the study is to present a simple, efficient and robust binary variant which copes with different binary problems. Therefore, the proposed method is tested on three important binary optimization problems, 0-1 knapsack, uncapacitated facility location and wind turbine placement, in order to show its performance and accuracy. In addition, the BinEHO is compared with various binary variants on these problems. Experimental results and comparisons show that the BinEHO algorithm is a robust and efficient tool for binary optimization.