|
|
|
|
|
by petra
3584 days ago
|
|
Not choosing optimal routes would lead to a more expensive service, which is critical for a commodity. As for routes only having 4 stops - sure, but that's after you chosen which users will drive in the same car/trip, which is hard in itself. BTW the dial-a-ride problem is quite similar to the ridesharing problem, and the complexity there is O(number_of_pickup_and_drop_points^2 ) [1] [1]https://www.itu.dk/people/pagh/CAOS/DARP.pdf - altough it's a bit old, so maybe results have improved since. |
|
Also, this particular problem is much easier than you surmise. The problem statement isn't a set of millions of cars sitting in particular locations with a set of millions of riders with particular sources and destinations and matching them and ordering routes to minimize fuel usage or median rider travel time. The problem is of hundreds of nearby cars traveling existing routes and matching a single new rider with a particular source and destination to one of those cars. There is a secondary problem of where to send empty cars that is more interesting.