Abstract
We propose the application of a genotype-phenotype mapping to the solution of constrained optimization problems. The method consists of strictly separating the search space of genotypes from the solution space of phenotypes. A mapping from genotypes into phenotypes provides for the appropriate expression of information represented by the genotypes. The mapping is constructed as to guarantee feasibility of phenotypic solutions for the problem under study. This enforcing of constraints causes multiple genotypes to result in one and the same phenotype. Neutral variants are therefore frequent and play an important role in maintaining genetic diversity. As a specific example, we discuss Binary Genetic Programming (BGP), a variant of Genetic Programming that uses binary strings as genotypes and program trees as phenotypes.
Preview
Unable to display preview. Download preview PDF.
References
C. Darwin: On the Origin of Species by Means of Natural Selection. London: Murray 1972, 6th Edition
M. Kimura: Nature 217, 624–626 (1968)
M. Kimura: The Neutral Theory of Molecular Evolution. Cambridge: Cambridge University Press 1983
T. Mukai: Experimental Verification of the Neutral Theory. In: T. Ohta, K. Aoki (Eds.): Population Genetics and Molecular Evolution. Berlin: Springer 1985
G. Reklaitis, A. Ravindran, K. Ragsdell: Engineering Optimization Methods and Applications. New York: Wiley 1983
D. Orvosh, L. Davis: Shall we repair? Genetic Algorithms, combinatorial optimization, and feasibility constraints. In: S. Forrest (Ed.): Proc. 5th Int. Conference on Genetic Algorithms, ICGA-93. San Mateo: Morgan Kaufmann 1993
H. Fang, P. Ross, D. Corne: A promising GA approach to Job-Shop scheduling, rescheduling, and Open-Shop scheduling problems. In: S. Forrest (Ed.): Proc. 5th Int. Conference on Genetic Algorithms, ICGA-93. San Mateo: Morgan Kaufmann 1993
R. Nakano: Conventional GA for job shop scheduling. In: R. Belew, L. Booker (Eds.): Proc. 4th Int. Conference on Genetic Algorithms, ICGA-91. San Mateo: Morgan Kaufmann 1991
J. Paredis: Exploiting Constraints as Background Knowledge for Genetic Algorithms: a Case-study for Scheduling. In: R. Männer, B. Manderick (Eds.): Parallel Problem Solving from Nature, 2. Amsterdam: Elsevier Science Publishers 1992
M. Eigen: Steps toward Life: a perspective on evolution. Oxford: Oxford University Press 1992
J.R. Koza: Genetic Programming. Cambridge (USA): MIT Press 1992
M.W. Gray, P.S. Covello: RNA editing in plant mitochondria and chloroplasts. FASEB J. 7 (1993) 64
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Banzhaf, W. (1994). Genotype-phenotype-mapping and neutral variation — A case study in Genetic Programming. In: Davidor, Y., Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature — PPSN III. PPSN 1994. Lecture Notes in Computer Science, vol 866. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58484-6_276
Download citation
DOI: https://doi.org/10.1007/3-540-58484-6_276
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58484-1
Online ISBN: 978-3-540-49001-2
eBook Packages: Springer Book Archive