Earlier quoted context omitted.
Ride share companies are surviving so it’s clear that some good enough solutions do exist. There’s a difference between the algorithms ride shares have to use and the heuristic based solution for 85.6k cities. The graph for ride shares is constantly changing as passengers request rides from random starting points to random destinations. This version of TSP is much harder to solve.
Sorry but how is ride share problem a TSP problem? Rides are assigned one at a time and I do not think they would take into account future rides while doing the assignment optimization.
You’re right that the problem space is simply matching available drivers to riders.