Title :
A symmetry-breaking approach of the graph coloring problem with GAs
Author :
Huang, Fangwan ; Chen, Guolong
Author_Institution :
Inst. of Math. & Comput. Sci., Fuzhou Univ., China
Abstract :
The graph coloring problem (GCP) is a well known combinatorial problem with a highly symmetric solution space. Population-based approaches do not provide a good alternative because of the danger of recombining good individuals from different regions of the search space to produce poor offspring. This work introduces the symmetry of the graph coloring problem with genetic algorithms and presents a genetic algorithm that breaks the symmetry of GCP by cyclic permutations.
Keywords :
genetic algorithms; graph colouring; search problems; combinatorial problem; cyclic permutations; genetic algorithms; graph coloring problem; population-based approaches; search space; symmetric solution space; symmetry-breaking approach; Computer science; Costs; Frequency; Genetic algorithms; Heuristic algorithms; Mathematics; Polynomials; Robustness; Simulated annealing;
Conference_Titel :
Computer Supported Cooperative Work in Design, 2004. Proceedings. The 8th International Conference on
Print_ISBN :
0-7803-7941-1
DOI :
10.1109/CACWD.2004.1349284
