Preamble | Introduction | Theory | Computational infrastructure: the TSP package | Examples | Conclusion
Package: TSP 1.2.8
TSP: Infrastructure for the Traveling Salesperson Problem
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>.
Authors:
TSP_1.2.8.tar.gz
TSP_1.2.8.zip(r-4.7-x86_64)TSP_1.2.8.zip(r-4.7-arm64)TSP_1.2.8.zip(r-4.6-x86_64)TSP_1.2.8.zip(r-4.6-arm64)TSP_1.2.8.zip(r-4.5-x86_64)
TSP_1.2.8.tgz(r-4.6-x86_64)TSP_1.2.8.tgz(r-4.6-arm64)TSP_1.2.8.tgz(r-4.5-x86_64)TSP_1.2.8.tgz(r-4.5-arm64)
TSP_1.2.8.tar.gz(r-4.7-arm64)TSP_1.2.8.tar.gz(r-4.7-x86_64)TSP_1.2.8.tar.gz(r-4.6-arm64)TSP_1.2.8.tar.gz(r-4.6-x86_64)
TSP_1.2.8.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
DESCRIPTION |NEWS
card.svg |card.png
TSP/json (API)
| # Install 'TSP' in R: |
| install.packages('TSP', repos = c('https://mhahsler.r-universe.dev', 'https://cloud.r-project.org')) |
Bug tracker:https://github.com/mhahsler/tsp/issues
Pkgdown/docs site:https://michael.hahsler.net
Datasets:
- USCA312 - USCA312/USCA50 - 312/50 cities in the US and Canada
- USCA312_GPS - USCA312/USCA50 - 312/50 cities in the US and Canada
- USCA50 - USCA312/USCA50 - 312/50 cities in the US and Canada
Last updated from:fe5ad19af1. Checks:15 OK. Indexed: yes.
| Target | Result | Time | Files | Syslog |
|---|---|---|---|---|
| linux-devel-arm64 | OK | 88 | ||
| linux-devel-x86_64 | OK | 105 | ||
| source / vignettes | OK | 171 | ||
| linux-release-arm64 | OK | 84 | ||
| linux-release-x86_64 | OK | 99 | ||
| macos-release-arm64 | OK | 83 | ||
| macos-release-x86_64 | OK | 229 | ||
| macos-oldrel-arm64 | OK | 97 | ||
| macos-oldrel-x86_64 | OK | 184 | ||
| windows-devel-arm64 | OK | 186 | ||
| windows-devel-x86_64 | OK | 108 | ||
| windows-release-arm64 | OK | 224 | ||
| windows-release-x86_64 | OK | 70 | ||
| windows-oldrel-x86_64 | OK | 74 | ||
| wasm-release | OK | 82 |
Exports:as.ATSPas.ETSPas.TOURas.TSPATSPconcorde_helpconcorde_pathcut_tourETSPfilter_ATSP_as_TSP_dummiesinsert_dummylinkern_helpn_of_citiesread_TSPLIBreformulate_ATSP_as_TSPsolve_TSPTOURtour_lengthTSPwrite_TSPLIB
Readme and manuals
Help Manual
| Help page | Topics |
|---|---|
| Class ATSP - Asymmetric traveling salesperson problem | as.ATSP as.ATSP.dist as.ATSP.matrix as.matrix.ATSP ATSP image.ATSP labels.ATSP n_of_cities.ATSP print.ATSP |
| Using the Concorde TSP Solver | Concorde concorde concorde_help concorde_path linkern_help |
| Cut a tour to form a path | cut_tour cut_tour.TOUR |
| Class ETSP - Euclidean traveling salesperson problem | as.ETSP as.ETSP.data.frame as.ETSP.matrix as.matrix.ETSP as.TSP.ETSP ETSP image.ETSP labels.ETSP n_of_cities.ETSP plot.ETSP print.ETSP |
| Insert dummy cities into a distance matrix | insert_dummy insert_dummy.ATSP insert_dummy.ETSP insert_dummy.TSP |
| Reformulate an ATSP as a symmetric TSP | filter_ATSP_as_TSP_dummies reformulate_ATSP_as_TSP |
| TSP solver interface | solve_TSP solve_TSP.ATSP solve_TSP.ETSP solve_TSP.TSP |
| Class TOUR - Solution to a traveling salesperson problem | as.TOUR as.TOUR.integer as.TOUR.numeric print.TOUR TOUR |
| Calculate the length of a tour | tour_length tour_length.ATSP tour_length.ETSP tour_length.integer tour_length.TOUR tour_length.TSP |
| Class TSP - Symmetric traveling salesperson problem | as.dist.TSP as.TSP as.TSP.dist as.TSP.matrix image.TSP labels.TSP n_of_cities n_of_cities.TSP print.TSP TSP |
| Read and write TSPLIB files | read_TSPLIB TSPLIB write_TSPLIB write_TSPLIB.ATSP write_TSPLIB.ETSP write_TSPLIB.TSP |
| USCA312/USCA50 - 312/50 cities in the US and Canada | USCA USCA312 USCA312_GPS USCA50 |