摘要
提出了一种新的遗传算法配对方式,并计算了配对概率。以这种配对方式为基础,对一个极大值问题作了计算机模拟。结果表明,这种配对方法从生物学角度来说,更符合生物世界的真实配对方式。而从探索最优解的角度来说,这种配对方式有助于优良基因结构的保留。因此这种配对方式可加快计算的收敛速度。
A new matching selection called slmilarity-matching selection of genetic algorithro was presented and the probabilities of the selection were calculated, An experimental calculation based on the proposed matching selection for a maximum problem was performed. The results show that such a matching selection guarantees the centralization and continuity of the exceUent genes and can help to maintain the good gene constructions from the point of real world's view. Furthermore, from the point of calculation convergence view, the calculation using the new matching selection is not easy to diverge in the small area around the global maximum. Therefore, the speed of convergence can be accelerated.
出处
《计算机应用》
CSCD
北大核心
2005年第11期2665-2667,共3页
journal of Computer Applications
关键词
相似性
遗传算法
配对原则
similarity
genetic algorithm
matching selection