ACM Home Page
Please provide us with feedback. Feedback
Obtaining ground states of ising spin glasses via optimizing bonds instead of spins
Full text PdfPdf (58 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 9th annual conference on Genetic and evolutionary computation table of contents
London, England
POSTER SESSION: Estimation of distribution algorithms: posters table of contents
Pages: 628 - 628  
Year of Publication: 2007
ISBN:978-1-59593-697-4
Authors
Martin Pelikan  University of Missouri-St. Louis, St. Louis, MO
Alexander K. Hartmann  Universitaet Goettingen, Goettingen, Germany
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 14,   Citation Count: 0
Additional Information:

abstract   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1276958.1277088
What is a DOI?

ABSTRACT

Frustrated Ising spin glasses represent a rich class of challenging optimization problems that share many features with other complex, highly multimodal optimization and combinatorial problems. This paper shows that transforming candidate solutions to an alternative representation that is strongly tied to the energy function simplifies the exploration of the space of potential spin configurations and that it significantly improves performance of evolutionary algorithms with simple variation operators on Ising spin glasses. The proposed techniques are incorporated into the simple genetic algorithm, the univariate marginal distribution algorithm, and the hierarchical Bayesian optimization algorithm.


Collaborative Colleagues:
Martin Pelikan: colleagues
Alexander K. Hartmann: colleagues