Abstract | ||
---|---|---|
In this paper we examine the gain of the performance obtained using multiple populations - that evolve in parallel - of the constraint-graph based evolutionary algorithm (in its dynamic adaptation operators version) with a migration policy. We show that a multiple populations approach outperforms a single population implementation when applying it to the 3-coloring problem. We also evaluate various migration policies. |
Year | DOI | Venue |
---|---|---|
2000 | 10.1007/3-540-44399-1_47 | IBERAMIA-SBIA |
Keywords | Field | DocType |
single population implementation,3-coloring problem,various migration policy,multiple populations approach,migration policy,multiple population,evolutionary algorithm,dynamic adaptation operators version | Population,Constraint satisfaction,Graph,Mathematical optimization,Evolutionary algorithm,Computer science,Constraint graph,Constraint satisfaction problem,Operator (computer programming) | Conference |
Volume | ISSN | ISBN |
1952.0 | 0302-9743 | 3-540-41276-X |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Arturo Núñez | 1 | 3 | 1.85 |
María Cristina Riff | 2 | 200 | 23.91 |