Quantum-inspired tabu search algorithm for solving 0/1 knapsack problems.
Yao-Hsin ChouChia-Hui ChiuYi-Jyuan YangPublished in: GECCO (Companion) (2011)
Keyphrases
- search algorithm for solving
- knapsack problem
- quantum inspired
- tabu search
- metaheuristic
- binary gravitational search algorithm
- optimization problems
- optimal solution
- simulated annealing
- scheduling problem
- genetic algorithm
- test problems
- quantum computing
- search algorithm
- feasible solution
- np hard
- combinatorial optimization problems
- dynamic programming
- lower bound
- mutation operator
- linear programming relaxation
- vehicle routing problem
- immune clonal
- principles of quantum computing
- combinatorial optimization
- greedy algorithm
- objective function
- evolutionary algorithm
- computational complexity
- nsga ii
- upper bound
- maximum profit