skip to main content
10.1145/2001858.2001895acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
poster

A test function with full controllability over overlapping: estimation of distribution algorithms

Published:12 July 2011Publication History

ABSTRACT

This work proposes a test function to study overlapping. The test function provides full controllability over overlapping. To achieve full controllability, the building block assigning problem is reduced to a bipartite matching problem which allow us to directly assign extent of overlapping to each gene. At the end, an experiment on overlapping shows that to four chosen crossover methods, the problem difficulty increases exponentially with the extent of overlapping.

References

  1. M. Tsuji, M. Munetomo, and K. Akama. A crossover for complex building blocks overlapping. In Proceedings of the 8th annual conference on Genetic and evolutionary computation, GECCO '06, pages 1337--1344. ACM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A test function with full controllability over overlapping: estimation of distribution algorithms

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader