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>.

Version: 1.2-4
Depends: R (≥ 3.5.0)
Imports: graphics, foreach, utils, stats, grDevices
Suggests: maps, doParallel, testthat
Published: 2023-04-04
Author: Michael Hahsler ORCID iD [aut, cre, cph], Kurt Hornik ORCID iD [aut, cph]
Maintainer: Michael Hahsler <mhahsler at lyle.smu.edu>
BugReports: https://github.com/mhahsler/TSP/issues
License: GPL-3
Copyright: All code is Copyright (C) Michael Hahsler and Kurt Hornik.
URL: https://github.com/mhahsler/TSP
NeedsCompilation: yes
Classification/ACM: G.1.6, G.2.1, G.4
Citation: TSP citation info
Materials: README NEWS
In views: Optimization
CRAN checks: TSP results

Documentation:

Reference manual: TSP.pdf
Vignettes: Introduction to TSP

Downloads:

Package source: TSP_1.2-4.tar.gz
Windows binaries: r-devel: TSP_1.2-4.zip, r-release: TSP_1.2-4.zip, r-oldrel: TSP_1.2-4.zip
macOS binaries: r-release (arm64): TSP_1.2-4.tgz, r-oldrel (arm64): TSP_1.2-4.tgz, r-release (x86_64): TSP_1.2-4.tgz
Old sources: TSP archive

Reverse dependencies:

Reverse depends: ForagingOrg, GraphPAC, isocir, PairViz, tspmeta
Reverse imports: cholera, colorpatch, contiBAIT, CRTspat, DmelSGI, jocre, nlnet, pencopulaCond, SCORPIUS, seriation, sincell, vines
Reverse suggests: archetypes, condvis, nilde, sensitivity, sfnetworks, VineCopula

Linking:

Please use the canonical form https://CRAN.R-project.org/package=TSP to link to this page.