New Order-Based Crossovers for the Graph Coloring Problem
- 1.2k Downloads
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.
KeywordsGenetic Algorithm Local Search Greedy Algorithm Graph Coloring Color Classis
Unable to display preview. Download preview PDF.
- 1.Anderson, P.G., Ashlock, D.: Advances in ordered greed (2004), Available from http://www.cs.rit.edu/~pga/abstracts.php
- 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.Culberson, J., Luo, F.: Exploring the k-colorable landscape with iterated greedy. In Johnson and Trick , pp. 499–520Google Scholar
- 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.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.Matula, D., Marble, G., Isaacson, J.: Graph coloring algorithms. In: Graph theory and computing, pp. 104–122. Academic Press, London (1972)Google Scholar
- 16.Morgenstern, C.: Distributed coloration neighborhood search. In Johnson and Trick , pp. 335–357Google Scholar
- 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