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

解决旅行商问题的改进算法
引用本文:吴明珠,史婷婷.解决旅行商问题的改进算法[J].微计算机信息,2011(9).
作者姓名:吴明珠  史婷婷
作者单位:华南师范大学增城学院计算机系;仲恺农业工程学院计算机科学与工程学院;
摘    要:首先提出旅行商问题(TSP),然后实现了常见的解决TSP问题的算法:有传统算法中的贪心算法和回溯法,还有现代优化算法中的基本遗传算法。并针对这3种算法的缺点提出了一种改进的算法,即综合运用贪心算法和遗传算法,依据贪心选择的原则指导遗传操作,可以大大加快搜索的速度,仿真实验表明改进的算法是十分有效和实用的。

关 键 词:旅行商问题  贪心算法  回溯法  遗传算法  

Improved Algorithm For Solving The Traveling Salesman Problem
WU Ming-zhu SHI Ting-ting.Improved Algorithm For Solving The Traveling Salesman Problem[J].Control & Automation,2011(9).
Authors:WU Ming-zhu SHI Ting-ting
Affiliation:WU Ming-zhu(Department of Computer,ZengCheng College of South China Normal University,GuangZhou 511363,China) SHI Ting-ting(Department of Computer Science and Engineering,Zhongkai University of Agriculture and Technology,Guangzhou,510225,China)
Abstract:TSP is brought forward.Then three common algorithms of TSP is realized.The algorithms include greedy algorithm and backtracking method which are tradition algorithm and genetic algorithm which is modern optimization algorithm.An improved algorithm is proposed for the shortcomings of the three algorithms which is comprehensive use of greedy algorithm and genetic algorithm.The principles of Greedy selection guiding the genetic operation can greatly accelerate the search speed.The artificial experiment shows t...
Keywords:TSP  greedy algorithm  backtracking method  genetic algorithm  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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

京公网安备 11010802026262号