Chapter

Evolutionary Programming VII

Volume 1447 of the series Lecture Notes in Computer Science pp 123-136

Date:

A superior evolutionary algorithm for 3-SAT

  • Thomas BäckAffiliated withDepartment of Computer Science, Leiden UniversityCenter for Applied Systems Analysis, Informatik Centrum Dortmund
  • , Agoston E. EibenAffiliated withDepartment of Computer Science, Leiden UniversityCWI
  • , Marco E. VinkAffiliated withDepartment of Computer Science, Leiden University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We investigate three approaches to Boolean satisfiability problems. We study and compare the best heuristic algorithm WGSAT and two evolutionary algorithms, an evolution strategy and an evolutionary algorithm adapting its own fitness function while running. The results show that the adaptive EA outperforms the other two approaches. The power of this EA originates from the adaptive mechanism, which is completely problem independent and generally applicable to any constraint satisfaction problem. This suggests that the adaptive EA is not only a good solver for satisfiability problems, but for constraint satisfaction problems in general.