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

Where Bars Outnumber Grocery Stores

A closer look at the age old question of where there are more bars than grocery stores, and vice versa.

10 Best Data Visualization Projects of 2015

These are my picks for the best of 2015. As usual, they could easily appear in a different order on a different day, and there are projects not on the list that were also excellent.

Life expectancy changes

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

Pizza Place Geography

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