tsp_dantzig42

tsp_dantzig42, an R 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.

Licensing:

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

Languages:

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.

Related Data and Programs:

tsp_dantzig42_test

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 R code which is given a table of city locations, and solves the traveling salesperson problem (TSP) using simulated annealing.

tsp_att48, an R 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_display, an Octave code which displays a solution of a Traveling Salesman Problem (TSP).

Reference:

1. William Cook,
   In Pursuit of the Traveling Salesman,
   Princeton University Press, 2012,
   ISBN13 978-0-691-16352-9.
2. Gerhard Reinelt,
   TSPLIB - A Traveling Salesman Problem Library,
   ORSA Journal on Computing,
   Volume 3, Number 4, Fall 1991, pages 376-384.

Source Code:

• tsp_dantzig42_order.R, returns the optimal tour ordering.
• tsp_dantzig42_xy.R, returns the city coordinates.