Ride chaining
A system for determining a dispatch includes an input interface, a processor, and an output interface. The input interface is to receive a request for a first pickup including a first pickup location and a first destination. The processor is configured to determining a driver to dispatch to the first pickup location. The output interface is to provide a first pickup indication to the driver to go to the first pickup location. The input interface is further to receive a first pickup arrival indication indicating the driver arrived at the first pickup location. The output interface is further to provide a first destination indication indicating to the driver to go to the first destination. The input interface is further to receive a request for a second pickup including a second pickup location and a second destination.
1. A non-transitory computer-readable medium comprising instructions that, when executed by at least one processor, cause a computing device to:
receive, from a first rider client device, a request for a first ride associated with a first route;
receive, from a second rider client device, a request for a second ride associated with a second route;
detect an overlapping route portion comprising a segment of the first route and a segment of the second route;
based on detecting the overlapping route portion, combine the first ride with the second ride by generating a combined route comprising the overlapping route portion; and
send, to a driver client device corresponding to a transportation vehicle, dispatch instructions for the first ride and the second ride that instruct a driver to travel the combined route.
2. The non-transitory computer-readable medium of claim 1 ,
further comprising instructions that, when executed by the at least one processor, cause the computing device to determine that the request for the second ride was received within a predetermined window of time after receiving the request for the first ride,
wherein combining the first ride with the second ride is further based on determining that the request for the second ride was received within the predetermined window of time after receiving the request for the first ride.
3. The non-transitory computer-readable medium of claim 1 , wherein:
the request for the first ride comprises a first pickup location and a first destination location;
the request for the second ride comprises a second pickup location and a second destination location; and
generating the combined route comprises determining an order of the first pickup location, the first destination location, the second pickup location, and the second destination location.
4. The non-transitory computer-readable medium of claim 1 , further comprising instructions that, when executed by the at least one processor, cause the computing device to select the transportation vehicle for dispatch for the first ride before receiving the request for the second ride.
5. The non-transitory computer-readable medium of claim 1 , wherein:
the request for the first ride comprises a first ride sharing acceptability indication;
the request for the second ride comprises a second ride sharing acceptability indication; and
combining the first ride with the second ride is further based on the first ride sharing acceptability indication and the second ride sharing acceptability indication.
6. The non-transitory computer-readable medium of claim 1 ,
further comprising instructions that, when executed by the at least one processor, cause the computing device to determine an amount of overlap between the first route and the second route,
wherein combining the first ride with the second ride is further based on the amount of overlap between the first route and the second route.
7. The non-transitory computer-readable medium of claim 1 , further comprising instructions that, when executed by the at least one processor, cause the computing device to:
determine an amount of overlap between the first route and the second route; and
apply a discount to the first ride and the second ride based on the amount of overlap between the first route and the second route.
8. The non-transitory computer-readable medium of claim 1 , wherein generating the combined route comprises modifying a portion of the first route to include a pickup location associated with the second ride.
9. A method comprising:
receiving, from a first rider client device, a request for a first ride associated with a first route;
receiving, from a second rider client device, a request for a second ride associated with a second route;
detecting an overlapping route portion comprising a segment of the first route and a segment of the second route;
based on detecting the overlapping route portion, combining the first ride with the second ride by generating a combined route comprising the overlapping route portion; and
sending, to a driver client device corresponding to a transportation vehicle, dispatch instructions for the first ride and the second ride that instruct a driver to travel the combined route.
10. The method of claim 9 ,
further comprising determining that the request for the second ride was received within a predetermined window of time after receiving the request for the first ride,
wherein combining the first ride with the second ride is further based on determining that the request for the second ride was received within the predetermined window of time after receiving the request for the first ride.
11. The method of claim 9 , wherein:
the request for the first ride comprises a first pickup location and a first destination location;
the request for the second ride comprises a second pickup location and a second destination location; and
generating the combined route comprises determining an order of the first pickup location, the first destination location, the second pickup location, and the second destination location.
12. The method of claim 9 , further comprising selecting the transportation vehicle for dispatch for the first ride before receiving the request for the second ride.
13. The method of claim 9 , wherein:
the request for the first ride comprises a first ride sharing acceptability indication;
the request for the second ride comprises a second ride sharing acceptability indication; and
combining the first ride with the second ride is further based on the first ride sharing acceptability indication and the second ride sharing acceptability indication.
14. The method of claim 9 ,
further comprising determining an amount of overlap between the first route and the second route,
wherein combining the first ride with the second ride is further based on the amount of overlap between the first route and the second route.
15. The method of claim 9 , further comprising:
determining an amount of overlap between the first route and the second route; and
applying a discount to the first ride and the second ride based on the amount of overlap between the first route and the second route.
16. The method of claim 9 , wherein generating the combined route comprises modifying a portion of the first route to include a pickup location associated with the second ride.
17. A dynamic transportation matching system comprising:
a processor; and
a non-transitory computer readable storage medium comprising computer instructions that, when executed by the processor, causes the dynamic transportation matching system to:
receive, from a first rider client device, a request for a first ride associated with a first route;
receive, from a second rider client device, a request for a second ride associated with a second route;
detect an overlapping route portion comprising a segment of the first route and a segment of the second route;
based on detecting the overlapping route portion, combine the first ride with the second ride by generating a combined route comprising the overlapping route portion; and
send, to a driver client device corresponding to a transportation vehicle, dispatch instructions for the first ride and the second ride that instruct a driver to travel the combined route.
18. The dynamic transportation matching system of claim 17 ,
further comprising instructions that, when executed by the processor, cause the dynamic transportation matching system to determine that the request for the second ride was received within a predetermined window of time after receiving the request for the first ride,
wherein combining the first ride with the second ride is further based on determining that the request for the second ride was received within the predetermined window of time after receiving the request for the first ride.
19. The dynamic transportation matching system of claim 17 , wherein:
the request for the first ride comprises a first pickup location and a first destination location;
the request for the second ride comprises a second pickup location and a second destination location; and
generating the combined route comprises determining an order of the first pickup location, the first destination location, the second pickup location, and the second destination location.
20. The dynamic transportation matching system of claim 17 , further comprising instructions that, when executed by the processor, cause the dynamic transportation matching system to select the transportation vehicle for dispatch for the first ride before receiving the request for the second ride.