论文部分内容阅读
通过对遗传算法搜索过程的分析，认为在问题空间中某些个体的存在是影响收敛的决定因素，因此定义了吸收串的概念，提出并证明了遗传算法收敛的充分必要条件．文章最后介绍了一种衡量遗传算法困难程度的方法．
By analyzing the search process of genetic algorithm, it is considered that the existence of some individuals in the problem space is the determinant of the convergence. Therefore, the concept of absorption chain is defined and the sufficient and necessary conditions for the convergence of genetic algorithm are proposed and proved. Finally, the article introduces a method to measure the degree of difficulty of genetic algorithms.