skip to main content
tutorial

Recent Developments in Cartesian Genetic Programming and its Variants

Published:28 January 2019Publication History
Skip Abstract Section

Abstract

Cartesian Genetic Programming (CGP) is a variant of Genetic Programming with several advantages. During the last one and a half decades, CGP has been further extended to several other forms with lots of promising advantages and applications. This article formally discusses the classical form of CGP and its six different variants proposed so far, which include Embedded CGP, Self-Modifying CGP, Recurrent CGP, Mixed-Type CGP, Balanced CGP, and Differential CGP. Also, this article makes a comparison among these variants in terms of population representations, various constraints in representation, operators and functions applied, and algorithms used. Further, future work directions and open problems in the area have been discussed.

References

  1. A. M. Ahmad, G. M. Khan, S. A. Mahmud, and J. F. Miller. 2012. Breast cancer detection using Cartesian genetic programming evolved artificial neural networks. In Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation. ACM, 1031–1038. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. A. I. E. Alcazar and K. C. Sharman. 1996. Some applications of genetic programming in digital signal processing. In Late Breaking Papers at the Genetic Programming 1996 Conference Stanford University. 24–31.Google ScholarGoogle Scholar
  3. T. V. Belle and D. H. Ackley. 2002. Code factoring and the evolution of evolvability. In Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation. 1383–1390. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. W. Banzhaf. 1993. Genetic programming for pedestrians. In Proceedings of the 5th International Conference on Genetic Algorithms (ICGA’93). Morgan Kaufmann Publishers Inc., 628. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. J. Clegg, J. A. Walker, and J. F. Miller. 2007. A new crossover technique for Cartesian genetic programming. In Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation. ACM, 1580–1587. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. M. Crosbie and G. Spafford. 1995. Applying genetic programming to intrusion detection. In Working Notes for the AAAI Symposium on Genetic Programming. MIT Press, Cambridge, MA, 1–8.Google ScholarGoogle Scholar
  7. Z. Gajda and L. Sekanina. 2009. Gate-level optimization of polymorphic circuits using Cartesian genetic programming. In Proceedings of IEEE Congress on Evolutionary Computation (CEC’09). IEEE, 1599–1604. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. Z. Gajda and L. Sekanina. 2010. An efficient selection strategy for digital circuit evolution. Evolvable Systems: From Biology to Hardware (2010), 13–24. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. E. Galvan-Lopez. 2008. Efficient graph-based genetic programming representation with multiple outputs. International Journal of Automation and Computing. 5, 1 (2008) 81–89.Google ScholarGoogle ScholarCross RefCross Ref
  10. A. B. Garmendia-Doval, J. F. Miller, and S. D. Morley. 2005. Cartesian genetic programming and the post docking filtering problem. In Genetic Programming Theory and Practice II. Springer, US, 225–244.Google ScholarGoogle Scholar
  11. A. B. Garmendia-Doval, S. D. Morley, and S. Juhos. 2003. Post docking filtering using Cartesian genetic programming. In Proceedings of the International Conference on Artificial Evolution (Evolution Artificial). Springer, Berlin, 189–200.Google ScholarGoogle Scholar
  12. B. W. Goldman and W. F. Punch. 2013. Length bias and search limitations in Cartesian genetic programming. In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation. ACM, 933–940. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. B. W. Goldman and W. F. Punch. 2015. Analysis of Cartesian genetic programming's evolutionary mechanisms. IEEE Transactions on Evolutionary Computation 19, 3 (2015), 359–373.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. G. J. Gray, D. J. Murray-Smith, Y. Li, K. C. Sharman, and T. Weinbrenner. 1998. Nonlinear model structure identification using genetic programming. Control Engineering Practice 6, 11 (1998), 1341–1352.Google ScholarGoogle ScholarCross RefCross Ref
  15. F. Gruau. 1994. Neural Network Synthesis Using Cellular Encoding and the Genetic Algorithm. Université de Lyon.Google ScholarGoogle Scholar
  16. A. Guven and M. Gunal. 2008. Genetic programming approach for prediction of local scour downstream of hydraulic structures. Journal of Irrigation and Drainage Engineering 134, 2 (2008), 241–249.Google ScholarGoogle ScholarCross RefCross Ref
  17. S. Harding and J. F. Miller. 2005. Evolution of robot controller using Cartesian genetic programming. In Proceedings of the European Conference on Genetic Programming. Springer, Berlin, 62–73. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Harding, J. F. Miller, and W. Banzhaf. 2007. Self-modifying Cartesian genetic programming. In Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation (GECCO’07), D. Thierens et al. (Eds.). ACM Press, London, 1021–1028. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. S. Harding. 2008. Evolution of image filters on graphics processor units using Cartesian genetic programming. In Proceedings of Evolutionary Computation (IEEE World Congress on Computational Intelligence). IEEE, 1921–1928.Google ScholarGoogle ScholarCross RefCross Ref
  20. S. L. Harding, J. F. Miller, and W. Banzhaf. 2011a. Self-modifying Cartesian genetic programming. Cartesian Genetic Programming. Springer, Berlin, 101–124.Google ScholarGoogle ScholarCross RefCross Ref
  21. S. Harding, J. F. Miller, and W. Banzhaf. 2011b. Smcgp2: Finding algorithms that approximate numerical constants using quaternions and complex numbers. In Proceedings of the 13th Annual Conference Companion on Genetic and Evolutionary Computation. ACM, 197--198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. S. Harding, J. F. Miller, and W. Banzhaf. 2009a. Self modifying Cartesian genetic programming: Fibonacci, squares, regression and summing. In Proceedings of the European Conference on Genetic Programming. Springer, Berlin, 133–144. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. S. Harding, J. F. Miller, and W. Banzhaf. 2009b. Self modifying Cartesian genetic programming: Parity. In Proceedings of the IEEE Congress on Evolutionary Computation (CEC’09). IEEE, 285–292. Google ScholarGoogle ScholarDigital LibraryDigital Library
  24. S. Harding, J. F. Miller, and W. Banzhaf. 2010a. Developments in Cartesian genetic programming: Self-modifying CGP. Genetic Programming and Evolvable Machines 11, 3-4 (2010), 397–439. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. S. Harding, J. F. Miller, and W. Banzhaf. 2010b. Self modifying Cartesian genetic programming: Finding algorithms that calculate pi and e to arbitrary precision. In Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation. ACM, 579–586. Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. S. Harding, J. F. Miller, and W. Banzhaf. 2011. SMCGP2: Self modifying Cartesian genetic programming in two dimensions. In Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation. ACM, 1491–1498. Google ScholarGoogle ScholarDigital LibraryDigital Library
  27. S. Harding, V. Graziano, J. Leitner, and J. Schmidhuber. 2012. MT-CGP: Mixed type Cartesian genetic programming. In Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation. ACM, 751–758. Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. S. Harding, J. Leitner, and J. Schmidhuber. 2013. Cartesian genetic programming for image processing. In Genetic Programming Theory and Practice X. Springer, New York, 31–44.Google ScholarGoogle Scholar
  29. A. Hazell and S. L. Smith. 2008. Towards an objective assessment of Alzheimer's disease: The application of a novel evolutionary algorithm in the analysis of figure copying tasks. In Proceedings of the 10th Annual Conference Companion on Genetic and Evolutionary Computation. ACM, 2073–2080. Google ScholarGoogle ScholarDigital LibraryDigital Library
  30. J. H. Hong and S. B. Cho. 2006. The classification of cancer based on DNA microarray data that uses diverse ensemble genetic programming. Artificial Intelligence in Medicine 36, 1 (2006), 43–58. Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. R. Hrbacek and V. Dvorak. 2014. Bent function synthesis by means of Cartesian genetic programming. In Proceedings of the International Conference on Parallel Problem Solving from Nature. Springer International Publishing, 414–423.Google ScholarGoogle Scholar
  32. L. Huelsbergen. 1996. Learning recursive sequences via evolution of machine-language programs. Genetic Programming, 186–194.Google ScholarGoogle Scholar
  33. H. Iba and T. Sasaki. 1999. Using genetic programming to predict financial data. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC’99), Vol. 1. IEEE, 244–251.Google ScholarGoogle Scholar
  34. D. Izzo, F. Biscani, and A. Mereta. 2016. Differentiable genetic programming. Arxiv Preprint arxiv:1611.04766.Google ScholarGoogle Scholar
  35. M. I. Jordan. 1986. Serial Order: A Parallel Distributed Processing Approach (Technical Report No. 8604). Institute for Cognitive Science, University of California, San Diego, La Jolla, CA.Google ScholarGoogle Scholar
  36. P. Kaufmann and M. Platzner. 2008. Advanced techniques for the creation and propagation of modules in Cartesian genetic programming. In Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation. ACM, 1219–1226. Google ScholarGoogle ScholarDigital LibraryDigital Library
  37. G. M. Khan, F. Zafari, and S. A. Mahmud. 2013a. Very short term load forecasting using Cartesian genetic programming evolved recurrent neural networks (CGPRNN). In Proceedings of the 2013 12th International Conference on Machine Learning and Applications (ICMLA’13), Vol. 2. IEEE, 152–155. Google ScholarGoogle ScholarDigital LibraryDigital Library
  38. M. M. Khan, A. M. Ahmad, G. M. Khan, and J. F. Miller. 2013b. Fast learning neural networks using Cartesian genetic programming. Neurocomputing 121 (2013), 274–289. Google ScholarGoogle ScholarDigital LibraryDigital Library
  39. M. M. Khan, G. M. Khan, and J. F. Miller. 2010a. Evolution of optimal ANNs for non-linear control problems using Cartesian genetic programming. In Proceedings of IC-AI. 339–346.Google ScholarGoogle Scholar
  40. M. M. Khan, G. M. Khan, and J. F. Miller. 2010b. Efficient representation of recurrent neural networks for Markovian/non-Markovian non-linear control problems. In Proceedings of the 2010 10th International Conference on Intelligent Systems Design and Applications (ISDA’10). IEEE, 615–620.Google ScholarGoogle Scholar
  41. J. K. Kishore, L. M. Patnaik, V. Mani, and V. K. Agrawal. 2000. Application of genetic programming for multicategory pattern classification. IEEE Transactions on Evolutionary Computation 4, 3 (2000), 242–258. Google ScholarGoogle ScholarDigital LibraryDigital Library
  42. J. R. Koza. 1992. Genetic Programming: On the Programming of Computers by Means of Natural Selection (1). MIT Press. Google ScholarGoogle ScholarDigital LibraryDigital Library
  43. J. R. Koza. 1994. Genetic Programming II: Automatic Discovery of Reusable Subprograms. MIT Press, Cambridge, MA. Google ScholarGoogle ScholarDigital LibraryDigital Library
  44. W. B. Langdon and R. Poli. 2013. Foundations of Genetic Programming. Springer Science 8 Business Media. Google ScholarGoogle ScholarDigital LibraryDigital Library
  45. W. B. Langdon, R. I. McKay, and L. Specter. 2010. Genetic programming. In Handbook of Metaheuristics. Springer, US, 185–225.Google ScholarGoogle Scholar
  46. J. Leitner, S. Harding, A. Förster, and J. Schmidhube. 2012. Mars terrain image classification using Cartesian genetic programming. In Proceedings of the 11th International Symposium on Artificial Intelligence, Robotics and Automation in Space (i-SAIRAS’12).Google ScholarGoogle Scholar
  47. E. G. López, R. Poli, and C. A. C. Coello. 2004. Reusing code in genetic programming. In Proceedings of Euro GP. 359–368.Google ScholarGoogle ScholarCross RefCross Ref
  48. S. Luke and L. Panait. 2006. A comparison of bloat control methods for genetic programming. Evolutionary Computation 14, 3 (2006), 309–344. Google ScholarGoogle ScholarDigital LibraryDigital Library
  49. B. McKay, M. Willis, and G. Barton. 1997. Steady-state modeling of chemical process systems using genetic programming. Computers 8 Chemical Engineering 21, 9 (1997), 981–996.Google ScholarGoogle Scholar
  50. A. Meier, M. Gonter, and R. Kruse. 2013. Accelerating convergence in Cartesian genetic programming by using a new genetic operator. In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation. ACM, 981–988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  51. J. Miller. 2001. What bloat? Cartesian genetic programming on Boolean problems. In 2001 Genetic and Evolutionary Computation Conference Late Breaking Papers. 295–302.Google ScholarGoogle Scholar
  52. J. F. Miller. 2011. Cartesian Genetic Programming. Cartesian Genetic Programming. Springer, Berlin, 17–34.Google ScholarGoogle Scholar
  53. J. F. Miller. 2013. GECCO 2013 Tutorial: Cartesian Genetic Programming. In Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO’13 Companion). 715–740. Google ScholarGoogle ScholarDigital LibraryDigital Library
  54. J. F. Miller and M. Mohid. 2013. Function optimization using Cartesian genetic programming. In Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation. ACM, 147–148. Google ScholarGoogle ScholarDigital LibraryDigital Library
  55. J. F. Miller and S. L. Smith. 2006. Redundancy and computational efficiency in Cartesian genetic programming. IEEE Transactions on Evolutionary Computation 10, 2 (2006), 167–174. Google ScholarGoogle ScholarDigital LibraryDigital Library
  56. J. F. Miller and P. Thomson. 2000. Cartesian genetic programming. In Proceedings of the European Conference on Genetic Programming. Springer, Berlin, 121–132. Google ScholarGoogle ScholarDigital LibraryDigital Library
  57. J. F. Miller and P. Thomson. 2003. A developmental method for growing graphs and circuits. In Proceedings of the International Conference on Evolvable Systems. Springer, Berlin, 93–104. Google ScholarGoogle ScholarDigital LibraryDigital Library
  58. J. F. Miller, S. L. Smith, and Y. Zhang. 2010. Detection of micro calcifications in mammograms using multi-chromosome Cartesian genetic programming. In Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation. ACM, 1923–1930. Google ScholarGoogle ScholarDigital LibraryDigital Library
  59. J. Miller and A. Turner. 2015. Cartesian genetic programming. In Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation. ACM, 179–198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  60. P. Nordin, W. Banzhaf, and M. Brameier. 1998. Evolution of a world model for a miniature robot using genetic programming. Robotics and Autonomous Systems 25, 1-2 (1998), 105–116.Google ScholarGoogle ScholarCross RefCross Ref
  61. S. Openshaw and I. Turton. 1994. Building new spatial interaction models using genetic programming. Evolutionary Computing. Lecture Notes in Computer Science, UK, 11–13.Google ScholarGoogle Scholar
  62. M. Oussaidene, B. Chopard, O. V. Pictet, and M. Tomassini. 1997. Parallel genetic programming and its application to trading model induction. Parallel Computing 23, 8 (1997), 1183–1198. Google ScholarGoogle ScholarDigital LibraryDigital Library
  63. P. C. D. Paris, E. C. Pedrino, and M. C. Nicoletti. 2015. Automatic learning of image filters using Cartesian genetic programming. Integrated Computer-Aided Engineering 22, 2 (2015), 135–151. Google ScholarGoogle ScholarDigital LibraryDigital Library
  64. T. Perkis. 1994. Stack-based genetic programming. In Proceedings of the First IEEE Conference on Evolutionary Computation, 1994. IEEE World Congress on Computational Intelligence. IEEE, 148–153.Google ScholarGoogle ScholarCross RefCross Ref
  65. S. Picek, D. Jakobovic, J. F. Miller, L. Batina, and M. Cupic. 2016. Cryptographic Boolean functions: One output, many design criteria. Applied Soft Computing 40 (2016), 635–653. Google ScholarGoogle ScholarDigital LibraryDigital Library
  66. R. Poli. 1996. Parallel Distributed Genetic Programming. University of Birmingham, Cognitive Science Research Centre.Google ScholarGoogle Scholar
  67. R. Poli. 2003. A simple but theoretically-motivated method to control bloat in genetic programming. In Proceedings of the European Conference on Genetic Programming. Springer, Berlin, 204–217. Google ScholarGoogle ScholarDigital LibraryDigital Library
  68. J. Y. Potvin, P. Soriano, and M. Vallée. 2004. Generating trading rules on the stock markets with genetic programming. Computers 8 Operations Research 31, 7 (2004), 1033–1047. Google ScholarGoogle ScholarDigital LibraryDigital Library
  69. J. A. Rothermich and J. F. Miller. 2002. Studying the emergence of multicellularity with Cartesian genetic programming in artificial life. In GECCO Late Breaking Papers. 397–403.Google ScholarGoogle Scholar
  70. P. Ryser-Welch and J. F. Miller. 2016. PPSN 2016 Tutorial: A Graph-based GP and Cartesian Genetic Programming. University of York.Google ScholarGoogle Scholar
  71. P. Ryser-Welch, J. F. Miller, J. Swan, and M. A. Trefzer. 2016. Iterative Cartesian genetic programming: Creating general algorithms for solving travelling salesman problems. In Proceedings of the European Conference on Genetic Programming. Springer, Cham, 294–310.Google ScholarGoogle Scholar
  72. L. Sekanina, S. L. Harding, W. Banzhaf, and T. Kowaliw. 2011. Image processing and CGP. In Proceedings of Cartesian Genetic Programming. Springer, Berlin, 181–215.Google ScholarGoogle Scholar
  73. S. Silva and E. Costa. 2009. Dynamic limits for bloat control in genetic programming and a review of past and current bloat theories. Genetic Programming and Evolvable Machines 10, 2 (2009), 141–179. Google ScholarGoogle ScholarDigital LibraryDigital Library
  74. D. Simon. 2008. Biogeography-based optimization. IEEE Transactions on Evolutionary Computation 12, 6 (2008), 702–713.Google ScholarGoogle ScholarDigital LibraryDigital Library
  75. S. L. Smith. 2011. Cartesian genetic programming and its application to medical diagnosis. IEEE Computational Intelligence Magazine 6, 4 (2011), 56–67.Google ScholarGoogle ScholarDigital LibraryDigital Library
  76. L. Spector. 1996. Simultaneous evolution of programs and their control structures. Advances in Genetic Programming 2 (1996), 137–154. Google ScholarGoogle ScholarDigital LibraryDigital Library
  77. L. Spector and K. Stoffel. 1996. Ontogenetic programming. In Proceedings of the 1st Annual Conference on Genetic Programming. MIT Press, 394–399. Google ScholarGoogle ScholarDigital LibraryDigital Library
  78. H. R. Tizhoosh. 2005. Opposition-based learning: A new scheme for machine intelligence. In Proceedings of the International Conference on Computational Intelligence for Modeling, Control and Automation, 2005 and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, Vol. 1. IEEE, 695–701. Google ScholarGoogle ScholarDigital LibraryDigital Library
  79. A. Turner. 2015. Evolving Artificial Neural Networks using Cartesian Genetic Programming. Doctoral dissertation, University of York.Google ScholarGoogle Scholar
  80. A. J. Turner and J. F. Miller. 2013. Cartesian genetic programming encoded artificial neural networks: A comparison using three benchmarks. In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation. ACM, 1005–1012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  81. A. J. Turner and J. F. Miller. 2014a. Recurrent Cartesian genetic programming applied to famous mathematical sequences. In Proceedings of the 7th York Doctoral Symposium on Computer Science 8 Electronics. 37–46.Google ScholarGoogle Scholar
  82. A. J. Turner and J. F. Miller. 2014b. Recurrent Cartesian genetic programming. In International Conference on Parallel Problem Solving from Nature. Springer International Publishing, 476–486.Google ScholarGoogle Scholar
  83. A. J. Turner and J. F. Miller. 2014c. Cartesian genetic programming: Why no bloat? In Proceedings of the European Conference on Genetic Programming. Springer, Berlin, 222–233. Google ScholarGoogle ScholarDigital LibraryDigital Library
  84. A. J. Turner and J. F. Miller. 2015a. Neutral genetic drift: An investigation using Cartesian genetic programming. Genetic Programming and Evolvable Machines 16, 4 (2015), 531–558. Google ScholarGoogle ScholarDigital LibraryDigital Library
  85. A. J. Turner and J. F. Miller. 2015b. Recurrent Cartesian genetic programming applied to series forecasting. In Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation. ACM, 1499–1500. Google ScholarGoogle ScholarDigital LibraryDigital Library
  86. I. Turton, S. Openshaw, and G. Diplock. 1996. Some geographical applications of genetic programming on the Cray T3D supercomputer. In Proceedings of the UK Parallel’96. Springer, London, 135–150.Google ScholarGoogle Scholar
  87. V. K. Vassilev and J. F. Miller. 2000. The advantages of landscape neutrality in digital circuit evolution. In Proceedings of the International Conference on Evolvable Systems. Springer, Berlin, 252–263. Google ScholarGoogle ScholarDigital LibraryDigital Library
  88. Z. Vasicek. 2015. Cartesian GP in optimization of combinational circuits with hundreds of inputs and thousands of gates. In Proceedings of the European Conference on Genetic Programming. Springer, Cham, 139–150.Google ScholarGoogle ScholarCross RefCross Ref
  89. Z. Vasicek, V. Mrazek, and L. Sekanina. 2016. Evolutionary functional approximation of circuits implemented into FPGAs. In Proceedings of the 2016 IEEE Symposium Series on Computational Intelligence (SSCI’16). IEEE, 1–8.Google ScholarGoogle Scholar
  90. J. A. Walker and J. F. Miller. 2004. Evolution and acquisition of modules in Cartesian genetic programming. In Proceedings of the European Conference on Genetic Programming. Springer, Berlin, 187–197.Google ScholarGoogle Scholar
  91. J. A. Walker and J. F. Miller. 2005a. Investigating the performance of module acquisition in Cartesian genetic programming. In Proceedings of the 7th Annual Conference on Genetic and Evolutionary Computation. ACM, 1649–1656. Google ScholarGoogle ScholarDigital LibraryDigital Library
  92. J. A. Walker and J. F. Miller. 2005b. Improving the evolvability of digital multipliers using embedded Cartesian genetic programming and product reduction. In Proceedings of the International Conference on Evolvable Systems. Springer, Berlin, 131–142. Google ScholarGoogle ScholarDigital LibraryDigital Library
  93. J. A. Walker and J. F. Miller. 2006. Embedded Cartesian genetic programming and the lawnmower and hierarchical-if-and-only-if problems. In Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation. ACM, 911–918. Google ScholarGoogle ScholarDigital LibraryDigital Library
  94. J. A. Walker, J. F. Miller, and R. Cavill. 2006. A multi-chromosome approach to standard and embedded Cartesian genetic programming. In Proceedings of the 8th Annual Conference on Genetic and Evolutionary Computation. ACM, 903–910. Google ScholarGoogle ScholarDigital LibraryDigital Library
  95. J. A. Walker and J. F. Miller. 2007. Solving real-valued optimization problems using Cartesian genetic programming. In Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation. ACM, 1724–1730. Google ScholarGoogle ScholarDigital LibraryDigital Library
  96. J. A. Walker and J. F. Miller. 2008. The automatic acquisition, evolution and reuse of modules in Cartesian genetic programming. IEEE Transactions on Evolutionary Computation 12, 4 (2008), 397–417. Google ScholarGoogle ScholarDigital LibraryDigital Library
  97. J. A. Walker, K. Völk, S. L. Smith, and J. F. Miller. 2009. Parallel evolution using multi-chromosome Cartesian genetic programming. Genetic Programming and Evolvable Machines 10, 4 (2009), 417–445. Google ScholarGoogle ScholarDigital LibraryDigital Library
  98. J. R. Woodward. 2003. Modularity in genetic programming. In Proceedings of the European Conference on Genetic Programming. Springer, Berlin, 254–263. Google ScholarGoogle ScholarDigital LibraryDigital Library
  99. W. P. Worzel, J. Yu, A. A. Almal, and A. M. Chinnaiyan. 2009. Applications of genetic programming in cancer research. The International Journal of Biochemistry 8 Cell Biology 41, 2 (2009), 405–413.Google ScholarGoogle Scholar
  100. S. Yazdani and J. Shanbehzadeh. 2015. Balanced Cartesian genetic programming via migration and opposition-based learning: Application to symbolic regression. Genetic Programming and Evolvable Machines 16, 2 (2015), 133–150. Google ScholarGoogle ScholarDigital LibraryDigital Library
  101. S. Yazdani, J. Shanbehzadeh, and E. Hadavandi. 2017. MBCGP-FE: A modified balanced Cartesian genetic programming feature extractor. Knowledge-Based Systems 135 (2017), 89–98. Google ScholarGoogle ScholarDigital LibraryDigital Library
  102. T. Yu and J. Miller. 2001. Neutrality and the evolvability of Boolean function landscape. In Proceedings of the European Conference on Genetic Programming. Springer, Berlin, 204–217. Google ScholarGoogle ScholarDigital LibraryDigital Library
  103. T. Yu and J. F. Miller. 2002. The role of neutral and adaptive mutation in an evolutionary search on the OneMax problem. GECCO Late Breaking Papers 2 (2002), 512–519.Google ScholarGoogle Scholar
  104. Z. Yu and S. Zeng. 2012. Using Cartesian genetic programming to design wire antenna. International Journal of Computer Applications in Technology 43, 4 (2012), 372–377. Google ScholarGoogle ScholarDigital LibraryDigital Library
  105. Z. Yu, S. Zeng, Y. Guo, and L. Song. 2011. Using Cartesian genetic programming to implement function modeling. International Journal of Innovative Computing and Applications 3, 4 (2011), 213–222. Google ScholarGoogle ScholarDigital LibraryDigital Library
  106. L. Zangeneh and P. J. Bentley. 2010. Analyzing the credit default swap market using Cartesian genetic programming. In Proceedings of the International Conference on Parallel Problem Solving from Nature. Springer, Berlin, 434–444. Google ScholarGoogle ScholarDigital LibraryDigital Library
  107. Y. Zhang and M. Zhang. 2004. A multiple-output program tree structure in genetic programming. In Proceedings of the 7th Asia-Pacific Conference on Complex Systems Cairns Convention Centre.Google ScholarGoogle Scholar

Index Terms

  1. Recent Developments in Cartesian Genetic Programming and its Variants

        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

        Full Access

        • Published in

          cover image ACM Computing Surveys
          ACM Computing Surveys  Volume 51, Issue 6
          November 2019
          786 pages
          ISSN:0360-0300
          EISSN:1557-7341
          DOI:10.1145/3303862
          • Editor:
          • Sartaj Sahni
          Issue’s Table of Contents

          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: 28 January 2019
          • Accepted: 1 September 2018
          • Revised: 1 April 2018
          • Received: 1 September 2017
          Published in csur Volume 51, Issue 6

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • tutorial
          • Research
          • Refereed

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader

        HTML Format

        View this article in HTML Format .

        View HTML Format