How the Route Was Calculated
Randy Olson used a genetic algorithm to solve the complex traveling salesman problem for his road trip plan. This method approximates the shortest possible route through multiple destinations by simulating natural selection processes. He input 45 must-see European locations into the algorithm, which iteratively improved the route over successive generations. The algorithm aimed to minimize total driving distance and avoid backtracking, resulting in a 16,287-mile journey. Olson utilized Google Maps to obtain driving distances between each pair of locations, ensuring practical routing. The final itinerary offers an efficient loop through Europe, balancing travel time with sightseeing opportunities.