1 1 project #1 optimization model john h. vande vate spring, 2001
TRANSCRIPT
![Page 1: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/1.jpg)
11
Project #1Optimization Model
John H. Vande Vate
Spring, 2001
![Page 2: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/2.jpg)
22
Careful about Words...
• Plants can ship to – DCs (direct) or– The Warehouse (indirect)
• All combined shipments come from the warehouse (not the Indiana plant).
• All Monitors, TV’s and Keyboards are shipped via the warehouse.
![Page 3: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/3.jpg)
33
Without Optimization
• For each DC there are 4 options:– All parts direct– All parts via Indianapolis warehouse– Green Bay & Indianapolis ship via warehouse– Denver & Indianapolis ship via warehouse
• Easy to calculate which of these is cheaper ….
![Page 4: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/4.jpg)
44
But...
• Ignoring the inventory implications at the plants and warehouse for indirect shipments
• Why?
![Page 5: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/5.jpg)
55
Not per DC
![Page 6: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/6.jpg)
66
Inventory at the Warehouse
![Page 7: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/7.jpg)
77
Approaches
• Inbound: Half a truckload for each plant that ships to the warehouse
• Outbound: ?
• The problem of different headways
![Page 8: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/8.jpg)
88
Time
• How much does indirect shipment add to the time to market?
Production DemandProduction
![Page 9: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/9.jpg)
99
Major weakness of Model
• It ignores the pipeline inventory
• This can have a significant impact on inventory!
![Page 10: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/10.jpg)
1010
EOQ
• How to calculate the optimal shipment size?
• Is the cost per unit:– Distance/Q + Interest Rate*Value or– Distance/Q + Interest Rate*Value/2?
![Page 11: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/11.jpg)
1111
It Depends!
• The EOQ formula– Inventory at the DC: Proportional to Q/2– Transportation Cost: Proportional to Demand/Q– Inventory at the Plant: ?
![Page 12: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/12.jpg)
1212
Inventory at the Plant
• item-days inventory at the plant accumulated for each shipment to DC #1, say, if the shipment size is Q?
• Q2/(2*Production Rate)
Q
Q/Production Rate
![Page 13: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/13.jpg)
1313
Total Item-Days
• How many such shipments will there be?
• Annual Demand at DC #1/Q
• So, the total item-days per year from shipments to DC #1 will be…
• Q2/(2*Production Rate)*Demand at DC/Q
• Q*Demand at DC/(2*Production Rate)
• So, making shipments of size Q to DC #1 adds what to the average inventory at the plant?
![Page 14: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/14.jpg)
1414
Effect on Average Inventory
• Q*Demand at DC/(2*Production Rate)
• Example: Q*2500/(2*100*2500) = Q/200
• Correct EOQ for Direct Shipments:
• Total Cost: carrying cost*Q*Demand at DC/(2*Production Rate)
+ carrying cost*Q/2
+transport cost*Demand at DC/Q
Q* = 2*transport*Demand/carrying cost P/(D+P)
![Page 15: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/15.jpg)
1515
In Our Case
• Since Demands at the n DCs are equal P/(D+P) = nD/(nD+D) = n/(n+1) • Q* = 2*transport*Demand/carrying cost P/(D+P)• Q* = 2*transport*Demand/carrying cost n/(n+1)
![Page 16: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/16.jpg)
1616
Will this Work at the Warehouse?• “Outbound” Inventory of monitors
• Consider shipments to a DC the gets CPU’s and Consoles direct from the plants -- shipping only Monitors, etc. from Warehouse
• Analysis is identical
• Q/2 * Q/P * D/Q = Q*D/(2*P)
Half the shipment size
How long to accumulate the shipment
The number of shipments/year
![Page 17: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/17.jpg)
1717
What about the other products?
• Consider a shipment of Monitors and CPU’s
• What is the production rate?
• How long does it take to accumulate the shipment?
Q
Q/Production Rate
![Page 18: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/18.jpg)
1818
Assumption• Q is the number of “assemblies” shipped• Assembly is Monitor, Keyboard, TV and CPU• How long does it take to accumulate the shipment?• How long does it take to accumulate the
assemblies?• Assumption: Allocate Monitors etc. (which arrive
faster) to assemblies at the rate the CPUs arrive and the remainder to pure shipments.
![Page 19: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/19.jpg)
1919
Example
![Page 20: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/20.jpg)
2020
Can’t Model it Exactly• “Outbound” inventory for part at Warehouse
from shipments to DC • EOQ/2 * EOQ/P * D/EOQ = EOQ*D/(2P)• P = annual vol. of option thru warehouse
1 ship opt to dc via warehouse 0 otherwise
• P = sum{dc in DCs}Demand for option at DC* x[dc]
• In the denominator! That’s not linear
{Binary variable x[dc] =
![Page 21: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/21.jpg)
2121
But, ….
• If all the EOQ*D’s are roughly equal we might approximate
sum{dc in DCs} h * EOQ[dc]/2 *D*x[dc]/P
sum{dc in DCs} h * EOQ[dc]/2 *(x[dc]/sum x[k])
h *(avg EOQ/2)*y
Where y is a binary variable that models
sum{dc in DCs} x[dc]/sum{k in DCs} x[k]
1 if any x[dc] =1 and
0 otherwise. { Binary variable y =
![Page 22: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/22.jpg)
2222
Without Optimization
• Ignore inventory at the plants and at the warehouse
• Calculate best strategy at each dc
• All Direct: $4.5 million
• Only Denver via Indianapolis: $4.1 million
• Only GB via Indianapolis: $3.5 million
• All via Indianapolis: $3.0 million
• Best at each DC: $3.0 million
![Page 23: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/23.jpg)
2323
Overview
• Sets– PLANTS– DCS– OPTIONS: All direct, none direct, ...
• Parameters– Distances– EOQs
• for direct shipments and • each option via the warehouse
![Page 24: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/24.jpg)
2424
Variables
• Select an option for each dc
• Whether or not each plant ships to the warehouse
• Optionally, indicate whether or not each plant serves each dc directly (can be inferred from the option chosen.
• Whether or not the warehouse shipped each option to some dc
![Page 25: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/25.jpg)
2525
Objective
• Transportation Costs
• Inventory Costs– Carrying cost for 1/2 the appropriate EOQ
value at the DCs– 1/2 the average EOQ value by option at the
warehouse (outbound)– Carrying cost of 1/2 a truckload at the
warehouse for each plant that ships to the warehouse (inbound)
![Page 26: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/26.jpg)
2626
Inventory at the Plants
Shipments of size Q induce inventory of
Q*Demand at Destination/(2*Production Rate)
at the Plant• Q is the
– the EOQ for the DCs
– a truckload for the warehouse
• sum{dc in DCs}EOQ[dc]/(2*100)*Did we ship direct? +• sum{dc in DCs}TL/(2*weight*100)*Did we ship via warehouse?
![Page 27: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/27.jpg)
2727
Constraints
• Select a single option at each dc
• Whether or not each plant ships to the warehouse
• Whether or not the warehouse ships each option.
![Page 28: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/28.jpg)
2828
Reports
• To a manager, not a professor
• Executive Summary -- the business!
• Solution Details
• Appendix– Modeling Assumptions– Model Description– Model itself
![Page 29: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/29.jpg)
2929
Executive Summary• Overview of Solution• Take solution back through “exact” calculations and
report– Total Cost– Breakdown of
• Transportation Cost• Inventory Cost
– Transportation Cost• Breakdown by
– Plant to Warehouse
– Plant to DCs
– Warehouse to DCs
![Page 30: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/30.jpg)
3030
Exec Summary Cont’d
– Inventory (Volume, Value, Carrying Cost)• Breakdown by
– Plant
– Warehouse
» CPU
» Monitor
» Console
– DCs (overall average, min and max)
» CPU
» Monitor
» Console
![Page 31: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/31.jpg)
3131
Exec Summary - Impacts
• Time to market (total days in inventory)– Console
– CPU
– Monitors
• Days in Inventory at DCs (avg, min, max)– Console
– CPU
– Monitor
• Any significant regional differences..
![Page 32: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/32.jpg)
3232
What if...
• All via Indianapolis …
• Warehouses at other plants (above and beyond for class,…)
• ...
![Page 33: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/33.jpg)
3333
Solution Details
• More detailed analysis of results summarized in Exec. Summary
• Charts, Tables, Graphs
![Page 34: 1 1 Project #1 Optimization Model John H. Vande Vate Spring, 2001](https://reader035.vdocument.in/reader035/viewer/2022062301/56649e975503460f94b9aadc/html5/thumbnails/34.jpg)
3434
Appendix
• Assumptions, Approximations, Observations
• How we handled Indianapolis vs. Warehouse
• Approach to Inventory at the Warehouse and at Plants
• EOQ further discussion
• ...