>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 determini

>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.