Skip to main content
SpringerLink
Log in

Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas

  • Conference paper
Parallel Problem Solving from Nature – PPSN XIII (PPSN 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8672))

Included in the following conference series:

Abstract

We show that simple mutation-only evolutionary algorithms find a satisfying assignment on two similar models of random planted 3-CNF Boolean formulas in polynomial time with high probability in the high constraint density regime. We extend the analysis to random formulas conditioned on satisfiability (i.e., the so-called filtered distribution) and conclude that most high-density satisfiable formulas are easy for simple evolutionary algorithms. With this paper, we contribute the first rigorous study of randomized search heuristics from the evolutionary computation community on well-studied distributions of random satisfiability problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Auger, A., Doerr, B.: Theory of Randomized Search Heuristics: Foundations and Recent Developments. World Scientific Publishing Company (2011)

    Google Scholar 

  2. Ben-Sasson, E., Bilu, Y., Gutfreund, D.: Finding a randomly planted assignment in a random 3-CNF (2002) (manuscript)

    Google Scholar 

  3. Doerr, B., Goldberg, L.A.: Drift analysis with tail bounds. In: Schaefer, R., Cotta, C., Kołodziej, J., Rudolph, G. (eds.) PPSN XI. LNCS, vol. 6238, pp. 174–183. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Doerr, B., Johannsen, D., Winzen, C.: Multiplicative drift analysis. Algorithmica 64(4), 673–697 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  5. Droste, S., Jansen, T., Wegener, I.: On the analysis of the (1+1) evolutionary algorithm. Theoretical Computer Science 276(1-2), 51–81 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  6. Gottlieb, J., Marchiori, E., Rossi, C.: Evolutionary algorithms for the satisfiability problem. Evolutionary Computation 10(1), 35–50 (2002)

    Article  Google Scholar 

  7. Koutsoupias, E., Papadimitriou, C.H.: On the greedy algorithm for satisfiability. Information Processing Letters 43(1), 53–55 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  8. Krivelevich, M., Sudakov, B., Vilenchik, D.: On the random satisfiability process. Combinatorics, Probability and Computing 18, 775–801 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Krivelevich, M., Vilenchik, D.: Solving random satisfiable 3CNF formulas in expected polynomial time. In: SODA, pp. 454–463 (2006)

    Google Scholar 

  10. Kroc, L., Sabharwal, A., Selman, B.: An empirical study of optimal noise and runtime distributions in local search. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 346–351. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  11. Motwani, R., Raghavan, P.: Randomized algorithms. Cambridge University Press, New York (1995)

    Book  MATH  Google Scholar 

  12. Neumann, F., Witt, C.: Bioinspired Computation in Combinatorial Optimization – Algorithms and Their Computational Complexity. Springer (2010)

    Google Scholar 

  13. Seitz, S., Orponen, P.: An efficient local search method for random 3-satisfiability. Electronic Notes in Discrete Mathematics 16, 71–79 (2003)

    Article  MathSciNet  Google Scholar 

  14. Sutton, A.M., Howe, A.E., Whitley, L.D.: A theoretical analysis of the k-satisfiability search space. In: Stützle, T., Birattari, M., Hoos, H.H. (eds.) SLS 2009. LNCS, vol. 5752, pp. 46–60. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  15. Sutton, A.M., Whitley, L.D., Howe, A.E.: A polynomial time computation of the exact correlation structure of k-satisfiability landscapes. In: GECCO (2009)

    Google Scholar 

  16. Witt, C.: Worst-case and average-case approximations by simple randomized search heuristics. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 44–56. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  17. Witt, C.: Tight bounds on the optimization time of a randomized search heuristic on linear functions. Combinatorics, Probability and Computing 22(2), 294–318 (2013)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Friedrich-Schiller-Universität Jena, 07743, Jena, Germany

    Andrew M. Sutton

  2. Optimisation and Logistics, School of Computer Science, The University of Adelaide, Adelaide, SA, 5005, Australia

    Frank Neumann

Authors
  1. Andrew M. Sutton
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Frank Neumann
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Computer and Engineering Sciences, Cologne University of Applied Sciences, Steinmüllerallee 1, 51643, Gummersbach, Germany

    Thomas Bartz-Beielstein

  2. Warwick Business School, University of Warwick, CV8 2SY, Coventry, UK

    Jürgen Branke

  3. Department of Intelligent Systems, JožefStefan Institute, Jamova cesta 39, 1000, Ljubljana, Slovenia

    Bogdan Filipič

  4. Department of Computer Science and Creative Technologies, University of the West of England, BS16 1QY, Bristol, UK

    Jim Smith

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Sutton, A.M., Neumann, F. (2014). Runtime Analysis of Evolutionary Algorithms on Randomly Constructed High-Density Satisfiable 3-CNF Formulas. In: Bartz-Beielstein, T., Branke, J., Filipič, B., Smith, J. (eds) Parallel Problem Solving from Nature – PPSN XIII. PPSN 2014. Lecture Notes in Computer Science, vol 8672. Springer, Cham. https://doi.org/10.1007/978-3-319-10762-2_93

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10762-2_93

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10761-5

  • Online ISBN: 978-3-319-10762-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation