You are here

Comparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation

TitleComparing Classical Methods for Solving Binary Constraint Satisfaction Problems with State of the Art Evolutionary Computation
Publication TypeConference Paper
Year of Publication2002
Authorsvan Hemert, JI
Conference NameSpringer Lecture Notes on Computer Science
PublisherSpringer-Verlag, Berlin
EditorCagnoni, S, Gottlieb, J, Hart, E, Middendorf, M, Raidl, G
Keywordsconstraint satisfaction
Abstract

Constraint Satisfaction Problems form a class of problems that are generally computationally difficult and have been addressed with many complete and heuristic algorithms. We present two complete algorithms, as well as two evolutionary algorithms, and compare them on randomly generated instances of binary constraint satisfaction prob-lems. We find that the evolutionary algorithms are less effective than the classical techniques.

Full Text