tsp_greedy_test

tsp_greedy_test, an Octave code which calls tsp_greedy(), which applies a simple greedy algorithm to construct a solution to the traveling salesperson problem (TSP).

Licensing:

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

Related Data and Programs:

tsp_greedy, an Octave code which applies a simple greedy algorithm to construct a solution to the traveling salesperson problem (TSP).

Source Code:

• tsp_greedy_test.m, calls all the tests.
• tsp_greedy_test.sh, runs all the tests.
• tsp_greedy_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.
• seventeen.txt, a 17 city distance matrix, whose minimal tour has length 2,085.