Introduction - If you have any usage issues, please Google them yourself
Solution for Travelling Salesman Problem by using Tabu Search heuristics.
Archive contains sources and some data to test the appllication.
As an input, we take the coordinates of cities (x,y) and then transform them into distances matrix. All computations are performed on that matrix.
The output is the shortest found path between all the cities.