Abstract
One of the most important research questions in GAs is the explanation of the evolutionary process of GAs as a mathematical object. In this paper, we use matrix linear transformations to do it, first. This new method makes the study on mechanism of GAs simpler. We obtain the conditions under which the operators of crossover and mutation are commutative operators of GAs. We also give an exact schema equation on the basis of the concept of schema space. The result is similar to Stephens and Waelbroeck’s work, but they have novel meanings and a larger degree of coarse graining.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Holland, J. H., Adaptation in Natural and Artificial Systems, Cambridge, Massachusetts: MIT Press, 1992.
Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, MA: Addison-Wesley, 1989.
Poli, R., Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Cross-over, Genetic Programming and Evolvable Machines 2001, Dordrecht: Kluwer Academic Publishers, 2001, 123–163.
Poli, R., Langdon, W. B., O’Reilly, U.-M., Analysis of schema variance and short term extinction likelihoods, in Genetic Programming 1998: Proc. Third Annually Conference (eds. Koza, J. R., Banzhaf, W., Chellapilla, K.), University of Wisconsin, Madison, Wisconsin, USA, San Francisco: Morgan Kaufmann, 1998, 284–292.
Whitley, D., An overview of evolutionary algorithms: practical issues and common pitfalls, Information and Software Technology, 2001, 43: 817–831.
Nix, A. E., Vose, M. D., Modeling genetic algorithms with Markov chains, Annals of Mathematics and Artificial Intelligence, 1992, 5: 79–88.
Davis, T. E. Jose, C., Principle: A Markov chain framework for the simple genetic algorithm, Evolutionary Computation, 1993, 1(3): 269–288.
Spears, W. M., De Jong, K. A., Analyzing GAs using Markov models with semantically ordered and lumped states, Foundations of GAs IV, San Francisco: Morgan Kaufmann, 1997, 85–100.
Lee, A., The Schema Theorem and Price’s Theorem, in Foundations of Genetic Algorithms 3 (eds. Whitley, D., Vose, M. D.), San Francisco: Morgan Kaufmann, 1995, 23–49.
Stephens, C., Waelbroeck, H., Schemata evolution and building blocks, Evolutionary Computation, 1999, 7(2): 109–124.
Vose, M. D., Wright, A. H., Form invariance and implicit parallelism, Evolutionary Computation, 1999, 9(3): 355–370.
Stephens, C., Waelbroeck, H., Schemata as building blocks: Does size matter? in Foundations of Genetic Algorithms 5 (eds. Banzhaf, W., Reeves, C.), San Francisco: Morgan Kaufmann, 1999, 117–135.
Stephens, C. R., Waelbroeck, H., Effective degree of freedom in genetic algorithms and the block hypothesis, in Proceedings of the Seventh International Conference on Genetic Algorithms (ed. Back, T.), San Mateo: Morgan Kaufmann, 1997, 34–40.
Vose, M. D., The Simple Genetic Algorithms: Foundations And Theory, Cambridge, Massachusetts: The MIT Press, 1999.
Stephens, C., Waelbroeck, H., Analysis of the effective degrees of freedom in genetic algorithms, Phys. Rev., 1998, E57: 3251–3264.
Nix, A. E., Vose, M. D., Modeling genetic algorithms with Markov Chains, Ann. Math. Artif. Intell., 1992, 5: 79–88.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Yang, H., Li, M. Form invariance of schema and exact schema theorem. Sci China Ser F 46, 475–484 (2003). https://doi.org/10.1360/02yf0384
Received:
Issue Date:
DOI: https://doi.org/10.1360/02yf0384