Hierarchical BOA, cluster exact approximation, and ising spin glasses

  • Authors:
  • Martin Pelikan;Alexander K. Hartmann;Kumara Sastry

  • Affiliations:
  • Missouri Estimation of Distribution Algorithms Laboratory (MEDAL), 320 CCB, University of Missouri in St. Louis, St. Louis, MO;Institut für Theoretische Physik, Universität Göttingen, Göttingen, Germany;Illinois Genetic Algorithms Laboratory (IlliGAL), 117 TB, University of Illinois at Urbana-Champaign, Urbana, IL

  • Venue:
  • PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper analyzes the hierarchical Bayesian optimization algorithm (hBOA) on the problem of finding ground states of Ising spin glasses with ±J couplings in two and three dimensions. The performance of hBOA is compared to that of the simple genetic algorithm (GA) and the univariate marginal distribution algorithm (UMDA). The performance of all tested algorithms is improved by incorporating a deterministic hill climber (DHC) based on single-bit flips and cluster exact approximation (CEA). The results show that hBOA significantly outperforms GA and UMDA with both types of local search and that CEA enables all tested algorithms to solve larger spin-glass instances than DHC. Using advanced hybrid methods created by combining competent genetic and evolutionary algorithms with advanced local searchers thus proves advantageous in this challenging class of problems.