TSP — Infrastructure for the traveling salesperson problem

View Researcher's Other Codes

Disclaimer: The provided code links for this paper are external links. Science Nest has no responsibility for the accuracy, legality or content of these links. Also, by downloading this code(s), you agree to comply with the terms of use as set out by the author(s) of the code(s).

Authors Michael Hahsler, Kurt Hornik Department of Information Systems and Operations,
Journal/Conference Name JOURNAL OF STATISTICAL SOFTWARE
Paper Category
Paper Abstract The traveling salesperson (or, salesman) problem (TSP) is a well known and important combinatorial optimization problem. The goal is to nd 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 dicult 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
Date of publication 2007
Code Programming Language R
Comment

Copyright Researcher 2022