Genetic and hybrid algorithms for graph coloring.
Charles FleurentJacques A. FerlandPublished in: Ann. Oper. Res. (1996)
Keyphrases
- graph coloring
- hybrid algorithms
- combinatorial problems
- metaheuristic
- genetic algorithm
- sat problem
- phase transition
- job shop scheduling
- hyper heuristics
- max sat
- hybrid algorithm
- evolutionary algorithm
- constraint satisfaction problems
- simulated annealing
- hill climbing
- job shop scheduling problem
- scheduling problem
- ant colony optimization
- optimization problems
- optimal solution
- artificial bee colony
- bi objective
- constraint satisfaction
- tabu search
- satisfiability problem
- search methods
- search space
- combinatorial optimization
- sat instances