An Evolutionary Annealing Approach to Graph Coloring

This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel crossover operator for graph coloring. Moreover, we investigate various ways in which simulated annealing can be used to enhance the performance of an evolutionary algorithm. Experiments performed on various collections of instances have justified the potential of this approach. We also discuss some possible enhancements and directions for further research.

• Type: Conference
• Year: 2001
• Where: EVOW
• Authors: Dimitris Fotakis, Spiridon D. Likothanassis, Stamatis Stefanakos
• Keywords: Artificial Intelligence, EVOW 2001, Graph Coloring, Graph Coloring Problem, Simulated Annealing