旅行商（TSP）问题一直以来都是一个NP难问题，旅行商问题（TSP问题）就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题，通过该软件设计，对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem, traveling salesman problem (TSP problem) is a vendor from the n cities in a city of departure, not repeated through the remaining n-1 cities and back to to the original starting point, in all possible path to derive a shortest path length. The software design is the use of simulated annealing algorithm to solve TSP problems, the adoption of the software design, on the simulated annealing algorithm and the traveling salesman problem to have a preliminary understanding.