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. Hahsler and Hornik (2007) <doi:10.18637/jss.v023.i02>.

Package details

AuthorMichael Hahsler [aut, cre, cph], Kurt Hornik [aut, cph]
MaintainerMichael Hahsler <mhahsler@lyle.smu.edu>
LicenseGPL-3
Version1.1-10
URL https://github.com/mhahsler/TSP
Package repositoryView on CRAN
Installation Install the latest version of this package by entering the following in R:
install.packages("TSP")

Try the TSP package in your browser

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

TSP documentation built on April 19, 2020, 3:56 p.m.