Infrastructure for the Traveling Salesperson Problem R package TSP version 1.2.7 Classification/ACM: G.1.6, G.2.1, G.4 CRAN Task View: Optimization (https://CRAN.R-project.org/view=Optimization) 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>. Software Depends: R (>= 3.5.0) Imports: graphics, foreach, utils, stats, grDevices Suggests: maps, doParallel, testthat Michael Hahsler <mhahsler@lyle.smu.edu> Comprehensive R Archive Network (CRAN) Michael Hahsler [aut, cre, cph] (ORCID: <https://orcid.org/0000-0003-2716-1405>), Kurt Hornik [aut, cph] (ORCID: <https://orcid.org/0000-0003-4198-9911>) GPL-3 2026-03-23 application/tgz https://CRAN.R-project.org/package=TSP doi:10.32614/CRAN.package.TSP