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

被引：0
|
作者：
Huang, FW [1 ]
Chen, GL [1 ]
机构：
[1] Fuzhou Univ, Inst Math & Comp Sci, Fuzhou 350002, Peoples R China
来源：
PROCEEDINGS OF THE 8TH INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN, VOL 2 | 2004年
关键词：
D O I：
暂无
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
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 paper 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.
引用
收藏
页码：717 / 719
页数：3
相关论文
共 50 条
12345