optimal inventory control with retail pre-packs · pdf fileproblem motivation optimal policies...
TRANSCRIPT
Problem MotivationOptimal policies
Computational Investigation
Optimal Inventory Control with RetailPre-Packs
Long Gao
joint work with Michael Freimer and Doug Thomas
Smeal College of BusinessThe Pennsylvania State University
March 6, 2007
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Outline
1 Problem Motivation
2 Optimal policiesSingle SKU Pre-packMultiple SKU pre-pack
3 Computational InvestigationImpact of Problem ParametersComparison of policies
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Outline
1 Problem Motivation
2 Optimal policiesSingle SKU Pre-packMultiple SKU pre-pack
3 Computational InvestigationImpact of Problem ParametersComparison of policies
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Problem motivation
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Two Forms of Packaging
ContractManufacturer
DistributionCenter
RetailStore
loose items
pre-packs
U.S.-based apparel retailerArkansas-based consumer goods retailer
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Two Forms of Packaging
ContractManufacturer
DistributionCenter
RetailStore
loose items
pre-packs
U.S.-based apparel retailerArkansas-based consumer goods retailer
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Two Forms of Packaging
ContractManufacturer
DistributionCenter
RetailStore
loose items
pre-packs
U.S.-based apparel retailerArkansas-based consumer goods retailer
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
When To Use Pre-Packs?
Significant savings in handlingand delivery costsReduces flexibility in ordering,increasing holding and shortagecostsBasic Tradeoff:handling savings (pre-pack) v.s.ordering flexibility (loose)
SavingsThe Limitedbrands reported 4% distribution costs savings in2006.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
When To Use Pre-Packs?
Significant savings in handlingand delivery costsReduces flexibility in ordering,increasing holding and shortagecostsBasic Tradeoff:handling savings (pre-pack) v.s.ordering flexibility (loose)
SavingsThe Limitedbrands reported 4% distribution costs savings in2006.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
When To Use Pre-Packs?
Significant savings in handlingand delivery costsReduces flexibility in ordering,increasing holding and shortagecostsBasic Tradeoff:handling savings (pre-pack) v.s.ordering flexibility (loose)
SavingsThe Limitedbrands reported 4% distribution costs savings in2006.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
When To Use Pre-Packs?
Significant savings in handlingand delivery costsReduces flexibility in ordering,increasing holding and shortagecostsBasic Tradeoff:handling savings (pre-pack) v.s.ordering flexibility (loose)
SavingsThe Limitedbrands reported 4% distribution costs savings in2006.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Current Practice at The Limitedbrands
Configure pre-packs with lead time 13 weeksBlack Pique Polo Pre-Pack: [1-2-2-1]
Set inventory targets, ignoring the prep-packconfigurationAllocate prepacks and loose to stores
HoweverThe pre-pack configuration is not necessarily optimal.The inventory policy is not optimal.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Current Practice at The Limitedbrands
Configure pre-packs with lead time 13 weeksBlack Pique Polo Pre-Pack: [1-2-2-1]
Set inventory targets, ignoring the prep-packconfigurationAllocate prepacks and loose to stores
HoweverThe pre-pack configuration is not necessarily optimal.The inventory policy is not optimal.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Current Practice at The Limitedbrands
Configure pre-packs with lead time 13 weeksBlack Pique Polo Pre-Pack: [1-2-2-1]
Set inventory targets, ignoring the prep-packconfigurationAllocate prepacks and loose to stores
HoweverThe pre-pack configuration is not necessarily optimal.The inventory policy is not optimal.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Current Practice at The Limitedbrands
Configure pre-packs with lead time 13 weeksBlack Pique Polo Pre-Pack: [1-2-2-1]
Set inventory targets, ignoring the prep-packconfigurationAllocate prepacks and loose to stores
HoweverThe pre-pack configuration is not necessarily optimal.The inventory policy is not optimal.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Current Practice at The Limitedbrands
Configure pre-packs with lead time 13 weeksBlack Pique Polo Pre-Pack: [1-2-2-1]
Set inventory targets, ignoring the prep-packconfigurationAllocate prepacks and loose to stores
HoweverThe pre-pack configuration is not necessarily optimal.The inventory policy is not optimal.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Inventory Policies: (R, nQ) and Base stock
T im e
Inve
ntor
y Q : P rep ack Size
R: T arget Level
(R,n Q ) P o licy
QuestionWhat if we can order both pre-pack and loose?
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Inventory Policies: (R, nQ) and Base stock
T im e
Inve
ntor
y Q : P rep ack SizeS: T arget Level
Base Sto ck P o licy
(R,n Q ) P o licy
QuestionWhat if we can order both pre-pack and loose?
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Inventory Policies: (R, nQ) and Base stock
T im e
Inve
ntor
y Q : P rep ack SizeS: T arget Level
Base Sto ck P o licy
(R,n Q ) P o licy
QuestionWhat if we can order both pre-pack and loose?
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Research Questions
Policy Characterization: What is the optimal ordering policyfor the retail store if both pre-pack and loose can beordered?
Policy Comparison: How does the optimal policy compareto other simpler policies, i.e., base stock and (R, nQ)?
Pre-Pack Design: What should go in the pre-pack?
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Research Questions
Policy Characterization: What is the optimal ordering policyfor the retail store if both pre-pack and loose can beordered?
Policy Comparison: How does the optimal policy compareto other simpler policies, i.e., base stock and (R, nQ)?
Pre-Pack Design: What should go in the pre-pack?
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Research Questions
Policy Characterization: What is the optimal ordering policyfor the retail store if both pre-pack and loose can beordered?
Policy Comparison: How does the optimal policy compareto other simpler policies, i.e., base stock and (R, nQ)?
Pre-Pack Design: What should go in the pre-pack?
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Relevant Literature and Contributions
Optimal inventory policies(R,nQ) Policy
Hadley & Whitin (1965)Zheng & Chen (1992)
Henig et. al. (1997)Parkinson & McCormick (2005)
Pre-pack designAgrawal & Smith (2003)
Our ContributionsTheoretical: characterization of the whole class ofinventory polices with both pre-pack and loose optionsPractical: recommendations for inventory policy selectionand pre-pack design
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Relevant Literature and Contributions
Optimal inventory policies(R,nQ) Policy
Hadley & Whitin (1965)Zheng & Chen (1992)
Henig et. al. (1997)Parkinson & McCormick (2005)
Pre-pack designAgrawal & Smith (2003)
Our ContributionsTheoretical: characterization of the whole class ofinventory polices with both pre-pack and loose optionsPractical: recommendations for inventory policy selectionand pre-pack design
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Relevant Literature and Contributions
Optimal inventory policies(R,nQ) Policy
Hadley & Whitin (1965)Zheng & Chen (1992)
Henig et. al. (1997)Parkinson & McCormick (2005)
Pre-pack designAgrawal & Smith (2003)
Our ContributionsTheoretical: characterization of the whole class ofinventory polices with both pre-pack and loose optionsPractical: recommendations for inventory policy selectionand pre-pack design
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Relevant Literature and Contributions
Optimal inventory policies(R,nQ) Policy
Hadley & Whitin (1965)Zheng & Chen (1992)
Henig et. al. (1997)Parkinson & McCormick (2005)
Pre-pack designAgrawal & Smith (2003)
Our ContributionsTheoretical: characterization of the whole class ofinventory polices with both pre-pack and loose optionsPractical: recommendations for inventory policy selectionand pre-pack design
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Outline
1 Problem Motivation
2 Optimal policiesSingle SKU Pre-packMultiple SKU pre-pack
3 Computational InvestigationImpact of Problem ParametersComparison of policies
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
System Assumptions
Periodic review inventory system (1-3 times per week)
Zero ordering cost (fixed transportation cost)
Zero lead time (next day delivery)
Stationary demand (short term, operational level)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
System Assumptions
Periodic review inventory system (1-3 times per week)
Zero ordering cost (fixed transportation cost)
Zero lead time (next day delivery)
Stationary demand (short term, operational level)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
System Assumptions
Periodic review inventory system (1-3 times per week)
Zero ordering cost (fixed transportation cost)
Zero lead time (next day delivery)
Stationary demand (short term, operational level)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
System Assumptions
Periodic review inventory system (1-3 times per week)
Zero ordering cost (fixed transportation cost)
Zero lead time (next day delivery)
Stationary demand (short term, operational level)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
System Assumptions
Periodic review inventory system (1-3 times per week)
Zero ordering cost (fixed transportation cost)
Zero lead time (next day delivery)
Stationary demand (short term, operational level)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Some notation
Q = size of the pre-packδ = per-unit handling penalty for ordering looseh = per unit holding costb = per unit shortage costξ = random demand
x = initial inventory
y0 = number of loose units ordered, y0 < Q
y1 = number of pre-packs ordered
I = target inventory position, I = x + y0 + y1Q
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Some notation
Q = size of the pre-packδ = per-unit handling penalty for ordering looseh = per unit holding costb = per unit shortage costξ = random demand
x = initial inventory
y0 = number of loose units ordered, y0 < Q
y1 = number of pre-packs ordered
I = target inventory position, I = x + y0 + y1Q
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Some notation
Q = size of the pre-packδ = per-unit handling penalty for ordering looseh = per unit holding costb = per unit shortage costξ = random demand
x = initial inventory
y0 = number of loose units ordered, y0 < Q
y1 = number of pre-packs ordered
I = target inventory position, I = x + y0 + y1Q
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Some notation
Q = size of the pre-packδ = per-unit handling penalty for ordering looseh = per unit holding costb = per unit shortage costξ = random demand
x = initial inventory
y0 = number of loose units ordered, y0 < Q
y1 = number of pre-packs ordered
I = target inventory position, I = x + y0 + y1Q
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Some notation
Q = size of the pre-packδ = per-unit handling penalty for ordering looseh = per unit holding costb = per unit shortage costξ = random demand
x = initial inventory
y0 = number of loose units ordered, y0 < Q
y1 = number of pre-packs ordered
I = target inventory position, I = x + y0 + y1Q
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Some notation
Q = size of the pre-packδ = per-unit handling penalty for ordering looseh = per unit holding costb = per unit shortage costξ = random demand
x = initial inventory
y0 = number of loose units ordered, y0 < Q
y1 = number of pre-packs ordered
I = target inventory position, I = x + y0 + y1Q
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Some notation
Q = size of the pre-packδ = per-unit handling penalty for ordering looseh = per unit holding costb = per unit shortage costξ = random demand
x = initial inventory
y0 = number of loose units ordered, y0 < Q
y1 = number of pre-packs ordered
I = target inventory position, I = x + y0 + y1Q
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Some notation
Q = size of the pre-packδ = per-unit handling penalty for ordering looseh = per unit holding costb = per unit shortage costξ = random demand
x = initial inventory
y0 = number of loose units ordered, y0 < Q
y1 = number of pre-packs ordered
I = target inventory position, I = x + y0 + y1Q
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Some notation
Q = size of the pre-packδ = per-unit handling penalty for ordering looseh = per unit holding costb = per unit shortage costξ = random demand
x = initial inventory
y0 = number of loose units ordered, y0 < Q
y1 = number of pre-packs ordered
I = target inventory position, I = x + y0 + y1Q
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Sequence of events
Start with initial inventory x
Place the order for y0 + y1Qbring the inventory position to I = x + y0 + y1Qincurring handling cost δy0 for ordering loose
Receive the order
Observe the demand ξ
Fulfill the demand
Ending inventory is (I − ξ)
incurring holding/shortage cost h(I − ξ)+ + b(ξ − I)+
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Sequence of events
Start with initial inventory x
Place the order for y0 + y1Qbring the inventory position to I = x + y0 + y1Qincurring handling cost δy0 for ordering loose
Receive the order
Observe the demand ξ
Fulfill the demand
Ending inventory is (I − ξ)
incurring holding/shortage cost h(I − ξ)+ + b(ξ − I)+
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Sequence of events
Start with initial inventory x
Place the order for y0 + y1Qbring the inventory position to I = x + y0 + y1Qincurring handling cost δy0 for ordering loose
Receive the order
Observe the demand ξ
Fulfill the demand
Ending inventory is (I − ξ)
incurring holding/shortage cost h(I − ξ)+ + b(ξ − I)+
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Sequence of events
Start with initial inventory x
Place the order for y0 + y1Qbring the inventory position to I = x + y0 + y1Qincurring handling cost δy0 for ordering loose
Receive the order
Observe the demand ξ
Fulfill the demand
Ending inventory is (I − ξ)
incurring holding/shortage cost h(I − ξ)+ + b(ξ − I)+
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Sequence of events
Start with initial inventory x
Place the order for y0 + y1Qbring the inventory position to I = x + y0 + y1Qincurring handling cost δy0 for ordering loose
Receive the order
Observe the demand ξ
Fulfill the demand
Ending inventory is (I − ξ)
incurring holding/shortage cost h(I − ξ)+ + b(ξ − I)+
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Sequence of events
Start with initial inventory x
Place the order for y0 + y1Qbring the inventory position to I = x + y0 + y1Qincurring handling cost δy0 for ordering loose
Receive the order
Observe the demand ξ
Fulfill the demand
Ending inventory is (I − ξ)
incurring holding/shortage cost h(I − ξ)+ + b(ξ − I)+
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Sequence of events
Start with initial inventory x
Place the order for y0 + y1Qbring the inventory position to I = x + y0 + y1Qincurring handling cost δy0 for ordering loose
Receive the order
Observe the demand ξ
Fulfill the demand
Ending inventory is (I − ξ)
incurring holding/shortage cost h(I − ξ)+ + b(ξ − I)+
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Sequence of events
Start with initial inventory x
Place the order for y0 + y1Qbring the inventory position to I = x + y0 + y1Qincurring handling cost δy0 for ordering loose
Receive the order
Observe the demand ξ
Fulfill the demand
Ending inventory is (I − ξ)
incurring holding/shortage cost h(I − ξ)+ + b(ξ − I)+
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Sequence of events
Start with initial inventory x
Place the order for y0 + y1Qbring the inventory position to I = x + y0 + y1Qincurring handling cost δy0 for ordering loose
Receive the order
Observe the demand ξ
Fulfill the demand
Ending inventory is (I − ξ)
incurring holding/shortage cost h(I − ξ)+ + b(ξ − I)+
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Sequence of events
Start with initial inventory x
Place the order for y0 + y1Qbring the inventory position to I = x + y0 + y1Qincurring handling cost δy0 for ordering loose
Receive the order
Observe the demand ξ
Fulfill the demand
Ending inventory is (I − ξ)
incurring holding/shortage cost h(I − ξ)+ + b(ξ − I)+
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Problem formulation
Obtain the optimal policy π∗ by solving a Markov DecisionProcess (MDP):
V(x) = minπ
δy0︸︷︷︸
handling cost
+ Eξ[h(I − ξ)+ + b(ξ − I)+]︸ ︷︷ ︸inventory cost
+βEξV(I − ξ)︸ ︷︷ ︸future cost
Cost of pre-pack only:
G(I) := Eξ[h(I − ξ)+ + b(ξ − I)+] + βEξV(I − ξ)
Minimum pre-packs:
I(x) := maxx + y1Q : x + y1Q ≤ S
Cost of ordering both pre-pack and loose:
H(x, I) := δ(I − I(x))+ + G(I)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Problem formulation
Obtain the optimal policy π∗ by solving a Markov DecisionProcess (MDP):
V(x) = minπ
δy0︸︷︷︸
handling cost
+ Eξ[h(I − ξ)+ + b(ξ − I)+]︸ ︷︷ ︸inventory cost
+βEξV(I − ξ)︸ ︷︷ ︸future cost
Cost of pre-pack only:
G(I) := Eξ[h(I − ξ)+ + b(ξ − I)+] + βEξV(I − ξ)
Minimum pre-packs:
I(x) := maxx + y1Q : x + y1Q ≤ S
Cost of ordering both pre-pack and loose:
H(x, I) := δ(I − I(x))+ + G(I)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Problem formulation
Obtain the optimal policy π∗ by solving a Markov DecisionProcess (MDP):
V(x) = minπ
δy0︸︷︷︸
handling cost
+ Eξ[h(I − ξ)+ + b(ξ − I)+]︸ ︷︷ ︸inventory cost
+βEξV(I − ξ)︸ ︷︷ ︸future cost
Cost of pre-pack only:
G(I) := Eξ[h(I − ξ)+ + b(ξ − I)+] + βEξV(I − ξ)
Minimum pre-packs:
I(x) := maxx + y1Q : x + y1Q ≤ S
Cost of ordering both pre-pack and loose:
H(x, I) := δ(I − I(x))+ + G(I)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Problem formulation
Obtain the optimal policy π∗ by solving a Markov DecisionProcess (MDP):
V(x) = minπ
δy0︸︷︷︸
handling cost
+ Eξ[h(I − ξ)+ + b(ξ − I)+]︸ ︷︷ ︸inventory cost
+βEξV(I − ξ)︸ ︷︷ ︸future cost
Cost of pre-pack only:
G(I) := Eξ[h(I − ξ)+ + b(ξ − I)+] + βEξV(I − ξ)
Minimum pre-packs:
I(x) := maxx + y1Q : x + y1Q ≤ S
Cost of ordering both pre-pack and loose:
H(x, I) := δ(I − I(x))+ + G(I)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
0 Inventory Position I(x)
Cos
t Fun
ctio
ns
SS−Q
G( I ): Prepack Only
1
1
Ω
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
0 Inventory Position I(x)
Cos
t Fun
ctio
ns
SZS−Q
Ω1 Ω
2 Ω3
G( I ): Prepack Only
H(x,I): Prepack & Loose
1
1
1
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
0 Inventory Position I(x)
Cos
t Fun
ctio
ns
B+QSZBS−Q
Ω1 Ω
2 Ω3
G( I ): Prepack Only
H(x,I): Prepack & Loose
1
1
1
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
0 Inventory Position I(x)
Cos
t Fun
ctio
ns
B+QSZBS−Q
Ω1 Ω
2 Ω3
G( I ): Prepack Only
H(x,I): Prepack & Loose
1
1
1
2
2
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
0 Inventory Position I(x)
Cos
t Fun
ctio
ns
B+QSZBS−Q
Ω1 Ω
2 Ω3
G( I ): Prepack Only
H(x,I): Prepack & Loose
1
1
1
2
2
3
3
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
0 Inventory Position I(x)
Cos
t Fun
ctio
ns
B+QSZBS−Q
Ω1 Ω
2 Ω3
G( I ): Prepack Only
H(x,I): Prepack & Loose
1
1
1
2
2
3
3
Ω3
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
Condition (C):Loose target Z: ∃Z ∈ (S − Q, S) s.t. G′(Z) = −δ
Indifferent point B: ∃B ∈ (S − Q, Z] s.t. H(B, Z) = G(B + Q)
Optimal Policy:Under (C),
π∗(C) ≡
order y1Q to bring I = I(x) + Q, if I(x) ∈ Ω1
order y0 + y1Q to bring I = Z, if I(x) ∈ Ω2
order y1Q to bring I = I(x), if I(x) ∈ Ω3
Under (C)c, (R, nQ) policy is optimal, where R satisfiesG(R) = G(R + Q).If δ = 0, base stock policy is optimal.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
Condition (C):Loose target Z: ∃Z ∈ (S − Q, S) s.t. G′(Z) = −δ
Indifferent point B: ∃B ∈ (S − Q, Z] s.t. H(B, Z) = G(B + Q)
Optimal Policy:Under (C),
π∗(C) ≡
order y1Q to bring I = I(x) + Q, if I(x) ∈ Ω1
order y0 + y1Q to bring I = Z, if I(x) ∈ Ω2
order y1Q to bring I = I(x), if I(x) ∈ Ω3
Under (C)c, (R, nQ) policy is optimal, where R satisfiesG(R) = G(R + Q).If δ = 0, base stock policy is optimal.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
Condition (C):Loose target Z: ∃Z ∈ (S − Q, S) s.t. G′(Z) = −δ
Indifferent point B: ∃B ∈ (S − Q, Z] s.t. H(B, Z) = G(B + Q)
Optimal Policy:Under (C),
π∗(C) ≡
order y1Q to bring I = I(x) + Q, if I(x) ∈ Ω1
order y0 + y1Q to bring I = Z, if I(x) ∈ Ω2
order y1Q to bring I = I(x), if I(x) ∈ Ω3
Under (C)c, (R, nQ) policy is optimal, where R satisfiesG(R) = G(R + Q).If δ = 0, base stock policy is optimal.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
Condition (C):Loose target Z: ∃Z ∈ (S − Q, S) s.t. G′(Z) = −δ
Indifferent point B: ∃B ∈ (S − Q, Z] s.t. H(B, Z) = G(B + Q)
Optimal Policy:Under (C),
π∗(C) ≡
order y1Q to bring I = I(x) + Q, if I(x) ∈ Ω1
order y0 + y1Q to bring I = Z, if I(x) ∈ Ω2
order y1Q to bring I = I(x), if I(x) ∈ Ω3
Under (C)c, (R, nQ) policy is optimal, where R satisfiesG(R) = G(R + Q).If δ = 0, base stock policy is optimal.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
Condition (C):Loose target Z: ∃Z ∈ (S − Q, S) s.t. G′(Z) = −δ
Indifferent point B: ∃B ∈ (S − Q, Z] s.t. H(B, Z) = G(B + Q)
Optimal Policy:Under (C),
π∗(C) ≡
order y1Q to bring I = I(x) + Q, if I(x) ∈ Ω1
order y0 + y1Q to bring I = Z, if I(x) ∈ Ω2
order y1Q to bring I = I(x), if I(x) ∈ Ω3
Under (C)c, (R, nQ) policy is optimal, where R satisfiesG(R) = G(R + Q).If δ = 0, base stock policy is optimal.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal Policy
0 Inventory Position I(x)
Cos
t Fun
ctio
ns
B+QSZBS−Q
Ω1 Ω
2 Ω3
G( I ): Prepack Only
H(x,I): Prepack & Loose
1
1
1
2
2
3
3
Ω3
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution
Theorem:Under (C), if demand follows a discrete uniform distribution on[0, nQ − 1], and the band policy [Z, B + Q] is implemented, thenthe steady-state inventory position has a semi-uniformdistribution:
Z−B
Q , 1Q , . . . , 1
Q
on Z, Z − 1, . . . , B + Q
Application:For large scale problems, the theorem is useful to developefficient approximations.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution
Theorem:Under (C), if demand follows a discrete uniform distribution on[0, nQ − 1], and the band policy [Z, B + Q] is implemented, thenthe steady-state inventory position has a semi-uniformdistribution:
Z−B
Q , 1Q , . . . , 1
Q
on Z, Z − 1, . . . , B + Q
Application:For large scale problems, the theorem is useful to developefficient approximations.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
For each initial inventory i, classify demand values (ξ ∼ f )into two sets: order only prepack (∪nEin) and order both(∪nEin)
c, where Ein = i− E + nQ, E = Z, Z + 1, . . . , B + Q.Transition probability:
if j 6= Z,pij = P ξ ∈ ∪nEin : ξ = nQ + i − j
=∞∑
n=0
f (nQ + i − j)
if j = Z,
pij = P ξ ∈ (∪nEin)c + P ξ ∈ ∪nEin : ξ = i − Z + nQ
= 1 −B+Q∑
l=Z+1
∞∑n=0
f (nQ + i − l).
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
For each initial inventory i, classify demand values (ξ ∼ f )into two sets: order only prepack (∪nEin) and order both(∪nEin)
c, where Ein = i− E + nQ, E = Z, Z + 1, . . . , B + Q.Transition probability:
if j 6= Z,pij = P ξ ∈ ∪nEin : ξ = nQ + i − j
=∞∑
n=0
f (nQ + i − j)
if j = Z,
pij = P ξ ∈ (∪nEin)c + P ξ ∈ ∪nEin : ξ = i − Z + nQ
= 1 −B+Q∑
l=Z+1
∞∑n=0
f (nQ + i − l).
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
For each initial inventory i, classify demand values (ξ ∼ f )into two sets: order only prepack (∪nEin) and order both(∪nEin)
c, where Ein = i− E + nQ, E = Z, Z + 1, . . . , B + Q.Transition probability:
if j 6= Z,pij = P ξ ∈ ∪nEin : ξ = nQ + i − j
=∞∑
n=0
f (nQ + i − j)
if j = Z,
pij = P ξ ∈ (∪nEin)c + P ξ ∈ ∪nEin : ξ = i − Z + nQ
= 1 −B+Q∑
l=Z+1
∞∑n=0
f (nQ + i − l).
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
For each initial inventory i, classify demand values (ξ ∼ f )into two sets: order only prepack (∪nEin) and order both(∪nEin)
c, where Ein = i− E + nQ, E = Z, Z + 1, . . . , B + Q.Transition probability:
if j 6= Z,pij = P ξ ∈ ∪nEin : ξ = nQ + i − j
=∞∑
n=0
f (nQ + i − j)
if j = Z,
pij = P ξ ∈ (∪nEin)c + P ξ ∈ ∪nEin : ξ = i − Z + nQ
= 1 −B+Q∑
l=Z+1
∞∑n=0
f (nQ + i − l).
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
For each initial inventory i, classify demand values (ξ ∼ f )into two sets: order only prepack (∪nEin) and order both(∪nEin)
c, where Ein = i− E + nQ, E = Z, Z + 1, . . . , B + Q.Transition probability:
if j 6= Z,pij = P ξ ∈ ∪nEin : ξ = nQ + i − j
=∞∑
n=0
f (nQ + i − j)
if j = Z,
pij = P ξ ∈ (∪nEin)c + P ξ ∈ ∪nEin : ξ = i − Z + nQ
= 1 −B+Q∑
l=Z+1
∞∑n=0
f (nQ + i − l).
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
For each initial inventory i, classify demand values (ξ ∼ f )into two sets: order only prepack (∪nEin) and order both(∪nEin)
c, where Ein = i− E + nQ, E = Z, Z + 1, . . . , B + Q.Transition probability:
if j 6= Z,pij = P ξ ∈ ∪nEin : ξ = nQ + i − j
=∞∑
n=0
f (nQ + i − j)
if j = Z,
pij = P ξ ∈ (∪nEin)c + P ξ ∈ ∪nEin : ξ = i − Z + nQ
= 1 −B+Q∑
l=Z+1
∞∑n=0
f (nQ + i − l).
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
For each initial inventory i, classify demand values (ξ ∼ f )into two sets: order only prepack (∪nEin) and order both(∪nEin)
c, where Ein = i− E + nQ, E = Z, Z + 1, . . . , B + Q.Transition probability:
if j 6= Z,pij = P ξ ∈ ∪nEin : ξ = nQ + i − j
=∞∑
n=0
f (nQ + i − j)
if j = Z,
pij = P ξ ∈ (∪nEin)c + P ξ ∈ ∪nEin : ξ = i − Z + nQ
= 1 −B+Q∑
l=Z+1
∞∑n=0
f (nQ + i − l).
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
For each initial inventory i, classify demand values (ξ ∼ f )into two sets: order only prepack (∪nEin) and order both(∪nEin)
c, where Ein = i− E + nQ, E = Z, Z + 1, . . . , B + Q.Transition probability:
if j 6= Z,pij = P ξ ∈ ∪nEin : ξ = nQ + i − j
=∞∑
n=0
f (nQ + i − j)
if j = Z,
pij = P ξ ∈ (∪nEin)c + P ξ ∈ ∪nEin : ξ = i − Z + nQ
= 1 −B+Q∑
l=Z+1
∞∑n=0
f (nQ + i − l).
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
Transition matrix P exhibits certain periodic property:
P = [pij] =
dZ a−1 a−2 . . . aZ−(B+Q)
dZ+1 a0 a−1 . . . aZ+1−(B+Q)
dZ+2 a1 a0 . . . aZ+2−(B+Q)...
......
. . ....
dB+Q aB+Q−Z−1 aB+Q−Z−2 . . . a0
where ai =
∑∞n=0 f (nQ + i), di = 1 −
∑B+Ql=Z+1 ai−l.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
If ξ ∼ U[0, nQ − 1], then ai = 1/Q, di = (Z − Q)/Q.Transition matrix P can be simplified as:
P =
d a . . . ad a . . . a...
.... . .
...d a . . . a
φ =
(Z−B
Q , 1Q , . . . , 1
Q
)satisfies
φ ·P = φ∑j∈E
φj = 1
For irreducible Markov Chain, the solution is unique.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
If ξ ∼ U[0, nQ − 1], then ai = 1/Q, di = (Z − Q)/Q.Transition matrix P can be simplified as:
P =
d a . . . ad a . . . a...
.... . .
...d a . . . a
φ =
(Z−B
Q , 1Q , . . . , 1
Q
)satisfies
φ ·P = φ∑j∈E
φj = 1
For irreducible Markov Chain, the solution is unique.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
If ξ ∼ U[0, nQ − 1], then ai = 1/Q, di = (Z − Q)/Q.Transition matrix P can be simplified as:
P =
d a . . . ad a . . . a...
.... . .
...d a . . . a
φ =
(Z−B
Q , 1Q , . . . , 1
Q
)satisfies
φ ·P = φ∑j∈E
φj = 1
For irreducible Markov Chain, the solution is unique.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Steady State Distribution: Proof
If ξ ∼ U[0, nQ − 1], then ai = 1/Q, di = (Z − Q)/Q.Transition matrix P can be simplified as:
P =
d a . . . ad a . . . a...
.... . .
...d a . . . a
φ =
(Z−B
Q , 1Q , . . . , 1
Q
)satisfies
φ ·P = φ∑j∈E
φj = 1
For irreducible Markov Chain, the solution is unique.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Multiple SKUs
Retailer may wish to put multiple SKUs in a pre-pack:Different sizesDifferent colorsMatching sets (e.g. hats, scarves)
Demand correlation plays a significant role
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Multiple SKUs
Retailer may wish to put multiple SKUs in a pre-pack:Different sizesDifferent colorsMatching sets (e.g. hats, scarves)
Demand correlation plays a significant role
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Multiple SKUs
Retailer may wish to put multiple SKUs in a pre-pack:Different sizesDifferent colorsMatching sets (e.g. hats, scarves)
Demand correlation plays a significant role
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Multiple SKUs
Retailer may wish to put multiple SKUs in a pre-pack:Different sizesDifferent colorsMatching sets (e.g. hats, scarves)
Demand correlation plays a significant role
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Multiple SKUs
Retailer may wish to put multiple SKUs in a pre-pack:Different sizesDifferent colorsMatching sets (e.g. hats, scarves)
Demand correlation plays a significant role
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Multiple SKUs
Problem formulation:Pre-pack: Q = (Q1, Q2, . . . , Qn)
Loose units: y0 = (y10, y2
0, . . . , yn0)
Penalty cost: δ · y0 =∑n
i=1 δiyi0
As before, optimal policy π∗ is obtained by solving MDP:V(x) = minπδy0 + L(I) + βEV(I − ξ)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Single SKU Pre-packMultiple SKU pre-pack
Optimal policy for two SKUs
−6 −4 −2 0 2 4 6 8 10
−6
−4
−2
0
2
4
6
8
10
x1
2
Ω2
Ω1
Ω4
Ω3
Z*
Z*(x)
Z3*
Z2*
B
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Outline
1 Problem Motivation
2 Optimal policiesSingle SKU Pre-packMultiple SKU pre-pack
3 Computational InvestigationImpact of Problem ParametersComparison of policies
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Computational Results
Impact on optimal policy of:per-unit handling penalty δpre-pack size Qdemand variability cvdemand correlation ρ (across multiple SKUs)
Comparison between:optimal policybase-stock policy(R, nQ) policy
Criteria:target inventory region and distributionpre-pack usagetotal cost
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Scenario for comparison
Two-SKUs with symmetric pre-pack of sizeQ ∈ (3, 3), (4, 4), (5, 5), (6, 6)unit penalty cost δ ∈ 0.01, 0.5, 1, 5Demand: discretized Normal with µ = 5 andcv ∈ 0.1, 0.2, 0.3, 0.34Demand correlation ρ ∈ −0.6, 0, 0.6unit holding cost h = 1 and shortage cost b = 10
Base case: Q = (4, 4), δ = 0.5, cv = 0.3, ρ = 0
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Scenario for comparison
Two-SKUs with symmetric pre-pack of sizeQ ∈ (3, 3), (4, 4), (5, 5), (6, 6)unit penalty cost δ ∈ 0.01, 0.5, 1, 5Demand: discretized Normal with µ = 5 andcv ∈ 0.1, 0.2, 0.3, 0.34Demand correlation ρ ∈ −0.6, 0, 0.6unit holding cost h = 1 and shortage cost b = 10
Base case: Q = (4, 4), δ = 0.5, cv = 0.3, ρ = 0
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Scenario for comparison
Two-SKUs with symmetric pre-pack of sizeQ ∈ (3, 3), (4, 4), (5, 5), (6, 6)unit penalty cost δ ∈ 0.01, 0.5, 1, 5Demand: discretized Normal with µ = 5 andcv ∈ 0.1, 0.2, 0.3, 0.34Demand correlation ρ ∈ −0.6, 0, 0.6unit holding cost h = 1 and shortage cost b = 10
Base case: Q = (4, 4), δ = 0.5, cv = 0.3, ρ = 0
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Scenario for comparison
Two-SKUs with symmetric pre-pack of sizeQ ∈ (3, 3), (4, 4), (5, 5), (6, 6)unit penalty cost δ ∈ 0.01, 0.5, 1, 5Demand: discretized Normal with µ = 5 andcv ∈ 0.1, 0.2, 0.3, 0.34Demand correlation ρ ∈ −0.6, 0, 0.6unit holding cost h = 1 and shortage cost b = 10
Base case: Q = (4, 4), δ = 0.5, cv = 0.3, ρ = 0
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Scenario for comparison
Two-SKUs with symmetric pre-pack of sizeQ ∈ (3, 3), (4, 4), (5, 5), (6, 6)unit penalty cost δ ∈ 0.01, 0.5, 1, 5Demand: discretized Normal with µ = 5 andcv ∈ 0.1, 0.2, 0.3, 0.34Demand correlation ρ ∈ −0.6, 0, 0.6unit holding cost h = 1 and shortage cost b = 10
Base case: Q = (4, 4), δ = 0.5, cv = 0.3, ρ = 0
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Scenario for comparison
Two-SKUs with symmetric pre-pack of sizeQ ∈ (3, 3), (4, 4), (5, 5), (6, 6)unit penalty cost δ ∈ 0.01, 0.5, 1, 5Demand: discretized Normal with µ = 5 andcv ∈ 0.1, 0.2, 0.3, 0.34Demand correlation ρ ∈ −0.6, 0, 0.6unit holding cost h = 1 and shortage cost b = 10
Base case: Q = (4, 4), δ = 0.5, cv = 0.3, ρ = 0
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of per-unit handling penalty δ
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
δ = 0.01
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of per-unit handling penalty δ
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
δ = 0.01
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
δ = 0.5
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of per-unit handling penalty δ
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
δ = 0.01
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
δ = 0.5
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
δ = 1
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of per-unit handling penalty δ
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
δ = 0.01
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
δ = 0.5
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
δ = 1
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
δ = 5
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of per-unit handling penalty δ
Table: Impact of per-unit handling penalty δ
δ Prepack Usage Total Cost
0.01 54.1% 5.180.50 80.8% 6.471.00 91.0% 7.005.00 94.2% 7.62
Target inventory region (after ordering) expands, avoidingexcess handling costsTotal cost and pre-pack usage increase as δ increasesBase stock policy is desirable for small handling cost δ
Pre-pack only policy is optimal for large handing savings δ
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of per-unit handling penalty δ
Table: Impact of per-unit handling penalty δ
δ Prepack Usage Total Cost
0.01 54.1% 5.180.50 80.8% 6.471.00 91.0% 7.005.00 94.2% 7.62
Target inventory region (after ordering) expands, avoidingexcess handling costsTotal cost and pre-pack usage increase as δ increasesBase stock policy is desirable for small handling cost δ
Pre-pack only policy is optimal for large handing savings δ
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of per-unit handling penalty δ
Table: Impact of per-unit handling penalty δ
δ Prepack Usage Total Cost
0.01 54.1% 5.180.50 80.8% 6.471.00 91.0% 7.005.00 94.2% 7.62
Target inventory region (after ordering) expands, avoidingexcess handling costsTotal cost and pre-pack usage increase as δ increasesBase stock policy is desirable for small handling cost δ
Pre-pack only policy is optimal for large handing savings δ
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of per-unit handling penalty δ
Table: Impact of per-unit handling penalty δ
δ Prepack Usage Total Cost
0.01 54.1% 5.180.50 80.8% 6.471.00 91.0% 7.005.00 94.2% 7.62
Target inventory region (after ordering) expands, avoidingexcess handling costsTotal cost and pre-pack usage increase as δ increasesBase stock policy is desirable for small handling cost δ
Pre-pack only policy is optimal for large handing savings δ
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of Pre-Pack Size Q
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
(Q1,Q
2)= (3,3)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of Pre-Pack Size Q
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
(Q1,Q
2)= (3,3)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
(Q1,Q
2)= (4,4)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of Pre-Pack Size Q
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
(Q1,Q
2)= (3,3)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
(Q1,Q
2)= (4,4)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
(Q1,Q
2)= (5,5)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of Pre-Pack Size Q
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
(Q1,Q
2)= (3,3)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
(Q1,Q
2)= (4,4)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
(Q1,Q
2)= (5,5)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
(Q1,Q
2)= (6,6)
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of Pre-Pack Size Q
Table: Impact of Package Size Q
(Q1, Q2) Prepack Usage Total Cost
(3,3) 83.5% 6.29(4,4) 80.8% 6.47(5,5) 76.1% 6.61(6,6) 71.5% 7.04
Target region expands, due to less ordering flexibilityTotal cost increases, and pre-pack usage decreasesWith the same handling savings, ordering a larger pre-packis less attractive to the store
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of Pre-Pack Size Q
Table: Impact of Package Size Q
(Q1, Q2) Prepack Usage Total Cost
(3,3) 83.5% 6.29(4,4) 80.8% 6.47(5,5) 76.1% 6.61(6,6) 71.5% 7.04
Target region expands, due to less ordering flexibilityTotal cost increases, and pre-pack usage decreasesWith the same handling savings, ordering a larger pre-packis less attractive to the store
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of Pre-Pack Size Q
Table: Impact of Package Size Q
(Q1, Q2) Prepack Usage Total Cost
(3,3) 83.5% 6.29(4,4) 80.8% 6.47(5,5) 76.1% 6.61(6,6) 71.5% 7.04
Target region expands, due to less ordering flexibilityTotal cost increases, and pre-pack usage decreasesWith the same handling savings, ordering a larger pre-packis less attractive to the store
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of demand variability CV
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
cv = 0.1
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of demand variability CV
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
cv = 0.1
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
cv = 0.2
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of demand variability CV
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
cv = 0.1
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
cv = 0.2
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
cv = 0.3
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of demand variability CV
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
cv = 0.1
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
cv = 0.2
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
cv = 0.3
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
cv = 0.34
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of demand variability CV
Table: Impact of demand variability CV
CV Prepack Usage Total Cost
0.10 88.2% 2.720.20 82.5% 4.440.30 80.8% 6.470.34 79.4% 7.06
More volatile demand requires higher inventory level, andresults in higher total costPre-pack usage decreases as demand variability increasesPre-pack is attractive for relative stable demand
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of demand variability CV
Table: Impact of demand variability CV
CV Prepack Usage Total Cost
0.10 88.2% 2.720.20 82.5% 4.440.30 80.8% 6.470.34 79.4% 7.06
More volatile demand requires higher inventory level, andresults in higher total costPre-pack usage decreases as demand variability increasesPre-pack is attractive for relative stable demand
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of demand variability CV
Table: Impact of demand variability CV
CV Prepack Usage Total Cost
0.10 88.2% 2.720.20 82.5% 4.440.30 80.8% 6.470.34 79.4% 7.06
More volatile demand requires higher inventory level, andresults in higher total costPre-pack usage decreases as demand variability increasesPre-pack is attractive for relative stable demand
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of demand correlation ρ
Table: Impact of demand correlation ρ
ρ Prepack Usage Total Cost
-0.6 78.5% 6.580.0 80.8% 6.470.6 82.7% 6.28
Total cost decreases as ρ increases.Prepack usage increases as ρ increases.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of demand correlation ρ
Table: Impact of demand correlation ρ
ρ Prepack Usage Total Cost
-0.6 78.5% 6.580.0 80.8% 6.470.6 82.7% 6.28
Total cost decreases as ρ increases.Prepack usage increases as ρ increases.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of ρ (demand correlation)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = −0.6
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of ρ (demand correlation)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = −0.6
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = 0
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of ρ (demand correlation)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = −0.6
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = 0.6
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = 0
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of ρ (demand correlation)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = −0.6
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = 0.6
Same region, but differentdistributionOrdering pre-packs isordering along thediagonal, ρ > 0Recommendation: bundledifference size of the samestyle-color
Limited: rainbow-pack,different color
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of ρ (demand correlation)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = −0.6
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = 0.6
Same region, but differentdistributionOrdering pre-packs isordering along thediagonal, ρ > 0Recommendation: bundledifference size of the samestyle-color
Limited: rainbow-pack,different color
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of ρ (demand correlation)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = −0.6
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = 0.6
Same region, but differentdistributionOrdering pre-packs isordering along thediagonal, ρ > 0Recommendation: bundledifference size of the samestyle-color
Limited: rainbow-pack,different color
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Impact of ρ (demand correlation)
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = −0.6
4 5 6 7 8 9 10 114
5
6
7
8
9
10
11
SKU1 Inventory
SK
U2
Inve
ntor
y
ρ = 0.6
Same region, but differentdistributionOrdering pre-packs isordering along thediagonal, ρ > 0Recommendation: bundledifference size of the samestyle-color
Limited: rainbow-pack,different color
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Relative Costs of Simple Policies
0 2 4 6 8 10 12 140
5
10
15
20
25
30
35
40
Prepack Size: Q
Per
form
ance
Gap
: ΔT
C%
Base Stock Policy
(R,nQ) Policy
Ω1
Ω2 Ω
3
∆TC%: percentagetotal cost differenceΩ1:(Big Stores)(R, nQ) dominatesΩ2: Both aresuboptimal. Thecost gap can be30% higher!Ω3: (Small Stores)Base stock policy ispreferable.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Relative Costs of Simple Policies
0 2 4 6 8 10 12 140
5
10
15
20
25
30
35
40
Prepack Size: Q
Per
form
ance
Gap
: ΔT
C%
Base Stock Policy
(R,nQ) Policy
Ω1
Ω2 Ω
3
∆TC%: percentagetotal cost differenceΩ1:(Big Stores)(R, nQ) dominatesΩ2: Both aresuboptimal. Thecost gap can be30% higher!Ω3: (Small Stores)Base stock policy ispreferable.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Relative Costs of Simple Policies
0 2 4 6 8 10 12 140
5
10
15
20
25
30
35
40
Prepack Size: Q
Per
form
ance
Gap
: ΔT
C%
Base Stock Policy
(R,nQ) Policy
Ω1
Ω2 Ω
3
∆TC%: percentagetotal cost differenceΩ1:(Big Stores)(R, nQ) dominatesΩ2: Both aresuboptimal. Thecost gap can be30% higher!Ω3: (Small Stores)Base stock policy ispreferable.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Relative Costs of Simple Policies
0 2 4 6 8 10 12 140
5
10
15
20
25
30
35
40
Prepack Size: Q
Per
form
ance
Gap
: ΔT
C%
Base Stock Policy
(R,nQ) Policy
Ω1
Ω2 Ω
3
∆TC%: percentagetotal cost differenceΩ1:(Big Stores)(R, nQ) dominatesΩ2: Both aresuboptimal. Thecost gap can be30% higher!Ω3: (Small Stores)Base stock policy ispreferable.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Relative Costs of Simple Policies
0 0.2 0.4 0.6 0.8 1.0 1.20
5
10
15
20
25
30
35
40
Unit Handling Penalty: δ
Per
form
ance
Gap
: ΔT
C%
Base Stock Policy(R,nQ) Policy
Value of Flexibility
Value of flexibility:21%!R1: Base stockpolicy is attractive.R2: (R, nQ) policy isbetter.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Relative Costs of Simple Policies
0 0.2 0.4 0.6 0.8 1.0 1.20
5
10
15
20
25
30
35
40
Unit Handling Penalty: δ
Per
form
ance
Gap
: ΔT
C%
Value of Flexibility
R1
R2
Value of flexibility:21%!R1: Base stockpolicy is attractive.R2: (R, nQ) policy isbetter.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Impact of Problem ParametersComparison of policies
Relative Costs of Simple Policies
0 0.2 0.4 0.6 0.8 1.0 1.20
5
10
15
20
25
30
35
40
Unit Handling Penalty: δ
Per
form
ance
Gap
: ΔT
C%
Value of Flexibility
R1
R2
Value of flexibility:21%!R1: Base stockpolicy is attractive.R2: (R, nQ) policy isbetter.
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Conclusions
Summary:Characterized the forms of the optimal policy for the singleand multiple SKU casesInvestigated the sensitivity of the optimal policy to problemparametersProvided guidance for policy selection and pre-pack design
Future work:How should the pre-pack be designed?Common pre-packs for multiple retail locationsMultiple pre-packs
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Conclusions
Summary:Characterized the forms of the optimal policy for the singleand multiple SKU casesInvestigated the sensitivity of the optimal policy to problemparametersProvided guidance for policy selection and pre-pack design
Future work:How should the pre-pack be designed?Common pre-packs for multiple retail locationsMultiple pre-packs
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Conclusions
Summary:Characterized the forms of the optimal policy for the singleand multiple SKU casesInvestigated the sensitivity of the optimal policy to problemparametersProvided guidance for policy selection and pre-pack design
Future work:How should the pre-pack be designed?Common pre-packs for multiple retail locationsMultiple pre-packs
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Conclusions
Summary:Characterized the forms of the optimal policy for the singleand multiple SKU casesInvestigated the sensitivity of the optimal policy to problemparametersProvided guidance for policy selection and pre-pack design
Future work:How should the pre-pack be designed?Common pre-packs for multiple retail locationsMultiple pre-packs
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Conclusions
Summary:Characterized the forms of the optimal policy for the singleand multiple SKU casesInvestigated the sensitivity of the optimal policy to problemparametersProvided guidance for policy selection and pre-pack design
Future work:How should the pre-pack be designed?Common pre-packs for multiple retail locationsMultiple pre-packs
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Conclusions
Summary:Characterized the forms of the optimal policy for the singleand multiple SKU casesInvestigated the sensitivity of the optimal policy to problemparametersProvided guidance for policy selection and pre-pack design
Future work:How should the pre-pack be designed?Common pre-packs for multiple retail locationsMultiple pre-packs
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Other Applications of Our Model
Contract transportation:truckload and less thantruckload
Chemical suppliers:large and small ocean tanks
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Other Applications of Our Model
Contract transportation:truckload and less thantruckload
Chemical suppliers:large and small ocean tanks
Long Gao Optimal Inventory Control with Retail Pre-Packs
Problem MotivationOptimal policies
Computational Investigation
Questions?
Long Gao Optimal Inventory Control with Retail Pre-Packs