首页 | 官方网站   微博 | 高级检索  
     

基于构建基因库求解TSP问题的改进遗传算法
引用本文:董子乐,范俊峰,胡纯德.基于构建基因库求解TSP问题的改进遗传算法[J].计算机工程与应用,2005,41(36):42-43,88.
作者姓名:董子乐  范俊峰  胡纯德
作者单位:中国科学院研究生院,北京,100039;中国科学院研究生院,北京,100039;中国科学院研究生院,北京,100039
基金项目:国家自然科学基金资助项目(编号:10171099);国家863高技术研究发展计划资助项目(编号:2002AA103069)
摘    要:文章针对TSP问题设计了一种将基因库和遗传算法结合起来的新算法,该算法首先构建一个基因库,在单亲演化中利用基因库指导种群的进化方向,其次在此基础上采用单亲进化遗传算法中的基因重组操作,保留每次获得的最好解组成初始种群,最后采用顺序交叉算子进行群体演化。给出的实验结果显示,该算法所获得的解与最优解的相对误差都不超过2%,该算法的收敛速度和寻优能力明显优于该问题的单亲进化遗传算法。

关 键 词:TSP问题  基因库  遗传算法  基因重组
文章编号:1002-8331-(2005)36-0042-02
收稿时间:2005-07
修稿时间:2005-07

A Modified Genetic Algorithm Based on Gene Pool for TSP
Dong Zile,Fan Junfeng,Hu Chunde.A Modified Genetic Algorithm Based on Gene Pool for TSP[J].Computer Engineering and Applications,2005,41(36):42-43,88.
Authors:Dong Zile  Fan Junfeng  Hu Chunde
Affiliation:Graduate School of the Chinese Academy of Sciences,Beijing 100039
Abstract:This paper presents a new algorithm which combines gene pool and Genetic Algorithm.First of all,the algorithm structures a gene pool during the single-parent evolution so as to direct the evolution of the whole population.Secondly,it performs gene reconstruction operations based on gene pool to produce the offspring in the Partheno Evolution Genetic Algorithm.The best solution is to be saved each time to form the initial population.Finally,it performs order crossover operator to march the population evolution process.The experiment results show that the average value of solution quality stays within 2% from the optimal solution for each test instance and the proposed algorithm is better than the Partheno Evolution Genetic Algorithm for this problem on the convergence speed and capability of searching for optimal solution.
Keywords:TSP  gene pool  Genetic Algorithm  gene reconstruction
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号