tsp_anneal

tsp_anneal, an R code which solves the traveling salesperson problem (TSP) using simulated annealing.

Licensing:

Copyright 2016 James P. Howard, II

The computer code and data files on this web page are distributed under the BSD-2-Clause license.

Languages:

tsp_anneal is available in a Fortran90 version and a MATLAB version and an Octave version and a Python version and an R version.

Related Data and Programs:

tsp_anneal_test

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_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.

tsp_display, an Octave code which displays a solution of a Traveling Salesman Problem (TSP).

Author:

Original R code by James Howard; This version by John Burkardt.

Reference:

1. William Cook,
   In Pursuit of the Traveling Salesman,
   Princeton University Press, 2012,
   ISBN13 978-0-691-16352-9.
2. James Howard,
   Computational Methods for Numerical Analysis with R,
   CRC Press, 2017,
   ISBN13: 978-1-4987-2363-3.
3. https://CRAN.R-project.org/package=cmna

Source Code:

• tsp_anneal.R, the source code;