Learn R Programming
⚠️There's a newer version (1.2-4) of this package.Take me there.

TSP (version 1.1-1)

Traveling Salesperson Problem (TSP)

Description

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. Concorde itself is not included in the package and has to be obtained separately from http://www.math.uwaterloo.ca/tsp/concorde.html.

Copy Link

Version

Install

install.packages('TSP')

Monthly Downloads

29,280

Version

1.1-1

License

GPL-3

Maintainer

Michael Hahsler

Last Published

May 15th, 2015

Functions in TSP (1.1-1)

tour_length

Calculate the length of a tour
ATSP

Class ATSP -- Asymmetric traveling salesperson problem
reformulate_ATSP_as_TSP

Reformulate a ATSP as a symmetric TSP
Concorde

Using the Concorde TSP Solver
cut_tour

Cut a tour to form a path
TOUR

Class TOUR -- Solution to a traveling salesperson problem
insert_dummy

Insert dummy cities into a distance matrix
TSP

Class TSP -- Symmetric traveling salesperson problem
USCA

USCA312/USCA50 -- 312/50 cities in the US and Canada
solve_TSP

TSP solver interface
TSPLIB

Read and write TSPLIB files
ETSP

Class ETSP -- Euclidean traveling salesperson problem