Classical and quantum-inspired Tabu search for solving 0/1 knapsack problem

In this paper, we propose a novel quantum-inspired evolutionary algorithm, called quantum-inspired Tabu search (QTS). QTS is based on the classical Tabu search and the characteristic of quantum computation, such as superposition. We will present how we implement QTS to solve 0/1 knapsack problem. Furthermore, the results of experiment are also compared with the original Quantum-inspired Evolutionary Algorithm (QEA)´ and the other heuristic algorithms´ experimental results. The final outcomes shows that QTS performs much better than the others on 0/1 knapsack problem, without premature convergence and more efficiency.