An efficient tabu search approach for the 0-1 multidimensional knapsack problem.
Saïd HanafiArnaud FrévillePublished in: Eur. J. Oper. Res. (1998)
Keyphrases
- multidimensional knapsack problem
- tabu search
- metaheuristic
- simulated annealing
- path relinking
- memetic algorithm
- scheduling problem
- feasible solution
- genetic algorithm
- search procedure
- test problems
- iterated local search
- vehicle routing problem
- search algorithm
- heuristic methods
- scatter search
- tabu list
- initial solution
- job shop scheduling problem
- knapsack problem
- tabu search algorithm
- hybrid algorithm
- quadratic assignment problem
- benchmark instances
- multiple choice
- reinforcement learning