tsp_brute_test

tsp_brute_test, an Octave code which calls tsp_brute(), which solves small versions of the traveling salesman problem (TSP), given a list of city locations, using brute force.

Licensing:

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

Related Data and Programs:

tsp_brute, an Octave code which solves small versions of the traveling salesman problem (TSP), given a list of city locations, using brute force.

Source Code:

• tsp_brute_test.m, calls all the tests.
• tsp_brute_test.sh, runs all the tests.
• tsp_brute_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. The brute force approach was only tried on the smaller cases!

• att06_xy.txt, the xy coordinates of 6 cities.
• att06.png, a plot of the best tour.
• att09_xy.txt, the xy coordinates of 12 cities.
• att09.png, a plot of the best tour.
• att12_xy.txt, the xy coordinates of 12 cities.
• att24_xy.txt, the xy coordinates of 24 cities.
• att48_xy.txt, the xy coordinates of 48 cities.