tsp_random_test

tsp_random_test, an Octave code which calls tsp_random(), which seeks a solution of the Traveling Salesperson Problem (TSP), by accepting a list of city coordinates, and randomly generating round trips that visit every city, returning the shortest tour found.

Licensing:

The information on this web page is distributed under the MIT license.

Related Data and Programs:

tsp_random, an Octave code which seeks a solution of the Traveling Salesperson Problem (TSP), by accepting a list of city coordinates, and randomly generating round trips that visit every city, returning the shortest tour found.

Source Code:

• tsp_random_test.m, calls all the tests.
• tsp_random_test.sh, runs all the tests.
• tsp_random_test.txt, the output file.

att06, att12, att24 are the first 6, 12, and 24 cities in the AT&T 48 city dataset. They are provided as warmup exercises for the full 48 challenge.

• att06_xy.txt, the xy coordinates of 6 cities.
• att06.png, a plot of the best tour after 10,000 random samples.
• att12_xy.txt, the xy coordinates of 12 cities.
• att12.png, a plot of the best tour after 10,000 random samples.
• att24_xy.txt, the xy coordinates of 24 cities.
• att24.png, a plot of the best tour after 10,000 random samples.
• att48_xy.txt, the xy coordinates of 48 cities.
• att48.png, a plot of the best tour after 10,000 random samples.