Journal of Combinatorial Optimization

, Volume 3, Issue 4, pp 379–397 | Cite as

Hybrid Evolutionary Algorithms for Graph Coloring

  • Philippe Galinier
  • Jin-Kao Hao


A recent and very promising approach for combinatorial optimization is to embed local search into the framework of evolutionary algorithms. In this paper, we present such hybrid algorithms for the graph coloring problem. These algorithms combine a new class of highly specialized crossover operators and a well-known tabu search algorithm. Experiments of such a hybrid algorithm are carried out on large DIMACS Challenge benchmark graphs. Results prove very competitive with and even better than those of state-of-the-art algorithms. Analysis of the behavior of the algorithm sheds light on ways to further improvement.

graph coloring solution recombination tabu search combinatorial optimization 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. D. Br´elaz, "New methods to color vertices of a graph," Communications of ACM, vol. 22, pp. 251–256, 1979.Google Scholar
  2. G.J. Chaitin, "Register Allocation and Spilling via Graph Coloring," in Proc. of ACM SIGPLAN 82 Symposium on Compiler Construction, New York, 1982, pp. 98–105.Google Scholar
  3. M. Chams, A. Hertz, and D. de Werra, "Some experiments with simulated annealing for coloring graphs," European Journal of Operational Research, vol. 32, pp. 260–266, 1987.Google Scholar
  4. D. Costa, A. Hertz, and O. Dubuis, "Embedding of a sequential procedure within an evolutionary algorithm for coloring problems in graphs," Journal of Heuristics, vol. 1, no. 1, pp. 105–128, 1995.Google Scholar
  5. L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold: New York, 1991.Google Scholar
  6. R. Dorne and J.K. Hao, "Tabu search for graph coloring, T-coloring and set T-colorings," in Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, S. Voss, S. Martello, I.H. Osman and C. Roucairol (Eds.), Kluwer Academic Publishers, 1999, Chapter 6, pp. 77–92.Google Scholar
  7. R. Dorne and J.K. Hao, "A new genetic local search algorithm for graph coloring," Lecture Notes in Computer Science 1498, Springer-Verlag, 1998, pp. 745–754.Google Scholar
  8. E. Falkenauer, "A hybrid grouping genetic algorithm for bin packing," Journal of Heuristics, vol. 2, no. 1, pp. 5–30, 1996.Google Scholar
  9. C. Fleurent and J.A. Ferland, "Object-Oriented Implementation of Heuristic Search Methods for Graph Coloring, Maximum Clique, and Satisfiability," in Proceedings of the 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society, vol. 26, 1996, pp. 619–652.Google Scholar
  10. B. Freisleben and P. Merz, "New genetic local search operators for the travelling salesman problem," Lecture Notes in Computer Science 1141, Springer-Verlag, 1996, pp. 890–899.Google Scholar
  11. A. Gamst, "Some lower bounds for a class of frequency assignment problems," IEEE Transactions on Vehicular Technology, vol. 35, no. 1, pp. 8–14, 1986.Google Scholar
  12. M.R. Garey and D.S. Johnson, Computer and Intractability, Freeman: San Francisco, 1979.Google Scholar
  13. F. Glover and M. Laguna, Tabu Search, Kluwer Academic Publishers, 1997.Google Scholar
  14. D.E. Goldberg, Genetic Algorithms in Search; Optimization and Machine Learning, Addison-Wesley, 1989.Google Scholar
  15. J.J. Greffenstette, "Incorporating problem specific knowledge into a genetic algorithm," in Genetic Algorithms and Simulated Annealing, L. Davis (Ed.), Morgan Kauffmann Publishers, 1987, pp. 42–60.Google Scholar
  16. A. Hertz and D. de Werra, "Using tabu search techniques for graph coloring," Computing, vol. 39, pp. 345–351, 1987.Google Scholar
  17. J.H. Holland, Adaptation and Artificial Systems, University of Michigan Press: Ann Arbor, 1975.Google Scholar
  18. 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, vol. 39, no. 3, pp. 378–406, 1991.Google Scholar
  19. D.S. Johnson and M.A. Trick (Eds.), in Proceedings of the 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, 1996.Google Scholar
  20. F.T. Leighton, "A graph coloring algorithm for large scheduling problems," Journal of Research of the National Bureau Standard, vol. 84, pp. 489–505, 1979.Google Scholar
  21. P. Merz and B. Freisleben, "A Genetic Local Search Approach to the Quadratic Assignment Problem," in Proc. of the 7th International Conference of Genetic Algorithms, Morgan Kauffman Publishers, 1997, pp. 465–472.Google Scholar
  22. C. Morgenstern, "Distributed Coloration Neighborhood Search," in Proceedings of the 2nd DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society, vol. 26, 1996, pp. 335–358.Google Scholar
  23. H. M¨uehlenbein, M. Gorges-Schleuter, and O. Kr¨amer, "Evolution algorithms in combinatorial optimization," Parallel Computing, vol. 7, pp. 65–88, 1988.Google Scholar
  24. P.M. Pardalos, T. Mavridou, and J. Xue, "The graph coloring problem: A bibliographic survey," in Handbook of Combinatorial Optimization, D.-Z. Du and P. Pardalos (Eds.), Kluwer Academic Publishers, vol. 2, 1998, pp. 331–395.Google Scholar

Copyright information

© Kluwer Academic Publishers 1999

Authors and Affiliations

  • Philippe Galinier
    • 1
  • Jin-Kao Hao
    • 2
  1. 1.LGI2P, EMA-EERIE, Parc Scientifique Georges BesseNîmesFrance
  2. 2.LERIA, Université d'AngersAngersFrance

Personalised recommendations