Ride-hailing dispatch cut wait times by 31% using historical pattern matching instead of machine learning

Researchers tested a new method for assigning taxi drivers to passengers in New York City that matches current demand patterns to similar historical days, then uses that match to position drivers before orders arrive. On 5.2 million real trips, the method cut average wait times by nearly a third and reduced inequality in wait times across the city.

This matters because it works without neural networks or real-time optimization — just historical data, pattern matching, and simple logistics rules. The practical effect is concrete: a rider waits 6 minutes instead of 8.5 minutes on average. The second effect is structural: if this approach generalizes to other cities (the paper shows it works in Chicago using New York's historical patterns), then ride-hailing companies have a choice between expensive, continuous machine learning systems and cheaper, interpretable, deterministic alternatives that often perform better.