Hierarchical BOA, cluster exact approximation, and ising spin glasses
2006 | conference paper. A publication with affiliation to the University of Göttingen.
Jump to: Cite & Linked | Documents & Media | Details | Version history
Cite this publication
Hierarchical BOA, cluster exact approximation, and ising spin glasses
Pelikan, M.; Hartmann, A. K. & Sastry, K. (2006)
In:Runarsson, Thomas Philip (Ed.), Parallel problem solving from nature - PPSN IX pp. 122-131. 9th International Conference on Parallel Problem Solving from Nature (PPSN IX), Reykjavik, ICELAND.
Berlin: Springer. DOI: https://doi.org/10.1007/11844297_13
Documents & Media
Details
- Authors
- Pelikan, Martin; Hartmann, Alexander K.; Sastry, Kumara
- Editors
- Runarsson, Thomas Philip
- 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 CA 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.
- Issue Date
- 2006
- Publisher
- Springer
- Conference
- 9th International Conference on Parallel Problem Solving from Nature (PPSN IX)
- Series
- Lecture Notes in Computer Science
- ISBN
- 3-540-38990-3
- Conference Place
- Reykjavik, ICELAND
- Event start
- 2006-09-09
- Event end
- 2006-09-13
- ISSN
- 0302-9743
- Language
- English