Skip to content

Latest commit

 

History

History
11 lines (6 loc) · 638 Bytes

README.md

File metadata and controls

11 lines (6 loc) · 638 Bytes

Quantum Tabu Search implementation for solving the 0/1-Knapsack Problem

This implementation of Tabu Search was based on the research paper "Quantum-inspired Tabu Search implementation for solving 0/1 Knapsack Problems" .

The repair method used was based on a Lamarckian greedy repair approach.

References

CHIU, Hui-Chia. YANG, Yi-Jyhuan. CHOU, Yao-Hsin. Quantum-inspired Tabu Search implementation for solving 0/1 Knapsack Problems. 2011, Dublin.

ISHIBUSHI, Hisao. KAIGE, Shiori. NARUKAWA, Kaname. Comparison between Lamarckian and Baldwinian Repair on Multiobjective 0/1 Knapsack Problems. Osaka Prefecture University, Japan.