期刊文献+

Form invariance of schema and exact schema theorem

Form invariance of schema and exact schema theorem
原文传递
导出
摘要 One of the most important research questions in GAs is the explanation of the evolutionary process of CAs 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 CAs simpler. We obtain the conditions under which the operators of crossover and mutation are commutative operators of CAs. 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. One of the most important research questions in GAs is the explanation of the evolutionary process of CAs 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 CAs simpler. We obtain the conditions under which the operators of crossover and mutation are commutative operators of CAs. 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.
出处 《Science in China(Series F)》 2003年第6期475-484,共10页 中国科学(F辑英文版)
基金 This work was supported by the National Natural Science Foundation of China(Grant Nos.70171002,69974026).
关键词 schema theorem schema space linear transformation exact schema equation. schema theorem, schema space, linear transformation, exact schema equation.
  • 相关文献

参考文献16

  • 1[1]Holland, J. H., Adaptation in Natural and Artificial Systems, Cambridge, Massachusetts: MIT Press, 1992.
  • 2[2]Goldberg, D. E., Genetic Algorithms in Search, Optimization, and Machine Learning, MA: Addison-Wesley, 1989.
  • 3[3]Poli, R., Exact Schema Theory for Genetic Programming and Variable-Length Genetic Algorithms with One-Point Crossover, Genetic Programming and Evolvable Machines 2001, Dordrecht: Kluwer Academic Publishers, 2001, 123-163.
  • 4[4]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.
  • 5[5]Whitley, D., An overview of evolutionary algorithms: practical issues and common pitfalls, Information and Software Technology, 2001, 43: 817-831.
  • 6[6]Nix, A. E., Vose, M. D., Modeling genetic algorithms with Markov chains, Annals of Mathematics and Artificial Intelligence, 1992, 5: 79-88.
  • 7[7]Davis, T. E. Jose, C., Principle: A Markov chain framework for the simple genetic algorithm, Evolutionary Computation, 1993, 1(3): 269-288.
  • 8[8]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.
  • 9[9]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.
  • 10[10]Stephens, C., Waelbroeck, H., Schemata evolution and building blocks, Evolutionary Computation, 1999, 7(2): 109-124.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部