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
{"_id":"ShWu6AGALYQtJiTMq","bibbaseid":"anonymous-multiplepopulationsguidedbytheconstraintgraphforcsp-2000","downloads":0,"creationDate":"2017-03-31T20:15:33.024Z","title":"Multiple populations guided by the constraint-graph for CSP","author_short":null,"year":2000,"bibtype":"inproceedings","biburl":"https://1fichier.com/?j9cpurkmnv","bibdata":{"bibtype":"inproceedings","type":"inproceedings","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)","bibtex":"@inproceedings{78650154747,\n 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.\",\n year = \"2000\",\n title = \"Multiple populations guided by the constraint-graph for CSP\",\n volume = \"1952 LNAI\",\n pages = \"457-466\",\n booktitle = \"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\"\n}\n\n","key":"78650154747","id":"78650154747","bibbaseid":"anonymous-multiplepopulationsguidedbytheconstraintgraphforcsp-2000","urls":{},"downloads":0,"html":""},"search_terms":["multiple","populations","guided","constraint","graph","csp"],"keywords":[],"authorIDs":[],"dataSources":["gKiCRHjjC2iGthGEx"]}