Network Design in The Supply Chain
Network Design in The Supply Chain
Network Design in The Supply Chain
Network Design in
the Supply Chain
1-1
5-1
Learning Objectives
1. Understand the role of network design in a
supply chain.
2. Identify factors influencing supply chain
network design decisions.
3. Develop a framework for making network
design decisions.
4. Use optimization for facility location and
capacity allocation decisions.
• Strategic factors
• Technological factors
• Macroeconomic factors
– Tariffs and tax incentives
– Exchange-rate and demand risk
– Freight and fuel costs
• Political
• Infrastructure factors
• Competitive factors
– Positive externalities between firms
– Locating to split the market
• Customer response time and local
presence
• Logistics and facility costs
n n m
Problem:
Min f i yi c x ij ij
There are several options
to meet the demand
i 1 i 1 j 1
-construct a small facility
subject to in each region to lower
n
x
i 1
ij D j for j 1,..., m total transportation cost
-construct a large facility to
m lower the total construction
x
j 1
ij K i yi for i 1,..., n cost
Figure 5-4
• Vice president of Supply Chain decides to view the worldwide demand in
five regions: North America, South America, Europe, Asia, Africa
Copyright ©2013 Pearson Education. 5-19
Capacitated Plant Location Model
Figure 5-5
Figure 5-5
Figure 5-6
Figure 5-7
2 2
dn = ( x – x ) +( y – y )
n n
𝑘
Total transportation
cost to minimize =𝑇𝐶= ∑ 𝑑𝑛 𝐷 𝑛 𝐹𝑛
𝑛=1
Figure 5-8
Figure 5-8
Dn Fn Dn Fn
å d å d
n=1 n n=1 n
Demand City
Production and Transportation Cost
per Thousand Units (Thousand $)
Monthly Monthly
Capacity Fixed Cost
Supply (Thousand (Thousand
City Atlanta Boston Chicago Denver Omaha Portland Units) K $) f
Baltimore 1,675 400 985 1,630 1,160 2,800 18 7,650
Cheyenne 1,460 1,940 970 100 495 1,200 24 3,500
Salt Lake 1,925 2,400 1,450 500 950 800 27 5,000
City
Memphis 380 1,355 543 1,045 665 2,321 22 4,100
Wichita 922 1,646 700 508 311 1,797 31 2,200
Monthly 10 8 14 6 7 11
demand
(thousan
d units) Dj
TelecomOne: Table 5-2
capacity 71,000 units/month; demand 32,000 units/month
HighOptic: capacity 51,000 units/month; demand 24,000 units/month
Producers of fiberoptic telecommunications equipment
Copyright ©2013 Pearson Education. 5-29
Network Optimization Models
• Allocating demand to production facilities
n = number of factory locations (3 or 2)
m = number of markets or demand points (3 or 3) xij = quantity shipped from factory i
Dj = annual demand from market j to market j
Ki = capacity of factory i
cij = cost of producing and shipping one unit from factory i to market j
n
n m x ij D j for j 1,..., m
Min cij xij subject to
i 1
m
x
i 1 j 1
ij K i for i 1,..., n
j 1
Problem: Decide how markets are allocated to the facilities. Response time
should be considered.
Copyright ©2013 Pearson Education. 5-30
Network Optimization Models
• Optimal demand allocation
Atlanta Boston Chicago Denver Omaha Portland
TelecomOne Baltimore 0 8 2
Memphis 10 0 12
Wichita 0 0 0
Cheyenne 6 7 0
x
i 1
ij D j for j 1,..., m
m
yi 0,1 and x ij 0
xij K i yi for i 1,..., n
j 1
Copyright ©2013 Pearson Education. 5-32
Capacitated Plant Location Model
Figure 5-9
Figure 5-10
Copyright ©2013 Pearson Education. 5-34
Capacitated Plant Location Model
Figure 5-10
Figure 5-11
åx ij
=1 for j =1,...,m
i=1
m
å Dx i ij
£K i yi for i =1,...,n
j=1
xij , yi Î { 0,1}
Copyright ©2013 Pearson Education. 5-38
Capacitated Model With
Single Sourcing
• Optimal network configuration with single
sourcing
Open/
Closed Atlanta Boston Chicago Denver Omaha Portland
Baltimore Closed 0 0 0 0 0 0
Cheyenne Closed 0 0 0 0 0 0
Salt Lake Open 0 0 0 6 0 11
Memphis Open 10 8 0 0 0 0
Wichita Open 0 0 14 0 7 0
Table 5-4
Figure 5-13
å å åå åå
warehouse e
Minxhi F=i yi quantity
+ f e yshipped
e
+ fromchisupplier
xie + h to factory
cej xej at
i=1 i
site e=1 h=1 i=1 e=1 j=1
n m
åx hi
£Sh for h =1,...,l åx ej
£We ye for e =1,...,t
i=1 j=1
l t t
åx hi
– å xie ³ 0 for i =1,...,n åx ej
=D j for j =1,...,m
h=1 e=1 e=1
t
åx ie
£ K i yi for i =1,...,n yi , ye Î { 0,1} , xej , xie , xhi ³ 0
e=1
n m
å x –å xie ej
³ 0 for e =1,...,t
i=1 j=1
åx ij
£D j for j =1,...,m
i=1