Classical and quantum-inspired Tabu search for solving 0/1 knapsack problem.
Yao-Hsin ChouYi-Jyuan YangChia-Hui ChiuPublished in: SMC (2011)
Keyphrases
- knapsack problem
- tabu search
- quantum inspired
- multidimensional knapsack problem
- test problems
- metaheuristic
- search heuristics
- optimization problems
- randomly generated test instances
- implicit enumeration
- simulated annealing
- optimal solution
- combinatorial optimization problems
- combinatorial optimization
- scheduling problem
- binary gravitational search algorithm
- feasible solution
- vehicle routing problem
- quantum computing
- genetic algorithm
- path relinking
- exact algorithms
- dynamic programming
- np hard
- evolutionary algorithm
- lp relaxation
- search algorithm
- memetic algorithm
- job shop scheduling problem
- heuristic methods
- max sat
- hybrid algorithm
- ant colony optimization
- mutation operator
- greedy algorithm
- tabu search algorithm
- flowshop
- least squares
- search space
- lower bound
- objective function