Colour Reassignment in Tabu Search for the Graph Set T-Colouring Problem.
Marco ChiarandiniThomas StützleKim S. LarsenPublished in: Hybrid Metaheuristics (2006)
Keyphrases
- tabu search
- simulated annealing
- metaheuristic
- candidate list
- quadratic assignment problem
- directed graph
- feasible solution
- heuristic methods
- hybrid algorithm
- solution space
- path relinking
- job shop scheduling problem
- graph theory
- random walk
- search algorithm
- genetic algorithm
- initial solution
- scatter search
- evolutionary algorithm