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]


Marrying Age

People get married at various ages, but there are definite trends that vary across demographic groups. What do these trends look like?

Unemployment in America, Mapped Over Time

Watch the regional changes across the country from 1990 to 2016.

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, …

Real Chart Rules to Follow

There are rules—usually for specific chart types meant to be read in a specific way—that you shouldn’t break. When they are, everyone loses. This is that small handful.