Crates for solving the Traveling Salesman Problem

1

Hi,

I've yet to come across a production-ready crate to solve the TSP. Here's what Google found :

  • teeline : "a work in progress" but "has all algorithms". Seems the best alternative at the moment ?
  • cylk-rs use Lin-Kerninghan heuristings
  • travelling-salesman : aims to be a collection of algoritms but the gitlab repo does seem to exist anymore. The example shows simulated annealing.
  • tsp-rs : 2-opt heuristics. Quoting the README : "don't trust this but the implementation should be corrected"

If you have other crates or can recommend one of them, it would be great. Thanks !

2

My first instinct is to look for bindings to concorde. A quick search yields concorde-rs.

3

This topic was automatically closed 90 days after the last reply. We invite you to open a new topic if you have further questions or comments.