skip to main content
10.1145/3319619.3322027acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

Does constraining the search space of GA always help?: the case of balanced crossover operators

Authors Info & Claims
Published:13 July 2019Publication History

ABSTRACT

In this paper, we undertake an investigation on the effect of balanced and unbalanced crossover operators against the problem of finding non-linear balanced Boolean functions: we consider three different balanced crossover operators and compare their performances with classic one-point crossover. The statistical comparison shows that the use of balanced crossover operators gives GA a definite advantage over one-point crossover.

Skip Supplemental Material Section

Supplemental Material

References

  1. Jiah-Shing Chen and Jia-Leh Hou. 2006. A Combination Genetic Algorithm with Applications on Portfolio Optimization. In IEA/AIE (Lecture Notes in Computer Science), Vol. 4031. Springer, 197--206. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Salvador García, Daniel Molina, Manuel Lozano, and Francisco Herrera. 2009. A study on the use of non-parametric tests for analyzing the evolutionary algorithms' behaviour: a case study on the CEC'2005 Special Session on Real Parameter Optimization. J. Heuristics 15, 6 (2009), 617--644. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Luca Mariot and Alberto Leporati. 2015. A Genetic Algorithm for Evolving Plateaued Cryptographic Boolean Functions. In Theory and Practice of Natural Computing - Fourth International Conference, TPNC 2015, Mieres, Spain, December 15--16, 2015. Proceedings. 33--45. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Luca Mariot, Stjepan Picek, Domagoj Jakobovic, and Alberto Leporati. 2017. Evolutionary algorithms for the design of orthogonal latin squares based on cellular automata. In GECCO. ACM, 306--313. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Luca Mariot, Stjepan Picek, Domagoj Jakobovic, and Alberto Leporati. 2018. Evolutionary Search of Binary Orthogonal Arrays. In PPSN(1) (Lecture Notes in Computer Science), Vol. 11101. Springer, 121--133.Google ScholarGoogle Scholar
  6. Thorsten Meinl and Michael R. Berthold. 2009. Crossover operators for multiobjective k-subset selection. In GECCO. ACM, 1809--1810. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. William Millan, Andrew J. Clark, and Ed Dawson. 1998. Heuristic Design of Crypto graphic ally Strong Balanced Boolean Functions. In EUROCRYPT (Lecture Notes in Computer Science), Vol. 1403. Springer, 489--499.Google ScholarGoogle Scholar
  8. Stjepan Picek, Marin Golub, and Domagoj Jakobovic. 2011. Evaluation of Crossover Operator Performance in Genetic Algorithms with Binary Representation. In ICIC (3) (LNCS), Vol. 6840. Springer, 223--230. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. Stjepan Picek, Domagoj Jakobovic, and Marin Golub. 2013. On the recombination operator in the real-coded genetic algorithms. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2013, Cancun, Mexico, June 20--23, 2013. 3103--3110.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Does constraining the search space of GA always help?: the case of balanced crossover operators

      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
      • Published in

        cover image ACM Conferences
        GECCO '19: Proceedings of the Genetic and Evolutionary Computation Conference Companion
        July 2019
        2161 pages
        ISBN:9781450367486
        DOI:10.1145/3319619

        Copyright © 2019 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 13 July 2019

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate1,669of4,410submissions,38%

        Upcoming Conference

        GECCO '24
        Genetic and Evolutionary Computation Conference
        July 14 - 18, 2024
        Melbourne , VIC , Australia

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader