Logistical Management System

Abstract

Disclosed herein are system, method, and computer program product embodiments for selecting a particular eligible transporter for transporting a first good for a first job. An embodiment operates by receiving a request for transporting the good from a pickup location to a delivery location. Thereafter, eligible transporters for transporting the good from the pickup location to a first intermediate location or the delivery location (option one), or from the first intermediate location to a second intermediate location or the delivery location (option two), are identifier. Subsequently, for each eligible transporter, an estimated completion time (ECT) for the transporting of the first good is derived. Based on the ECT for each eligible transporter, a request to transport the good is sent to one of the eligible transporters.

What is claimed is: 
     
         1 . A computer-implemented method for selecting a particular eligible transporter for transporting a first good for a first job, comprising:
 receiving a request for the transporting of the first good for the first job from a pickup location to a delivery location, wherein the request corresponds to one or both of a first intermediate location and a second intermediate location;   identifying a plurality of eligible transporters for transporting the first good from the pickup location to the first intermediate location or the delivery location, or from the first intermediate location to the second intermediate location or the delivery location;   deriving, based on a trained transporter model, an estimated completion time (ECT) for the transporting of the first good from the pickup location to the first intermediate location or the delivery location, or from the first intermediate location to the second intermediate location or the delivery location; and   sending a request to the particular eligible transporter of the plurality of eligible transporters for the transporting of the first good from the pickup location to the first intermediate location or the delivery location, or from the first intermediate location to the second intermediate location or the delivery location, based on the particular eligible transporter having a lowest ECT of each of the plurality of eligible transporters.   
     
     
         2 . The computer-implemented method of  claim 1 , the identifying of the eligible transporters comprising:
 identifying a plurality of available transporters within a searchable distance from the pickup location or the first intermediate location; and   identifying the plurality of eligible transporters from the plurality of available transporters based on the first good,   wherein the plurality of eligible transporters comprise one or more of a certification for transporting the first good and a transportation carrier suitable for transporting the first good.   
     
     
         3 . The computer-implemented method of  claim 1 , further comprising:
 determining that the plurality of eligible transporters meet or exceed a predetermined minimum number of eligible transporters,   wherein the deriving of the estimated completion of time is based on the plurality of eligible transporters meeting or exceeding the predetermined minimum number of eligible transporters.   
     
     
         4 . The computer-implemented method of  claim 1 , wherein:
 the ECT relates to one or more of an estimated transport time, an estimated tender time, and an estimated acceptance time,   the estimated transport time relates to an estimated amount of time for transporting the first good from the pickup location to the first intermediate location or the delivery destination, or from the first intermediate location to the second intermediate location or the delivery destination, the estimated tender time relates to an estimated amount of time for tendering the first good at the first intermediate location, the second intermediate location, or the destination location, and   the estimated transporter acceptance time relates to an estimated amount of time for each of the plurality of eligible transporters to accept a solicitation for the transporting of the good.   
     
     
         5 . The computer-implemented method of  claim 4 , the deriving of the ECT comprising one or more of:
 deriving, by a transportation time model, the estimated transport time for each of the plurality of eligible transporters;   deriving, by a location time model, the estimated tendering time for each of the plurality of eligible transporters; and   deriving, by a transporter acceptance time mode, the estimate transporter acceptance time for each of the plurality of eligible transporters,   wherein the trained transporter model comprises one or more of the transportation time model, the location time model, and the transporter acceptance time model.   
     
     
         6 . The computer-implemented method of  claim 5 , wherein the estimated transporter acceptance time for each of the plurality of eligible transporters is based on a likelihood of each of the plurality of eligible transporters accepting a solicitation for transporting the first good. 
     
     
         7 . The computer-implemented method of  claim 5 , the deriving of the ECT further comprising: deriving, by a transporter acceptance chance model, the likelihood of each of the plurality of eligible transporters accepting the solicitation for transporting the first good. 
     
     
         8 . The computer-implemented method of  claim 7 , wherein the likelihood of each of the plurality of eligible transporters accepting the solicitation for transporting the first good relates to historical data of each of the plurality of eligible transporters accepting the solicitation for transporting the first good. 
     
     
         9 . The computer-implemented method of  claim 1 , wherein the particular eligible transporter is identified as one of the plurality of eligible transporters after being assigned transport of a =second good of a second job. 
     
     
         10 . The computer-implemented method of  claim 1 , the deriving of the ECT for the particular transporter comprising:
 deriving the ECT for each of a first plurality of possible sequence of events relating to transporting the first good and the second good; and   selecting a lowest ECT of a particular event of the first plurality of possible sequence of events,   wherein:   the first plurality of possible sequence of events comprises picking up the first good, picking up the second good, delivering the first good, and delivering the second good, and   the lowest ECT for the particular event of the first plurality of possible events for the particular transporter is less than the ECT for a second transporter of the plurality of transporters.   
     
     
         11 . The computer-implemented method of  claim 10 , wherein the particular event comprises picking up the second good prior to picking up the first good. 
     
     
         12 . The computer-implemented method of  claim 10 , wherein when the second transporter is identified as one of the plurality of eligible transporters, the first job would have been a first assigned job to the second transporter. 
     
     
         13 . The computer-implemented method of  claim 10 , wherein when the second transporter is identified as one of the plurality of eligible transporters, the second transporter was previously assigned a third job to transport a third good. 
     
     
         14 . The computer-implemented method of  claim 13 , the deriving of the ECT for the second transporter comprising:
 deriving the ECT for each of a second plurality of possible sequence of events relating to transporting the first good and the third good; and   selecting a lowest ECT for a particular event of the second plurality of possible sequence of events,   wherein:   the second plurality of possible sequence of events comprises picking up the first good, picking up the third good, delivering the first good, and delivering the third good, and   the lowest ECT for the particular event of the first plurality of possible events for the particular transporter is less than the lowest ECT for the particular event of the plurality of possible sequence events for the second transporter.   
     
     
         15 . The computer-implemented method of  claim 14 , wherein:
 the lowest ECT for the particular transporter relates to completing the first job prior to completing the second job.   
     
     
         16 . The computer-implemented method of  claim 15 , wherein the ECT for the particular transporter to complete the first job and the second job is greater than the ECT for the second transporter to complete the first job and the second job. 
     
     
         17 . The computer-implemented method of  claim 10 , further comprising:
 determining a failure of the particular transporter to respond to the request within a predetermined period of time,   wherein the identifying of the plurality of eligible transporters is performed again based on the failure of the particular transporter to respond to the request.   
     
     
         18 . The computer-implemented method of  claim 17 , wherein after the failure of the particular transporter to respond to the request, the particular transporter is considered again as one of the plurality of eligible transporters. 
     
     
         19 . A system, comprising:
 a memory; and   a processor in communication with the memory and configured to:
 receive a request for a transporting of a first good for a first job from a pickup location to a delivery location, wherein the request corresponds to one or both of a first intermediate location and a second intermediate location; 
 identify a plurality of eligible transporters for transporting the first good from the pickup location to the first intermediate location or the delivery location, or from the first intermediate location to the second intermediate location or the delivery location; 
 derive, based on a trained transporter model, an estimated completion time (ECT) for the transporting of the first good from the pickup location to the first intermediate location or the delivery location, or from the first intermediate location to the second intermediate location or the delivery location; and 
 send a request to the particular eligible transporter of the plurality of eligible transporters for the transporting of the first good from the pickup location to the first intermediate location or the delivery location, or from the first intermediate location to the second intermediate location or the delivery location, based on the particular eligible transporter having a lowest ECT of each of the plurality of eligible transporters. 
   
     
     
         20 . A computer-readable storage device having instructions stored thereon, execution of which,
 by a processing device, causes the processing device to perform operations comprising:   receiving a request for a transporting of a first good for a first job from a pickup location to a delivery location, wherein the request corresponds to one or both of a first intermediate location and a second intermediate location;   identifying a plurality of eligible transporters for transporting the first good from the pickup location to the first intermediate location or the delivery location, or from the first intermediate location to the second intermediate location or the delivery location;   deriving, based on a trained transporter model, an estimated completion time (ECT) for the transporting of the first good from the pickup location to the first intermediate location or the delivery location, or from the first intermediate location to the second intermediate location or the delivery location; and   sending a request to the particular eligible transporter of the plurality of eligible transporters for the transporting of the first good from the pickup location to the first intermediate location or the delivery location, or from the first intermediate location to the second intermediate location or the delivery location, based on the particular eligible transporter having a lowest ECT of each of the plurality of eligible transporters.