TSP (Dataset)

Background

Traveling Salesman Problem is an interesting problem in Combinatorial Optimization. There is a rich repository of dataset that has been published for use.

Why this dataset?

While several datasets exist, they are invariably caracterized by the Euclidean distance between the cities in the dataset. However, in a practical scenario, the optimization could be based on the motorable road distance or the actual time taken to travel between cities.

This dataset captures not only the distance between the cities, but also gives (a) the motorable distance between cities and (b) time taken to travel from one city to another. This gives the user of this dataset to optimize over these characteristics as well or a combination of these characteristics.

Dataset consists of (all ASCII files)

1. names: Contains the names of (markets) towns in Maharastra, India.
2. Lat Long: Contains the latitude and longitude of the towns in the same sequence as in names.txt
3. Distance: relative distance between the towns on a map (inter town distance in km)
4. Road Distance: relative motor driving distance between the towns (inter town motor distance in km; from google)
5. Travel Time: Inter town travel time (in minutes)
6. Map (plot of the towns on google satellite maps)
7. Map (plot of the location of the towns on google maps)

Last Updated: Feb 18, 2013