Try to solve the TSP problem with greedy and 2-opt.
For the dataset, we used the gr666.tsp data from tsplib.
python 2.7
Math
Random
I just test the greedy algorithm with the dataset.
** This is the Distance for Eucilidean Distance **
Distance:4336.99001934
Time Used: 0.389232