首页 | 本学科首页   官方微博 | 高级检索  
     检索      

具有自适应交换率和变异率的遗传算法
引用本文:袁慧梅.具有自适应交换率和变异率的遗传算法[J].首都师范大学学报(自然科学版),2000,21(3):14-20.
作者姓名:袁慧梅
作者单位:首都师范大学物理系,北京,100037
摘    要:简单遗传算法存在着收敛速度慢、易陷入局部上等缺陷。针对这些,本文设计出随相对遗传代数呈双曲线下降的自适应换率,并提出与父串间的相对欧氏距离成反比、随相对遗传代数指数下降的自适应异率。实例验证表明,具有自适应交换和变异率的遗传算法在收敛速度和获得全局最优解的概率两个方面都有很大的提高。

关 键 词:遗传算法  自适应交换率  自适应变异率  最优解
修稿时间:2000年3月7日

Adaptive Crossover Rate and Mutation Rate in Genetic Algorithms
Yuan Huimei.Adaptive Crossover Rate and Mutation Rate in Genetic Algorithms[J].Journal of Capital Normal University(Natural Science Edition),2000,21(3):14-20.
Authors:Yuan Huimei
Abstract:Simple genetic algorithm gets local minimization too easily and converges slowly.To solve these problems,adaptive crossover rate that has reverse hyperbolic relation with the numbers of iteration is designed,and adaptive mutation rate that has reverse proportion to the distances of parents and reverse exponential relation to the numbers of iteration is put forward.The Practical simulation results show that the adaptive GA has greater convergence speed and larger probability of getting the best solution.
Keywords:genetic algorithms  adaptive crossover rate  adaptive mutation rate  
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号