A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem

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.

• Type: Conference
• Year: 2003
• Where: GECCO
• Authors: Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone
• Keywords: GECCO 2003, Graph Coloring Problem, Overall Performances, Simple Local Search