Performance Evaluation of Various Binary Variants of ABC Algorithm for Solving Knapsack Problem
AbstractOver past two decades, many algorithms taking inspiration from natural phenomena have been proposed by the researchers. One of the famous algorithms is Artificial Bee Colony (ABC) algorithm which is inspired by the intelligent behaviors of the honey bees. Although original ABC algorithm has been proposed for solving continuous optimization problems, in order to effectively solve binary optimization problems original ABC should be modified. Using logic operator, genetic operator, and transfer function are the strategies to obtain binary solutions. Knapsack is a well-known binary optimization problem which aims to obtain a maximal knapsack packing. In this paper, various binary variants of ABC algorithm (xorABC, crossoverABC, vFunctionABC) are applied to 0–1 knapsack packing problem. The performance of three binary variants of ABC is investigated with respect to time and quality.