A hybrid immune algorithm with information gain for the graph coloring problem
Genetic and Evolutionary Computation—GECCO 2003: Genetic and Evolutionary …, 2003•Springer
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.
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.
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
以上显示的是最相近的搜索结果。 查看全部搜索结果