Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem.
Jin QinXianhao XuQinghua WuT. C. E. ChengPublished in: Comput. Oper. Res. (2016)
Keyphrases
- tabu search
- knapsack problem
- multidimensional knapsack problem
- feasible solution
- test problems
- metaheuristic
- hybrid algorithm
- optimization problems
- simulated annealing
- combinatorial optimization problems
- optimal solution
- vehicle routing problem
- exact algorithms
- memetic algorithm
- path relinking
- linear programming relaxation
- benchmark instances
- genetic algorithm
- scheduling problem
- heuristic methods
- search algorithm
- np hard
- job shop scheduling problem
- search procedure
- tabu search algorithm
- dynamic programming
- scatter search
- quadratic assignment problem
- iterated local search
- ant colony optimization
- initial solution
- greedy algorithm
- max sat
- candidate list
- mixed integer
- variable neighborhood search
- search space
- maximum profit
- tabu list
- lagrangian relaxation
- combinatorial problems
- evolutionary algorithm
- traveling salesman problem