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-5 |
| Depends: |
R (≥ 3.5.0) |
| Imports: |
graphics, foreach, utils, stats, grDevices |
| Suggests: |
maps, doParallel, testthat |
| Published: |
2025-05-27 |
| DOI: |
10.32614/CRAN.package.TSP |
| Author: |
Michael Hahsler 
[aut, cre, cph],
Kurt Hornik [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 |