Solving Binary Constraint Satisfaction Problems Using Evolutionary Algorithms with an Adaptive Fitness Function

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.

• Type: Conference
• Year: 1998
• Where: PPSN
• Authors: A. E. Eiben, Jano I. van Hemert, Elena Marchiori, Adri G. Steenbeek
• Keywords: Binary Csps, Constraint Satisfaction Problems, Constraint Violations, Distributed And Parallel Computing, PPSN 1998