|
|||||
|
|
| 旅行商问题的一种模拟退火算法求解 | |
| 引用本文： | 曲晓丽,潘昊,柳向斌.旅行商问题的一种模拟退火算法求解[J].现代电子技术,2007,30(18):78-79,82. |
| 作者姓名： | 曲晓丽 潘昊 柳向斌 |
| 作者单位： | 1. 武汉理工大学,计算机科学与技术学院,湖北,武汉,430070;河南科技大学,电子信息工程学院,河南,洛阳,471003 2. 武汉理工大学,计算机科学与技术学院,湖北,武汉,430070 3. 河南科技大学,电子信息工程学院,河南,洛阳,471003 |
| 摘 要： | 旅行商问题(TSP)是组合优化领域里的一个典型的、易于描述却难以处理的NP难题,其可能的路径数目与城市数目是呈指数型增长的,求解非常困难。首先介绍了旅行商问题,模拟退火算法原理及其算法实现。应用模拟退火算法对TSP进行研究,给出解决TSP的一种比较精确的算法并用Matlab实现了算法。最后用该算法对TSP进行了仿真,验证了该算法的有效性。 |
| 关 键 词： | 旅行商问题 模拟退火算法 组合优化 最短路径 |
| 文章编号： | 1004-373X（2007）18-078-02 |
| 收稿时间： | 2007-04-11 |
| 修稿时间： | 2007-04-11 |
Solution of Travelling Salesman Problem by a Kind of Simulated Annealing Algorithm |
|
| QU Xiaoli,PAN Hao,LIU Xiangbin.Solution of Travelling Salesman Problem by a Kind of Simulated Annealing Algorithm[J].Modern Electronic Technique,2007,30(18):78-79,82. | |
| Authors: | QU Xiaoli PAN Hao LIU Xiangbin |
| Abstract: | Travelling Salesman Problem(TSP) is one of the typical NP-hard problems in combinatorial optimization,which is easy to be described but hard to be solved.Its possible amounts of path increase exponentially with the amounts of city,so it is very difficult to solve it.TSP is first introduced in this paper,then the principal of simulated annealing algorithm and its algorithm realization are introduced too.TSP is studied by simulated annealing algorithm and an approximate algorithm which method for solving TSP is better than others,and using Matlab,we complete the program for solving TSP.The simulation of algorithm for travelling salesman problem is given,and the results prove its efficiency. |
| Keywords: | travelling salesman problem simulated annealing algorithm combinatorial optimization the shortest way |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |