US2014222491A1PendingUtilityA1
Systems and Methods for Determining Pack Allocations
Est. expiryJan 10, 2031(~4.5 yrs left)· nominal 20-yr term from priority
G06Q 10/087G06Q 10/06315
61
PatentIndex Score
0
Cited by
0
References
0
Claims
Abstract
Systems and methods are provided for determining a distribution of each of a plurality of inner packs to a plurality of stores. Mismatch cost data and product demand data are received for the plurality of stores. A first inner pack quantity for distribution is determined based on the product demand data. A supply difference amount is determined, where the supply difference amount is a difference between the first inner pack quantity and the number of first inner packs available for distribution. A determination is made that adjusting the first inner pack quantity for the particular store based on the supply difference amount would have less effect on mismatch costs than other stores, and the first inner pack quantity is adjusted for the particular store based on the supply difference.
Claims
exact text as granted — not AI-modified1 .- 30 . (canceled)
31 . A computer-program product comprising a non-transitory machine-readable storage medium storing instructions configured to cause a data processing apparatus to perform operations including:
accessing information including:
a value (a) representing an amount of a first variety of a product demanded at a store;
a value (b) representing an amount of a second variety of the product demanded at the store;
a value (c) representing a net amount of the product demanded at the store;
a value (D) representing a pack capacity constraint, the pack capacity constraint specifying a quantity of the product held in individual packs during shipment of the product; and
mismatch cost data representing anticipated costs of oversupplying and anticipated costs of undersupplying units of both the first variety and the second variety of the product;
calculating anticipated cumulative mismatch costs associated with:
shipping an oversupplying quantity of packs in distributing the product to the store, wherein the oversupplying quantity is a ceiling of
c
D
;
and
shipping an undersupplying quantity of packs in distributing the product to the store, wherein the undersupplying quantity is a floor of
c
D
,
wherein calculating the anticipated cumulative mismatch costs includes:
using a heuristic algorithm in defining a first candidate pack configuration associated with shipping the oversupplying quantity of packs and in defining a second candidate pack configuration associated with shipping the undersupplying quantity of packs, wherein the first and second candidate pack configurations specify distinct assortments of the first and second variety of the product within individual packs; and
planning a shipment to include either:
a first shipping arrangement involving the oversupplying quantity of packs filled in accordance with the first candidate pack configuration; or
a second shipping arrangement involving the undersupplying quantity of packs filled in accordance with the second candidate pack configuration.
32 . The computer-program product of claim 31 , wherein using the heuristic algorithm in defining the first candidate pack configuration includes:
using a mismatch cost minimization heuristic in determining a quantity of the first variety and in determining a quantity of the second variety, wherein determining the quantity of the first variety includes selecting from amongst two candidate numbers, based on the costs of oversupplying and undersupplying units of the first variety of the product, wherein a ceiling of
aD
c
and a floor of
aD
c
are the two candidate numbers.
33 . The computer-program product of claim 32 , wherein planning the shipment includes selecting either the first or second shipping arrangement based on the anticipated cumulative mismatch costs.
34 . The computer-program product of claim 33 , wherein, in selecting either the first or second shipping arrangement, the first shipping arrangement is selected, and wherein planning the shipment further includes:
calculating a largest integer (x) for which:
a product (z) of x and the quantity of the first variety is less than a; and
a product (y) of x and the quantity of the second variety is less than b;
determining a difference (p) between a and z; determining a difference (q) between b and y; defining a complementary pack configuration including a number (m) of the first variety of the product, and a number (n) of the second variety of the product, wherein defining includes determining m based on p, and determining n based on q,
and wherein planning the shipment is done such that the complementary pack is used in the shipment.
35 . The method of claim 32 , wherein the mismatch cost minimization heuristic includes a rule followed in selecting from amongst the two candidate numbers.
36 . The computer-program product of claim 32 , wherein selecting from amongst the two candidate numbers is further based on a first hypothetical number of mismatch units of the first variety, wherein the first hypothetical number of mismatch units is an absolute difference between c and:
a product of one of the two candidate numbers and the oversupplying quantity.
37 . The computer-program product of claim 36 , wherein selecting from amongst the two candidate numbers is further based on a second hypothetical number of mismatch units of the first variety, wherein the second hypothetical number of mismatch units is an absolute differences between c and:
a product of another of the two candidate numbers and the oversupplying quantity.
38 . The computer-program product of claim 32 , wherein the quantity of the second variety is a number selected, from amongst two other candidate numbers, based on the costs of oversupplying and costs of undersupplying units of the second variety of the product, wherein a ceiling of
bD
c
and a floor of
bD
c
are the two candidate numbers.
39 . The computer-program product of claim 32 , wherein the quantity of the first variety of the product demanded at the store is greater than the quantity of the second variety of the product demanded at the store, and wherein using the greedy algorithm in defining the first candidate pack configuration further includes determining the quantity of the first variety before determining the quantity of the second variety.
40 . The computer-program product of claim 32 , wherein using the heuristic algorithm in defining the second candidate pack configuration includes:
using the mismatch cost minimization heuristic in determining another quantity of the first variety and in determining another quantity of the second variety, wherein the another quantity of the first variety is a number selected from amongst two candidate numbers, based on the costs of oversupplying and the costs of undersupplying units of the first variety of the product, wherein the two candidate numbers include a ceiling and a floor of
aD
c
.
41 . A computer-implemented method, comprising:
accessing information on a computing device, the information including:
a value (a) representing an amount of a first variety of a product demanded at a store;
a value (b) representing an amount of a second variety of the product demanded at the store;
a value (c) representing a net amount of the product demanded at the store;
a value (D) representing a pack capacity constraint, the pack capacity constraint specifying a quantity of the product held in individual packs during shipment of the product; and
mismatch cost data representing anticipated costs of oversupplying and anticipated costs of undersupplying units of both the first variety and the second variety of the product;
calculating anticipated cumulative mismatch costs associated with:
shipping an oversupplying quantity of packs in distributing the product to the store, wherein the oversupplying quantity is a ceiling of
c
D
;
and
shipping an undersupplying quantity of packs in distributing the product to the store, wherein the undersupplying quantity is a floor of
c
D
,
wherein calculating the anticipated cumulative mismatch costs includes:
using a heuristic algorithm in defining a first candidate pack configuration associated with shipping the oversupplying quantity of packs and in defining a second candidate pack configuration associated with shipping the undersupplying quantity of packs, wherein the first and second candidate pack configurations specify distinct assortments of the first and second variety of the product within individual packs; and
planning a shipment to include either:
a first shipping arrangement involving the oversupplying quantity of packs filled in accordance with the first candidate pack configuration; or
a second shipping arrangement involving the undersupplying quantity of packs filled in accordance with the second candidate pack configuration.
42 . The method of claim 41 , wherein using the heuristic algorithm in defining the first candidate pack configuration includes:
using a mismatch cost minimization heuristic in determining a quantity of the first variety and in determining a quantity of the second variety, wherein determining the quantity of the first variety includes selecting from amongst two candidate numbers, based on the costs of oversupplying and undersupplying units of the first variety of the product, wherein a ceiling of
aD
c
and a floor of
aD
c
are the two candidate numbers.
43 . The method of claim 42 , wherein planning the shipment includes selecting either the first or second shipping arrangement based on the anticipated cumulative mismatch costs.
44 . The method of claim 43 , wherein, in selecting either the first or second shipping arrangement, the first shipping arrangement is selected, and wherein planning the shipment further includes:
calculating a largest integer (x) for which:
a product (z) of x and the quantity of the first variety is less than a; and
a product (y) of x and the quantity of the second variety is less than b;
determining a difference (p) between a and z; determining a difference (q) between b and y; defining a complementary pack configuration including a number (m) of the first variety of the product, and a number (n) of the second variety of the product, wherein defining includes determining m based on p, and determining n based on q,
and wherein planning the shipment is done such that the complementary pack is used in the shipment.
45 . The method of claim 42 , wherein the mismatch cost minimization heuristic includes a rule followed in selecting from amongst the two candidate numbers.
46 . The method of claim 42 , wherein selecting from amongst the two candidate numbers is further based on a first hypothetical number of mismatch units of the first variety, wherein the first hypothetical number of mismatch units is an absolute difference between:
c; and a product of one of the two candidate numbers and the oversupplying quantity.
47 . The method of claim 46 , wherein selecting from amongst the two candidate numbers is further based on a second hypothetical number of mismatch units of the first variety, wherein the second hypothetical number of mismatch units is an absolute differences between:
c; and a product of another of the two candidate numbers and the oversupplying quantity.
48 . The method of claim 42 , wherein the quantity of the second variety is a number selected, from amongst two other candidate numbers, based on the costs of oversupplying and costs of undersupplying units of the second variety of the product, wherein a ceiling of
bD
c
and a floor of
bD
c
are the two candidate numbers.
49 . The method of claim 42 , wherein the quantity of the first variety of the product demanded at the store is greater than the quantity of the second variety of the product demanded at the store, and wherein using the greedy algorithm in defining the first candidate pack configuration further includes determining the quantity of the first variety before determining the quantity of the second variety.
50 . The method of claim 42 , wherein using the heuristic algorithm in defining the second candidate pack configuration includes:
using the mismatch cost minimization heuristic in determining another quantity of the first variety and in determining another quantity of the second variety, wherein the another quantity of the first variety is a number selected from amongst two candidate numbers, based on the costs of oversupplying and the costs of undersupplying units of the first variety of the product, wherein the two candidate numbers include a ceiling and a floor of
aD
c
.
51 . A system, comprising:
a processor configured to perform operations including: accessing information including:
a value (a) representing an amount of a first variety of a product demanded at a store;
a value (b) representing an amount of a second variety of the product demanded at the store;
a value (c) representing a net amount of the product demanded at the store;
a value (D) representing a pack capacity constraint, the pack capacity constraint specifying a quantity of the product held in individual packs during shipment of the product; and
mismatch cost data representing anticipated costs of oversupplying and anticipated costs of undersupplying units of both the first variety and the second variety of the product;
calculating anticipated cumulative mismatch costs associated with:
shipping an oversupplying quantity of packs in distributing the product to the store, wherein the oversupplying quantity is a ceiling of
c
D
;
and
shipping an undersupplying quantity of packs in distributing the product to the store, wherein the undersupplying quantity is a floor of
c
D
,
wherein calculating the anticipated cumulative mismatch costs includes:
using a heuristic algorithm in defining a first candidate pack configuration associated with shipping the oversupplying quantity of packs and in defining a second candidate pack configuration associated with shipping the undersupplying quantity of packs, wherein the first and second candidate pack configurations specify distinct assortments of the first and second variety of the product within individual packs; and
planning a shipment to include either:
a first shipping arrangement involving the oversupplying quantity of packs filled in accordance with the first candidate pack configuration; or
a second shipping arrangement involving the undersupplying quantity of packs filled in accordance with the second candidate pack configuration.
52 . The system of claim 51 , wherein using the heuristic algorithm in defining the first candidate pack configuration includes:
using a mismatch cost minimization heuristic in determining a quantity of the first variety and in determining a quantity of the second variety, wherein determining the quantity of the first variety includes selecting from amongst two candidate numbers, based on the costs of oversupplying and undersupplying units of the first variety of the product, wherein a ceiling of
aD
c
and a floor of
aD
c
are the two candidate numbers.
53 . The system of claim 52 , wherein planning the shipment includes selecting either the first or second shipping arrangement based on the anticipated cumulative mismatch costs.
54 . The system of claim 53 , wherein, in selecting either the first or second shipping arrangement, the first shipping arrangement is selected, and wherein planning the shipment further includes:
calculating a largest integer (x) for which:
a product (z) of x and the quantity of the first variety is less than a; and
a product (y) of x and the quantity of the second variety is less than b;
determining a difference (p) between a and z; determining a difference (q) between b and y; defining a complementary pack configuration including a number (m) of the first variety of the product, and a number (n) of the second variety of the product, wherein defining includes determining m based on p, and determining n based on q,
and wherein planning the shipment is done such that the complementary pack is used in the shipment.
55 . The system of claim 52 , wherein the mismatch cost minimization heuristic includes a rule followed in selecting from amongst the two candidate numbers.
56 . The system of claim 52 , wherein selecting from amongst the two candidate numbers is further based on a first hypothetical number of mismatch units of the first variety, wherein the first hypothetical number of mismatch units is an absolute difference between:
c; and a product of one of the two candidate numbers and the oversupplying quantity.
57 . The system of claim 56 , wherein selecting from amongst the two candidate numbers is further based on a second hypothetical number of mismatch units of the first variety, wherein the second hypothetical number of mismatch units is an absolute differences between:
c; and a product of another of the two candidate numbers and the oversupplying quantity.
58 . The system of claim 52 , wherein the quantity of the second variety is a number selected, from amongst two other candidate numbers, based on the costs of oversupplying and costs of undersupplying units of the second variety of the product, wherein a ceiling of
bD
c
and a floor of
bD
c
are the two candidate numbers.
59 . The system of claim 52 , wherein the quantity of the first variety of the product demanded at the store is greater than the quantity of the second variety of the product demanded at the store, and wherein using the greedy algorithm in defining the first candidate pack configuration further includes determining the quantity of the first variety before determining the quantity of the second variety.
60 . The system of claim 52 , wherein using the heuristic algorithm in defining the second candidate pack configuration includes:
using the mismatch cost minimization heuristic in determining another quantity of the first variety and in determining another quantity of the second variety, wherein the another quantity of the first variety is a number selected from amongst two candidate numbers, based on the costs of oversupplying and the costs of undersupplying units of the first variety of the product, wherein the two candidate numbers include a ceiling and a floor of
aD
c
.Join the waitlist — get patent alerts
Track US2014222491A1 — get alerts on status changes and closely related new filings.
We store only your email — no account needed. See our privacy policy.