Analysis of Evolutionary Algorithms on the One-Dimensional Spin Glass with Power-Law Interactions

Physics – Condensed Matter – Disordered Systems and Neural Networks

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Scientific paper

10.1145/1569901.1570017

This paper provides an in-depth empirical analysis of several evolutionary algorithms on the one-dimensional spin glass model with power-law interactions. The considered spin glass model provides a mechanism for tuning the effective range of interactions, what makes the problem interesting as an algorithm benchmark. As algorithms, the paper considers the genetic algorithm (GA) with twopoint and uniform crossover, and the hierarchical Bayesian optimization algorithm (hBOA). hBOA is shown to outperform both variants of GA, whereas GA with uniform crossover is shown to perform worst. The differences between the compared algorithms become more significant as the problem size grows and as the range of interactions decreases. Unlike for GA with uniform crossover, for hBOA and GA with twopoint crossover, instances with short-range interactions are shown to be easier. The paper also points out interesting avenues for future research.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Analysis of Evolutionary Algorithms on the One-Dimensional Spin Glass with Power-Law Interactions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Analysis of Evolutionary Algorithms on the One-Dimensional Spin Glass with Power-Law Interactions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Analysis of Evolutionary Algorithms on the One-Dimensional Spin Glass with Power-Law Interactions will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-361306

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.