Skip to main content
SpringerLink
Log in

Hierarchical BOA Solves Ising Spin Glasses and MAXSAT

  • Conference paper
  • First Online:
Genetic and Evolutionary Computation — GECCO 2003 (GECCO 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2724))

Included in the following conference series:

Abstract

Theoretical and empirical evidence exists that the hierarchical Bayesian optimization algorithm (hBOA) can solve challenging hierarchical problems and anything easier. This paper applies hBOA to two important classes of real-world problems: Ising spin-glass systems and maximum satisfiability (MAXSAT). The paper shows how easy it is to apply hBOA to real-world optimization problems—in most cases hBOA can be applied without any prior problem analysis, it can acquire enough problem-specific knowledge automatically. The results indicate that hBOA is capable of solving enormously difficult problems that cannot be solved by other optimizers and still provide competitive or better performance than problem-specific approaches on other problems. The results thus confirm that hBOA is a practical, robust, and scalable technique for solving challenging real-world 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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Pelikan, M., Goldberg, D.E.: Escaping hierarchical traps with competent genetic algorithms. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) (2001) 511–518 Also IlliGAL Report No. 2000020.

    Google Scholar 

  2. Pelikan, M.: Bayesian optimization algorithm: From single level to hierarchy. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL (2002) Also IlliGAL Report No. 2002023.

    Google Scholar 

  3. Goldberg, D.E.: The design of innovation: Lessons from and for competent genetic algorithms. Volume 7 of Genetic Algorithms and Evolutionary Computation. Kluwer Academic Publishers (2002)

    Google Scholar 

  4. Simon, H.A.: The Sciences of the Artificial. The MIT Press, Cambridge, MA (1968)

    Google Scholar 

  5. Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. Computational Optimization and Applications 21 (2002) 5–20 Also IlliGAL Report No. 99018.

    Article  MATH  MathSciNet  Google Scholar 

  6. Mühlenbein, H., Paaß, G.: From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature (1996) 178–187

    Google Scholar 

  7. Bosman, P.A., Thierens, D.: Continuous iterated density estimation evolutionary algorithms within the IDEA framework. Workshop Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2000) (2000) 197–200

    Google Scholar 

  8. Larranaga, P., Lozano, J.A., eds.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston, MA (2002)

    MATH  Google Scholar 

  9. Harik, G.R.: Finding multiple solutions in problems of bounded difficulty. IlliGAL Report No. 94002, University of Illinois at Urbana-Champaign, Urbana, IL (1994)

    Google Scholar 

  10. Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: Linkage problem, distribution estimation, and Bayesian networks. Evolutionary Computation 8 (2000) 311–341 Also IlliGAL Report No. 98013.

    Article  Google Scholar 

  11. Pelikan, M., Mühlenbein, H.: The bivariate marginal distribution algorithm. Advances in Soft Computing—Engineering Design and Manufacturing (1999) 521–535

    Google Scholar 

  12. Naudts, B., Naudts, J.: The effect of spin-flip symmetry on the performance of the simple GA. Parallel Problem Solving from Nature (1998) 67–76

    Google Scholar 

  13. Van Hoyweghen, C.: Detecting spin-flip symmetry in optimization problems. In Kallel, L., et al., eds.: Theoretical Aspects of Evolutionary Computing. Springer, Berlin (2001) 423–437

    Google Scholar 

  14. Mühlenbein, H., Mahnig, T., Rodriguez, A.O.: Schemata, distributions and graphical models in evolutionary optimization. Journal of Heuristics 5 (1999) 215–247

    Article  MATH  Google Scholar 

  15. Monien, B., Sudborough, I.H.: Min cut is NP-complete for edge weighted trees. Theoretical Computer Science 58 (1988) 209–229

    Article  MATH  MathSciNet  Google Scholar 

  16. Harik, G., Lobo, F.: A parameter-less genetic algorithm. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99) I (1999) 258–265

    Google Scholar 

  17. Pelikan, M., Lobo, F.G.: Parameter-less genetic algorithm: A worst-case time and space complexity analysis. IlliGAL Report No. 99014, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL (1999)

    Google Scholar 

  18. Pelikan, M., Goldberg, D.E., Sastry, K.: Bayesian optimization algorithm, decision graphs, and Occam’s razor. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) (2001) 519–526 Also IlliGAL Report No. 2000020.

    Google Scholar 

  19. Kardar, M., Saul, L.: The 2D +/−J Ising spin glass: Exact partition functions in polynomial time. Nucl. Phys. B 432 (1994) 641–667

    Article  Google Scholar 

  20. De Simone, C., Diehl, M., Jünger, M., Reinelt, G.: Exact ground states of two-dimensional +−J Ising spin glasses. Journal of Statistical Physics 84 (1996) 1363–1371

    Article  Google Scholar 

  21. Galluccio, A., Loebl, M.: A theory of Pfaffian orientations. I. Perfect matchings and permanents. Electronic Journal of Combinatorics 6 (1999) Research Paper 6.

    Google Scholar 

  22. Galluccio, A., Loebl, M.: A theory of Pfaffian orientations. II. T-joins, k-cuts, and duality of enumeration. Electronic Journal of Combinatorics 6 (1999) Research Paper 7.

    Google Scholar 

  23. Barahona, F.: On the computational complexity of ising spin glass models. Journal of Physics A: Mathematical, Nuclear and General 15 (1982) 3241–3253

    Article  MathSciNet  Google Scholar 

  24. Rana, S., Whitley, D.L.: Genetic algorithm behavior in the MAXSAT domain. Parallel Problem Solving from Nature (1998) 785–794

    Google Scholar 

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

    Article  Google Scholar 

  26. Selman, B., Levesque, H.J., Mitchell, D.: A new method for solving hard satisfiability problems. Proceedings of the National Conference on Artificial Intelligence (AAAI-92) (1992) 440–446

    Google Scholar 

  27. Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-91) (1991) 331–337

    Google Scholar 

  28. Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI-97) (1997) 366–371

    Google Scholar 

  29. Gent, I., Hoos, H.H., Prosser, P., Walsh, T.: Morphing: Combining structure and randomness. Proceedings of the American Association of Artificial Intelligence (AAAI-99) (1999) 654–660

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computational Laboratory (Colab), Swiss Federal Institute of Technology (ETH), Hirschengraben 84, 8092, Zürich, Switzerland

    Martin Pelikan

  2. Illinois Genetic Algorithms Laboratory (IlliGAL), University of Illinois at Urbana-Champaign, 104 S. Mathews Ave., Urbana, IL, 61801

    Martin Pelikan & David E. Goldberg

Authors
  1. Martin Pelikan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. David E. Goldberg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Center for Applied Scientific Computing (CASC), Lawrence Livermore National Laboratory, 7000 East Avenue, L-561, Livermore, CA, 94550, USA

    Erick Cantú-Paz

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pelikan, M., Goldberg, D.E. (2003). Hierarchical BOA Solves Ising Spin Glasses and MAXSAT. In: Cantú-Paz, E., et al. Genetic and Evolutionary Computation — GECCO 2003. GECCO 2003. Lecture Notes in Computer Science, vol 2724. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45110-2_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45110-2_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40603-7

  • Online ISBN: 978-3-540-45110-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation