Using differential evolution for the graph coloring

Iztok Fister, Janez Brest
2011 2011 IEEE Symposium on Differential Evolution (SDE)  
Differential evolution was developed for reliable and versatile function optimization. It has also become interesting for other domains because of its ease to use. In this paper, we posed the question of whether differential evolution can also be used by solving of the combinatorial optimization problems, and in particular, for the graph coloring problem. Therefore, a hybrid self-adaptive differential evolution algorithm for graph coloring was proposed that is comparable with the best
more » ... for graph coloring today, i.e. Tabucol of Hertz and de Werra and the hybrid evolutionary algorithm of Galinier and Hao. We have focused on the graph 3-coloring. Therefore, the evolutionary algorithm with method SAW of Eiben et al., which achieved excellent results for this kind of graphs, was also incorporated into this study. The extensive experiments show that the differential evolution could become a competitive tool for the solving of graph coloring problem in the future.
doi:10.1109/sde.2011.5952075 dblp:conf/sdiev/FisterB11 fatcat:ylvernxi3zf2xeflj2ayw53uji