The major tasks include : ( 1 ) expand the schema theorem for ga . the schema theorem with binary 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 probability convergence analysis of recga using the theory of markov chain , random process ; ( 4 ) make convergence analysis of scfga using the principle of contractive mapping in functional analysis theory ; ( 5 ) design the test programs ( cap ) to resolve np problems ( course arrangement ) with gas ; based on recga , modify the arithmetic and then conduct tests 主要有以下几方面工作: ( 1 )将二进制编码遗传算法的模式定理扩展到由有限整数、字母或取值个数有限的浮点数编码,或它们混合编码的遗传算法范围; ( 2 )提出最佳个体替换策略遗传算法( recga ) 、优势群体优先策略遗传算法( scfga ) ,对遗传算法进行改进; ( 3 )使用随机过程理论markov链对recga进行了收敛性分析; ( 4 )使用泛函分析理论压缩映射原理对scfga进行了收敛性分析; ( 5 )使用遗传算法设计了解决np类问题(排课问题)的测试程序( cap ) ,并根据recga对算法进行改进并进行测试。