TSP: Traveling Salesperson Problem (TSP)
Version 1.1-5

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]
Date of publication2017-02-22 17:29:14
MaintainerMichael Hahsler <mhahsler@lyle.smu.edu>
LicenseGPL-3
Version1.1-5
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:
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 May 29, 2017, 8 p.m.