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

一种遗传算法交叉算子的改进算法
引用本文:卢厚清,陈亮,宋以胜,吴值民,邹赟波.一种遗传算法交叉算子的改进算法[J].解放军理工大学学报,2007,8(3):250-253.
作者姓名:卢厚清  陈亮  宋以胜  吴值民  邹赟波
作者单位:解放军理工大学工程兵工程学院,江苏南京210007
摘    要:为了有效克服遗传算法收敛速度慢和易陷入局部极值点的缺点,提出了一种遗传算法交叉算子的改进算法,即采用自适应交叉概率,给不相关大的个体赋予较大的被选概率的配对方式进行交叉操作;在适应度比例轮盘赌的基础上辅以父子竞争的选择操作.二元多峰值Schaffer函数优化的仿真实例结果表明:与保留最优个体策略的遗传算法相比,改进算法能有效减少无效的交叉操作,收敛速度和全局搜索能力都得到了较大提高,其平均收敛代数和收敛到最优解的概率都优于保留最佳个体策略的遗传算法.

关 键 词:自适应交叉概率  不相关性指数  配对  父子竞争  遗传算法  交叉算子  改进算法  genetic  algorithm  crossover  operator  最佳  最优解  收敛代数  搜索能力  收敛速度  策略  最优个体  结果  仿真实例  函数优化  多峰值  选择操作  父子竞争  上辅  轮盘赌
文章编号:1009-3443(2007)03-0250-04
修稿时间:2007-01-25

An improved crossover operator of genetic algorithm
LU Hou-qing,CHEN Liang,SONG Yi-sheng,WU Zhi-min and ZOU Yun-bo.An improved crossover operator of genetic algorithm[J].Journal of PLA University of Science and Technology(Natural Science Edition),2007,8(3):250-253.
Authors:LU Hou-qing  CHEN Liang  SONG Yi-sheng  WU Zhi-min and ZOU Yun-bo
Institution:Engineering Institute of Corps of Engineers,PLA Univ.of Sci.& Tech.,Nanjing 210007,China;Engineering Institute of Corps of Engineers,PLA Univ.of Sci.& Tech.,Nanjing 210007,China;Engineering Institute of Corps of Engineers,PLA Univ.of Sci.& Tech.,Nanjing 210007,China;Engineering Institute of Corps of Engineers,PLA Univ.of Sci.& Tech.,Nanjing 210007,China;Engineering Institute of Corps of Engineers,PLA Univ.of Sci.& Tech.,Nanjing 210007,China
Abstract:In order to effectively overcome the disadvantages of traditional Genetic Algorithm which converge slowly and easily run into local extremism, an improved crossover operator of genetic algorithms was proposed. This operator used the autoadaptive crossover probability and entrusted individual having big irrelevance index with a big elected probability to carry on the crossing operation; The two generations competitive selective operator was designed to improve the traditional genetic algorithm based on roulette. In a simulative example of multi-peaks function, the proposed method can reduce useless crossover effectively and thus the convergence speed and the search capability are greatly improved when compared with the elitist reserved genetic algorithm that keeps best strategy. As a result, the average convergence generations and the probability of getting optimal result are superior to the elitist reserved genetic algorithm.
Keywords:auto-adaptive crossover probability  irrelevance index  pair  fathers and sons competition
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《解放军理工大学学报》浏览原始摘要信息
点击此处可从《解放军理工大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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