A Novel Hybrid Tabu Search Algorithm With Binary Differential Operator for Knapsack Problems

The knapsack problem (KP) is a typical NP- complete problem. In this paper, a novel tabu search (TS) algorithm with the elite set is presented to solve the KPs. The algorithm is a hybrid TS with a binary differential operator (BDO), which is denoted by TSBDO. The binary differential operator is employed to mutate individuals which are generated randomly from the list EliteSol. To validate the proposed TSBDO algorithm, 15 high-dimensional KP examples are randomly generated. Simulated results indicate that the TSBDO algorithm can yield better solutions than some existing algorithms such as GMBO and BABC-DE.