Description: 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.
To Search:
File list (Check if you may need any files):
lvxingshang
...........\City.java
...........\SimulatedAnnealing.java
...........\Tour.java
Download