Quantum-inspired tabu search algorithm for solving 0/1 knapsack problems

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 experiments are also compared with other quantum-inspired evolutionary algorithm and other heuristic algorithms' experimental results. The final outcomes show that QTS performs much better than the other heuristic algorithms on 0/1 knapsack problem, without premature convergence and more efficiency.

[1]  Jong-Hwan Kim,et al.  Quantum-inspired evolutionary algorithm for a class of combinatorial optimization , 2002, IEEE Trans. Evol. Comput..

[2]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[3]  Yanchun Liang,et al.  A novel quantum swarm evolutionary algorithm and its applications , 2007, Neurocomputing.

[4]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[5]  Jong-Hwan Kim,et al.  Genetic quantum algorithm and its application to combinatorial optimization problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).