Installation
About
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.
| Citation | TSP citation info |
| github.com/mhahsler/TSP | |
| Copyright | All code is Copyright (C) Michael Hahsler and Kurt Hornik. |
| Bug report | File report |
Key Metrics
Downloads
| Yesterday | 1.007 0% |
| Last 7 days | 6.185 -6% |
| Last 30 days | 24.520 -14% |
| Last 90 days | 78.823 -8% |
| Last 365 days | 337.628 -17% |
Depends
| R | ≥ 3.5.0 |