Published by the Foundation for Open Access Statistics
Editors-in-chief: Bettina Grün, Torsten Hothorn, Edzer Pebesma, Achim Zeileis    ISSN 1548-7660; CODEN JSSOBK
TSP—Infrastructure for the Traveling Salesperson Problem | Hahsler | Journal of Statistical Software
Authors: Michael Hahsler, Kurt Hornik
Title: TSPInfrastructure for the Traveling Salesperson Problem
Abstract: 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.

Page views:: 8732. Submitted: 2006-12-21. Published: 2007-12-18.
Paper: TSPInfrastructure for the Traveling Salesperson Problem     Download PDF (Downloads: 8442)
TSP_0.2-1.tar.gz: R source package Download (Downloads: 1692; 748KB) v23i02.R: R example code from the paper Download (Downloads: 1605; 1KB)

DOI: 10.18637/jss.v023.i02

This work is licensed under the licenses
Paper: Creative Commons Attribution 3.0 Unported License
Code: GNU General Public License (at least one of version 2 or version 3) or a GPL-compatible license.