Want to read Slashdot from your mobile device? Point it at m.slashdot.org and keep reading!

 



Forgot your password?
typodupeerror

Slashdot videos: Now with more Slashdot!

  • View

  • Discuss

  • Share

We've improved Slashdot's video section; now you can view our video interviews, product close-ups and site visits with all the usual Slashdot options to comment, share, etc. No more walled garden! It's a work in progress -- we hope you'll check it out (Learn more about the recent updates).

×

+ - Santa's Route Is the Biggest "Traveling Salesman Problem" of All Time->

Submitted by
Nerval's Lobster
Nerval's Lobster writes "What's the most optimal path for Santa (if he actually, you know, existed) to travel around the world on Christmas Eve? The answer is a variation of the classic "Traveling Salesman Problem." According to a history of the problem compiled by Georgia Tech, the traveling salesman problem (or “TSP”) dates back to the 1800s, when Irish mathematician Sir William Rowan Hamilton challenged friends to navigate 20 points in the shortest path using only a series of specified connections. But it wasn’t until the first decades of the 20th century when statisticians began to tackle the challenge in a more systematic way. The World TSP Problem involves 1,904,711-city instance of locations throughout the world, with a most-optimized route of 7,515,778.188 kilometers (4,670,090 miles). The "Santa problem" would be even more complex — hope those reindeer are well-fed."
Link to Original Source
This discussion was created for logged-in users only, but now has been archived. No new comments can be posted.

Santa's Route Is the Biggest "Traveling Salesman Problem" of All Time

Comments Filter:

If you don't have time to do it right, where are you going to find the time to do it over?

Working...