TSP-package

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 <a href="https://www.math.uwaterloo.ca/tsp/concorde/">Concorde</a> itself is not included in the package and has to be obtained separately.

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

Michael Hahsler

Traveling Salesperson Problem (TSP)

Kurt Hornik

TSP-package function

<ul>
<li><code>solve_TSP()</code></li>
</ul>

Key functions

Author

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 <a href='https://www.math.uwaterloo.ca/tsp/concorde/'>Concorde</a> itself is not included in the package and has to be obtained separately.

TSP: Traveling Salesperson Problem (TSP) — TSP-package

<ul>
<li><code>solve_TSP()</code></li>
</ul>

TSP-package: TSP: Traveling Salesperson Problem (TSP)

Description

Arguments

Key functions

Author

References