By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yao-Hsin Chou ; Nat. Chi-Nan Univ., Puli, Taiwan ; Yi-Jyuan Yang ; Chia-Hui Chiu

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.

Published in:

Systems, Man, and Cybernetics (SMC), 2011 IEEE International Conference on

Date of Conference:

9-12 Oct. 2011