A simulation of the traveling salesman problem

Posted to Statistics  |  Tags: ,  |  Nathan Yau

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]

Favorites

Top Brewery Road Trip, Routed Algorithmically

There are a lot of great craft breweries in the United States, but there is only so much time. This is the computed best way to get to the top rated breweries and how to maximize the beer tasting experience. Every journey begins with a single sip.

How We Spend Our Money, a Breakdown

We know spending changes when you have more money. Here’s by how much.

Life expectancy changes

The data goes back to 1960 and up to the most current estimates for 2009. Each line represents a country.

Interactive: When Do Americans Leave For Work?

We don’t all start our work days at the same time, despite what morning rush hour might have you think.