An Evolutionary Annealing Approach to Graph Coloring

  • Dimitris A. Fotakis
  • Spiridon D. Likothanassis
  • Stamatis K. Stefanakos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2037)


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.


Genetic Algorithm Local Search Simulated Annealing Random Graph Crossover Operator 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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
  2. 2.
    F.T. Leighton. A graph colouring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards, 84(6):489–503, 1979.CrossRefzbMATHGoogle Scholar
  3. 3.
    D. Brélaz. New methods to color the vertices of a graph. Communications of the ACM, 22(4):251–256, April 1979.MathSciNetCrossRefzbMATHGoogle Scholar
  4. 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
  5. 5.
    F. Glover. Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13:533–549, 1986.MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    M. Chams, A. Hertz, and D. deWerra. Some experiments with simulated annealing for coloring graphs. European Journal of Operational Research, 32(2):260–266, 1987.MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    D.S. Johnson, C.R. Aragon, L.A. McGeoch, and C. Schevon. Optimization by simulated annealing: An experimental evaluation; part II, graph coloring and number partitioning. Operations Research, 39(3):378–406, May-June 1991.CrossRefzbMATHGoogle Scholar
  8. 8.
    C.A. Morgenstern. Distributed coloration neighborhood search. In [17], pages 335–357. American Mathematical Society, 1996.Google Scholar
  9. 9.
    A. Hertz and D. de Werra. Using tabu search techniques for graph coloring. Computing, 39(4):345–351, 1987.MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer-Verlag, NY, 1992.CrossRefzbMATHGoogle Scholar
  11. 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. 12.
    L. Davis. Order-based genetic algorithms and the graph coloring problem. In Handbook of Genetic Algorithms. Van Nostrand Reinhold, 1991.Google Scholar
  13. 13.
    D. Costa, A. Hertz, and O. Dubuis. Embedding a sequential procedure within an evolutionary algorithm for coloring problems. Journal of Heuristics, 1:105–128, 1995.CrossRefzbMATHGoogle Scholar
  14. 14.
    P. Galinier and J.K. Hao. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization, 1998.Google Scholar
  15. 15.
    R. Dorne and J.K. Hao. A new genetic local search algorithm for graph coloring, 1998.Google Scholar
  16. 16.
    K. Mehlhorn and S. Naher. LEDA: A platform for combinatorial and geometric computing. Cambridge University Press, 1999.Google Scholar
  17. 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. 18.
    G. Lewandowski and A. Condon. Experiments with parallel graph coloring heuristics and applications of graph coloring. In [17], pages 309–334. American Mathematical Society, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Dimitris A. Fotakis
    • 1
  • Spiridon D. Likothanassis
    • 1
  • Stamatis K. Stefanakos
    • 2
  1. 1.Computer Engineering & Informatics DepartmentUniversity of PatrasGreece
  2. 2.Department of Computer ScienceETH ZurichZurichSwitzerland

Personalised recommendations