Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem.
Mariem Ben SalemSaïd HanafiRaouia TaktakHanêne Ben-AbdallahPublished in: RAIRO Oper. Res. (2017)
Keyphrases
- tabu search
- knapsack problem
- multidimensional knapsack problem
- test problems
- metaheuristic
- optimization problems
- simulated annealing
- optimal solution
- vehicle routing problem
- combinatorial optimization problems
- scheduling problem
- exact algorithms
- path relinking
- feasible solution
- benchmark instances
- genetic algorithm
- search algorithm
- hybrid algorithm
- iterated local search
- dynamic programming
- memetic algorithm
- scatter search
- bayesian networks
- heuristic methods
- initial solution
- search procedure
- greedy algorithm
- tabu list
- job shop scheduling problem
- np hard
- tabu search algorithm
- flowshop
- test instances
- max sat
- combinatorial optimization
- quadratic assignment problem
- lp relaxation
- objective function
- multi start
- evolutionary algorithm
- variable neighborhood search
- special case
- cost function
- nsga ii
- linear programming relaxation
- ant colony optimization
- routing problem