Package: TSP 1.2-4.1

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

Authors:Michael Hahsler [aut, cre, cph], Kurt Hornik [aut, cph]

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-arm64)TSP_1.2-4.1.tgz(r-4.4-x86_64)TSP_1.2-4.1.tgz(r-4.3-arm64)TSP_1.2-4.1.tgz(r-4.3-x86_64)
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

Peer review:

Bug tracker:https://github.com/mhahsler/tsp/issues

On CRAN:

concorde-tsp-solvertsp

20 exports 61 stars 7.25 score 3 dependencies 93 dependents 41 mentions 21.8k downloads

Last updated 3 months agofrom:cd161180d0

Exports:as.ATSPas.ETSPas.TOURas.TSPATSPconcorde_helpconcorde_pathcut_tourETSPfilter_ATSP_as_TSP_dummiesinsert_dummylinkern_helpn_of_citiesread_TSPLIBreformulate_ATSP_as_TSPsolve_TSPTOURtour_lengthTSPwrite_TSPLIB

Dependencies:codetoolsforeachiterators