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

Approximating geometric crossover in semantic space

Published:08 July 2009Publication History

ABSTRACT

We propose a crossover operator that works with genetic programming trees and is approximately geometric crossover in the semantic space. By defining semantic as program's evaluation profile with respect to a set of fitness cases and constraining to a specific class of metric-based fitness functions, we cause the fitness landscape in the semantic space to have perfect fitness-distance correlation. The proposed approximately geometric semantic crossover exploits this property of the semantic fitness landscape by an appropriate sampling. We demonstrate also how the proposed method may be conveniently combined with hill climbing. We discuss the properties of the methods, and describe an extensive computational experiment concerning logical function synthesis and symbolic regression.

References

  1. L. Altenberg. Emergent phenomena in genetic programming. In A. V. Sebald and L. J. Fogel, editors, Evolutionary Programming -- Proceedings of the Third Annual Conference, pages 233--241, San Diego, CA, USA, 24-26 Feb. 1994. World Scientific Publishing.Google ScholarGoogle Scholar
  2. L. Beadle and C. Johnson. Semantically driven crossover in genetic programming. In J. Wang, editor, Proceedings of the IEEE World Congress on Computational Intelligence, pages 111--116, Hong Kong, 1-6 June 2008. IEEE Computational Intelligence Society, IEEE Press.Google ScholarGoogle ScholarCross RefCross Ref
  3. B. Doerr, E. Happ, and C. Klein. Crossover can provably be useful in evolutionary computation. In GECCO '08: Proceedings of the 10th annual conference on Genetic and evolutionary computation, pages 539--546, New York, NY, USA, 2008. ACM. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, USA, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. W. B. Langdon and R. Poli. Foundations of Genetic Programming. Springer-Verlag, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. Luke. ECJ evolutionary computation system, 2002. (http://cs.gmu.edu/ eclab/projects/ecj/).Google ScholarGoogle Scholar
  7. N. F. McPhee, B. Ohs, and T. Hutchison. Semantic building blocks in genetic programming. In M. O'Neill, L. Vanneschi, S. Gustafson, A. I. E. Alcázar, I. D. Falco, A. D. Cioppa, and E. Tarantino, editors, Genetic Programming, volume 4971 of LNCS, pages 134--145. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. P. Merz. A comparison of memetic recombination operators for the traveling salesman problem. In GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference, pages 472--479. Morgan Kaufmann Publishers. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. A. Moraglio and R. Poli. Topological interpretation of crossover. In K. Deb, R. Poli, W. Banzhaf, H.-G. Beyer, E. Burke, P. Darwen, D. Dasgupta, D. Floreano, J. Foster, M. Harman, O. Holland, P. L. Lanzi, L. Spector, A. Tettamanzi, D. Thierens, and A. Tyrrell, editors, Genetic and Evolutionary Computation -- GECCO-2004, Part I, volume 3102 of Lecture Notes in Computer Science, pages 1377--1388, Seattle, WA, USA, 26-30 June 2004. Springer-Verlag.Google ScholarGoogle Scholar
  10. A. Moraglio and R. Poli. Geometric landscape of homologous crossover for syntactic trees. In Proceedings of the 2005 IEEE Congress on Evolutionary Computation (CEC-2005), volume 1, pages 427--434, Edinburgh, 2-4 Sept. 2005. IEEE.Google ScholarGoogle ScholarCross RefCross Ref
  11. R. Poli and J. Page. Solving high-order boolean parity problems with smooth uniform crossover, sub-machine code GP and demes. Genetic Programming and Evolvable Machines, 1(1/2):37--56, Apr. 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. F. Rothlauf. On the locality of representations. Technical report, University of Mannheim, Department of Information Systems 1, 2003.Google ScholarGoogle Scholar
  13. F. Rothlauf and M. Oetzel. On the locality of grammatical evolution. Working Paper 11/2005, Department of Business Administration and Information Systems, University of Mannheim, D-68131 Mannheim, Germany, Dec. 2005.Google ScholarGoogle Scholar
  14. W. A. Tackett and A. Carmi. The unique implications of brood selection for genetic programming. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, Orlando, Florida, USA, 27-29 June 1994. IEEE Press.Google ScholarGoogle ScholarCross RefCross Ref
  15. L. Vanneschi and M. Tomassini. Pros and cons of fitness distance correlation in genetic programming. In A. M. Barry, editor, GECCO 2003: Proceedings of the Bird of a Feather Workshops, Genetic and Evolutionary Computation Conference, pages 284--287, Chigaco, 11 July 2003. AAAI.Google ScholarGoogle Scholar
  16. H. Xie, M. Zhang, and P. Andreae. An analysis of constructive crossover and selection pressure in genetic programming. In D. Thierens, H.-G. Beyer, J. Bongard, J. Branke, J. A. Clark, D. Cliff, C. B. Congdon, K. Deb, B. Doerr, T. Kovacs, S. Kumar, J. F. Miller, J. Moore, F. Neumann, M. Pelikan, R. Poli, K. Sastry, K. O. Stanley, T. Stutzle, R. A. Watson, and I. Wegener, editors, GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, volume 2, pages 1739--1748, London, 7-11 July 2007. ACM Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. M. Yangiya. Efficient genetic programming based on binary decision diagrams. In 1995 IEEE Conference on Evolutionary Computation, volume 1, pages 234--239, Perth, Australia, 29 Nov. - 1 Dec. 1995. IEEE Press.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Approximating geometric crossover in semantic space

        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 '09: Proceedings of the 11th Annual conference on Genetic and evolutionary computation
          July 2009
          2036 pages
          ISBN:9781605583259
          DOI:10.1145/1569901

          Copyright © 2009 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: 8 July 2009

          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