Name
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1007/3-540-45105-6_23 | GECCO |
Keywords | Field | DocType |
hybrid immune algorithm,information gain,problem instance,simple local search procedure,new immune algorithm,evolutionary algorithm,overall performance,combinatorial optimization,graph coloring problem,graph coloring,local search | Memetic algorithm,Search algorithm,Evolutionary algorithm,Computer science,Artificial intelligence,Graph coloring,Mathematical optimization,Algorithm,Greedy coloring,Local search (optimization),Factor-critical graph,Machine learning,Best-first search | Conference |
Volume | ISSN | ISBN |
2723 | 0302-9743 | 3-540-40602-6 |
Citations | PageRank | References |
36 | 2.80 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| vincenzo cutello | 1 | 553 | 57.63 |
| Giuseppe Nicosia | 2 | 479 | 46.53 |
| Mario Pavone | 3 | 212 | 19.41 |