Few algorithms for TSP problem in Python
- Free software: MIT license
- Documentation: https://pytsp.readthedocs.io.
This package is under heavy development. The code may not be efficient and may potentially lead to bugs.
- Christofides algorithm
- Minimal spanning tree (Prim algorithm)
- 2-opt algorithm
- 3-opt algorithm
- Nearest Neighbor
- Simulated Annealing (SA)
- B&B algorithm (LB based on 2 nearest neighbours, bad performance)
- Feel free to contribute any way possible for you (Implement new algorithms or tests)
- Feel free to ask for new algorithms via "Issues" tab.