ABSTRACT
The search performance of Cartesian Genetic Programming (CGP) relies to a large extent on the sole use of genotypic point mutation in combination with extremely large redundant genotypes. Over the last years, steps have been taken to extend CGP's variation mechanisms by the introduction of advanced methods for recombination and mutation. One branch of these contributions addresses phenotypic variation in CGP. However, recent studies have demonstrated the limitations of phenotypic recombination in Boolean function learning and highlighted the effectiveness of the mutation-only approach. Therefore, in this work, we further explore phenotypic mutation in CGP by the introduction and evaluation of two phenotypic mutation operators that are inspired by chromosomal rearrangement. Our initial findings show that the proposed methods can significantly improve the search performance of CGP on various single- and multiple-output Boolean function benchmarks.
- Marc Ebner. 2012. Evolving concepts using gene duplication. In Computational Modelling of Objects Represented in Images - Fundamentals, Methods and Applications III, Third International Symposium, CompIMAGE 2012, Rome, Italy, September 5--7, 2012. CRC Press, 69--74. Google ScholarCross Ref
- JH Holland, Manish Mahajan, Sumit Kumar, and Rabins Porwal. 1975. Adaptation in Natural and Artificial Systems, the University of Michigan Press, Ann Arbor, MI. 1975. In Applying genetic algorithm to increase the efficiency of a data flow-based test data generation approach. 1--5.Google Scholar
- Jakub Husa and Roman Kalkreuth. 2018. A Comparative Study on Crossover in Cartesian Genetic Programming. In EuroGP 2018: Proceedings of the 21st European Conference on Genetic Programming (LNCS, Vol. 10781). Springer Verlag, Parma, Italy, 203--219. Google ScholarCross Ref
- Roman Kalkreuth. 2020. A Comprehensive Study on Subgraph Crossover in Cartesian Genetic Programming. In Proceedings of the 12th International Joint Conference on Computational Intelligence, IJCCI 2020, Budapest, Hungary, November 2--4, 2020. SCITEPRESS, 59--70. Google ScholarCross Ref
- Roman Kalkreuth, Günter Rudolph, and Andre Droschinsky. 2017. A New Subgraph Crossover for Cartesian Genetic Programming. In Genetic Programming - 20th European Conference, EuroGP 2017, Amsterdam, The Netherlands, April 19--21, 2017, Proceedings (Lecture Notes in Computer Science, Vol. 10196). 294--310. Google ScholarCross Ref
- Roman Tobias Kalkreuth. 2021. Reconsideration and Extension of Cartesian Genetic Programming. Ph.D. Dissertation. Google ScholarCross Ref
- Pedro Larrañaga, Cindy M. H. Kuijpers, Roberto H. Murga, Iñaki Inza, and S. Dizdarevic. 1999. Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators. Artif. Intell. Rev. 13, 2 (1999), 129--170. Google ScholarDigital Library
- Julian F. Miller. 1999. An empirical study of the efficiency of learning boolean functions using a Cartesian Genetic Programming approach. In Proceedings of the Genetic and Evolutionary Computation Conference, Vol. 2. Morgan Kaufmann, Orlando, Florida, USA, 1135--1142. http://citeseer.ist.psu.edu/153431.htmlGoogle Scholar
- Julian F. Miller. 2011. Cartesian Genetic Programming. Springer Berlin Heidelberg, Berlin, Heidelberg, 17--34. Google ScholarCross Ref
- Conor Ryan, J. J. Collins, and Michael O'Neill. 1998. Grammatical Evolution: Evolving Programs for an Arbitrary Language. In Genetic Programming, First European Workshop, EuroGP'98, Paris, France, April 14--15, 1998, Proceedings (Lecture Notes in Computer Science, Vol. 1391). Springer, 83--96. Google ScholarCross Ref
- Eric O. Scott and Sean Luke. 2019. ECJ at 20: toward a general metaheuristics toolkit. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2019, Prague, Czech Republic, July 13--17, 2019. ACM, 1391--1398. Google ScholarDigital Library
Index Terms
- Phenotypic duplication and inversion in cartesian genetic programming applied to boolean function learning
Recommendations
Two New Mutation Techniques for Cartesian Genetic Programming
IJCCI 2019: Proceedings of the 11th International Joint Conference on Computational IntelligenceCartesian Genetic Programming is often used with a point mutation as the sole genetic operator. In this paper, we propose two phenotypic mutation techniques and take a step towards advanced phenotypic mutations in Cartesian Genetic Programming. The ...
Towards Discrete Phenotypic Recombination in Cartesian Genetic Programming
Parallel Problem Solving from Nature – PPSN XVIIAbstractThe tree-based representation model of Genetic Programming (GP) is largely used with subtree crossover for genetic variation. Unlike Cartesian Genetic Programming (CGP) which is commonly used merely with mutation. Compared to comprehensive ...
Solving real-valued optimisation problems using cartesian genetic programming
GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computationClassical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to real-valued function optimisation. Both of these techniques directly evolve the real-values that are the arguments of the real-valued function. In this ...
Comments