Package: TSP 1.2-4.1
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-4.1.tar.gz
TSP_1.2-4.1.zip(r-4.5)TSP_1.2-4.1.zip(r-4.4)TSP_1.2-4.1.zip(r-4.3)
TSP_1.2-4.1.tgz(r-4.4-x86_64)TSP_1.2-4.1.tgz(r-4.4-arm64)TSP_1.2-4.1.tgz(r-4.3-x86_64)TSP_1.2-4.1.tgz(r-4.3-arm64)
TSP_1.2-4.1.tar.gz(r-4.5-noble)TSP_1.2-4.1.tar.gz(r-4.4-noble)
TSP_1.2-4.1.tgz(r-4.4-emscripten)TSP_1.2-4.1.tgz(r-4.3-emscripten)
TSP.pdf |TSP.html✨
TSP/json (API)
NEWS
# 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
- 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 3 months agofrom:95d2ddf38e. Checks:OK: 9. Indexed: yes.
Target | Result | Date |
---|---|---|
Doc / Vignettes | OK | Dec 26 2024 |
R-4.5-win-x86_64 | OK | Dec 26 2024 |
R-4.5-linux-x86_64 | OK | Dec 26 2024 |
R-4.4-win-x86_64 | OK | Dec 26 2024 |
R-4.4-mac-x86_64 | OK | Dec 26 2024 |
R-4.4-mac-aarch64 | OK | Dec 26 2024 |
R-4.3-win-x86_64 | OK | Dec 26 2024 |
R-4.3-mac-x86_64 | OK | Dec 26 2024 |
R-4.3-mac-aarch64 | OK | Dec 26 2024 |
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 a 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 |