CHANNEL ASSORTMENT DECISION ENGINE

摘要

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. The method further can include determining a selected set of the distinct items that maximizes a payoff of the selected set of the distinct items.

主权项

1. A method of limiting cross-channel splits in a supply chain network based at least in part on an additional distinct item capacity (t) of a first channel in the supply chain network, the method being implemented at least partially via execution of computer instructions configured to run at one or more processing modules and configured to be stored at one or more non-transitory memory storage modules, the method comprising:
determining via the one or more processing modules a target order set from historical order data, the target order set comprising 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; determining via the one or more processing modules, for each order of the target order set, a non-owned item combination (C) comprising distinct items (i) that were not fulfilled from the first channel when the order was fulfilled; determining via the one or more processing modules a non-owned item combination set (S) and a split item set (I), wherein each of the non-owned item combinations (C) is a member of the non-owned item combination set (S), and each of the distinct items (i) in each of the non-owned item combinations (C) is a member of the split item set (I); determining via the one or more processing modules, for each of the non-owned item combinations (C), a combination profit (pC); and determining via the one or more processing modules a selected set of the distinct items (T) that maximizes a payoff of the selected set of the distinct items (P(T)), wherein:P(T)=∑C∈SandC⊆TpC,  the selected set of the distinct items (T) is a subset of the split item set (I), and a quantity of the distinct items in the selected set of the distinct items (T) is less than or equal to the additional distinct item capacity (t).