New Order-Based Crossovers for the Graph Coloring Problem

  • Christine L. Mumford
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4193)


Huge color class redundancy makes the graph coloring problem (GCP) very challenging for genetic algorithms (GAs), and designing effective crossover operators is notoriously difficult. Thus, despite the predominance of population based methods, crossover plays a minor role in many state-of-the-art approaches to solving the GCP. Two main encoding methods have been adopted for heuristic and GA methods: direct encoding, and order based encoding. Although more success has been achieved with direct approaches, algorithms using an order based representation have one powerful advantage: every chromosome decodes as a feasible solution. This paper introduces some new order based crossover variations and demonstrates that they are much more effective on the GCP than other order based crossovers taken from the literature.


Genetic Algorithm Local Search Greedy Algorithm Graph Coloring Color Classis 
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.
    Anderson, P.G., Ashlock, D.: Advances in ordered greed (2004), Available from
  2. 2.
    Burke, E., Petrovic, S.: Recent research directions in automated timetabling. European Journal of Operational Research 140(2), 266–280 (2002)zbMATHCrossRefGoogle Scholar
  3. 3.
    Costa, D., Hertz, A., Dubuis, O.: Embedding a sequential procedure within an evolutionary algorithm for coloring problems. Journal of Heuristics 1, 105–128 (1995)zbMATHCrossRefGoogle Scholar
  4. 4.
    Croitoru, C., Luchian, H., Gheorghieş, O., Apetrei, A.: A new genetic graph coloring heuristic. In: Proceedings of the Computational Symposium on Graph Coloring and its Generalizations, pp. 63–74 (2002)Google Scholar
  5. 5.
    Culberson, J., Luo, F.: Exploring the k-colorable landscape with iterated greedy. In Johnson and Trick [13], pp. 499–520Google Scholar
  6. 6.
    Brélaz, D.: New methods to color the vertices of graphs. Communications of the ACM 24(4), 251–256 (1979)CrossRefGoogle Scholar
  7. 7.
    Eiben, A.E., Van der Hauw, J.K., Van Hemert, J.I.: Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics 4, 25–46 (1998)zbMATHCrossRefGoogle Scholar
  8. 8.
    Erben, W.: A grouping genetic algorithm for graph colouring and exam timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, Springer, Heidelberg (2001)CrossRefGoogle Scholar
  9. 9.
    Fleurent, C., Ferland, J.A.: Genetic and hybrid algorithms for graph coloring. Annals of Operations Research 63, 437–461 (1996)zbMATHCrossRefGoogle Scholar
  10. 10.
    Galinier, P., Hao, J.K.: Hybrid evolutionary algorithms for graph coloring. Journal of Combinatorial Optimization 3(4), 379–397 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  11. 11.
    Glass, C.A., Prügel-Bennett, A.: A polynomially searchable exponential neighbourhood for graph colouring. Journal of the Operational Research Society 56(3), 324–330 (2005)zbMATHCrossRefGoogle Scholar
  12. 12.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)zbMATHGoogle Scholar
  13. 13.
    Johnson, D.S., Trick, M.A. (eds.): DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26. American Mathematical Society (1996)Google Scholar
  14. 14.
    Davis, L.: Order-based genetic algorithms and the graph coloring problem. In: Handbook of Genetic Algorithms, ch. 6, pp. 72–90. Van Nostrand Reinhold, New York (1991)Google Scholar
  15. 15.
    Matula, D., Marble, G., Isaacson, J.: Graph coloring algorithms. In: Graph theory and computing, pp. 104–122. Academic Press, London (1972)Google Scholar
  16. 16.
    Morgenstern, C.: Distributed coloration neighborhood search. In Johnson and Trick [13], pp. 335–357Google Scholar
  17. 17.
    Oliver, I.M., Smith, D.J., Holland, J.: A study of permutation crossover operators on the traveling salesman problem. In: Genetic Algorithms and their Applications: Proceedings of the Second International Conference on Genetic Algorithms, pp. 224–230 (1987)Google Scholar
  18. 18.
    Valenzuela, C.: A study of permutation operators for minimum span frequency assignment using an order based representation. Journal of Heuristics 7(1), 5–22 (2001); C.L. Valenzuela is now known as C. L. MumfordzbMATHCrossRefGoogle Scholar
  19. 19.
    Welsh, D., Powell, M.: An upper bound for the chromatic number of a graph and its application to timetabling problems. The Computer Journal 10, 85–86 (1967)zbMATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Christine L. Mumford
    • 1
  1. 1.School of Computer ScienceCardiff University 

Personalised recommendations