Traveling Salesperson Problem (TSP)
Class ATSP -- Asymmetric traveling salesperson problem
Using the Concorde TSP Solver
Cut a tour to form a path
Class ETSP -- Euclidean traveling salesperson problem
Insert dummy cities into a distance matrix
Reformulate a ATSP as a symmetric TSP
TSP solver interface
Class TOUR -- Solution to a traveling salesperson problem
Calculate the length of a tour
TSP: Traveling Salesperson Problem (TSP)
Class TSP -- Symmetric traveling salesperson problem
Read and write TSPLIB files
USCA312/USCA50 -- 312/50 cities in the US and Canada
Basic infrastructure and some algorithms for the traveling salesperson problem (also traveling salesman problem; TSP). The package provides some simple algorithms and an interface to the Concorde TSP solver and its implementation of the Chained-Lin-Kernighan heuristic. The code for Concorde itself is not included in the package and has to be obtained separately. Hahsler and Hornik (2007) <doi:10.18637/jss.v023.i02>.