The Traveling Salesman Problem (TSP) seems simple. However, finding the solution can be difficult, even for a small number of points. Highly specialized software, based on mathematical and scientific principles, is required.
The TSP has many applications, for example, in transportation and logistics. On this website you will find examples of the TSP done on a small scale around Iowa City. Data was collected by foot and then entered into a publically available solver.
This project and website have been support by the National Science Foundation under grant CCF 0545514.