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.
A Hybrid Immune Algorithm with Information Gain for the Graph Coloring Problem
CUTELLO, Vincenzo;NICOSIA, GIUSEPPE;PAVONE, MARIO FRANCESCO
2003-01-01
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
