Chaotic ant swarm for graph coloring

@article{Ge2010ChaoticAS,
  title={Chaotic ant swarm for graph coloring},
  author={Fangzhen Ge and Zhen Wei and Yiming Tian and ZhenJin Huang},
  journal={2010 IEEE International Conference on Intelligent Computing and Intelligent Systems},
  year={2010},
  volume={1},
  pages={512-516}
}
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. 
Highly Cited
This paper has 24 citations. REVIEW CITATIONS
12 Citations
12 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 12 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 12 references

, " Fuzzy system identification via chaotic ant swarm

  • Lixiang Li, Yixian Yang, Haipeng Peng
  • Chaos , Solutions & Fractals
  • 2009

Hybrid chaotic ant swarm optimization,

  • Y. Y. Li, Q. Y. Wen, L. X. Li, H. P. Peng
  • Chaos, Solitons and Fractals,
  • 2009

Heuristics for Graph Coloring," Computational Graph Theory, Comput. Suppl

  • D. de Werra
  • 1990

Similar Papers

Loading similar papers…