System and method for generating predictions for unit allocation in a materials processing network
First Claim
1. A system, comprising:
- one or more hardware processors; and
a non-transitory memory coupled to the one or more hardware processors, wherein the non-transitory memory stores program instructions executable by the one or more hardware processors to implement a capacity planner configured to;
define a model comprising, for each of a plurality of discrete periods of time;
a corresponding representation of a fulfillment network that includes one or more model components that represent multiple fulfillment centers configured to process received inventory items for subsequent fulfillment of customer orders of the inventory items,one or more constraints that are characteristic of ones of the fulfillment centers or characteristic of the inventory items, andlogic for determining efficient flows of the inventory items within the fulfillment network during that discrete period of time, wherein the logic comprises one or more algorithms associated with respective ones of the one or more model components of the representation, and wherein the multiple fulfillment centers of the fulfillment network are maintained by a same product distributor;
in order to determine one or more particular efficient flows of the inventory items within the fulfillment network for a particular period of time, wherein at least some of the inventory items flow from one or more fulfillment centers within the fulfillment network to one or more other fulfillment centers within the fulfillment network;
determine one or more of said discrete periods of time corresponding to representations of the model required to determine said one or more particular efficient flows;
discard, based on the determined one or more discrete periods of time, one or more model components that are no longer needed for the determination of the one or more efficient flows, wherein the discarded model components correspond to other ones of the discrete periods of time, wherein based at least in part on the discarded model components the system does not need memory for storing the entire graph, and wherein memory associated with the discarded one or more model components is made available based at least in part on the discard;
determine an order in which to perform algorithms associated with one or more of the remaining model components based at least in part on interdependencies between the algorithms; and
evaluate the logic of the representations based at least in part on the determined order of the algorithms and without evaluating the discarded one or more components of the model corresponding to the other ones of the discrete periods of time; and
specify a capacity plan based at least in part on said determination of one or more particular efficient flows of the inventory items within the fulfillment network for the particular period of time, wherein said capacity plan comprises predicted allocations of inventory items among the fulfillment centers of the fulfillment network, estimated outbound shipment costs for the fulfillment network, or a recommended topology for the fulfillment network;
wherein the program instructions are further executable by the one or more hardware processors to, in accordance with the specified capacity plan, either;
cause inventory to be stocked among the fulfillment centers of the fulfillment network, or cause implementation of the recommended topology of the fulfillment network.
1 Assignment
0 Petitions
Accused Products
Abstract
Various embodiments of a system and method for generating predictions for unit allocation in a materials processing network are described. Various embodiments may include a capacity planner for defining a model including, for each of a plurality of discrete periods of time, a corresponding representation of a materials processing network including materials handling facilities, constraints associated with ones of the materials handling facilities, and logic for determining efficient flows of materials within the materials processing network during that discrete period of time. In order to determine efficient flows of materials within the materials processing network for a particular period of time, the capacity planner may determine the discrete periods of time corresponding to representations of the model required to determine the one or more efficient flows, and evaluate the logic of the those representations without evaluating logic of representations of the model corresponding to other discrete periods of time.
33 Citations
27 Claims
-
1. A system, comprising:
-
one or more hardware processors; and a non-transitory memory coupled to the one or more hardware processors, wherein the non-transitory memory stores program instructions executable by the one or more hardware processors to implement a capacity planner configured to; define a model comprising, for each of a plurality of discrete periods of time; a corresponding representation of a fulfillment network that includes one or more model components that represent multiple fulfillment centers configured to process received inventory items for subsequent fulfillment of customer orders of the inventory items, one or more constraints that are characteristic of ones of the fulfillment centers or characteristic of the inventory items, and logic for determining efficient flows of the inventory items within the fulfillment network during that discrete period of time, wherein the logic comprises one or more algorithms associated with respective ones of the one or more model components of the representation, and wherein the multiple fulfillment centers of the fulfillment network are maintained by a same product distributor; in order to determine one or more particular efficient flows of the inventory items within the fulfillment network for a particular period of time, wherein at least some of the inventory items flow from one or more fulfillment centers within the fulfillment network to one or more other fulfillment centers within the fulfillment network; determine one or more of said discrete periods of time corresponding to representations of the model required to determine said one or more particular efficient flows; discard, based on the determined one or more discrete periods of time, one or more model components that are no longer needed for the determination of the one or more efficient flows, wherein the discarded model components correspond to other ones of the discrete periods of time, wherein based at least in part on the discarded model components the system does not need memory for storing the entire graph, and wherein memory associated with the discarded one or more model components is made available based at least in part on the discard; determine an order in which to perform algorithms associated with one or more of the remaining model components based at least in part on interdependencies between the algorithms; and evaluate the logic of the representations based at least in part on the determined order of the algorithms and without evaluating the discarded one or more components of the model corresponding to the other ones of the discrete periods of time; and specify a capacity plan based at least in part on said determination of one or more particular efficient flows of the inventory items within the fulfillment network for the particular period of time, wherein said capacity plan comprises predicted allocations of inventory items among the fulfillment centers of the fulfillment network, estimated outbound shipment costs for the fulfillment network, or a recommended topology for the fulfillment network; wherein the program instructions are further executable by the one or more hardware processors to, in accordance with the specified capacity plan, either;
cause inventory to be stocked among the fulfillment centers of the fulfillment network, or cause implementation of the recommended topology of the fulfillment network. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9)
-
-
10. A computer-implemented method, comprising:
performing, by a capacity planner implemented via one or more computing devices comprising one or more hardware processors and non-transitory memory; creating, by the capacity planner, a model comprising, for each of a plurality of discrete periods of time; a corresponding representation of a fulfillment network that includes one or more model components that represent multiple fulfillment centers configured to process received inventory items for subsequent fulfillment of customer orders of the inventory items, one or more constraints that are characteristic of ones of the fulfillment centers or characteristic of the inventory items, and logic for determining efficient flows of the inventory items within the fulfillment network during that discrete period of time, wherein the logic comprises one or more algorithms associated with respective ones of the one or more model components of the representation, and wherein the multiple fulfillment centers of the fulfillment network are maintained by a same product distributor; determining, by the capacity planner, one or more particular efficient flows of the inventory items within the fulfillment network for a particular period of time, wherein at least some of the inventory items flow from one or more fulfillment centers within the fulfillment network to one or more other fulfillment centers within the fulfillment network, and wherein said determining one or more particular efficient flows comprises; determining one or more of said discrete periods of time corresponding to representations of the model required to determine said one or more particular efficient flows; discarding, based on the determined one or more discrete periods of time, one or more model components that are no longer needed for the determination of the one or more efficient flows, wherein the discarded model components correspond to other ones of the discrete periods of time, wherein based at least in part on the discarded model components the system does not need memory for storing the entire graph, and wherein memory associated with the discarded one or more model components is made available based at least in part on the discarding; determining an order in which to perform algorithms associated with one or more of the remaining model components based at least in part on interdependencies between the algorithms and evaluating the logic of the representations based at least in part on the determined order of the algorithms and without evaluating the discarded one or more model components of the model corresponding to the other ones of the discrete periods of time; wherein said creating and said determining one or more particular efficient flows are performed using one or more computer systems; specifying, by the capacity planner, a capacity plan based at least in part on said determining one or more particular efficient flows of the inventory items within the fulfillment network for a particular period of time, wherein said capacity plan comprises predicted allocations of inventory items among the fulfillment centers of the fulfillment network, estimated outbound shipment costs for the fulfillment network, or a recommended topology for the fulfillment network; and in accordance with the specified capacity plan;
causing inventory to be stocked among the fulfillment centers of the fulfillment network, or causing implementation of the recommended topology of the fulfillment network.- View Dependent Claims (11, 12, 13, 14, 15, 16, 17, 18)
-
19. A non-transitory computer-readable storage medium storing program instructions computer-executable by one or more hardware processors to implement a capacity planner configured to:
-
define a model comprising, for each of a plurality of discrete periods of time; a corresponding representation of a fulfillment network that includes one or more model components that represent multiple fulfillment centers configured to process received inventory items for subsequent fulfillment of customer orders of the inventory items, one or more constraints that are characteristic of ones of the fulfillment centers or characteristic of the inventory items, and logic for determining efficient flows of the inventory items within the fulfillment network during that discrete period of time, wherein the logic comprises one or more algorithms associated with respective ones of the one or more model components of the representation, and wherein the multiple fulfillment centers of the fulfillment network are maintained by a same product distributor; in order to determine one or more particular efficient flows of the inventory items within the fulfillment network for a particular period of time, wherein at least some of the inventory items flow from one or more fulfillment centers within the fulfillment network to one or more other fulfillment centers within the fulfillment network; determine one or more of said discrete periods of time corresponding to representations of the model required to determine said one or more particular efficient flows; discard, based on the determined one or more discrete periods of time, one or more model components that are no longer needed for the determination of the one or more efficient flows, wherein the discarded model components correspond to other ones of the discrete periods of time wherein based at least in part on the discarded model components the system does not need memory for storing the entire graph, and wherein memory associated with the discarded one or more model components is made available based at least in part on the discard; determine an order in which to perform algorithms associated with one or more of the remaining model components based at least in part on interdependencies between the algorithms; and evaluate the logic of the representations based at least in part on the determined order of the algorithms and without evaluating the discarded one or more components of the model corresponding to the other ones of the discrete periods of time; and specify a capacity plan based at least in part on said determination of one or more particular efficient flows of the inventory items within the fulfillment network for the particular period of time, wherein said capacity plan comprises predicted allocations of inventory items among the fulfillment centers of the fulfillment network, estimated outbound shipment costs for the fulfillment network, or a recommended topology for the fulfillment network; wherein the program instructions are further computer-executable by one or more hardware processors to, in accordance with the specified capacity plan, either;
cause inventory to be stocked among the fulfillment centers of the fulfillment network, or cause implementation of the recommended topology of the fulfillment network. - View Dependent Claims (20, 21, 22, 23, 24, 25, 26, 27)
-
Specification