Abstract
We present a new Immune Algorithm that incorporates a simple local search procedure to improve the overall performances to tackle the graph coloring problem instances. We characterize the algorithm and set its parameters in terms of Information Gain. Experiments will show that the IA we propose is very competitive with the best evolutionary algorithms. © Springer-Verlag Berlin Heidelberg 2003.
Author supplied keywords
Cite
CITATION STYLE
Cutello, V., Nicosia, G., & Pavone, M. (2003). A hybrid immune algorithm with information gain for the graph coloring problem. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2723, 171–182. https://doi.org/10.1007/3-540-45105-6_23
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
