A recent and very promising approach for combinatorial optimization is to embed
local search into the framework of evolutionary algorithms. In this paper, we
present such hybrid algorithms for the graph coloring problem. These algorithms
combine a new class of highly specialized crossover operators and a well-known
tabu search algorithm. Experiments of such a hybrid algorithm are carried out on
la... hiện toàn bộ