Improved Logistical Management System

Abstract

Disclosed herein are system, method, and computer program product for a transporting of a good. An embodiment operates by receiving a user request for the transporting of the good from a pickup location to a destination location. Thereafter, a corresponding pickup, first intermediate, a second intermediate, and destination node are identified on a pre-generated graph, and transportation edges each relating to a transit cost associated with one of the pickup, first intermediate, second intermediate, and destination locations. Subsequently, a subgraph of of the pre-generated graph comprising the pickup, first intermediate, second intermediate, and destination node, as well as the transportation edges, are generated. Based on the subgraph, Based on subgraph, a preferred route from the pickup location to the destination location having a lowest transit cost for transporting the good is generated.

What is claimed is: 
     
         1 . A computer-implemented method for a transporting of a good, comprising:
 receiving a user request for the transporting of the good from a pickup location to a destination location;   identifying a pickup node, a first intermediate node, a second intermediate node, and a destination node on a pre-generated graph representing the pickup location, a first intermediate location, a second intermediate location, and the destination location, respectively;   determining a plurality of transportation edges that each relate to a transit cost associated with a corresponding one of the pickup location, the first intermediate location, the second intermediate location, and the destination location, wherein each of the plurality of transportation edges correspond to one of the pickup node, the first intermediate node, the second intermediate node, and the destination node such that each of the pickup node, the first intermediate node, the second intermediate node, and the destination node corresponds to the transit cost;   generating a subgraph of the pre-generated graph comprising the pickup node, the first intermediate node, the second intermediate node, the destination node, and the plurality of transportation edges; and   generating a preferred route from the pickup location to the destination location having a lowest transit cost of transporting the good from the pickup location to the destination location based on the subgraph.   
     
     
         2 . The computer-implemented method of  claim 1 , the generating of the pre-generated graph comprising:
 generating the subgraph of the pre-generated graph such that the subgraph is unique to the user request.   
     
     
         3 . The computer-implemented method of  claim 1 , the generating of the preferred route comprising:
 generating the preferred route from a plurality of possible routes such that the preferred route has the lowest transit cost of the plurality of possible routes for transporting the good from the pickup location to the destination route,   wherein the plurality of possible routes includes at least two of:
 a first possible route from the pickup location to the destination location, 
 a second possible route from the pickup location to the first intermediate location to the destination location, 
 a third possible route from the pickup location to the second intermediate location to the destination location, 
 a fourth location from the pickup location to the first intermediate location to the second intermediate location to the destination location, and 
 a fifth location from the pickup location to the second intermediate location to the first intermediate location to the destination location. 
   
     
     
         4 . The computer-implemented method of  claim 1 , the identifying of the pickup node, the first intermediate node, the second intermediate node, and the destination node comprising:
 identifying the pickup node and the destination node on the pre-generated graph;   traversing the pre-generated graph based on the pickup node and the destination node; and   identifying at least two of the first possible path, the second possible path, the third possible path, the fourth possible path, and the fifth possible path for transporting the good from the pickup node to the destination node based on the traversing of the pre-generated graph,   wherein:   the first possible path comprises a first segment connecting the pickup node to the destination node,   the second possible path comprises a second segment connecting the pickup node to the first intermediate node and a third segment connecting the first intermediate node to the destination node,   the third possible path comprises a fourth segment connecting the pickup node to the second intermediate node and a fifth segment connecting the second intermediate node to the destination node,   the fourth possible path comprises the second segment connecting the pickup node to the first intermediate node, a sixth segment connecting the first intermediate node to the second intermediate node, and the fifth segment connecting the second intermediate node to the destination node,   the fifth possible path comprises the fourth segment connecting the pickup node to the second intermediate node, a seventh segment connecting the second intermediate node to the first intermediate node, and the third segment connecting the first intermediate node to the destination node, and   the first path, the second path, the third path, the fourth path, and the fifth correspond to a different one of the plurality of transportation edges.   
     
     
         5 . The computer-implemented method of  claim 4 , wherein a first one and a second one of the first segment, the second segment, the third segment, the fourth segment, the fifth segment, the sixth segment, and the seventh segment comprise a first mode of transportation and a second mode of transportation, respectively. 
     
     
         6 . The computer-implemented method of  claim 5 , wherein the first mode of transportation and the second mode of transportation comprises a vehicle and a flight, respectively. 
     
     
         7 . The computer-implemented method of  claim 4 , wherein:
 the plurality of edges comprises one or more of a tendering edge, a transportation edge, and a cargo edge,   the tendering edge relates to a tendering time for tendering the good at a corresponding one of the pickup location, the first intermediate location, the second intermediate location, and the destination location,   the transportation edge relates to at least one of a transporting time and a transporting cost for transporting the good over a corresponding one of the first path, the second path, the third path, and the fourth path, and   the cargo edge relates at least one of a loading time and an unloading time at a corresponding one of the pickup location, the first intermediate location, the second intermediate location, and the destination location.   
     
     
         8 . The computer-implemented method of  claim 7 , the generating of the preferred route comprising one or more of:
 deriving the tendering time for tendering the good at the corresponding one of the pickup location, the first intermediate location, the second intermediate location, and the destination location;   deriving the at least one of the transporting time and the transporting cost for transporting the good over the corresponding one of the first path, the second path, the third path, and the fourth path;   deriving the at least one of the loading time and the unloading time at a corresponding one of the pickup location, the first intermediate location, the second intermediate location, and the destination location.   
     
     
         9 . The computer-implemented method of  claim 1 , wherein the user request is sent by a second user on behalf of the first user such that the first user is different than the second user and that the first user is seeking receipt of the good. 
     
     
         10 . The computer-implemented method of  claim 1 , wherein the user request is sent by a user seeking receipt of the good 
     
     
         11 . The computer-implemented method of  claim 1 , wherein the user request further comprises a user-selected service type, and wherein the generating of the preferred route is further based on the user-selected service type. 
     
     
         12 . The computer-implemented method of  claim 11 , wherein the user-selected service type is one of a plurality of available service types comprising at least two of a fastest routing, a recommended routing, an economy routing, and a drive-only routing. 
     
     
         13 . The computer-implemented method of  claim 12 , wherein the recommended routing, the economy routing, and the drive-only routing are based on the transit cost. 
     
     
         14 . The computer-implemented method of  claim 13 , wherein the transit cost is unique to a user submitting the user request. 
     
     
         15 . The computer-implemented method of  claim 14 , further comprising:
 determining an actual cost for transporting the good from each of the pickup location, the first intermediate location, the second intermediate location, and the destination location to another one of the pickup location, the first intermediate location, the second intermediate location, and the destination location;   determining a user value of time specific to the user for a period of time for transporting the good from the pickup location to the destination location; and   determining the transit cost based on the actual cost and the user value of time.   
     
     
         16 . The computer-implemented method of  claim 15 , further comprising:
 identifying a plurality of paths from the pickup location to the destination location, wherein each of the plurality of paths comprise at least one segment;   determining a likelihood of approval of one or more segments of the plurality of paths for transporting the good from the pickup location to the destination;   wherein the transit cost is further based on the likelihood of approval.   
     
     
         17 . The computer-implemented method of  claim 11 , the generating of the preferred route from the pickup location to the destination location comprising:
 generating the preferred route from the pickup location to the destination location having the lowest transit cost based on the subgraph using a pathfinding algorithm   
     
     
         18 . The computer-implemented method of  claim 4 , wherein the pathfinding algorithm is A*. 
     
     
         19 . A system, comprising:
 a memory; and   a processor in communication with the memory and configured to:
 receive a user request for the transporting of the good from a pickup location to a destination location; 
 identify a pickup node, a first intermediate node, a second intermediate node, and a destination node on a pre-generated graph representing the pickup location, a first intermediate location, a second intermediate location, and the destination location, respectively; 
 determine a plurality of transportation edges that each relating to a transit cost corresponding to one of the pickup location, the first intermediate location, the second intermediate location, and the destination location, wherein each of the plurality of transportation edges correspond to one of the pickup node, the first intermediate node, the second intermediate node, and the destination node such that each of the pickup node, the first intermediate node, the second intermediate node, and the destination node corresponds to the transit cost; 
 generate a subgraph of the pre-generated graph comprising the pickup node, the first intermediate node, the second intermediate node, the destination node, and the plurality of transportation edges; and 
 generate a preferred route from the pickup location to the destination location having a lowest transit cost of transporting the good from the pickup location to the destination location from the plurality of possible routes based on the subgraph. 
   
     
     
         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 user request for a transporting of a good from a pickup location to a destination location;   identifying a pickup node, a first intermediate node, a second intermediate node, and a destination node on a pre-generated graph representing the pickup location, a first intermediate location, a second intermediate location, and the destination location, respectively;   determining a plurality of transportation edges that each relate to a transit cost for a corresponding one of the pickup location, the first intermediate location, the second intermediate location, and the destination location, wherein each of the plurality of transportation edges correspond to one of the pickup node, the first intermediate node, the second intermediate node, and the destination node such that each of the pickup node, the first intermediate node, the second intermediate node, and the destination node corresponds to the transit cost;   generating a subgraph of the pre-generated graph comprising the pickup node, the first intermediate node, the second intermediate node, the destination node, and the plurality of transportation edges; and   generating a preferred route from the pickup location to the destination location having a lowest transit cost of transporting the good from the pickup location to the destination location based on the subgraph.