Abstract
Developmental Genetic Programming (DGP) algorithms have been introduced where the search space for a problem is divided into genotypes and corresponding phenotypes that are connected by a mapping (or “genetic code”). Current implementations of this concept involve evolution of the mappings in addition to the traditional evolution of genotypes. We introduce the latest version of Probabilistic Adaptive Mapping DGP (PAM DGP), a robust and highly customizable algorithm that overcomes performance problems identified for the latest competing adaptive mapping algorithm. PAM DGP is then shown to outperform the competing algorithm on two non-trivial regression benchmarks.
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Banzhaf, W.: Genotype-Phenotype Mapping and Neutral Variation. In: Davidor, Y., Schwefel, H.-P., Manner, R. (eds.) Proceedings of Parallel Problem Solving from Nature III, pp. 322–332. Springer, Heidelberg (1994)
Keller, R., Banzhaf, W.: Genetic Programming using Genotype-Phenotype Mapping from Linear Genomes in Linear Phenotypes. In: Koza, J., et al. (eds.) Genetic Programming 1996. Proceedings of the First Annual Conference, pp. 116–122. MIT Press, Cambridge (1996)
Keller, R., Banzhaf, W.: The Evolution of Genetic Code in Genetic Programming. In: Banzhaf, W., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference—GECCO 1999, pp. 1077–1082. Morgan Kaufmann, San Francisco (1999)
Keller, R., Banzhaf, W.: Evolution of Genetic Code on a Hard Problem. In: Spector, L., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference—GECCO 2001, pp. 50–56. Morgan Kaufmann, San Francisco (2001)
Margetts, S.: Adaptive Genotype to Phenotype Mappings for Evolutionary Algorithms. Ph. D. thesis, Cardiff University, Wales, Great Britain (2001)
Margetts, S., Jones, A.: Phlegmatic Mappings for Functional Optimisation with Genetic Programming. In: Whitley, L., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference—GECCO 2000, pp. 82–89. Morgan Kaufmann, San Francisco (2000)
Margetts, S., Jones, A.: An Adaptive Mapping for Developmental Genetic Programming. In: Miller, J., Tomassini, M., Lanzi, P.L., Ryan, C., Tetamanzi, A.G.B., Langdon, W.B. (eds.) EuroGP 2001. LNCS, vol. 2038, pp. 97–107. Springer, Heidelberg (2001)
Wilson, G., Heywood, M.: Probabilistic (Genotype) Adaptive Mapping Combinations for Developmental Genetic Programming. In: Proceedings of the IEEE Congress on Evolutionary Computation—CEC 2006, IEEE Press, Los Alamitos (2006) (upcoming)
Koza, J.: Genetic Programming II: Automatic Discovery of Reusable Programs. MIT Press, Cambridge (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wilson, G., Heywood, M. (2006). Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP): A New Developmental Approach. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_76
Download citation
DOI: https://doi.org/10.1007/11844297_76
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38990-3
Online ISBN: 978-3-540-38991-0
eBook Packages: Computer ScienceComputer Science (R0)