A Data Scientist's Algorithm for an Efficient Road Trip

I came across this article in the Washington Post about a data scientist who used data science to calculate the most efficient road trip throughout the entire continental United States assuming the traveler would stop at one location of national significance in each state and one stop in Washington D.C. He added a second stop in California to make a total of fifty stops.

With fifty stops, there would be 2500 possible routes and calculating the shortest path without an algorithm could be quite a tedious task. Luckily for anyone planning on taking a road trip, data science comes to the rescue! You can read more about the algorithm he used here. It is the same algorithm he used to find Waldo from the children's book series titled Where's Waldo?

Thanks for reading!

Comments