Chaotic Ant Swarm for Graph Coloring

摘要：

We present a hybrid chaotic ant swarm approach for the graph coloring problem (CASCOL). This approach is based on a novel swarm intelligence technique called chaotic ant swarm (CAS) and a simple greedy sequential coloring, First-Fit algorithm. We use the CAS evolutionary to improve First-Fit algorithm for GCP and formulate hybrid algorithm architecture. Computational experiments give evidence that our proposed algorithm is competitive with the existing algorithms for this problem.

关键词： Graph coloring problem Chaotic ant swarm Combinational optimization First-Fit algorithm

作者: Fangzhen Ge Zhen Wei Yiming Tian Zhenjin Huang

作者单位: School of Computer and Information Hefei University of Technology Hefei 230009, China School of Comp School of Computer and Information Hefei University of Technology Hefei 230009, China

会议类型: 国际会议

会议名称: 2010 IEEE International Conference on Intelligent Computing and Intelligent Systems(2010 IEEE 智能计算与智能系统国际会议 ICIS 2010)

会议地点: 厦门

会议语种:英文

页码: 512-516

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