Multistart solution-based tabu search for the Set-Union Knapsack Problem.
Zequn WeiJin-Kao HaoPublished in: Appl. Soft Comput. (2021)
Keyphrases
- tabu search
- knapsack problem
- multidimensional knapsack problem
- test problems
- simulated annealing
- metaheuristic
- optimal solution
- initial solution
- solution space
- search procedure
- optimization problems
- iterated local search
- tabu search algorithm
- scheduling problem
- combinatorial optimization problems
- decision variables
- feasible solution
- candidate list
- path relinking
- scatter search
- quadratic assignment problem
- maximum profit
- implicit enumeration
- job shop scheduling problem
- genetic algorithm
- variable neighborhood search
- integer programming
- hybrid algorithm
- benchmark instances
- dynamic programming
- minimum cost
- lower bound
- solution quality
- ant colony optimization
- traveling salesman problem