tsp_display, a MATLAB code which displays the solution of a Traveling Salesman Problem (TSP). Graphics files are created for processing by gnuplot().
The information on this web page is distributed under the MIT license.
tsp_display is available in a C version and a C++ version and a Fortran90 version and a MATLAB version.
cities, a MATLAB code which handles various problems associated with a set of "cities" on a map.
concorde, examples which call concorde(), which solves the traveling salesman problem (TSP), mixed integer programming, and related network optimization problems.
matlab_combinatorics, a MATLAB code which considers a variety of problems in combinatorics involving counting, combinations, permutations, and so on.
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, a MATLAB code which is given a city-to-city distance table, and solves the traveling salesperson problem (TSP) using simulated annealing.
tsp_brute, a MATLAB code which is given a city-to-city distance table, and solves a (small) traveling salesperson problem (TSP), using brute force.
tsp_descent, a MATLAB code which is given a city-to-city distance table, chooses an initial tour at random, and then tries simple variations, seeking to quickly find a tour of lower cost for the traveling salesperson problem (TSP).
tsp_moler, a MATLAB code which tries to optimize the traveling salesperson problem (TSP), written by Cleve Moler.
tsp_nearest, a MATLAB code which is given a city-to-city distance 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, a MATLAB code which is given a city-to-city distance table, seeks a solution of the Traveling Salesperson Problem (TSP), by randomly generating round trips that visit every city, returning the tour of shortest length.