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 →
Data Underload #5 – The Portfolio
Lazy Bob called himself an information designer, but everyone else knew the truth.
Data, R, and a 3-D Printer
We almost always look at data through a screen. It’s quick and good for exploration. So is there value in making data physical? I played around with a 3-D printer to find out.
Unemployment in America, Mapped Over Time
Watch the regional changes across the country from 1990 to 2016.