It's not that simple. They need to figure out which assignment of drivers to customers maximizes some utility function. If they just send the closest available driver, that may degrade service for some other customer, or leave an important area of the city uncovered for the next unexpected call.

It's not the same problem as TSP, but it's surely reducible to it, given the NP-completeness proof.