Tabu Search versus GRASP for the maximum diversity problem.
Roberto AringhieriRoberto CordoneYari MelzaniPublished in: 4OR (2008)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- scheduling problem
- search algorithm
- memetic algorithm
- feasible solution
- search procedure
- genetic algorithm
- test problems
- heuristic methods
- path relinking
- vehicle routing problem
- job shop scheduling problem
- initial solution
- iterated local search
- benchmark instances
- quadratic assignment problem
- scatter search
- hybrid algorithm
- multi start
- tabu search algorithm
- candidate list
- multidimensional knapsack problem
- max sat
- tabu list
- variable neighborhood search
- flowshop
- combinatorial optimization
- genetic algorithm ga
- evolutionary algorithm
- graph colouring
- decision trees