Optimizing service requests in transport supply-constrained sub-regions

Abstract

A system can implement a delivery service for a service region by monitoring, for each respective sub-region of the service region, supply conditions corresponding to transport providers available to deliver menu items from menu item suppliers to requesting users. When the supply conditions have dropped below the equilibrium threshold for a respective sub-region, the system can initiate a supply-constrained mode for the respective sub-region in which the system inputs each respective menu item request received, corresponding to a delivery location within the respective sub-region, into a queue, and dynamically determines a fulfillment probability for the respective menu item request. When the fulfillment probability of the respective menu item request exceeds a fulfillment threshold, the system can transmit the respective menu item request to a corresponding menu item supplier for preparation of a corresponding menu item and coordinate delivery of the corresponding menu item to the requesting user.

1 .- 20 . (canceled) 
     
     
         21 . A computing system comprising:
 one or more processors; and   one or more memories storing instructions that are executable by the one or more processors to cause the computing system to perform operations comprising:
 accessing, for at least one respective sub-region of a service region, supply conditions corresponding to one or more transport providers available to deliver one or more menu items from one or more menu item suppliers to one or more users; 
 determining that the supply conditions for the respective sub-region have dropped below an equilibrium threshold; 
 in response to determining that the supply conditions have dropped below the equilibrium threshold for the respective sub-region, determining a fulfillment probability value for a respective menu item associated with a respective user; 
 based on the fulfillment probability value exceeding a fulfillment threshold, transmitting a respective menu item request to a respective menu item supplier for preparation of the respective menu item; and 
 coordinating delivery of the respective menu item to the respective user. 
   
     
     
         22 . The computing system of  claim 21 , wherein determining the fulfillment probability value comprises determining a probability that the respective user will cancel the respective menu item request. 
     
     
         23 . The computing system of  claim 21 , wherein determining the fulfillment probability value comprises determining a probability that a transport provider will become available to deliver the respective menu item to the respective user prior to the respective user canceling the respective menu item request. 
     
     
         24 . The computing system of  claim 21 , wherein determining that the supply conditions for the respective sub-region have dropped below the equilibrium threshold comprises determining a transport supply forecast for the respective sub-region based on historical data. 
     
     
         25 . The computing system of  claim 21 , wherein determining the fulfillment probability value for the respective menu item associated with the respective user comprises:
 obtaining at least one of: location data associated with the one or more transport providers within the respective sub-region, status data associated with the one or more transport providers, location data associated with the one or more respective users, or location data associated with the one or more menu item suppliers;   accessing a predictive model; and   determining the fulfillment probability value based on the predictive model and at least one of: the location data associated with the one or more transport providers within the respective sub-region, the status data associated with the one or more transport providers, the location data associated with the one or more respective users, or the location data associated with the one or more menu item suppliers.   
     
     
         26 . The computing system of  claim 21 , wherein determining the fulfillment probability value for the respective menu item associated with the respective user comprises:
 associating each respective menu item request in a queue with a timer; and   monitoring the timer to determine whether the timer exceeds an expiration time threshold.   
     
     
         27 . The computing system of  claim 21 , wherein determining the fulfillment probability value for the respective menu item associated with the respective user comprises:
 accessing data associated with the respective user, wherein the data associated with the respective user comprises at least one of: a cancelation history of the respective user and a service utilization history of the respective user.   
     
     
         28 . The computing system of  claim 21 , wherein coordinating the delivery of the respective menu item to the respective user comprises transmitting a delivery invitation to a computing device associated with a respective transport provider. 
     
     
         29 . A computer-implemented method comprising:
 accessing, for a respective sub-region of a service region, a supply condition corresponding to one or more transport providers available to deliver one or more menu items from one or more menu item suppliers;   determining that the supply condition for the respective sub-region have dropped below an equilibrium threshold;   in response to determining that the supply condition has dropped below the equilibrium threshold for the respective sub-region, determining a fulfillment probability value for a respective menu item associated with a respective user;   determining a comparison between the fulfillment probability value and a threshold;   based on the comparison of the fulfillment probability value and the threshold, determining an action associated with the respective menu item; and   transmitting, over a network, data indicative of the action associated with the respective menu item.   
     
     
         30 . The computer-implemented method of  claim 29 , wherein the threshold is a fulfillment threshold, and wherein the comparison between the fulfillment probability value and the threshold indicates the fulfillment probability value exceeds the fulfillment threshold, and
 wherein the action associated with the respective menu item comprises generating a respective menu item request for preparation of the respective menu item, and   wherein transmitting the data indicative of the action associated with the respective menu item comprises transmitting the respective menu item request to a respective menu item supplier for preparation of the respective menu item.   
     
     
         31 . The computer-implemented method of  claim 30 , further comprising coordinating delivery of the respective menu item to the respective user. 
     
     
         32 . The computer-implemented method of  claim 29 , wherein the threshold is a cancelation threshold, and wherein the comparison between the fulfillment probability value and the threshold indicates the fulfillment probability value is below the cancelation threshold, and wherein the action associated with the respective menu item comprises canceling the respective menu item request for the respective menu item. 
     
     
         33 . The computer-implemented method of  claim 32 , wherein transmitting the data indicative of the action associated with the respective menu item comprises transmitting a cancelation notification to a computing device of the respective user. 
     
     
         34 . The computer-implemented method of  claim 33 , further comprising transmitting a mitigative token to the computing device of the respective user. 
     
     
         35 . The computer-implemented method of  claim 29 , wherein the respective menu item comprises food. 
     
     
         36 . The computer-implemented method of  claim 29 , wherein the one or more menu item suppliers comprise one or more restaurants. 
     
     
         37 . One or more non-transitory computer-readable medium storing instructions that are executable by one or more processors to perform operations comprises:
 accessing, for a respective sub-region of a service region, a supply condition corresponding to one or more transport providers available to deliver one or more menu items from one or more menu item suppliers;   determining that the supply condition for the respective sub-region has dropped below an equilibrium threshold;   in response to determining that the supply conditions have dropped below the equilibrium threshold for the respective sub-region, determining a fulfillment probability value for a respective menu item associated with a respective user; and   based on the fulfillment probability value exceeding a fulfillment threshold, transmitting a respective menu item request to a respective menu item supplier for preparation of the respective menu item.   
     
     
         38 . The one or more non-transitory computer-readable medium of  claim 37 , wherein determining the fulfillment probability value comprises determining a probability that the respective user will cancel the respective menu item request. 
     
     
         39 . The one or more non-transitory computer-readable medium of  claim 37 , wherein determining the fulfillment probability value comprises determining a probability that a transport provider will become available to deliver the respective menu item to the respective user prior to the respective user canceling the respective menu item request. 
     
     
         40 . The one or more non-transitory computer-readable medium of  claim 37 , wherein the operations further comprise coordinating delivery of the respective menu item to the respective user.