Journal of Combinatorial Optimization

, Volume 7, Issue 3, pp 229–236 | Cite as

Genetic Algorithm for Graph Coloring: Exploration of Galinier and Hao's Algorithm

  • Celia A. Glass
  • Adam Prügel-Bennett


This paper examines the best current algorithm for solving the Chromatic Number Problem, due to Galinier and Hao (Journal of Combinatorial Optimization, vol. 3, no. 4, pp. 379–397, 1999). The algorithm combines a Genetic Algorithm with Tabu Search. We show that the algorithm remains powerful even if the Tabu Search component is eliminated, and explore the reasons for its success where other Genetic Algorithms have failed. In addition we propose a generalized algorithm for the Frequency Assignment Problem.

graph theory: chromatic number problem frequency assignment problem heuristics: local search genetic algorithms 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. G. Carpaneto and P. Toth, “Algorithm 548: Solution of the assignment problem,” ACM Transactions of Mathematical Software, vol. 6, no. 1, pp. 104-111, 1980.Google Scholar
  2. D. Costa, A. Hertz, and O. Dubuis, “Embedding a sequential procedure within an evolutionary algorithm for coloring problems,” Journal of Heuristics, vol. 1, pp. 105-128, 1995.Google Scholar
  3. D.S. David, 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
  4. L. Davis, Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, 1991.Google Scholar
  5. A. Eisenblätter and A. Koster, “FAP web-a website about frequency assignment problems,” 2000. Available on the world wide web at Scholar
  6. C. Fleurent and J.A. Ferland, “Genetic and hybrid algorithms for graph coloring,” Annals of Operations Research, vol. 63, pp. 437-461, 1996.Google Scholar
  7. P. Galinier and J.K. Hao, “Hybrid evolutionary algorithms for graph coloring,” Journal of Combinatorial Optimization, vol. 3, no. 4, pp. 379-397, 1999.Google Scholar
  8. C.A. Glass and A. Prügel-Bennett, “A polynomially searchable exponential neighbourhood for graph coloring,” 1998. Available on the world wide web at Scholar
  9. A. Hertz and D. De Werra, “Using tabu search techniques for graph coloring,” Computing, vol. 39, pp. 345-351, 1987.Google Scholar
  10. D.S. Johnson and M.A. Trick (Eds.), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, American Mathematical Society, 1996. Available via ftp from pub/challenge/graph/benchmarks/.Google Scholar
  11. C. Morgenstern, “Distributed coloration neighborhood search,” in Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, 1993, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, D.S. Johnson and M.A. Trick (Eds.), American Mathematical Society, vol. 26, pp. 335-357, 1996.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Celia A. Glass
    • 1
  • Adam Prügel-Bennett
    • 2
  1. 1.Faculty of Actuarial Science and StatisticsCass Business SchoolLondonUK
  2. 2.Department of Electronics and Computer ScienceUniversity of SouthamptonSouthamptonUK

Personalised recommendations