Abstract
If a population is constrained to exhibit no variation in the allelic frequency distribution of any gene then information may only be recorded by recombining genes into new configurations (schemata). It is shown that such a constraint need lead to no loss of information capacity. A simple algorithm, employing direct replacement and a single uniform genetic operator, is then analysed with regard to schema sampling. The probabilities of schema creation and destruction are proven identical, regardless of operator. The probabilities are then deduced, with which new schemata are sampled by, first, recombination, and, second, mutation, in relation to order and allelic variation. The analysis overcomes limitations inherent in earlier work [4, 9,
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Booker, L. B.: 1992, “Recombination Distributions for Genetic Algorithms”, in “Proceedings of The Second Workshop on the Foundations of Genetic Algorithms”, Whitley, L. D. (Ed.), Morgan Kaufmann, pp. 29–44.
Bridges, C. L. and D. E. Goldberg: 1987, “An Analysis of Reproduction and Crossover in a Binary-Coded Genetic Algorithm”, in “Proceedin s of Second International Conference on Genetic Algorithms”, Grefenstette, J.. (Ed.), Lawrence Erlbaum Associates.
Culberson, J. C.: 1993, “Crossover versus Mutation: Fueling the Debate: TGA versus GIGA”, in “Proceedings of the Fifth International Conference on Genetic Algorithms”, Forrest, S. (Ed.), Morgan Kaufmann, p. 632.
Dejong, K. A.: 1975, “An Analysis of the Behaviour of a Class of Genetic Adaptive Systems”, Doctoral thesis, University of Michigan, Department of Computer and Communications Sciences, University of Michigan, Ann Arbor, Michigan, USA.
East, I. R., & J. Rowe: 1994, “Direct Replacement: A Genetic Algorithm without Mutation Avoids Deception”, in “Progress in Evolutionary Computation: AI '93 and AI '94 Workshops on Evolutionary Computation” Lecture Notes in Artificial Intelligence Vol. 956, Xin Yao (Ed.), Springer-Verlag, pp. 41–48.
Geiringer, H.: 1944, “On the probability theory of linkage in Mendelian heredity”, Annals of Mathematical Statistics, 15, pp. 25–57.
Holland, J. H.: 1975, “Adaptation in Natural and Artificial Systems”, University of Michigan Press.
Shannon, C. E. and W. Weaver: 1949, “The Mathematical Theory of Communication”, (1963) Edition, University of Illinois Press.
Spears, W. M. and K. A. D. Jong: 1990, “An Analysis of Multi-Point Crossover”, in “Proceedings of the First Workshop on the Foundations of Genetic Algorithms”, Rawlins, G. J. E. (Ed.), Morgan Kaumann, pp. 301–315.
Spears, W. M.: 1992, “Crossover or Mutation?”, in “Proceedings of The Second Workshop on the Foundations of Genetic Algorithms”, Whitley, L. D. (Ed.), Morgan Kaufmann, pp. 221–237.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
East, I.R. (1997). On recombinative sampling. In: Corne, D., Shapiro, J.L. (eds) Evolutionary Computing. AISB EC 1997. Lecture Notes in Computer Science, vol 1305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027167
Download citation
DOI: https://doi.org/10.1007/BFb0027167
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63476-8
Online ISBN: 978-3-540-69578-3
eBook Packages: Springer Book Archive