IDEAS home Printed from https://ideas.repec.org/a/jss/jstsof/v023i02.html
   My bibliography  Save this article

TSPInfrastructure for the Traveling Salesperson Problem

Author

Listed:
  • Hahsler, Michael
  • Hornik, Kurt

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.

Suggested Citation

  • Hahsler, Michael & Hornik, Kurt, 2007. "TSPInfrastructure for the Traveling Salesperson Problem," Journal of Statistical Software, Foundation for Open Access Statistics, vol. 23(i02).
    • Handle: RePEc:jss:jstsof:v:023:i02
    DOI: http://hdl.handle.net/10.18637/jss.v023.i02
    as

    Download full text from publisher

    File URL: https://www.jstatsoft.org/index.php/jss/article/view/v023i02/v23i02.pdf
    Download Restriction: no
    File URL: https://www.jstatsoft.org/index.php/jss/article/downloadSuppFile/v023i02/TSP_0.2-1.tar.gz
    Download Restriction: no
    File URL: https://www.jstatsoft.org/index.php/jss/article/downloadSuppFile/v023i02/v23i02.R.zip
    Download Restriction: no
    File URL: https://libkey.io/http://hdl.handle.net/10.18637/jss.v023.i02?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wittek, Peter, 2013. "Two-way incremental seriation in the temporal domain with three-dimensional visualization: Making sense of evolving high-dimensional datasets," Computational Statistics & Data Analysis, Elsevier, vol. 66(C), pages 193-201.
    2. Maria Michela Dickson & Yves Tillé, 2016. "Ordered spatial sampling by means of the traveling salesman problem," Computational Statistics, Springer, vol. 31(4), pages 1359-1372, December.
    3. Kemal Ihsan Kilic & Leonardo Mostarda, 2022. "Novel Concave Hull-Based Heuristic Algorithm For TSP," SN Operations Research Forum, Springer, vol. 3(2), pages 1-45, June.
    4. Thomas Kirschstein & Christian Bierwirth, 2018. "The selective Traveling Salesman Problem with emission allocation rules," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(1), pages 97-124, January.
    5. Aliyev, Denis A. & Zirbel, Craig L., 2023. "Seriation using tree-penalized path length," European Journal of Operational Research, Elsevier, vol. 305(2), pages 617-629.
    6. Doppstadt, C. & Koberstein, A. & Vigo, D., 2016. "The Hybrid Electric Vehicle – Traveling Salesman Problem," European Journal of Operational Research, Elsevier, vol. 253(3), pages 825-842.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:jss:jstsof:v:023:i02. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Christopher F. Baum (email available below). General contact details of provider: http://www.jstatsoft.org/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.