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

Semantics based crossover for boolean problems

Published:07 July 2010Publication History

ABSTRACT

This paper investigates the role of semantic diversity and locality of crossover operators in. Genetic Programming (GP) for Boolean problems. We propose methods for measuring and storing semantics of subtrees in Boolean domains using Trace Semantics, and design several new crossovers on this basis. They can be categorised into two classes depending on their purposes: promoting semantic diversity or improving semantic locality. We test the operators on several well-known Boolean problems, comparing them with Standard GP Crossovers and with the Semantic Driven Crossover of Beadle and Johnson. The experimental results show the positive effects both of promoting semantic diversity, and of improving semantic locality, in crossover operators. They also show that the latter has a greater positive effect on GP performance than the former.

References

  1. L. Beadle and C. Johnson. Semantically driven crossover in genetic programming. In Proceedings of the IEEE World Congress on Computational Intelligence pages 111--116. IEEE Press, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  2. L. Beadle and C. G. Johnson. Semantic analysis of program initialisation in genetic programming. Genetic Programming and Evolvable Machines 10(3):307--337, Sep 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. L. Beadle and C. G. Johnson. Semantically driven mutation in genetic programming. In A. Tyrrell, editor, 2009 IEEE Congress on Evolutionary Computation pages 1336--1342, Trondheim, Norway, 18-21 May 2009. IEEE Computational Intelligence Society, IEEE Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. E. K. Burke, S. Gustafson, G. Kendall, and N. Krasnogor. Is increased diversity in genetic programming beneficial--an analysis of the effects on performance. In R. Sarker, R. Reynolds, H. Abbass, K. C. Tan, B. McKay, D. Essam, and T. Gedeon, editors, Proceedings of the 2003 Congress on Evolutionary Computation CEC2003 pages 1398--1405, Canberra, December 2003. IEEE Press.Google ScholarGoogle ScholarCross RefCross Ref
  5. R. Cleary and M. O 'Neill. An attribute grammar decoder for the 01 multi-constrained knapsack problem. In Proceedings of the Evolutionary Computation in Combinatorial Optimization pages 34--45. Springer Verlag, April 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. de la Cruz Echeanda, A. O. de la Puente, and M. Alfonseca. Attribute grammar evolution. In Proceedings of the IWINAC 2005 pages 182--191. Springer Verlag Berlin Heidelberg, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35: 677--691, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. C. Gathercole and P. Ross. An adverse interaction between crossover and restricted tree depth in genetic programming. In J. R. Koza, D. E. Goldberg, D. B. Fogel, and R. L. Riolo, editors, Genetic Programming 1996: Proceedings of the First Annual Conference pages 291--296, Stanford University, CA, USA, July 1996. MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. Gottlieb and G. Raidl. The effects of locality on the dynamics of decoder-based evolutionary search. In Proceedings of the Genetic and Evolutionary Computation Conference pages 283--290. ACM, 2000.Google ScholarGoogle Scholar
  10. S. Gustafson. An Analysis of Diversity in Genetic Programming PhD thesis, School of Computer Science and Information Technology, University of Nottingham, Nottingham, England, February 2004.Google ScholarGoogle Scholar
  11. S. Hengpraprohm and P. Chongstitvatana. Selective crossover in genetic programming. In Proceedings of ISCIT International Symposium on Communications and Information Technologies pages 14--16, November 2001.Google ScholarGoogle Scholar
  12. N. X. Hoai, R. I. McKay, and D. Essam. Representation and structural difficulty in genetic programming. IEEE Transection on Evolutionary Computation 10(2): 157--166, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. T. Ito, H. Iba, and S. Sato. Depth-dependent crossover for genetic programming. In Proceedings of the 1998 IEEE World Congress on Computational Intelligence pages 775--780. IEEE Press, May 1998.Google ScholarGoogle ScholarCross RefCross Ref
  14. C. Johnson. Deriving genetic programming fitness properties by static analysis. In Proceedings of the 4th European Conference on Genetic Programming (EuroGP 2002)pages 299--308. Springer, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. C. Johnson. What can automatic programming learn from theoretical computer science. In Proceedings of the UK Workshop on Computational Intelligence University of Birmingham, 2002.Google ScholarGoogle Scholar
  16. C. Johnson. Genetic programming with fitness based on model checking. In Proceedings of the 10th European Conference on Genetic Programming (EuroGP 2002)pages 114--124. Springer, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. G. Katz and D. Peled. Genetic programming and model checking: Synthesizing new mutual exclusion algorithms. Automated Technology for Verification and Analysis, Lecture Notes in Computer Science 5311: 33--47, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. G. Katz and D. Peled. Model checking-based genetic programming with an application to mutual exclusion. Tools and Algorithms for the Construction and Analysis of Systems 4963: 141--156, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. J. Koza. Genetic Programming: On the Programming of Computers by Natural Selection MIT Press, MA, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. K. Krawiec and P. Lichocki. Approximating geometric crossover in semantic space. In F. Rothlauf, editor, Genetic and Evolutionary Computation Conference, GECCO 2009, Proceedings, Montreal, Québec, Canada, July 8-12, 2009 pages 987--994. ACM, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. W. B. Langdon and R. Poli. Foundations of Genetic Programming Springer, Berlin, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. H. Majeed and C. Ryan. A less destructive, context-aware crossover operator for gp. In Proceedings of the 9th European Conference on Genetic Programming pages 36--48. Lecture Notes in Computer Science, Springer, April 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. N. McPhee, B. Ohs, and T. Hutchison. Semantic building blocks in genetic programming. In Proceedings of 11th European Conference on Genetic Programming pages 134--145. Springer, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. R. Poli and W. B. Langdon. Genetic programming with one-point crossover. In Proceedings of Soft Computing in Engineering Design and Manufacturing Conference pages 180--189. Springer-Verlag, June 1997.Google ScholarGoogle Scholar
  25. R. Poli and W. B. Langdon. On the search properties of di fferent crossover operators in genetic programming. In J. R. Koza, W. Banzhaf, K. Chellapilla, K. Deb, M. Dorigo, D. B. Fogel, M. H. Garzon, D. E. Goldberg, H. Iba, and R. Riolo, editors, Genetic Programming 1998: Proceedings of the Third Annual Conference pages 293--301, University of Wisconsin, Madison, Wisconsin, USA, July 1998. Morgan Kaufmann.Google ScholarGoogle Scholar
  26. R. Poli and W. L. N. McPhee. A Field Guide to Genetic Programming http://lulu. com, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. 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): 37--56, 04 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. F. Rothlauf and D. Goldberg. Redundant Representations in Evolutionary Algorithms. Evolutionary Computation 11(4): 381--415, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. W. A. Tackett. Selection, and the Genetic Construction of Computer Programs PhDthesis, University of Southern California, USA, 1994. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. N. Q. Uy, N. X. Hoai, and M. O'Neill. Semantic aware crossover for genetic programming: the case for real-valued function regression. In Proceedings of EuroGP 2009 pages 292--302. Springer, April 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. N. Q. Uy, M. O'Neill, N. X. Hoai, B. McKay, and E. G. Lopez. Semantic similarity based crossover in GP: The case for real-valued function regression. In P. Collet, editor, Evolution Artificielle, 9th International Conference Lecture Notes in Computer Science, pages 13--24, October 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. M. L. Wong and K. S. Leung. An induction system that learns programs in different programming languages using genetic programming and logic grammars. In Proceedings of the 7th IEEE International Conference on Tools with Artificial Intelligence 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Semantics based crossover for boolean problems

    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 '10: Proceedings of the 12th annual conference on Genetic and evolutionary computation
      July 2010
      1520 pages
      ISBN:9781450300728
      DOI:10.1145/1830483

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

      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