TSP: Traveling Salesperson Problem (TSP)

Description

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.

Key functions

• solve_TSP()

Author(s)

Michael Hahsler

References

Michael Hahsler and Kurt Hornik. TSP – Infrastructure for the traveling salesperson problem. Journal of Statistical Software, 23(2):1–21, December 2007. doi: 10.18637/jss.v023.i02