使用模拟退火选择路径问题，例如一个旅行商问题，给定N个城市，有一个推销员必须遍访这N个城市，而且每个城市只能访问一次最后回到出发的那个城市，要求安排合理的访问顺序，以实现访问路线最短的目标。-Select the path using the simulated annealing problems, such as a traveling salesman problem, given N cities, a salesman must have visited this N cities, and each city can only be accessed once the final return to the starting of the city, it requires reasonable arrangements the access order to achieve the shortest access route target.