Abstract: A system and method includes a computer network system configured to provide output to a plurality of distribution centers for a retailer, an inputting system configured to allow ordering of a quantity of an item from a vendor having a minimum order quantity (MOQ) and vendor pack size for the item, an allocation system configured to allocate the order quantity based on an allocation policy including specific distribution centers and allocation percentages associated with the specific distribution centers, and an inventory allocation tool (IAT) configured to receive the allocation policy, order quantity, MOQ, and vendor pack size as inputs, optimizes distribution of the order quantity among the specific distribution centers so that MOQ and vendor pack size according to the allocation policy are respected, and outputs an executable purchase order over the computer network system for each specific distribution center.

Abstract: A method of reallocating inventory in a fulfillment network is disclosed herein. The fulfillment network can include a plurality of distribution centers. An allocation plan can be created in a one of a variety of different manners, where the allocation plan involves allocating an item to one or more distribution centers in the fulfillment network. Thereafter, the allocation plan can be analyzed for feasibility. If the allocation plan is not feasible, each distribution center in the allocation plan can be analyzed to determine if using the distribution center is feasible. If the distribution center cannot be used, another distribution in the same cluster of distribution centers is examined for feasibility. This process is repeated for each distribution center in the allocation plan. Once an alternative allocation plan has been developed in this manner, items can be allocated. Existing inventory can be taken into account in the allocation plan.

Abstract: A system and method for selecting an deployment of goods for shipping purposes is presented. An affinity network representing the deployment of goods is created. A first and second set of goods in the affinity network are created, the first set of goods representing an initial set of goods to be placed in a first location and the second set of goods representing a set of goods that are constrained to be placed in a second location. An objective function is iteratively operated to determine an optimum deployment of goods between the first location and second location. Other embodiments are disclosed.

Abstract: Various examples of methods and systems for prioritizing identifier in cost-based inventory allocation are described. In one implementation, a method may determine a shipping cost sensitivity of each identifier of a plurality of identifiers of a plurality of items in an inventory, the shipping cost sensitivity of each identifier related to sales volume, billable weight and shipping zone associated with the respective identifier. The method may also rank the plurality of identifiers based at least in part on the shipping cost sensitivity of each identifier. The method may further determine an order of allocation of the inventory of the plurality of items based at least in part on the ranking of the plurality of identifiers.

Abstract: Various examples of methods and systems for prioritizing identifier in cost-based inventory allocation are described. In one implementation, a method may determine a shipping cost sensitivity of each identifier of a plurality of identifiers of a plurality of items in an inventory, the shipping cost sensitivity of each identifier related to sales volume, billable weight and shipping zone associated with the respective identifier. The method may also rank the plurality of identifiers based at least in part on the shipping cost sensitivity of each identifier. The method may further determine an order of allocation of the inventory of the plurality of items based at least in part on the ranking of the plurality of identifiers.

Abstract: A method of reallocating inventory in a fulfillment network is disclosed herein. The fulfillment network can include a plurality of distribution centers. An allocation plan can be created in a one of a variety of different manners, where the allocation plan involves allocating an item to one or more distribution centers in the fulfillment network. Thereafter, the allocation plan can be analyzed for feasibility. If the allocation plan is not feasible, each distribution center in the allocation plan can be analyzed to determine if using the distribution center is feasible. If the distribution center cannot be used, another distribution in the same cluster of distribution centers is examined for feasibility. This process is repeated for each distribution center in the allocation plan. Once an alternative allocation plan has been developed in this maimer, items can be allocated. Existing inventory can be taken into account in the allocation plan.

Abstract: A system and method for selecting an deployment of goods for shipping purposes is presented. An affinity network representing the deployment of goods is created. A first and second set of goods in the affinity network are created, the first set of goods representing an initial set of goods to be placed in a first location and the second set of goods representing a set of goods that are constrained to be placed in a second location. An objective function is iteratively operated to determine an optimum deployment of goods between the first location and second location. Other embodiments are disclosed.

Abstract: A system and method includes a computer network system configured to provide output to a plurality of distribution centers for a retailer, an inputting system configured to allow ordering of a quantity of an item from a vendor having a minimum order quantity (MOQ) and vendor pack size for the item, an allocation system configured to allocate the order quantity based on an allocation policy including specific distribution centers and allocation percentages associated with the specific distribution centers, and an inventory allocation tool (IAT) configured to receive the allocation policy, order quantity, MOQ, and vendor pack size as inputs, optimizes distribution of the order quantity among the specific distribution centers so that MOQ and vendor pack size according to the allocation policy are respected, and outputs an executable purchase order over the computer network system for each specific distribution center.

Abstract: Various examples of methods and systems for prioritizing identifier in cost-based inventory allocation are described. In one implementation, a method may determine a shipping cost sensitivity of each identifier of a plurality of identifiers of a plurality of items in an inventory, the shipping cost sensitivity of each identifier related to sales volume, billable weight and shipping zone associated with the respective identifier. The method may also rank the plurality of identifiers based at least in part on the shipping cost sensitivity of each identifier. The method may further determine an order of allocation of the inventory of the plurality of items based at least in part on the ranking of the plurality of identifiers.

Abstract: A method of limiting cross-channel splits in a supply chain network based at least in part on an additional distinct item capacity of a first channel. The method can include determining a target order set from historical order data, which can include orders each having at least one first item that was fulfilled from the first channel and at least one second item that was fulfilled from a second channel in the supply chain network that is different from the first channel. The method also can include determining, for each order of the target order set, a non-owned item combination, which can include distinct items that were not fulfilled from the first channel when the order was fulfilled. The method further can include determining a non-owned item combination set and a split item set. The method also can include determining, for each of the non-owned item combinations, a combination profit.

Abstract: A computer-implemented method is disclosed for optimizing a flow network. In the method, a computer system may obtain first data characterizing supply sites, demand sites, and lanes of a distribution network. The computing system may also obtain second data characterizing supply and demand for an item distributed within the distribution network. Using the first and second data, a computer system may determine a maximum possible flow of the item within the distribution network. Subsequently, the computer system may use the maximum possible flow as a benchmark in determining which lanes of the distribution network are required to achieve the maximum possible flow and which lanes of the distribution network are redundant lanes. From among a remaining set of required, non-redundant lanes, a computer system may select a lowest cost solution for achieving the maximum possible flow.