An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring.
Daniel Cosmin PorumbelJin-Kao HaoPascale KuntzPublished in: Comput. Oper. Res. (2010)
Keyphrases
- graph coloring
- combinatorial problems
- job shop scheduling
- phase transition
- np complete problems
- max sat
- constraint satisfaction problems
- scheduling problem
- metaheuristic
- hyper heuristics
- neural network
- randomly generated
- branch and bound algorithm
- constraint programming
- lower bound
- combinatorial optimization problems
- crossover operator
- artificial bee colony
- combinatorial optimization
- np complete