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.