INTELLIGENTLY CUSTOMIZING A CANCELLATION NOTICE FOR CANCELLATION OF A TRANSPORTATION REQUEST BASED ON TRANSPORTATION FEATURES
The present disclosure relates to systems, non-transitory computer-readable media, and methods for intelligently determining to assess (or not assess) a cancellation penalty and notifying a requestor device of such a penalty in response to either a requestor's selection to cancel a single transportation request for a requestor or a requestor's selection to cancel a shared-transportation request associated with multiple requestors. For example, the disclosed systems can generate conversion probabilities for a requestor reflecting if a cancellation penalty is assessed—and if the cancellation penalty is not assessed—for a cancellation of a transportation request for transport of a lone requestor. Based on the conversion probabilities, the disclosed systems customize a cancellation notice for a requestor device to either include or exclude the cancellation penalty. Additionally, or alternatively, in certain implementations, the disclosed systems generate a transportation efficiency metric for modifying a projected transportation route for a shared transportation to account for a cancellation of a shared-transportation request. Based on the transportation efficiency metric, the disclosed systems customize a cancellation notice for a requestor device to either include or exclude the cancellation penalty.
1 . A system comprising:
at least one processor; and
at least one non-transitory computer-readable storage medium storing instructions that, when executed by the at least one processor, causes the system to:
generate a projected transportation route for shared transport of a first requestor and a second requestor based on a first shared-transportation request and a second shared-transportation request;
generate a transportation efficiency metric reflecting a modification to the projected transportation route associated with cancelling the first shared-transportation request;
based on the transportation efficiency metric, determine whether to assess a cancellation penalty for cancelling the first shared-transportation request; and
in response to an indication of a selection by the first requestor to cancel the first shared-transportation request, provide, for display by a requestor device of the first requestor, a customized cancellation notice based on determining whether to assess the cancellation penalty for cancelling the first shared-transportation request.
2 . The system of claim 1 , further comprising instructions that, when executed by the at least one processor, cause the system to generate the transportation efficiency metric by:
determining a first projected value of a transportation provider transporting the first requestor and the second requestor along the projected transportation route; and
determining a second projected value of transporting the second requestor along an alternative projected transportation route.
3 . The system of claim 2 , wherein the alternative projected transportation route comprises:
a first projected transportation route for the transportation provider transporting the second requestor alone and without the first requestor; or
a second projected transportation route for the transportation provider transporting the second requestor with a third requestor associated with an additional shared-transportation request.
4 . The system of claim 1 , further comprising instructions that, when executed by the at least one processor, cause the system to:
generate a predicted-requestor rating for the first requestor based on a set of transportation features corresponding to the first shared-transportation request; and
provide, for display by the requestor device of the first requestor, the customized cancellation notice based further on the predicted-requestor rating.
5 . The system of claim 4 , wherein the set of transportation features comprises one or more of:
an amount of time for matching the first shared-transportation request with a transportation provider;
a predicted time or a predicted distance of detour for transport of the first requestor to a drop-off location; or
an estimated time of arrival of the transportation provider at a pickup location of the first requestor.
6 . The system of claim 4 , further comprising instructions that, when executed by the at least one processor, cause the system to:
convert the predicted-requestor rating to a routing weight for the projected transportation route based on the transportation features; and
provide, for display by the requestor device of the first requestor, the customized cancellation notice based further on the routing weight.
7 . The system of claim 1 , further comprising instructions that, when executed by the at least one processor, cause the system to:
generate a first conversion probability associated with assessing a cancellation penalty for cancelling the transportation request;
generate a second conversion probability associated with not assessing the cancellation penalty for cancelling the transportation request; and
provide, for display by the requestor device of the first requestor, the customized cancellation notice based further on the first conversion probability and the second conversion probability.
8 . A computer-implemented method comprising:
generating a projected transportation route for shared transport of a first requestor and a second requestor based on a first shared-transportation request and a second shared-transportation request;
generating a transportation efficiency metric reflecting a modification to the projected transportation route associated with cancelling the first shared-transportation request;
based on the transportation efficiency metric, determining whether to assess a cancellation penalty for cancelling the first shared-transportation request; and
in response to an indication of a selection by the first requestor to cancel the first shared-transportation request, providing, for display by a requestor device of the first requestor, a customized cancellation notice based on determining whether to assess the cancellation penalty for cancelling the first shared-transportation request.
9 . The computer-implemented method of claim 8 , further comprising:
generating the transportation efficiency metric by:
determining a first projected value of a transportation provider transporting the first requestor and the second requestor along the projected transportation route; and
determining a second projected value of transporting the second requestor along an alternative projected transportation route.
10 . The computer-implemented method of claim 9 , wherein the alternative projected transportation route comprises:
a first projected transportation route for the transportation provider transporting the second requestor alone and without the first requestor; or
a second projected transportation route for the transportation provider transporting the second requestor with a third requestor associated with an additional shared-transportation request.
11 . The computer-implemented method of claim 8 , further comprising:
generating a predicted-requestor rating for the first requestor based on a set of transportation features corresponding to the first shared-transportation request; and
providing, for display by the requestor device of the first requestor, the customized cancellation notice based further on the predicted-requestor rating.
12 . The computer-implemented method of claim 11 , wherein the set of transportation features comprises one or more of:
an amount of time for matching the first shared-transportation request with a transportation provider;
a predicted time or a predicted distance of detour for transport of the first requestor to a drop-off location; or an estimated time of arrival of the transportation provider at a pickup location of the first requestor.
13 . The computer-implemented method of claim 11 , further comprising:
converting the predicted-requestor rating to a routing weight for the projected transportation route based on the transportation features; and
providing, for display by the requestor device of the first requestor, the customized cancellation notice based further on the routing weight.
14 . The computer-implemented method of claim 8 , further comprising instructions that, when executed by the at least one processor, cause the system to:
generate a first conversion probability associated with assessing a cancellation penalty for cancelling the transportation request;
generate a second conversion probability associated with not assessing the cancellation penalty for cancelling the transportation request; and
provide, for display by the requestor device of the first requestor, the customized cancellation notice based further on the first conversion probability and the second conversion probability.
15 . A non-transitory computer-readable medium comprising instructions that, when executed by at least one processor, causes a computer system to:
generate a projected transportation route for shared transport of a first requestor and a second requestor based on a first shared-transportation request and a second shared-transportation request;
generate a transportation efficiency metric reflecting a modification to the projected transportation route associated with cancelling the first shared-transportation request;
based on the transportation efficiency metric, determine whether to assess a cancellation penalty for cancelling the first shared-transportation request; and
in response to an indication of a selection by the first requestor to cancel the first shared-transportation request, provide, for display by a requestor device of the first requestor, a customized cancellation notice based on determining whether to assess the cancellation penalty for cancelling the first shared-transportation request.
16 . The non-transitory computer-readable medium of claim 15 , further comprising instructions that, when executed by the at least one processor, cause the computer system to generate the transportation efficiency by:
determining a first projected value of a transportation provider transporting the first requestor and the second requestor along the projected transportation route; and
determining a second projected value of transporting the second requestor along an alternative projected transportation route.
17 . The non-transitory computer-readable medium of claim 16 , wherein the alternative projected transportation route comprises:
a first projected transportation route for the transportation provider transporting the second requestor alone and without the first requestor; or
a second projected transportation route for the transportation provider transporting the second requestor with a third requestor associated with an additional shared-transportation request.
18 . The non-transitory computer-readable medium of claim 15 , further comprising instructions that, when executed by the at least one processor, cause the computer system to:
generate a predicted-requestor rating for the first requestor based on a set of transportation features corresponding to the first shared-transportation request; and
provide, for display by the requestor device of the first requestor, the customized cancellation notice based further on the predicted-requestor rating.
19 . The non-transitory computer-readable medium of claim 18 , wherein the set of transportation features comprises one or more of:
an amount of time for matching the first shared-transportation request with a transportation provider;
a predicted time or a predicted distance of detour for transport of the first requestor to a drop-off location; or
an estimated time of arrival of the transportation provider at a pickup location of the first requestor.
20 . The non-transitory computer-readable medium of claim 18 , further comprising instructions that, when executed by the at least one processor, cause the computer system to:
convert the predicted-requestor rating to a routing weight for the projected transportation route based on the transportation features; and
provide, for display by the requestor device of the first requestor, the customized cancellation notice based further on the routing weight.