Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive tness function
Cached
Download Links
| Venue: | In Eiben et al |
| Citations: | 24 - 12 self |
BibTeX
@INPROCEEDINGS{Eiben_solvingbinary,
author = {A. E. Eiben and J. I. Van Hemert and E. Marchiori and A. G. Steenbeek},
title = {Solving binary constraint satisfaction problems using evolutionary algorithms with an adaptive tness function},
booktitle = {In Eiben et al},
year = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. This paper presents a comparative study of Evolutionary Algorithms (EAs) for Constraint Satisfaction Problems (CSPs). We focus on EAs where fitness is based on penalization of constraint violations and the penalties are adapted during the execution. Three different EAs based on this approach are implemented. For highly connected constraint networks, the results provide further empirical support to the theoretical prediction of the phase transition in binary CSPs. 1
