摘要
根据遗传算法的一些基本概念以及遗传算法的操作流程,对遗传算法的繁殖算子从数学上给出定义,刻划了繁殖算子的本质。遗传算法是一种基于概率意义上的随机搜索算法,但它是从空间上的一组点而不是一个点出发,因此遗传算法的搜索能力比其他随机搜索算法更强,可以找到全局范围内的最优解。但是,应该注意在遗传算法的应用中,要避免其过早的收敛,防止陷入局部最优解。
We define the reproduction operators of genetic algorithms by mathematics, and give out the essence of reproduction operators. Genetic algorithms are random search algorithms based on probability, however they start from a set of points in space not from a point, the search ahihty of genetic algorithms is better than that of other random search algorithms, and it can get optimized solutions in a whole range. But we should pay attention to avoid convergence earlier and be in local optimized solution in the application of genetic algorithm,
出处
《现代计算机》
2006年第5期19-22,共4页
Modern Computer
基金
国家自然科学基金(60273063)资助。
