Abstract
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form of a linear string of integers. The inputs or terminal set and node outputs are numbered sequentially. The node functions are also separately numbered. The genotype is just a list of node connections and functions. The genotype is then mapped to an indexed graph that can be executed as a program. Evolutionary algorithms are used to evolve the genotype in a symbolic regression problem (sixth order polynomial) and the Santa Fe Ant Trail. The computational effort is calculated for both cases. It is suggested that hit effort is a more reliable measure of computational efficiency. A neutral search strategy that allows the fittest genotype to be replaced by another equally fit genotype (a neutral genotype) is examined and compared with non-neutral search for the Santa Fe ant problem. The neutral search proves to be much more effective.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Banzhaf, W.: Genetic Programming for Pedestrains, Technical Report No. 93-03, Mitsubishi Electric Research Labs, Cambridge, MA (1993)
Banzhaf, W.: Genotype-Phenotype-Mapping and Neutral Variation: A Case study in Genetic Programming. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 322–332. Springer, Heidelberg (1994)
Chellapilla, K.: Evolutionary programming with tree mutations: Evolving computer programs without crossover. In: Koza, J.R., et al. (eds.) Genetic Programmimg 1997: Proceedings of the Third Annual Conference on Genetic Programming, pp. 432–438. Morgan Kaufmann, San Francisco (1998)
Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence through Simulated Evolution. Wiley, Chichester (1996)
Fogel, D.B.: Evolutionary Computation: Towards a New Philosophy of Machine Intelligence. IEEE Press, Los Alamitos (1995)
Harvey, I., Thompson, A.: Through the labyrinth evolution finds a way: A silicon ridge. In: Higuchi, T., Iwata, M., Weixin, L. (eds.) ICES 1996. LNCS, vol. 1259, pp. 406–422. Springer, Heidelberg (1997)
Huynen, M.A., Stadler, P.F., Fontana, W.: Smoothness within ruggedness: The role of neutrality in adaptation. In: Proceedings of the National Academy of Science USA, vol. 93, pp. 397–401 (1996)
Kimura, M.: Nature 217, 624-626 (1968)
Kimura, M.: The Neutral Theory of Molecular Evolution. Cambridge University Press, Cambridge (1983)
Koza, J.R.: Genetic Programming: On the programming of computers by means of natural selection. MIT Press, Cambridge (1992)
Koza, J.R.: Genetic Programming II: Automatic Discovery of Reusable Subprograms. MIT Press, Cambridge (1994)
Langdon, W.B., Poli, R.: Why Ants are Hard. In: Koza, J.R., et al. (eds.) Proceedings of the Third Annual Conference on Genetic Programming., pp. 193–201. Morgan Kaufmann, San Francisco (1998)
Miller, J.F., Thomson, P.: Aspects of Digital Evolution: Geometry and Learning. In: Sipper, M., Mange, D., Pérez-Uribe, A. (eds.) ICES 1998. LNCS, vol. 1478, pp. 25–35. Springer, Heidelberg (1998)
Miller, J.F.: An empirical study of the efficiency of learning Boolean functions using a Cartesian Genetic Programming Approach. In: Banzhaf, W., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), pp. 1135–1142. Morgan Kaufmann, San Francisco (1999)
Ohta, T.: Slightly deleterious mutant substitutions in evolution. Nature 246, 96–97 (1973)
Ohta, T.: The nearly neutral theory of molecular evolution. Annual Review of Ecology and Systematics 23, 263–286 (1992)
Poli, T.: Parallel distributed genetic programming. Technical report CSRP-96-15, School of Computer Science, The University of Birmingham, UK (1996)
Poli, R.: Evolution of graph-like programs with parallel distributed genetic programming. In: Bäck, T. (ed.) Genetic Algorithms: Proceedings of the Seventh International Conference, pp. 346–353. Morgan Kaufmann, San Francisco (1997)
Teller, A., Veloso, M.: PADO: Learning tree structured algorithms for orchestration into an object recognition system. Technical Report CMU-CS-95-101, Dept. of Computer Science, Carnegie Mellon University, Pittsburg (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Miller, J.F., Thomson, P. (2000). Cartesian Genetic Programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds) Genetic Programming. EuroGP 2000. Lecture Notes in Computer Science, vol 1802. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-46239-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-46239-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67339-2
Online ISBN: 978-3-540-46239-2
eBook Packages: Springer Book Archive