说明：  使用模拟退火解旅行商问题，因为这个问题本身是一个NP难问题，所以也就求不到最优解，不过应该可以求得一个比较好的解，然后再手工优化。
(Using simulated annealing to solve the traveling salesman problem, because the problem itself is a NP hard problem, so it can not find the optimal solution, but it should be able to obtain a better solution, and then manually optimized.)