A simulation of the traveling salesman problem

Posted to Statistics  |  Tags: ,  |  Nathan Yau

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

Reviving the Statistical Atlas of the United States with New Data

Due to budget cuts, there is no plan for an updated atlas. So I recreated the original 1870 Atlas using today’s publicly available data.

Unemployment in America, Mapped Over Time

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

Who is Older and Younger than You

Here’s a chart to show you how long you have until you start to feel your age.

One Dataset, Visualized 25 Ways

“Let the data speak” they say. But what happens when the data rambles on and on?