You are here

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

TitleSolving Binary Constraint Satisfaction Problems using Evolutionary Algorithms with an Adaptive Fitness Function
Publication TypeConference Paper
Year of Publication1998
AuthorsEiben, AE, van Hemert, JI, Marchiori, E, Steenbeek, AG
Conference NameSpringer Lecture Notes on Computer Science
PublisherSpringer-Verlag, Berlin
EditorEiben, AE, B{\"a}ck, T, Schoenauer, M, Schwefel, H-P
Keywordsconstraint satisfaction
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.

Full Text