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

一种基于二次变异策略的改进型遗传算法
引用本文:马福祥,马秀娟.一种基于二次变异策略的改进型遗传算法[J].计算机工程与应用,2014,50(13):62-65.
作者姓名:马福祥  马秀娟
作者单位:青海师范大学 计算机学院,西宁 810008
摘    要:通过对基本遗传算法采用单点位变异和倒置变异两次变异操作进行改进,并把该算法应用到TSP问题的求解中。仿真结果表明,改进后的算法提高了种群的多样性,增强了算法的局部搜索能力,从而使最终找到的解比基本遗传算法更优。另外,二次变异的改进遗传算法对种群规模的敏感性比非二次变异的基本遗传算法更强,相同条件下当增大种群规模时,二次变异的改进算法能得到更优的解。

关 键 词:遗传算法  二次变异  旅行商问题(TSP)  种群多样性  搜索能力  

Improved genetic algorithm based on double mutation operators
MA Fuxiang,MA Xiujuan.Improved genetic algorithm based on double mutation operators[J].Computer Engineering and Applications,2014,50(13):62-65.
Authors:MA Fuxiang  MA Xiujuan
Affiliation:College of Computer, Qinghai Normal University, Xining 810008, China
Abstract:Simple genetic algorithm is improved by using single point mutation and inversion mutation operators. The algorithm is applied to Traveling Salesman Problem(TSP). Simulation results show the diversity of population can be also improved by uising the modified algorithm. The local search capacity of the algorithm is effectively improved. The algorithm can find better solution than the simple genetic algorithm. In addition, the improved genetic algorithm has higher sensitivity for population size. Under the same conditions, when the population size increases, the improved algorithm can get a better solution.
Keywords:genetic algorithm  double mutation  Traveling Salesman Problem(TSP)  diversity of the population  search capacity  
本文献已被 CNKI 等数据库收录!
点击此处可从《计算机工程与应用》浏览原始摘要信息
点击此处可从《计算机工程与应用》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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