By Topic

A symmetry-breaking approach of the graph coloring problem with GAs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Fangwan Huang ; Inst. of Math. & Comput. Sci., Fuzhou Univ., China ; Guolong Chen

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.

Published in:

Computer Supported Cooperative Work in Design, 2004. Proceedings. The 8th International Conference on  (Volume:2 )

Date of Conference:

26-28 May 2004