A superior evolutionary algorithm for 3-SAT

  • Thomas Bäck
  • Agoston E. Eiben
  • Marco E. Vink
Conference paper

DOI: 10.1007/BFb0040766

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1447)
Cite this paper as:
Bäck T., Eiben A.E., Vink M.E. (1998) A superior evolutionary algorithm for 3-SAT. In: Porto V.W., Saravanan N., Waagen D., Eiben A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1998

Authors and Affiliations

  • Thomas Bäck
    • 1
    • 2
  • Agoston E. Eiben
    • 1
    • 3
  • Marco E. Vink
    • 1
  1. 1.Department of Computer ScienceLeiden UniversityCA LeidenThe Netherlands
  2. 2.Center for Applied Systems AnalysisInformatik Centrum DortmundDortmundGermany
  3. 3.CWIGB AmsterdamThe Netherlands

Personalised recommendations