Comaparing diffrenent algorithm to solve TSP
- Naive
- Dynamic Programming
- Branch and bound
- 3/2 opt
- Genetic Algorithm
CLone the repo and inside the directory run python3 main.py
The inputs are hardcoded with 9 nodes each
Genetic and 3/2 opt uses one same data and both the input format is in co-ordinate system.
Rest uses a adjacency martix.