DMCA
Hybrid Evolutionary Algorithms for Graph Coloring (1998)
| Citations: | 141 - 19 self |
BibTeX
@MISC{Galinier98hybridevolutionary,
author = {Philippe Galinier and Jin-kao Hao},
title = {Hybrid Evolutionary Algorithms for Graph Coloring},
year = {1998}
}
Share
 |
 |
 |
 |
||
OpenURL
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. 1 Introduction A recent and very promising approach for combinatorial optimization is to embed local search into the framework of population based evolutionary algorithms, leading to hybrid evolutionary algorithms (HEA). Such an algorithm is essentially based on two key elements: an eff...
Keyphrases
graph coloring combinatorial optimization hybrid evolutionary algorithm evolutionary algorithm local search promising approach hybrid algorithm state-of-the-art algorithm algorithm shed new class key element crossover operator large dimacs challenge benchmark graph solution recombination graph coloring problem well-known tabu search algorithm tabu search
