tsp_dantzig42, an Octave code which returns the (x,y) coordinates of the cities that constitute the Dantzig 42 state challenge for the Traveling Salesman Problem (TSP). The minimal tour is known to have length 699.
The information on this web page is distributed under the MIT license.
tsp_dantzig42 is available in a C version and a C++ version and a Fortran77 version and a Fortran90 version and a MATLAB version and an Octave version and a Python version and an R version.
concorde, examples which call concorde(), which solves the traveling salesman problem (TSP), mixed integer programming, and related network optimization problems.
tsp, a dataset directory which contains test data for the traveling salesperson problem (TSP) including the AT&T 48 state capital test, and Dantzig's 42 city test;
tsp_anneal, an Octave code which is given a table of city locations, and solves the traveling salesperson problem (TSP) using simulated annealing.
tsp_att48, an Octave code which returns the (x,y) coordinates of the cities that constitute the AT&T 48 state challenge for the Traveling Salesman Problem (TSP).
tsp_brute, an Octave code which is given a city location table, and solves a (small) traveling salesperson problem (TSP), using brute force.
tsp_display, an Octave code which displays the solution of a Traveling Salesman Problem (TSP).
tsp_moler, an Octave code which tries to optimize the traveling salesperson problem (TSP), written by Cleve Moler.
tsp_nearest, an Octave code which is given a city location table, and solves a small traveling salesperson problem (TSP) using the nearest neighbor algorithm. It picks a starting city at random, and then successively visits the nearest unvisited city.
tsp_random, an Octave code which is given a table of city locations, seeks a solution of the Traveling Salesperson Problem (TSP), by randomly generating round trips that visit every city, returning the tour of shortest length.