Solving Geographic Travelling Salesman Problems using Python

Using pyconcorde to find optimal solutions to real-world routing problems

The famous Travelling Salesman Problem (TSP) is about finding an optimal route between a collection of nodes (cities) and returning to where you started. It sounds simple, but is impossible to solve by brute force for large numbers of nodes, since the number of possible orderings of n cities is n!. This means …

deep-dives geo operations-research routing travelling-salesman