pytsp¶
Few algorithms for TSP problem in Python
Free software: MIT license
Documentation: https://pytsp.readthedocs.io.
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.