By Topic

Using the knowledge of the constraints network to design an evolutionary algorithm that solves CSP

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
M. C. R. Rojas ; CERMICS, Inst. Nat. de Recherche en Inf. et Autom., Sophia-Antipolis, France

This paper describes an Evolutionary Algorithm to solve Constraint Satisfaction Problems. Knowledge about properties of the constraint network can permit us to define a fitness function which is used to improve the stochastic search. A selection mechanism which exploits this fitness function has been defined. The algorithm has been tested by running experiments on randomly generated k-colouring graphs, with different constraints networks. The results suggest that the technique may be successfully applied to other CSP

Published in:

Evolutionary Computation, 1996., Proceedings of IEEE International Conference on

Date of Conference:

20-22 May 1996