Skip to content
TSP algorithms and graph support utilities
Branch: master
Clone or download
Permalink
Type Name Latest commit message Commit time
Failed to load latest commit information.
.github rest Oct 22, 2018
docs docs fix Jan 30, 2019
pytsp Added B&B method, Lower bound is calculated by 2-nearest neighbors Mar 9, 2019
tests Added B&B method, Lower bound is calculated by 2-nearest neighbors Mar 9, 2019
.editorconfig rest Oct 22, 2018
.gitignore rest Oct 22, 2018
.travis.yml rest Oct 22, 2018
CONTRIBUTING.rst Docs Oct 22, 2018
HISTORY.rst Docs Oct 22, 2018
LICENSE Docs Oct 22, 2018
MANIFEST.in Docs Oct 22, 2018
Makefile Docs Oct 22, 2018
README.rst updated readme Mar 9, 2019
modules.rst doc Jan 30, 2019
pytsp.data_structures.rst doc Jan 30, 2019
pytsp.rst doc Jan 30, 2019
requirements_dev.txt Added B&B method, Lower bound is calculated by 2-nearest neighbors Mar 9, 2019
setup.cfg rest Oct 22, 2018
setup.py Added B&B method, Lower bound is calculated by 2-nearest neighbors Mar 9, 2019
tox.ini rest Oct 22, 2018

README.rst

pytsp

Documentation Status

Few algorithms for TSP problem in Python

Notice

This package is under heavy development. The code may not be efficient and may potentially lead to bugs.

Features

  • Christofides algorithm
  • Minimal spanning tree (Prim algorithm)
  • 2-opt algorithm
  • 3-opt algorithm
  • Permutations
  • Nearest Neighbor
  • Simulated Annealing (SA)
  • B&B algorithm (LB based on 2 nearest neighbours, bad performance)

Contributions

  • Feel free to contribute any way possible for you (Implement new algorithms or tests)
  • Feel free to ask for new algorithms via "Issues" tab.

Credits

This package was created with Cookiecutter and the audreyr/cookiecutter-pypackage project template.

You can’t perform that action at this time.