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.
- Version1.2-4
- R version≥ 3.5.0
- LicenseGPL-3
- Needs compilation?Yes
- TSP citation info
- Last release04/04/2023
Documentation
Team
Michael Hahsler
MaintainerShow author detailsKurt Hornik
Insights
Last 30 days
This package has been downloaded 27,669 times in the last 30 days. The downloads are officially high enough to crash an underfunded departmental server. Quite an accomplishment! The following heatmap shows the distribution of downloads per day. Yesterday, it was downloaded 672 times.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Last 365 days
This package has been downloaded 293,017 times in the last 365 days. This is the kind of download count that makes grant committees nod approvingly. A job well done, even the stoic reviewers might be impressed! The day with the most downloads was Mar 11, 2025 with 1,449 downloads.
The following line graph shows the downloads per day. You can hover over the graph to see the exact number of downloads per day.
Data provided by CRAN
Binaries
Dependencies
- Imports1 package
- Suggests3 packages
- Reverse Depends4 packages
- Reverse Imports10 packages
- Reverse Suggests6 packages