Travelling Salesman Problem Instances

Matlab structs with relevant information about TSP problem instances (name, distance matrix, optimal solution).

The following files contain a matlab struct for each TSP instance with the following fields:

name: name of the TSP instance

dist: matrix where each element dij represent the distance from node i to node j

x: x coordinates of the cities

y: y coordinates of the cities

optlength: length of the optimal tour

optimal_tour: optimal solution

References:

- TSPLIB95 benchmark library (at http://comopt.ifi.uni-heidelberg.de/software/TSPLIB95/)

- tsplib95 python library