In a nutshell, the traveling salesman problem is as follows: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?” Todd Schneider made an interactive that lets you punch in the cities yourself and then watch the process look for an optimum route. Fun to play with even if you’re not into processes. [Thanks, Todd]
A simulation of the traveling salesman problem
Projects by FlowingData See All →
How the American Work Day Changed in 15 Years
The American Time Use Survey recently released results for 2018. That makes 15 years of data. What’s different? What’s the same?