A superior evolutionary algorithm for 3-SAT

  • Thomas Bäck
  • Agoston E. Eiben
  • Marco E. Vink
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1447)

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.

References

  1. [Bäc96]
    T. Bäck. Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York, 1996.Google Scholar
  2. [Coo71]
    S.A. Cook. The complexity of theorem-proving procedures. In Proc. of the 3rd Annual ACM Symposium on the Theory of Computing, pages 151–158, 1971.Google Scholar
  3. [dJS89]
    K.A. de Jong and W.M. Spears. Using genetic algorithms to solve NP-complete problems. In Third International Conference on Genetic Algorithms, pages 124–132, 1989.Google Scholar
  4. [DP60]
    M. Davis and H. Putnam. A computing procedure for quantification theory. Jnl. Association for Computing Machinery, 7:201–215, 1960.Google Scholar
  5. [ERR94]
    A.E. Eiben, P.-E. Raué, and Zs. Ruttkay. Repairing, adding constraints and learning as a means of improving GA performance on CSPs. In J.C. Bioch, editor, Proceedings of the 4th Belgian-Dutch Conference on Machine Learning, pages 112–123. Erasmus University Press, 1994.Google Scholar
  6. [EvdH97]
    A.E. Eiben and J.K. van der Hauw. Solving 3-SAT with adaptive Genetic Algorithms. In Proceedings of the 4th IEEE Conference on Evolutionary Computation, pages 81–86. IEEE Press, 1997.Google Scholar
  7. [EvdHvH98]
    A.E. Eiben, J.K. van der Hauw, and J.I. van Hemert. Graph coloring with adaptive evolutionary algorithms. Journal of Heuristics, 4:25–46, 1998.Google Scholar
  8. [FF96]
    C. Fleurent and J.A. Ferland. Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In M. A. Trick and D. S. Johnson, editors, 2nd DIMACS Challenge, special issue, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, 1996. to appear.Google Scholar
  9. [Fra96]
    J. Frank. Weighting for godot: Learning heuristics for GSAT. In Proceedings of the AAAI, 1996. Available by http://rainier.cs.ucdavis.edu/frank/weighting.aaai96.ps.Google Scholar
  10. [GW95]
    I. Gent and T. Walsh. Unsatisfied variables in local search. In J. Hallam, editor, Hybrid Problems, Hybrid Solutions. IOS Press, 1995.Google Scholar
  11. [Hao95]
    J.-K. Hao. A clausal genetic representation and its evolutionary procedures for satisfiability problems. In Proceedings of the International Conference on Artificial Neural Networks and Genetic Algorithms, France, April 1995.Google Scholar
  12. [HK95]
    S. Hampson and D. Kibler. Plateaus and plateau search in boolean satisfiability problems: When to give up searching and start again, 1995. DIMACS Challenge 1995, Available by http://www.ics.uci.edu/kibler/.Google Scholar
  13. [KS92]
    H.A. Kautz and B. Selman. Planning as satisfiability. In Proceedings of the 10th ECAI, pages 359–363, 1992.Google Scholar
  14. [MSL92]
    D. Mitchell, B. Selman, and H.J. Levesque. Hard and easy distributions of SAT problems. In Proceedings of the AAAI, pages 459–465, San Jose, CA, 1992.Google Scholar
  15. [RM89]
    R. Reiter and A. Mackworth. A logical framework for depiction and image interpretation. Artificial Intelligence, 41 (3):123–155, 1989.Google Scholar
  16. [Sch95]
    H.-P. Schwefel. Evolution and Optimum Seeking. Sixth-Generation Computer Technology Series. Wiley, New York, 1995.Google Scholar
  17. [vdH96]
    J.K. van der Hauw. Evaluating and Improving Steady State Evolutionary Algorithms on Constraint Satisfaction Problems. Master's thesis, Leiden University, 1996.Google Scholar
  18. [Vin97]
    M.E. Vink. Solving Combinatorial Problems Using Evolutionary Algorithms. Master's thesis, Leiden University, 1997.Google Scholar

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