Study Of Some Characteristics Of Genetic Algorithms And Application In The Problem Of Test Paper System

This paper introduces the emergence and development of genetic algorithms(GAs) to some of the basic situation, which mainly contains the concepts and some research results in related fields in terms of solution perators, including selector operator, crossover operator and mutation opertor, as well as other important concepts of ecoding and fitness funtion andso on.By introducing the basic theory of Genetic Algorithms and some modification methods are advanced and some convergence proofs made, aiming at the problem that the probability of Simple Genetic Algorithm (SGA) converged to optimal solution is less than 1. The major tasks of this paper include:(1) Expand the schema theorem for GA, The schema theorem with bnary coding advanced by Professor Holland is expanded to limited integer, letter, floating point numbers the number of which value is limited, and their hybrid coding.(2)Put forward Replacing by the Excellent Chromosome GA(RECGA),Superiority Colony First GA(SCFGA) and improve the GA;(3)Make probality convergence analysis of RECGA using the theory of Markov Chain, Random Process;(4)Make probability convergence analysis of RECGA using the theoryof Markov Chain, Random Process; (5)Design the test programs(CAP) to resolve test paper system with GAS; Based on RECGA, modify the Arithmetic and then conduct tests.The experiment result illustrates that the Genetic Algorithms becomesmore efficient being improved with REC. Moreover, the convergence proofs of RECGA and SCFGA are theoretically meaningful in the research of Genetic Aogorithms.