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

AuthorMichael Hahsler [aut, cre, cph], Kurt Hornik [aut, cph]
Date of publication2016-02-22 08:04:07
MaintainerMichael Hahsler <mhahsler@lyle.smu.edu>
LicenseGPL-3
Version1.1-4
http://lyle.smu.edu/IDA/seriation

View on CRAN

Files in this package

TSP
TSP/inst
TSP/inst/examples
TSP/inst/examples/d493.tsp
TSP/inst/CITATION
TSP/inst/tests
TSP/inst/tests/test-TSPLIB.R
TSP/inst/tests/test-solve_TSP.R
TSP/inst/NEWS
TSP/inst/doc
TSP/inst/doc/TSP.R
TSP/inst/doc/TSP.pdf
TSP/inst/doc/TSP.Rnw
TSP/tests
TSP/tests/testthat.R
TSP/src
TSP/src/tour_length.c
TSP/src/two_opt.c
TSP/src/insertion_cost.c
TSP/src/matrix_pos.h
TSP/NAMESPACE
TSP/data
TSP/data/USCA312_map.rda
TSP/data/USCA312.rda
TSP/data/USCA50.rda
TSP/R
TSP/R/tsp_concorde.R TSP/R/TSP.R TSP/R/ATSP.R TSP/R/AAAparameter.R TSP/R/solve_TSP.R TSP/R/tsp_nn.R TSP/R/reformulare_ATSP_as_TSP.R TSP/R/TOUR.R TSP/R/tsp_insertion.R TSP/R/cut_tour.R TSP/R/ETSP.R TSP/R/tour_length.R TSP/R/write_TSPLIB.R TSP/R/insert_dummy.R TSP/R/read_TSPLIB.R TSP/R/tsp_two_opt.R
TSP/vignettes
TSP/vignettes/TSP.bib
TSP/vignettes/overview.pdf
TSP/vignettes/TSP.Rnw
TSP/vignettes/overview.odg
TSP/README.md
TSP/MD5
TSP/build
TSP/build/vignette.rds
TSP/DESCRIPTION
TSP/man
TSP/man/ETSP.Rd TSP/man/ATSP.Rd TSP/man/TOUR.Rd TSP/man/tour_length.Rd TSP/man/Concorde.Rd TSP/man/insert_dummy.Rd TSP/man/USCA312.Rd TSP/man/TSPLIB.Rd TSP/man/TSP.Rd TSP/man/solve_TSP.Rd TSP/man/cut_tour.Rd TSP/man/reformulate_ATSP_as_TSP.Rd

Questions? Problems? Suggestions? or email at ian@mutexlabs.com.

All documentation is copyright its authors; we didn't write any of that.