Warehouse and Location I
Warehouse and Location I
Prof. Wei
– Sink points
• Retail outlets
• Customers/Users
– Intermediate points
• Warehouses
• Distribution centers
• Sink points
– Service: decisions are driven by service factors. Response time, accessibility,
and availability are key dimensions for locating in the service industry.
– Retail: decisions are driven by revenue. Traffic flow and resulting revenue are
primary location factors, cost is considered after revenue.
– Competition: Locating to split the market / to capture largest market share
Bo
à
1– b – a 1+ b – a If p
d1 = a + and d 2 = sh
2 2
• How many facilities should there be and what size should they be?
Global/National/ Site-Specific
Regional Determinants Determinants
Growing use of
and need for
strategically
located cross-
Greater use of Greater emphasis on
“Customer-direct” docking facilities
access to major airports
delivery from and/or ocean ports for
manufacturing import and export
shipments
Strategic
positioning of
inventories
Greater use of
(fast-moving, Site providers of third-
profitable items party-logistics
vs. slower-moving, Selection
services
less-profitable
items)
Designed to develop a
computer representation of
supply chain network &
Simulation Models observe changes as cost
structures, constraints, and
other factors are varied.
n Multiply by the number of loads between each site and the four cities
Logistics Management Prof. Wei University at Buffalo Slide 17
Load-Distance Model (Cont.)
!"#$%CD()*C+,*-".LM1D2C.(3,*43"5,*S"5*4$5D()SD,TL
!DC8 -".L 1D2C.(3, TL
!T,9,T.(L :; <=>; ?=@>;
!"T%#A%2 := B>; B;
!D(3D((.CD :< @>; C=
1.8C"( B ?>; :B
a"C.T *-".LM1D2C.(3,*43"5,bB;c>;d***
!"#$%CD()*C+,*-".LM1D2C.(3,*43"5,*S"5*e.(2SD,TL
!DC8 -".L 1D2C.(3, TL
!T,9,T.(L :; f :<=
!"T%#A%2 := f f=
!D(3D((.CD :< <= <B=
1.8C"( B :c cB
a"C.T **-".LM1D2C.(3,*43"5,b;=Bd*****
Step 1: For each location, determine the fixed and variable costs
Step 2: Plot the total costs for each location on one graph
Step 3: Identify ranges for which each location has the lowest total cost
Step 4: Solve algebraically for the break-even points over the identified ranges
!"#ABCDEF*+E,-.L0E12D#34!5DLE6L#CT-.-
UV:#;.VL <."D=E>V-; ?#2.#@CDE>V-; AV;#CE>V-;
6 BCabcbbb BEadebcbbbI Bgbbcbbb
1 BeKbcbbb BiadebcbbbI Bgibcbbb
> Bebbcbbb BgbdebcbbbI Babbcbbb
M Biabcbbb BibdebcbbbI Bgabcbbb
– Over that time period, the supply capacities and locations are unlikely to
change at all, and the demands can be predicted with reasonable precision.
• These decisions are strategic in the sense that, once determined, they
influence the system for a relatively long time interval.
• The basic model for choosing supply locations is called the Network
Design Model.
– Alternatively, it is also directly referred to as the facility location model.
– In Hardgrave Machine Company example (in the Transportation model), we
implicitly discussed the facility location selection problem in which we build
models and evaluate total costs for all possible facility selection choices; then
select the facility choice with the least cost.
– In this session, we will present how to select the optimal facility location over all
choices via a single unified model.
• The costs at stake are also of two types: fixed costs associated with
keeping a warehouse open and variable transportation costs
associated with shipments from the open warehouses.
Albuquerque 0.0 47.0 32.0 22.0 42.5 27.0 23.0 30.0 36.5 29.5
Dallas 32.0 79.5 0.0 39.0 12.5 10.5 50.0 63.0 13.5 17.0
Denver 21.0 42.0 39.0 0.0 51.5 31.5 40.5 24.0 47.5 26.0
Houston 42.5 91.0 12.5 51.5 0.0 23.0 58.0 72.0 10.0 31.0
Phoenix 23.0 49.0 50.0 40.5 58.0 49.0 0.0 32.5 50.0 52.0
San Antonio 36.5 83.5 13.5 47.5 10.0 24.0 50.0 66.5 0.0 32.0
– Warehouse choices:
1; if warehouse 𝑖 is open
𝑦! = #
0; if warehouse 𝑖 is NOT open
– Shipping costs:
• E.g., from Albuquerque to other distribution centers
0𝑥$,$ + 47𝑥$,% + 32𝑥$,& + 22𝑥$,' + 42.5𝑥$,(
+27𝑥$,) + 23𝑥$,* + 30𝑥$,+ + 36.5𝑥$,, + 29.5𝑥$,$-
. . 𝑐!,# / 𝑥!,#
!.$ #.$
$ $ #'
Subject to
#'
𝑦! = 0 or 1 , for i=1,2,…,6.
Binary Constraint
Logistics Management Prof. Wei University at Buffalo Slide 30
Mixed Integer Programming
• The optimal solution of a linear program may contain fractional
decision variables, even when it does not make sense from a
practical standpoint.
– E.g., open 0.8 warehouse.
– E.g., sending 19.5 products from New York to St. Louis.
• Bad news: the optimal integer solution may not reside in the
“vicinity” of the relaxation problem’s fractional solution.
1
Increasing revenue
0 1 2 3 4 5
1; if plant 𝑖 is open
𝑦! = #
0; if plant 𝑖 is NOT open
Subject to
+
𝑦! = 0 or 1 , for i=1,2,…,4.
9:?7;(-+<
S7(-8 !?#ABCD(( )B*+,- .?-/?--B+? MC11B#, O+#B-+B
P,-+?B/ 4 ! ! ! ! !
.?-/?--B+? 5 ! "#$!!! "%$!!! &$!!! !
)B*+,- 4 ! ! ! ! !
O+#B-+B 5 "!$!!! ! ! "!$!!! "'$!!!
S7?89(-+:
;8(-< !?#ABCD(( )B*+,- .?-/?--B+? MC11B#, O+#B-+B
P,-+?B/ 4 ! ! ! ! !
.?-/?--B+? 4 ! "#$!!! "%$!!! &$!!! !
)B*+,- 5 ! ! ! ! !
O+#B-+B 4 "!$!!! ! ! "!$!!! "'$!!!