A New Binary Snake Optimizer for 0-1 Knapsack Problems

Abstract

The Snake Optimizer (SO) is a newly proposed heuristic algorithm in recent years. It was proposed in the original paper for continuous optimization problems. Its success has been tested on CEC-2017 and engineering design problems. When the literature is reviewed, there is no recommended version of SO for binary optimization problems. In this study, SO has been updated to solve binary optimizations. Transfer functions are generally used when converting continuous search space to binary search space. In this study, S-shaped and Vshaped transfer functions, which are mostly used in binary optimizations, are used. Eight different Binary SO (SOBin) variations were obtained according to the transfer functions used (SOBin_S1, SOBin_S2, SOBin_S3, SOBin_S4, SOBin_V1, SOBin_V2, SOBin_V3, SOBin_V4). These Binary SO variations were tested on twenty-five knapsack problems of different sizes (dimension= {8, 12, 16, 20, 24}). The knapsack problem is often used to test the success of binary optimization problems. The knapsack problem is based on placing the most valuable and least weighty objects in a bag. It is a maximization problem. According to the results obtained, V-shaped transfer functions have obtained more successful results than S-shaped transfer functions. The most successful Binary SO variation was the one using the V1 transfer function (SOBin_V1).