Abstract: The disclosed computer-implemented method may include (i) receiving, from a transportation requestor device, a request for transportation that comprises a transportation stop at a location next to a street, (ii) matching, by a dynamic transportation matching system, the transportation requestor device with a transportation provider, and (iii) improving, by the dynamic transportation matching system, a value of fulfilling the request by (a) determining that a near side of the street is closer to the location of the transportation stop than a far side of the street, (b) mapping, based on the determination that the near side of the street is closer to the location of the transportation stop, a driving route that traverses the street, and (c) directing the transportation provider to fulfill the request for transportation by traversing the driving route. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method may include (i) receiving, from a transportation requestor device, a request for transportation that comprises a transportation stop at a location next to a street, (ii) matching, by a dynamic transportation matching system, the transportation requestor device with a transportation provider, and (iii) improving, by the dynamic transportation matching system, a value of fulfilling the request by (a) determining that a near side of the street is closer to the location of the transportation stop than a far side of the street, (b) mapping, based on the determination that the near side of the street is closer to the location of the transportation stop, a driving route that traverses the street, and (c) directing the transportation provider to fulfill the request for transportation by traversing the driving route. Various other methods, systems, and computer-readable media are also disclosed.

Abstract: The disclosed computer-implemented method may include (i) receiving, by a dynamic transportation matching system, a request for transportation between initial waypoints, (ii) calculating, by the dynamic transportation matching system, a value metric for an initial driving route between the initial waypoints (iii) calculating a value metric for a walk-enabled driving route that comprises at least one alternate waypoint that is within a predetermined walking range of one of the initial waypoints, and (iv) improving, by the dynamic transportation matching system, a value of fulfilling the request for transportation by determining that a difference between the value metric of the walk-enabled driving route and the value metric of the initial driving route satisfies a walking-value threshold and selecting, based on the determination that the difference satisfies the walking-value threshold, the walk-enabled driving route for fulfilling the request for transportation.

Abstract: The present disclosure relates to systems, non-transitory computer-readable media, and methods for selectively coalescing stop locations of route options in a dynamic transportation matching system. In one or more embodiments, the coalescing controller system generates route scores for driving route options, including route scores for an optimal non-coalesced driving route option and a coalesced driving route option. In some embodiments, the route score can include a driving score, a walking score, and a coalescing factor. Based on the route scores, the coalescing controller system can determine to coalesce stop locations. For example, if the route score of the coalesced driving route option is lower than the non-coalesced driving route option, the coalescing controller system can determine to coalesce stop locations in accordance with the coalesced driving route option.