TSP (1.1-10)

1 user

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

Maintainer: Michael Hahsler
Author(s): Michael Hahsler [aut, cre, cph], Kurt Hornik [aut, cph]

License: GPL-3

Uses: foreach, maps, maptools, sp, testthat
Reverse depends: extracat, PairViz, penDvine, seriation, tspmeta, vines
Reverse suggests: archetypes, condvis, VineCopula

Released about 1 month ago.

23 previous versions



  (0 votes)


  (0 votes)

Log in to vote.


No one has written a review of TSP yet. Want to be the first? Write one now.

Related packages: DEoptim, LowRankQP, boot, bvls, clue, desirability, gafit, genalg, glpk, gsl, igraph, kernlab, linprog, lpSolve, minpack.lm, nls2, nnls, optmatch, powell, quadprog(20 best matches, based on common tags.)

Search for TSP on google, google scholar, r-help, r-devel.

Visit TSP on R Graphical Manual.