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]


Think Like a Statistician – Without the Math

I call myself a statistician, because, well, I’m a statistics graduate student. However, the most important things I’ve learned are less formal, but have proven extremely useful when working/playing with data.

How We Spend Our Money, a Breakdown

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

19 Maps That Will Blow Your Mind and Change the Way You See the World. Top All-time. You Won’t Believe Your Eyes. Watch.

Many lists of maps promise to change the way you see the world, but this one actually does.

Best Data Visualization Projects of 2016

Here are my favorites for the year.