TSP: Traveling Salesperson Problem (TSP)

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.

Package details

AuthorMichael Hahsler [aut, cre, cph], Kurt Hornik [aut, cph]
MaintainerMichael Hahsler <[email protected]>
URL http://lyle.smu.edu/IDA/seriation
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:

Try the TSP package in your browser

Any scripts or data that you put into this service are public.

TSP documentation built on April 30, 2018, 5:03 p.m.