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. Concorde itself is not included in the package and has to be obtained separately from http://www.math.uwaterloo.ca/tsp/concorde.html.

Version: 1.1-3
Depends: R (≥ 2.14.0)
Imports: graphics, foreach, utils, methods, stats, grDevices
Suggests: maps, sp, maptools, testthat
Published: 2015-09-03
Author: Michael Hahsler [aut, cre, cph], Kurt Hornik [aut, cph]
Maintainer: Michael Hahsler <mhahsler at lyle.smu.edu>
BugReports: http://r-forge.r-project.org/projects/tsp/
License: GPL-3
Copyright: All code is Copyright (C) Michael Hahsler and Kurt Hornik.
URL: http://lyle.smu.edu/IDA/seriation
NeedsCompilation: yes
Classification/ACM: G.1.6, G.2.1, G.4
Citation: TSP citation info
Materials: NEWS
In views: Optimization
CRAN checks: TSP results


Reference manual: TSP.pdf
Vignettes: Introduction to TSP
Package source: TSP_1.1-3.tar.gz
Windows binaries: r-devel: TSP_1.1-3.zip, r-release: TSP_1.1-3.zip, r-oldrel: TSP_1.1-3.zip
OS X Snow Leopard binaries: r-release: TSP_1.1-3.tgz, r-oldrel: TSP_1.1-1.tgz
OS X Mavericks binaries: r-release: TSP_1.1-3.tgz
Old sources: TSP archive

Reverse dependencies:

Reverse depends: PairViz, penDvine, tspmeta
Reverse imports: seriation, vines
Reverse suggests: archetypes, VineCopula