摘要
遗传算法可以看成是在某个空间求最大值的搜索技术。本文从理论上分析了在搜索技术中 ,用格点法比纯随机法好 ,并用格点理论 (佳点是格点的一种 )设计了遗传交叉算子。模拟结果显示 ,与传统的纯随机法实现交叉操作的遗传算法相比 ,本文算法不仅在效率、精度上有所提高 ,而且克服了“早熟”现象。
Genetic algorithms can be considered to be technologies of searching maximum in a certain space.After an analysis in this paper we know that,in a searching method,the lattice search is better than pure random search.And a crossover operator using the optimal point (optimal point is a kind of lattice) is designed.The results of computer simulation show that,compared with conventional genetic algorithms in which crossover is operated with pure random methods,the new GA presented here not only improves the effciency and accuracy,but also overcomes precocity. [WT5HZ]
出处
《计算机工程与科学》
CSCD
2000年第1期18-20,共3页
Computer Engineering & Science
基金
国家自然科学基金
关键词
遗传算法
纯随机法
格点法
网格
交叉操作
genetic algorithm
pure random search
lattice search
optimal point
