CRAN

TSP 1.1-7

Traveling Salesperson Problem (TSP)

Released May 22, 2019 by Michael Hahsler

Dependencies

foreach 1.4.4

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.

Installation

Maven

This package can be included as a dependency from a Java or Scala project by including the following your project's pom.xml file. Read more about embedding Renjin in JVM-based projects.

<dependencies>
  <dependency>
    <groupId>org.renjin.cran</groupId>
    <artifactId>TSP</artifactId>
    <version>1.1-7-b1</version>
  </dependency>
</dependencies>
<repositories>
  <repository>
    <id>bedatadriven</id>
    <name>bedatadriven public repo</name>
    <url>https://nexus.bedatadriven.com/content/groups/public/</url>
  </repository>
</repositories>

View build log

Renjin CLI

If you're using Renjin from the command line, you load this library by invoking:

library('org.renjin.cran:TSP')

Test Results

This package was last tested against Renjin 0.9.2726 on Jul 13, 2019.

• ATSP-examples
• ETSP-examples
• TOUR-examples
• TSP-examples
• TSPLIB-examples
• USCA312-examples
• cut_tour-examples
• insert_dummy-examples
• reformulate_ATSP_as_TSP-examples
• solve_TSP-examples
• testthat
• tour_length-examples

Source

View GitHub Mirror

Release History

• 1.1-7
• 1.1-6
• 1.1-5
• 1.1-4
• 1.1-3
• 1.1-2
• 1.1-1
• 1.1-0
• 1.0-10
• 1.0-9
• 1.0-8
• 1.0-7
• 1.0-6
• 1.0-5
• 1.0-4
• 1.0-3
• 1.0-2
• 1.0-1
• 1.0-0
• 0.2-6
• 0.2-4
• 0.2-3
• 0.2-2
• 0.2-1
• 0.2-0
• 0.1-2