Multiple populations guided by the constraint-graph for CSP. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 1952 LNAI, pages 457-466, 2000.
abstract   bibtex   
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. © Springer-Verlag 2000.
@inproceedings{78650154747,
    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. © Springer-Verlag 2000.",
    year = "2000",
    title = "Multiple populations guided by the constraint-graph for CSP",
    volume = "1952 LNAI",
    pages = "457-466",
    booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)"
}

Downloads: 0