Multiple Populations Guided by the Constraint-Graph for CSP

Authors:
Arturo Núñez;María Cristina Riff Rojas
Affiliations:
-;-
Venue:
IBERAMIA-SBIA '00 Proceedings of the International Joint Conference, 7th Ibero-American Conference on AI: Advances in Artificial Intelligence
Year:
2000

Citing 5
Cited 0

Algorithms for constraint-satisfaction problems: a survey

AI Magazine
New methods to color the vertices of a graph

Communications of the ACM
Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Where the really hard problems are

IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Solving constraint satisfaction problems using hybrid evolutionarysearch

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

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.