| 一种求解TSP问题的演化算法 |
| |
| 引用本文： | 孙光福,李程俊,张冬梅,贺幸. 一种求解TSP问题的演化算法[J]. 计算机工程, 2011, 37(11): 209-211. DOI: 10.3969/j.issn.1000.3842.2011.11.072 |
| |
| 作者姓名： | 孙光福 李程俊 张冬梅 贺幸 |
| |
| 作者单位： | 中国地质大学计算机学院,武汉,430074 |
| |
| 摘 要： | 针对IGT算法在求解旅行商问题(TSP)中存在的求解规模较小、求解成功概率较低等问题，通过改进原有映射算子及Inver-over算子并引入求异算子，提出一种新的求解TSP问题的演化算法。方差对比及T-test结果表明，与IGT算法相比，该算法可以求得概率较高的最优解，且稳定性也更好。
|
| 关 键 词： | TSP问题 演化算法 距离近邻表 求异算子 |
| 收稿时间： | 2010-12-08 |
Evolutionary Algorithm for Solving Traveling Salesman Problem |
| |
| SUN Guang-fu,LI Cheng-jun,ZHANG Dong-mei,HE Xing. Evolutionary Algorithm for Solving Traveling Salesman Problem[J]. Computer Engineering, 2011, 37(11): 209-211. DOI: 10.3969/j.issn.1000.3842.2011.11.072 |
| |
| Authors: | SUN Guang-fu LI Cheng-jun ZHANG Dong-mei HE Xing |
| |
| Affiliation: | (School of Computer,China University of Geosciences,Wuhan 430074,China) |
| |
| Abstract: | In order to solve the problem of low rate of success and small scale,by amending the original mapping operator and Inver-over operator and introducing differing operator,a new Evolutionary Algorithm（EA） to Traveling Salesman Problem（TSP） is got.According to the experimental results,the algorithm can find all instances＇ optimal solution of experiments and the probability of getting the optimal solution is higher,while the IGT algorithm can only get that of partial instances.Comparison of variances shows the new algorithms is more stable and the T-test also shows the full advantages of the new algorithm. |
| |
| Keywords: | Traveling Salesman Problem（TSP） Evolutionary Algorithm（EA） distance neighbor tabulation differing operator |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载免费的PDF全文 |
|
