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 →
A Day in the Life: Women and Men
Using the past couple of years of data from the American Time Use Survey, I simulated a working day for men and women to see how schedules differ. Watch it play out in this animation.
The Most Trendy Names in US History
Names are incredibly personal things. It’s how we identity ourselves. …