This is a different problem, because the TSP is about reaching every point in the shortest distance, but in this case you can't just hit every point in any order you want. Each rider is going to want a ride at different times, and each rider is going to make their request at different times, and multiple drivers are going to be available at different times.
You are optimizing for least amount of time riders have to wait, not just for shortest distance driven.
>You are optimizing for least amount of time riders have to wait, not just for shortest distance driven.
Point being though that it's fundamentally a deterministic combinatorial problem. And they have the added benefit in this case of only worrying about prescheduled trips that need to be calculated the day before. It's not trivial, but it's an algorithmic problem that has no need for inductive output.
You are optimizing for least amount of time riders have to wait, not just for shortest distance driven.