tsp_descent_test

tsp_descent_test, an Octave code which calls tsp_descent(), which solves small versions of the traveling salesman problem (TSP), using a descent method.

Licensing:

The computer code and data files described and made available on this web page are distributed under the MIT license

Related Data and Programs:

tsp_descent, an Octave code which solves small versions of the traveling salesman problem (TSP), using a descent method.

Source Code:

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

• five.txt, a 5 city distance matrix, whose minimal tour has length 19.
• fifteen.txt, a 15 city distance matrix, whose minimal tour has length 291.
• fortyeight.txt, a 48 city distance matrix, whose minimal tour has length 33523. (The tsp_descent() program does very badly on this example, with only 1000 variations allowed. The results don't get much better if we allow 100,000 variations!)
• seventeen.txt, a 17 city distance matrix, whose minimal tour has length 2085.