Tabu Search Based Procedure for Solving the 0-1 MultiObjective Knapsack Problem: The Two Objectives Case.
Xavier GandibleuxArnaud FrévillePublished in: J. Heuristics (2000)
Keyphrases
- knapsack problem
- tabu search
- multiple objectives
- multidimensional knapsack problem
- metaheuristic
- test problems
- multi objective
- optimization problems
- search heuristics
- search procedure
- vehicle routing problem
- simulated annealing
- nsga ii
- optimal solution
- randomly generated test instances
- combinatorial optimization problems
- evolutionary algorithm
- combinatorial optimization
- implicit enumeration
- genetic algorithm
- feasible solution
- mip solver
- exact algorithms
- path relinking
- dynamic programming
- scatter search
- memetic algorithm
- scheduling problem
- search algorithm
- lp relaxation
- heuristic methods
- mixed integer program
- job shop scheduling problem
- np hard
- linear programming relaxation
- greedy algorithm
- search algorithm for solving
- multi start
- objective function
- optimization algorithm
- tabu search algorithm
- candidate list
- variable neighborhood search
- cutting plane
- combinatorial problems
- multi objective optimization
- ant colony optimization
- iterated local search
- initial solution
- max sat
- branch and bound algorithm
- constraint satisfaction