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

Causes of Death

There are many ways to die. Cancer. Infection. Mental. External. This is how different groups of people died over the past 10 years, visualized by age.

A Day in the Life of Americans

I wanted to see how daily patterns emerge at the individual level and how a person’s entire day plays out. So I simulated 1,000 of them.

Where People Run in Major Cities

There are many exercise apps that allow you to keep track of your running, riding, and other activities. Record speed, …

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.