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

 



Forgot your password?
typodupeerror
Get HideMyAss! VPN, PC Mag's Top 10 VPNs of 2016 for 55% off for a Limited Time ×

Submission + - Santa's Route Is the Biggest "Traveling Salesman Problem" of All Time (slashdot.org)

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."
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:

Computers are not intelligent. They only think they are.

Working...