16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04) Meta-Heuristics for Robust Graph Coloring Problem Boca Raton, Florida November 15-November 17 ISBN: 0-7695-2236-X
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICTAI.2004.83
In this paper, the Robust Graph Coloring Problem (RGCP), an extension of the classical graph coloring, is solved by various meta-heuristics. After discussing the search space encoding and neighborhood structure, several meta-heuristics including genetic algorithm, simulated annealing and tabu search are developed to solve RGCP. The experimental results on various sizes of input graph provide the performance of these meta-heuristics in terms of accuracy and run time.
Citation:
Andrew Lim, Fan Wang, "Meta-Heuristics for Robust Graph Coloring Problem," ictai, pp.514-518, 16th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'04), 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb