Traveling Salesman Problem, namely the TSP Problem ('ll Salesman Problem) is translated into Traveling Salesman Problem, Traveling Salesman Problem, is one of the prominent problems in mathematics, suppose you have a Traveling merchant to visit n cities, he must choose to go by the path, the path of the limit is only visit each city once, and finally to return to the original departure city, the choice of the path goal is to require the path of the journey for all paths of the minimum, your task is to: assuming that each city 2 d coordinates are given, all cities are directly linked by side (both side), a distance of Euclidean distance, you try to achieve a kind of algorithm, the optimal or approximate optimal solution of a TSP path, test data by TSP. TXT, given criteria as follows: the shorter the path (72) known to the optimal solution is the higher the score,
Data:
City Position_X Position_Y
1, 38.24 20.42
2, 39.57 26.15
3 40.56 25.32
4 36.26 23.12
5 33.48 10.54
6 37.56 12.19
7 38.42 13.11
8 37.52 20.44
9 41.23 9.10
10 41.17 13.05
11, 36.08-5.21
12 38.47 15.13
13 38.15 15.35
14 37.51 15.17
15 35.49 14.32
16 39.36 19.56
EOF