Repository for Traveling Salesman Problems (Euklydian 2D) with their optimal solutions.
This is a repository for a very large number of TSP-Problems. Each package contains 5,000 TSPs and their solutions. All files are in TspLib95 format.
It may be suitable for people testing algorithms on TSPs and comparing quality to the optimal solution.
All TSPs are brute-force calculated with double number precision. As such, the solutions are expected to be correct.
Because of this and the obvious limitations on brute-force algorithms, the size of the TSP is usually 15 or 16 vertices. Some are bigger.