Algorithms for the Traveling Salesman Problem visualized

Posted to Maps  |  Tags: , ,  |  Nathan Yau

The Traveling Salesman Problem is a popular puzzle that asks for the shortest route between a set of points such that you visit each point once and end up back where you started. The problem is trivial for a few points, but it gets tricky as you add more. Here are are a few of the strategies in action.

See also this interactive simulation.

Or, you can try using genetic algorithms. [via kottke]

Favorites

Life expectancy changes

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

The Changing American Diet

See what we ate on an average day, for the past several decades.

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.

Pizza Place Geography

Most of the major pizza chains are within a 5-mile radius of where I live, so I have my pick, …