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

用基于小生镜技术的改进遗传算法解决TSP问题
引用本文:张宝菊,贾萍,郝迎英. 用基于小生镜技术的改进遗传算法解决TSP问题[J]. 天津工业大学学报, 2006, 25(3): 70-73
作者姓名:张宝菊  贾萍  郝迎英
作者单位:1. 天津师范大学,物理与电子信息学院,天津,300074;天津大学,电子信息工程学院,天津,300072
2. 天津师范大学,物理与电子信息学院,天津,300074
基金项目:天津市高等学校科研项目
摘    要:针对TSP搜索空间随城市数的增加而计算难度增大的问题,引入了基于小生镜的改进遗传算法,文中介绍了这种算法的步骤和实验结果.与传统的简单遗传算法(SGA)相比,既可以避免陷入局部最优解,又可以提高搜索速率.

关 键 词:改进遗传算法  小生镜
文章编号:1671-024X(2006)03-0070-04
收稿时间:2005-11-10
修稿时间:2005-11-10

Solving TSP with improved genetic algorithm based on niche technique
ZHANG Bao-ju,JIA Ping,HAO Ying-ying. Solving TSP with improved genetic algorithm based on niche technique[J]. Journal of Tianjin Polytechnic University, 2006, 25(3): 70-73
Authors:ZHANG Bao-ju  JIA Ping  HAO Ying-ying
Affiliation:1. College of Physics and Electronic Information Science, Tianjin Normal University, Tianjin 300074, China; 2. School of Electronic and Information Engineering, Tianjin University, Tianjin 300072, China
Abstract:Aimmed at TSP' s calculating difficulty increasing with the increasing of cities, the improved genetic algorithm based on niche technique is drawn into to solve TSP. The steps and experimental results of the method are given. Compared with SCA, the new algorithm improves the convergence of genetic algorithms and gets best solution in high speed.
Keywords:TSP
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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