A library for computing near optimal solution to large instances of the TSP (Travelling Salesman Problem) fast using a local solver. The library is written in C++ and provides Python bindings.
First install the library
$ pip install fast-tsp
Then run the problem on your 2D distance matrix:
import fast_tsp
dists = [
[ 0, 63, 72, 70],
[63, 0, 57, 53],
[72, 57, 0, 4],
[70, 53, 4, 0],
]
tour = fast_tsp.find_tour(dists)
print(tour) # [0, 1, 3, 2]
Documentation can be found at https://fast-tsp.readthedocs.io/.
You can build the documentation by cding to docs/ and running make clean && make html.
If you find that this project helps your research, please consider citing it using the metadata from the CITATION.cff file.
This library is licensed under the MIT license. Additionally, it uses pybind11 which is provided under a BSD-style license that can be found in the LICENSE file. By using, distributing, or contributing to this project, you agree to the terms and conditions of this license.
FAQs
A fast TSP solver with Python bindings
We found that fast-tsp demonstrated a healthy version release cadence and project activity because the last version was released less than a year ago. It has 1 open source maintainer collaborating on the project.
Did you know?
Socket for GitHub automatically highlights issues in each pull request and monitors the health of all your open source dependencies. Discover the contents of your packages and block harmful activity before you install or update your dependencies.
Security News
Research
The Socket Research Team breaks down a malicious wrapper package that uses obfuscation to harvest credentials and exfiltrate sensitive data.
Research
Security News
Attackers used a malicious npm package typosquatting a popular ESLint plugin to steal sensitive data, execute commands, and exploit developer systems.
Security News
The Ultralytics' PyPI Package was compromised four times in one weekend through GitHub Actions cache poisoning and failure to rotate previously compromised API tokens.