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.
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35: 677--691, 1986. Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- 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 Scholar
- 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 Scholar
- 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 ScholarDigital Library
- 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 ScholarCross Ref
- 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 ScholarDigital Library
- 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 Scholar
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- J. Koza. Genetic Programming: On the Programming of Computers by Natural Selection MIT Press, MA, 1992. Google ScholarDigital Library
- 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 ScholarDigital Library
- W. B. Langdon and R. Poli. Foundations of Genetic Programming Springer, Berlin, 2002. Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 Scholar
- 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 Scholar
- R. Poli and W. L. N. McPhee. A Field Guide to Genetic Programming http://lulu. com, 2008. Google ScholarDigital Library
- 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 ScholarDigital Library
- F. Rothlauf and D. Goldberg. Redundant Representations in Evolutionary Algorithms. Evolutionary Computation 11(4): 381--415, 2003. Google ScholarDigital Library
- W. A. Tackett. Selection, and the Genetic Construction of Computer Programs PhDthesis, University of Southern California, USA, 1994. Google ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
- 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 ScholarDigital Library
Index Terms
Semantics based crossover for boolean problems
Recommendations
A micro niche evolutionary algorithm with lower-dimensional-search crossover for optimisation problems with constraints
This paper proposes a micro niche evolutionary algorithm (MNEA) with lower-dimensional-search crossover for optimisation problems with constraints. The best individual in each niche is picked out and all those picked individuals compose the breeding ...
Theoretical and Experimental Study of Crossover Operators of Genetic Algorithms
This paper is concerned with crossover operators for genetic algorithms (GAs) which are used to solve problems based on real numbers. First, a classification of the operators is introduced, dividing crossover into a vector-level and a variable-level ...
The effects of two new crossover operators on genetic algorithm performance
In this study, two new crossover operators in genetic algorithm are proposed; sequential and random mixed crossover. In the first stage, existing and developed crossover operators were applied to two benchmark problems, namely the reinforced concrete ...
Comments