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.
KeywordsGenetic Algorithm Local Search Simulated Annealing Random Graph Crossover Operator
Unable to display preview. Download preview PDF.
- 1.P.M Pardalos, T. Mavridou, and J. Xue. The graph coloring problem: A bibliographic survey. In D.-Z. Du and P.M. Pardalos, editors, Handbook of Combinatorial Optimization, Vol. 2, pages 331–395. Kluwer Academic Publishers, 1998.Google Scholar
- 4.E. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial and Neural Computing. Interscience series in discrete mathematics and optimization. John Wiley & Sons, New York, 1989.Google Scholar
- 8.C.A. Morgenstern. Distributed coloration neighborhood search. In , pages 335–357. American Mathematical Society, 1996.Google Scholar
- 11.C. Fleurent and J.A. Ferland. Genetic and hybrid algorithms for graph coloring. Annals of Operations Research, pages 437–461, 1995.Google Scholar
- 12.L. Davis. Order-based genetic algorithms and the graph coloring problem. In Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.Google Scholar
- 14.P. Galinier and J.K. Hao. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 1998.Google Scholar
- 15.R. Dorne and J.K. Hao. A new genetic local search algorithm for graph coloring, 1998.Google Scholar
- 16.K. Mehlhorn and S. Naher. LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, 1999.Google Scholar
- 17.D.S. Johnson and M.A. Trick, editors. Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, volume 26_ of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1996. contains many articles on cliques and coloring.Google Scholar
- 18.G. Lewandowski and A. Condon. Experiments with parallel graph coloring heuristics and applications of graph coloring. In , pages 309–334. American Mathematical Society, 1996.Google Scholar