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

Authors:
Yao-Hsin Chou;Chia-Hui Chiu;Yi-Jyuan Yang
Affiliations:
National Chi-Nan University, Puli 54561, Taiwan Roc;National Chi-Nan University, Puli 54561, Taiwan Roc;National Chi-Nan University, Puli 54561, Taiwan Roc
Venue:
Proceedings of the 13th annual conference companion on Genetic and evolutionary computation
Year:
2011

Citing 2
Cited 0

A novel quantum swarm evolutionary algorithm and its applications

Neurocomputing
Quantum-inspired evolutionary algorithm for a class of combinatorial optimization

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.