Hybrid Evolutionary Algorithms for Graph Coloring |
| |
Authors: | Philippe Galinier Jin-Kao Hao |
| |
Institution: | (1) LGI2P, EMA-EERIE, Parc Scientifique Georges Besse, F-30000 Nîmes, France;(2) LERIA, Université d'Angers, 2 bd Lavoisier, F-49045 Angers, France |
| |
Abstract: | 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 large DIMACS Challenge benchmark graphs. Results prove very competitive with and even better than those of state-of-the-art algorithms. Analysis of the behavior of the algorithm sheds light on ways to further improvement. |
| |
Keywords: | graph coloring solution recombination tabu search combinatorial optimization |
本文献已被 SpringerLink 等数据库收录! |
|