By Topic

Solving constraint satisfaction problems with heuristic-based evolutionary algorithms

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

3 Author(s)
B. G. W. Craenen ; Fac. of Exact Sci., Vrije Univ., Amsterdam, Netherlands ; A. E. Eiben ; E. Marchiori

Evolutionary algorithms (EAs) for solving constraint satisfaction problems (CSPs) can be roughly divided into two classes: EAs with adaptive fitness functions and heuristic-based EAs. A.E. Eiben et al. (1998) compared effective EAs of the first class experimentally using a large set of benchmark instances consisting of randomly-generated binary CSPs. In this paper, we complete this comparison by performing the same experiments using three of the most effective heuristic-based EAs. The results of our experiments indicate that the three heuristic-based EAs have similar performances on random binary CSPs. Comparing these results with those of A.E. Eiben et al., we are able to identify the best EA for binary CSPs as the algorithm introduced by G. Dozier et al. (1994), which uses a heuristic as well as an adaptive fitness function

Published in:

Evolutionary Computation, 2000. Proceedings of the 2000 Congress on  (Volume:2 )

Date of Conference:

2000