Given a list of cities and the distance to travel between each pair of them, the traveling salesman problem, or TSP for short, asks for the shortest route to visit each city and to return to the starting point. The Concorde App computes exact optimal solutions for TSP, based on the Concorde code by Applegate, Bixby, Chvatal, and Cook. Instances of 1,000 or more cities can often be solved exactly, with all computations carried out locally on your iPhone or iPad. The app is a companion to the book "In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation", William Cook, Princeton University Press, 2012.
Includes Exact TSP Solver, 3D Points, TSP Art, Map Routing, Tour-Finding Heuristics, Cutting Planes , TSP Challenge, Minimum Spanning Tree, and Perfect Matching modules.
Now explore optimal 3D traveling salesman tours with augmented reality and build your own tours with a TSP challenge.
Ratings and Reviews
For education and fun!
Exact solutions to the traveling salesman problem have driven the development of integer optimization for a long time. This app provides a beautiful, fun to watch, visualization of the run of such a process. Maps can be generated randomly, read from the Internet, or chosen from some built-in examples.
As an extra, photos from your iPhone can be turned into exciting line art!
The current version has many illustrative animations that can help students understand complex combinatorial algorithms visually.
Nice but needs save option!
Would be 5 stars if I could save images!
Amazing and Fun
This is really a lot of fun to play around. My only problem is the "Germany 120" data set. 22 years after the reunion it still has only cities from West Germany!?! Seriously? Could you not find better data or is this a political statement? Maybe you should add a set of only Confederate States of America?
With Family Sharing set up, up to six family members can use this app.