tsp_io, a Fortran90 code which reads or writes files from the TSPLIB collection of traveling salesman problems (TSP).
The information on this web page is distributed under the MIT license.
tsp_io is available in a Fortran90 version.
cities, a dataset directory which contains sets of information about cities and the distances between them;
concorde, examples which call concorde(), which solves the traveling salesman problem (TSP), mixed integer programming, and related network optimization problems.
cities, a Fortran90 code which handles various problems associated with a set of "cities" on a map.
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 Fortran90 code which reads a table of city locations, and uses simulated annealing to solve the traveling salesperson problem (TSP), based on a Numerical Recipes code. Graphics files are created for processing by gnuplot().
tsp_att48, a Fortran90 code which returns the (x,y) coordinates of the cities that constitute the AT&T 48 state challenge for the Traveling Salesman Problem (TSP). Graphics files are created for processing by gnuplot().
tsp_brute, a Fortran90 code which reads a table of city locations and solves the traveling salesperson problem, using brute force.
tsp_dantzig42, a Fortran90 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. Graphics files are created for processing by gnuplot().
tsp_display, a Fortran90 code which displays the solution of a Traveling Salesman Problem (TSP). Graphics files are created for processing by gnuplot().
tsp_lau, a Fortran90 code which implements a heuristic algorithm for the solution of the traveling salesperson problem (TSP).
tsp_nearest, a Fortran90 code which is given a table of city locations, 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.