A new genetic local search algorithm for graph coloring
This paper presents a new genetic local search algorithm for the graph coloring problem. The algorithm combines an original crossover based on the notion of union of independent sets and a powerful local search operator (tabu search). This new hybrid algorithm allows us to improve ou the best known results of some large instances of the famous Dimacs benchmarks.
Unable to display preview. Download preview PDF.
- 4.R. Dorne and J.K. Hao Tabu search for graph coloring, T-coloring and set T-colorings. Presented at the 2nd Intl. Conf. on Metaheuristics, Sophia-Antopollis, France, July, 1997, Under review for publication.Google Scholar
- 7.B. Freisleben and P. Merz. New genetic local search operators for the traveling salesman problem. Proc. of PPSN-96, Lecture Notes in Computer Science 1141, pp890–899, Springer-Verlag, 1996.Google Scholar
- 8.P. Galinier and J.K. Hao New crossover operators for graph coloring. Research Report, April 1998.Google Scholar
- 9.F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers. 1997.Google Scholar
- 13.P. Merz and B. Freisleben. A genetic local search approach to the quadratic assignment problem. In Proc. of ICGA-97, pp 465–472, Morgan Kaufmann Publishers, 1997.Google Scholar
- 14.C. Morgenstern. Distributed coloration neighborhood search. Discrete Mathematics and Theoretical Computer Science, 26: 335–358. American Mathematical Society, 1996.Google Scholar
- 15.C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization — Algorithms and Complexity. Prentice Hall, 1982.Google Scholar