Multiple Populations Guided by the Constraint-Graph for CSP

  • Arturo Nuñez
  • María-Cristina Riff
Conference paper

DOI: 10.1007/3-540-44399-1_47

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1952)
Cite this paper as:
Nuñez A., Riff MC. (2000) Multiple Populations Guided by the Constraint-Graph for CSP. In: Monard M.C., Sichman J.S. (eds) Advances in Artificial Intelligence. Lecture Notes in Computer Science, vol 1952. Springer, Berlin, Heidelberg

Abstract

In this paper we examine the gain of the performance obtained using multiple populations - that evolve in parallel - of the constraintgraph 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Arturo Nuñez
    • 1
  • María-Cristina Riff
    • 1
  1. 1.Computer Science DepartmentUniversidad Técnica Federico Santa MaríaValparaísoChile

Personalised recommendations