A Binary Social Spider Algorithm for Discounted {0-1} Knapsack Problem

This paper proposed a new binary social spider algorithm with repair operator solving discounted {0-1} knapsack problem (DKP01). The solution of DKP01 is presented by a binary vector. Social spider algorithm is a simple and powerful optimization algorithm. A new function is used to convert real vector to binary vector to design binary social spider algorithm. We conducted extensive experiments on two types of 20 instances using our proposed approach. The experiments proved that the new method is efficient for solving DKP01.