DocumentCode :
3444177
Title :
Chaotic ant swarm for graph coloring
Author :
Ge, Fangzhen ; Wei, Zhen ; Tian, Yiming ; Huang, Zhenjin
Author_Institution :
Sch. of Comput. & Inf., Hefei Univ. of Technol., Hefei, China
Volume :
1
fYear :
2010
fDate :
29-31 Oct. 2010
Firstpage :
512
Lastpage :
516
Abstract :
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.
Keywords :
graph colouring; particle swarm optimisation; chaotic ant swarm approach; first-fit algorithm; graph coloring; greedy sequential coloring; hybrid algorithm architecture; swarm intelligence technique; Economics; Generators; Tin; Chaotic ant swarm; Combinational optimization; First-Fit algorithm; Graph coloring problem;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Computing and Intelligent Systems (ICIS), 2010 IEEE International Conference on
Conference_Location :
Xiamen
Print_ISBN :
978-1-4244-6582-8
Type :
conf
DOI :
10.1109/ICICISYS.2010.5658530
Filename :
5658530
Link To Document :
بازگشت