A composite-neighborhood tabu search approach to the traveling tournament problem.
Luca Di GasperoAndrea SchaerfPublished in: J. Heuristics (2007)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- memetic algorithm
- scheduling problem
- feasible solution
- search algorithm
- path relinking
- vehicle routing problem
- genetic algorithm
- hybrid algorithm
- search procedure
- heuristic methods
- job shop scheduling problem
- iterated local search
- tabu search algorithm
- test problems
- benchmark instances
- initial solution
- max sat
- multidimensional knapsack problem
- tabu list
- multi start
- optimization problems
- benchmark problems
- quadratic assignment problem
- scatter search
- simulated annealing and tabu search
- candidate list
- np hard
- combinatorial optimization
- variable neighborhood search
- neighborhood structure
- ant colony optimization
- search heuristics
- starting point