| 一种求解TSP问题的改进禁忌搜索算法 |
| |
| 引用本文： | 彭茂. 一种求解TSP问题的改进禁忌搜索算法[J]. 计算技术与自动化, 2012, 31(1): 78-81 |
| |
| 作者姓名： | 彭茂 |
| |
| 作者单位： | 长沙理工大学计算机与通信工程学院,湖南长沙,410114 |
| |
| 摘 要： | 禁忌搜索算法作为一种新兴的智能搜索算法,已被广泛应用于各类优化问题。本文综合解向量的分量变化和目标值变化,提出一种新的候选解和当前解选择策略,并用改进的新算法求解TSP问题。实验表明新的算法具有良好的性能。
|
| 关 键 词： | 禁忌搜索 旅行商问题 |
Improved Tabu Search Algorithm for Solving Traveling Salesman Problem |
| |
| PENG Mao. Improved Tabu Search Algorithm for Solving Traveling Salesman Problem[J]. Computing Technology and Automation, 2012, 31(1): 78-81 |
| |
| Authors: | PENG Mao |
| |
| Affiliation: | PENG Mao(Changsha University of Science & Technology School of computer and Communication Engineering,Changsha 410114,China) |
| |
| Abstract: | Tabu search algorithm as a new kind of intelligent search algorithm,has been widely used in various types of optimization problems.In this paper the solution vector component changes and target value changes,put forward a kind of new candidate value and the current solution selection strategy,and an improved new algorithm for solving TSP problem.Experiments show that the new algorithm has a good performance. |
| |
| Keywords: | tabu search algorithm traveling salesman problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算技术与自动化》浏览原始摘要信息 |
|
点击此处可从《计算技术与自动化》下载全文 |
