Hybrid Evolutionary Algorithms for Graph Coloring

Philippe Galinier () and Jin-Kao Hao ()
Additional contact information
Philippe Galinier: LGI2P, EMA-EERIE, Parc Scientifique Georges Besse
Jin-Kao Hao: LERIA, Université d'Angers

Journal of Combinatorial Optimization, 1999, vol. 3, issue 4, No 3, 379-397

Abstract: 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 (search for similar items in EconPapers)
Date: 1999
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (41)

Downloads: (external link)
http://link.springer.com/10.1023/A:1009823419804 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:3:y:1999:i:4:d:10.1023_a:1009823419804

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1023/A:1009823419804

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().