JAVA实现旅行商问题，有简单的可视化界面

有N个城市，要求从其中某个问题出发，唯一遍历所有城市，再回到出发的城市，求最短的路线。使用模拟退火算法可以比较快的求出TSP的一条近似最优路径。-JAVA traveling salesman problem, a simple visual interface

There are N cities,　which to ask a question, the only way to traverse all cities, and then go back to the city, the shortest route. The use of simulated annealing algorithm can be faster to find an approximate optimal path TSP.