Multiple Populations Guided by the Constraint-Graph for CSP

* Final gross prices may vary according to local VAT.

Get Access

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.