A simulation of the traveling salesman problem

Oct 1, 2014

In a nutshell, the traveling salesman problem is as follows: “Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?” Todd Schneider made an interactive that lets you punch in the cities yourself and then watch the process look for an optimum route. Fun to play with even if you’re not into processes. [Thanks, Todd]

Favorites

Pizza Place Geography

Most of the major pizza chains are within a 5-mile …

Most popular porn searches, by state

We’ve seen that we can learn from what people search …

The Best Data Visualization Projects of 2011

I almost didn’t make a best-of list this year, but …

Jobs Charted by State and Salary

Jobs and pay can vary a lot depending on where you live, based on 2013 data from the Bureau of Labor Statistics. Here’s an interactive to look.