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

TSP (version 1.0-7)

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 Concorde, the currently fastest TSP solver. Concorde itself is not included in the package and has to be obtained separately.

Copy Link

Version

Install

install.packages('TSP')

Monthly Downloads

29,102

Version

1.0-7

License

GPL-2

Maintainer

Michael Hahsler

Last Published

August 22nd, 2012

Functions in TSP (1.0-7)

USCA

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

Class ATSP -- Asymmetric traveling salesperson problem
reformulate_ATSP_as_TSP

Reformulate a ATSP as a symmetric TSP
Concorde

Using the Concorde TSP Solver
solve_TSP

TSP solver interface
TSPLIB

Read and write TSPLIB files
TSP

Class TSP -- Symmetric traveling salesperson problem
cut_tour

Cut a tour to form a path
insert_dummy

Insert dummy cities into a distance matrix
TOUR

Class TOUR -- Solution to a traveling salesperson problem
tour_length

Calculate the length of a tour