The DOI matches its Crossref record.
TSP- Infrastructure for the Traveling Salesperson Problem
Open accessAbstract
The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving the TSP is difficult since it belongs to the class of NP-complete problems. The importance of the TSP arises besides from its theoretical appeal from the variety of its applications. Typical applications in operations research include vehicle routing, computer wiring, cutting wallpaper and job sequencing. The main application in statistics is combinatorial data analysis, e.g., reordering rows and columns of data matrices or identifying clusters. In this paper, we introduce the R package TSP which provides a basic infrastructure for handling and solving the traveling salesperson problem. The package features S3 classes for specifying a TSP and its (possibly optimal) solution as well as several heuristics to find good solutions. In addition, it provides an interface to Concorde, one of the best exact TSP solvers currently available.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
GA: A Package for Genetic Algorithms in R
Scrucca, L. (2013) · Journal of Statistical Software · doi:10.18637/jss.v053.i04 · Cited by 837
Getting Things in Order: An Introduction to the R Package seriation
Hahsler, M., Hornik, K., & Buchta, C. (2008) · Journal of Statistical Software · doi:10.18637/jss.v025.i03 · Cited by 385
Self-citationA Review of Methodological Approaches for the Design and Optimization of Wind Farms
Herbert-Acero, J., Probst, O., Réthoré, P.-E., Larsen, G., & Castillo-Villar, K. (2014) · Energies · doi:10.3390/en7116930 · Cited by 311
Human Genome Structural Variation Consortium, Porubsky, D., Ebert, P., Audano, P. A., Vollger, M. R., Harvey, W. T., Marijon, P., Ebler, J., Munson, K. M., Sorensen, M., et al. (2021) · Nature Biotechnology · doi:10.1038/s41587-020-0719-5 · Cited by 203
Metadata
- Authors
- Hahsler, M., & Hornik, K.
- Venue
- Journal of Statistical Software
- Publisher
- Foundation for Open Access Statistic
- Published
- 2007
- Volume
- 23
- Issue
- 2
- ISSN
- 1548-7660 (ISSN-L)
- OpenAlex
- W2171060218
- Cited by
- 158
- References
- 0
- FWCI
- 1.06
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: TSP- Infrastructure for the Traveling Salesperson Problem. https://app.cochat.ai/papers/10.18637/jss.v023.i02
- The paper
- Hahsler, M., & Hornik, K. (2007). TSP- Infrastructure for the Traveling Salesperson Problem. Journal of Statistical Software. https://doi.org/10.18637/jss.v023.i02
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.