A Symmetry-breaking Approach of the Graph Coloring Problem with GAs

摘要：

The Graph Coloring Problem (GCP) is a well knowncombinatorial problem with a highly symmetricsolution space. Population-based approaches do notprovide a good alternative because of the danger ofrecombining good individuals from different regions ofthe search space to produce poor offspring. This paperintroduces the symmetry of the graph coloring problemwith genetic algorithms and presents a geneticalgorithm that breaks the symmetry of GCP by cyclicpermutations.

作者: Fangwan Huang Guolong Chen

作者单位: Institute of Mathematics and Computer Science Fuzhou University,Fuzhou,China

会议类型: 国际会议

会议名称: The 8th International Conference on Computer Supported Cooperative Work in Design(第八届计算机支持的协同工作设计国际会议)(CSCWD2004)

会议地点: 厦门

会议语种:英文

页码: 717-719

在线出版日期: 2004-05-26（万方平台首次上网日期，不代表论文的发表时间）