Affiliation:
1. Naval University of Engineering
2. Nanchang Institute of Technology
Abstract
Genetic programming is an evolutionary algorithm that proposed to solve the automatic computer program design problem by J.R.Koza in the 1990s. It has good universality and intelligence, and has been widely applied in the field of computer engineering. But genetic programming is essentially a stochastic optimization algorithm, lack theoretic basis on the convergence of algorithm, which limit the scope of its application in some extent. The convergence mechanism of non-elitist genetic programming was studied in this paper. A recursive estimation of the probability of population contains satisfactory solution with the evolution algebra was established by the analysis of operators characteristic parameters, then a sufficient condition of population converge in probability was derived from this estimation, and thereby some operational convergence strategies for many common evolution modes were provided.
Publisher
Trans Tech Publications, Ltd.
Reference20 articles.
1. J.R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection [M]. Cambridge, MA: MIT press, (1994).
2. J.R. Koza. Genetic Programming Ⅱ: Automatic Discovery of Reusable Programs [M]. Cambridge, MA: MIT press, (1992).
3. J.R. Koza, M.A. Keane, M.J. Streeter, et al. Genetic programming Ⅳ: Routine human-Competitive machine intelligence [M]. Nerwell, MA: Kluwer academic publishers, (2003).
4. H. Mohammad. Analysis on the evolution of the discourse on computer software and programming languages in the light of literary genres and power-knowledge [J]. Computers in Human Behavior, 2010, 26(3): 464-473.
5. J.R. Koza. Automatic creation of human-competitive programs and controllers by means of genetic programming [J]. Genetic Programming and Evolvable Machines, 2000, 1(2): 121-164.