tsp

tsp, a Python code which seeks the shortest round trip visiting every city on a list, the traveling salesperson problem (TSP). The original MATLAB version was written by Cleve Moler.

The code depends in part on randomization, and so the results are likely to vary each time it is run. Moler reports that the shortest itinerary he found had a length of 10818 miles, and is likely an optimum circuit.

Licensing:

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

Reference:

1. Cleve Moler,
   USA Traveling Salesman Tour,
   Posted 17 September 2018,
   blogs.mathworks.com/cleve/2018/09/17/usa-traveling-salesman-tour/?s_tid=srchtitle_traveling%20salesman_1
2. Great circle distance matrix between pairs of cities,
   https://en.wikipedia.org/wiki/Great-circle_distance.

Source Code:

• tsp.py, the source code.
• tsp.sh, runs all the tests.
• tsp.txt, the output file.

• tsp.png, a plot of the results of one run of the code.