Mirrored in: https://github.com/aimms/traveling-salesman
How-to: https://how-to.aimms.com/Articles/397/397-traveling-salesman.html
The Traveling Salesman Problem (TSP) is the problem of finding the best route given a set of locations and distances between those locations.
It is widely researched for several reasons including:
- They are notoriously hard to solve to proven optimality.
- There is a wide range of practical applications.
- There are various ways of solving TSP problems.
The purpose of this example application is to illustrate some ways of solving a TSP.