| 基于演化算法的TSP求解 |
| |
| 引用本文： | 夏建勋.基于演化算法的TSP求解[J].孝感学院学报,2007,27(3):67-69. |
| |
| 作者姓名： | 夏建勋 |
| |
| 作者单位： | 孝感学院,计算机科学系,湖北,孝感,432000 |
| |
| 摘 要： | TSP即旅行商问题或者货郎担问题是一个易于描述但难于解决的NP问题,也是一个具有广泛的应用背景和重要理论价值的组合优化问题。简要介绍了求解TSP的若干方法,同时讨论了基于演化算法的TSP求解方法,并对TSP的求解进行了展望。
|
| 关 键 词： | NP问题 演化算法 |
| 文章编号： | 1671-2544（2007）03-0067-03 |
| 收稿时间： | 2006-03-06 |
| 修稿时间： | 2006-03-06 |
The Solution to the TSP Based on Evolutionary Algorithm |
| |
| Xia Jianxun.The Solution to the TSP Based on Evolutionary Algorithm[J].JOURNAL OF XIAOGAN UNIVERSITY,2007,27(3):67-69. |
| |
| Authors: | Xia Jianxun |
| |
| Institution: | Department of Computer Science, Xiaogan University, Xiaogan, Hubei, 432000, China |
| |
| Abstract: | The TSP(Traveling Salesman Problem) is a NP problem which is easily described but difficult to solve.It is also a combination optimization question with widespread application background and important theory value.This paper introduced some methods of solving the TSP briefly and discussed the TSP solution method based on the evolutionary algorithm.Also,the paper prospected the TSP solution. |
| |
| Keywords: | TSP |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
