Become an expert in R — Interactive courses, Cheat Sheets, certificates and more!
Get Started for Free

TSP

Traveling Salesperson Problem (TSP)

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>.

Functions (12)

ATSP

Class ATSP – Asymmetric traveling salesperson problem

Concorde

Using the Concorde TSP Solver

ETSP

Class ETSP – Euclidean traveling salesperson problem

TOUR

Class TOUR – Solution to a traveling salesperson problem

TSP

Class TSP – Symmetric traveling salesperson problem

TSPLIB

Read and write TSPLIB files

USCA312

USCA312/USCA50 – 312/50 cities in the US and Canada

cut_tour

Cut a tour to form a path

insert_dummy

Insert dummy cities into a distance matrix

reformulate_ATSP_as_TSP

Reformulate a ATSP as a symmetric TSP

solve_TSP

TSP solver interface

tour_length

Calculate the length of a tour

TSP

Traveling Salesperson Problem (TSP)

v1.1-10
GPL-3
Authors
Michael Hahsler [aut, cre, cph], Kurt Hornik [aut, cph]
Initial release
2020-04-17

We don't support your browser anymore

Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.