An Evolutionary Algorithm for Graph Coloring Problems

Abstract

This paper presents an evolutionary algorithm for graph-coloring problems. The proposed evolutionary algorithm works on artificial strings each of which represents some coloring solution. Using robust encoding and genetic operators, the algorithm exploits, and evolves better solutions. In experiments the algorithm is applied to random normal graphs instances as well as radio-coloring instances.