© 2024 NPR Illinois
The Capital's Community & News Service
Play Live Radio
Next Up:
0:00
0:00
0:00 0:00
Available On Air Stations

The Definitive Road Trip? It's Data-Driven

Randy Olson's algorithm devised the optimal driving route to 50 tourist spots in the Lower 48 states.
Randy Olson
Randy Olson's algorithm devised the optimal driving route to 50 tourist spots in the Lower 48 states.

Spring is here, and a number of families are plotting road trips for school break.

Randy Olson, a Ph.D. candidate at Michigan State University and a self-proclaimed "data tinkerer," believes he's devised a route that could allow a family to hit a landmark in each of the Lower 48 states, from Grand Canyon in Arizona to the Gateway Arch in St. Louis to the Statue of Liberty in New York, in just nine days of driving.

"About 9.33 days, if you drove non-stop," Olson clarifies.

That means no time sleeping or using the restroom — and no bad traffic.

Olson tells NPR's Scott Simon that he and his team spent a few days deciding where to go, based on a set of criteria: They had to hit at least one spot in each state; they had to be national parks, natural landmarks or national historic sites; and they had to be reachable by car without leaving the U.S.

The team aimed for a mix of big-city and rural locations. They used TripAdvisor to find the best family friendly places.

"Once we chose 50 stops around the U.S., that's when the algorithm kicked in," he says.

The optimal but improbable road trip takes in major landmarks such as Acadia National Park, Lincoln's home, and even Frank Lloyd Wright's home in Wisconsin — known as Taliesin. More obscure spots make the map as well: the C.W. Parker Carousel Museum in Leavenworth, Kan.; the Ashfall Fossil Beds in Royal, Neb.; and Woodward Avenue in Detroit.

His interactive map details all the sites.

Olson says the algorithm can shape excursions beyond this round-the-country ramble. He's used it to plan tours of hot spots in major cities and a road trips around continents.

"And also," he says, "last month I used a very similar algorithm, strangely enough, to solve the Where's Waldo children's book as well."

He means the popular series by Martin Handford, in which a character in a red and white striped hat "hides" in detailed illustrations crammed with seemingly hundreds of people in various places. As a kid, Olson spent hours poring over the pages, trying to find Waldo.

"I finally decided, now as a Ph.D. student, I can actually analyze this and sort of find the optimal route to look through the page to find Waldo," he says.

Copyright 2021 NPR. To see more, visit https://www.npr.org.