A variable neighborhood search for graph coloring.
Cédric AvanthayAlain HertzNicolas ZuffereyPublished in: Eur. J. Oper. Res. (2003)
Keyphrases
- variable neighborhood search
- graph coloring
- combinatorial problems
- metaheuristic
- traveling salesman problem
- tabu search
- hyper heuristics
- max sat
- heuristic methods
- simulated annealing
- job shop scheduling
- combinatorial optimization
- scheduling problem
- benchmark instances
- search space
- ant colony optimization
- optimization problems
- constraint satisfaction problems
- phase transition
- search procedure
- hybrid method
- job shop scheduling problem
- vehicle routing problem
- single machine scheduling problem
- optimal solution
- routing problem
- combinatorial optimization problems
- minimum spanning tree
- genetic algorithm
- search methods
- special case
- search algorithm
- test problems
- particle swarm optimization
- memetic algorithm
- artificial bee colony