Sure, consider a dynamic programming approach that precomputes shortest paths between hubs, then applies a greedy insertion heuristic for the remaining stops. It reduces computation by caching segment costs, so you only recalculate when traffic data changes. That should shave those minutes off.