Introduction - If you have any usage issues, please Google them yourself
Solution for Travelling Salesman Problem using the simulated annealing heuristic.
As an input, we take coordinates of cities (x,y) and then transform them into distances matrix (we assume, the distance between x and y is the same as between y and x). All the computations then are performed on such matrix.
The output is the shortest path between all cities, the algorithm was capable to find.