Professional Documents
Culture Documents
Network Design
Network Design
Product Multiple
Carriers Demand shifts
Normal demand curve Product Flow Categorization
quickly
Supplier Rates
Capacity Customer
Locations
Products
Demand
Consolidation Cross Docks Pattern
Vendors
Centers & DCs Zone Base
Warehousing Transport
Restrictions Rates for
Sourcing Product Set
Policies Warehouse
Capacity Warehouse
Capability on Utilization &
Handling Products Limitations
McMaster-Carr (6
facilities 1-2 day lead
time most US cities)
Inventory Costs and Number
of Facilities
B&N
Amazon
B&N
PPET = 7
Amazon
PPET = 19
The retailer plays same role as before, but carrier merges in-transit the
order if from multiple manufacturers. Example: order a Dell PC and a Sony
monitor; carrier merges at a hub before delivering to customer
2. In-Transit Merge
subject to
n
n m
x D j for j 1,..., m
Min cij xij
ij
i 1
i 1 j 1 m
x
j 1
ij K i for i 1,..., n
Network Model 1
Numerical
Example
Demand City
Production and Transportation Cost
per Thousand Units (Thousand $)
Monthly
Capacity
Atlant Bosto (Thousand
Supply City a n Chicago Denver Omaha Portland Units) K
Baltimore 1,675 400 985 1,630 1,160 2,800 18
Cheyenne 1,460 1,940 970 100 495 1,200 24
Salt Lake City 1,925 2,400 1,450 500 950 800 27
Memphis 380 1,355 543 1,045 665 2,321 22
Wichita 922 1,646 700 508 311 1,797 31
Monthly 10 8 14 6 7 11
demand
(thousand
units) D
Network model 1
Formulation of the model
Baltimore 0 8 2 0 0 0
Cheyenne 0 0 0 6 0 0
Salt Lake 0 0 0 0 0 11
Memphis 10 0 12 0 0 0
Wichita 0 0 0 0 7 0
Z = $26,463
Network Model 2: Selecting
plants
Given that you can meet supply with less plants,
decide which plants should remain open
There are now location-specific costs to consider!
x ij D j for j 1,..., m
i 1 Note!
m
x
j 1
ij K i yi for i 1,..., n
Numerical
Example
Demand City
Production and Transportation Cost
per Thousand Units (Thousand $)
Monthly Monthly
Capacity Fixed
(Thousa Cost
Supply Atlant Bosto Chicag Denve Omah Portlan nd Units) (Thousa
City a n o r a d K nd $) f
Baltimor 1,675 400 985 1,630 1,160 2,800 18 7,650
e
Cheyenn 1,460 1,940 970 100 495 1,200 24 3,500
e
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
Network Model 2
Formulation of the model
Z= $ 47,401
Network Model 3: Single
sourcing
Each market should be supplied by only one factory
Modify objective, constraints & decision variables
as follows:
yi = 1 if factory i is open, 0 otherwise
xij = 1 if market j is supplied by factory i, 0 otherwise
n n m
Min f i yi D j cij xij
i 1 i 1 j 1
subject to
x
i 1
ij 1 for j 1,..., m
m Note!
D x
j 1
i ij K i yi for i 1,..., n
xij , yi 0,1
Network Model 3
Present the formulation of the model
Cheyenne Closed 0 0 0 0 0 0
Memphis Open 10 8 0 0 0 0
Wichita Open 0 0 14 0 7 0
Z= $49,717
Network Model 4: Multiple
Capacity Options
We need to decide both the location and
capacity allocation for each facility as
earlier, however:
We have multiple capacity options for each
location (in particular a high and a low
option)
Network Model 4
Modelling approach:
Treat each scenario option as a separate
facility and introduce binary variables for
each one of them as earlier. For example:
Binary variables Y1 and Y5 will refer to N.
America, and will denote the low and high
capacity, respectively.
Add a constraint to make sure that only one
capacity will be realized!
e.g. Y1+Y5 ≤ 1
Network Model 4
Formulation of the model
Min Z = 6000Y1+…+ 4000Y5+
+ 9000Y6+…+6000Y10
+1675x11 + 400X12 + ... + 311X55 + 1797X56
+1675x61 + 400X62 + ... + 311X12,5 + 1797X10,6
s.t.
(X11 + X21 + ... + X51) + (X61 + X71 + ... + X101) = 10Satisfy the demand
…. of each demand city
(X16 + X26 + ... + X56) + (X66 + X76 + ... + X10,6) = 7
(X11 + X12 + ... + X16) + (X61 + X62 + ... + X66) ≤ 18(YDo 1+Y6)
not exceed
the capacity
….
(X51 + X52 + ... + X56) + (X10,1 + X10,2 + ... + X10,6) ≤ 31(Y5+Y10)
Make sure that at most only one capacity
scenario will be realized for each location
Y1+Y6 ≤ 1 …. Y5+Y10 ≤ 1
Solution to Network Model 4
Network Optimization
Models and Examples cont.
What happens if I have a complex network
with multiple transshipment points and
transportation capacities?
Capacity of the plants (in ton per year) and demand from
cij = cost of producing and shipping one unit from node i to node j
subject to
n n n n
warehouses)
Nodes 6 & 7 represent demand points (e.g.
T:0
4
customers) D:400
S:200
There are linear costs and capacities 6
3 S:100 T:0
5
Network Model 5
Numerical Example (cont.)
s.t.
Node 1: (X12 + X13 + ... + X17) – (X21 + X31) = 200
Node 2: (X21 + X23 + ... + X27) – (X12 + X32) = 300
Node 3: (X32 + X31 + ... + X37) – (X13 + X23) = 100
Network model 5
Origin ion Cost Flow
1 2 5.0 0
1 3 3.0 180
1 4 5.0 0
1 5 5.0 0
1 6 20.0 0
T:0
1 7 20.0 0
4
2 1 9.0 0
D:400
2 3 9.0 0
S:200 6 2 4 1.0 300
2 5 1.0 0
1
2 6 8.0 0
2 7 15.0 0
2 7 3 1 0.4 0
S:300
3 2 8.0 0
D:180
3 4 1.0 0
3 5 0.5 280
3 6 10.0 0
3 S:100 5 T:0 3 7 12.0 0
4 5 1.2 0
4 6 2.0 300
4 7 12.0 0
5 4 0.8 0
Z 5 6 2.0 280
: 2320 5 7 12.0 0
6 7 1.0 180
7 6 7.0 0
Network Model 6: Network
flow for multiple products
Minimum cost network flow model - Multiple
Products
Same network structure as before (this can easily
relaxed)
Shipment of 2 products (P and P )
1 2
2 7
S1:300
D1:180
S2:100
D2:140
3 T:0
Assume that the
S1:100
S2:100 unit shipping costs
5
are the same for
both products (this can be easily relaxed)
Network Model 6
Mathematical Model
xijp = quantity shipped of product p from node i to node j
cij = cost of producing and shipping one unit from node i to node j
p n n
Min c x ij ijp
subject to
p 1 i 1 j 1 n n
x
j 1
ijp x jip Di for all p and i 1,..., n
j 1
s.t.
Node 1, P1: (X121 + X131 + ... + X171) – (X211 + X311) = 200
Node 1, P2: (X122 + X132 + ... + X172) – (X212 + X312) = 200
…
Node 7, P1: X761 - (X171 + X271 + ... + X671) = - 400
Node 7, P2: X762 - (X172 + X272 + ... + X672) = - 200
X121+X122 ≤ 300
…
X761+X762 ≤ 300
Solution of Network Model 6
Destinatio Unit Flow Product Flow Product
Origin n Cost 1 2 Total flow Arc Capacity
1 2 5.0 0 0 0 <= 300
1 3 3.0 180 120 300 <= 300
1 4 5.0 0 20 20 <= 300
1 5 5.0 0 0 0 <= 300
1 6 20.0 0 0 0 <= 300
1 7 20.0 0 0 0 <= 300
2 1 9.0 0 0 0 <= 300
2 3 9.0 0 0 0 <= 300
2 4 1.0 100 0 100 <= 300
2 5 1.0 0 0 0 <= 300
2 6 8.0 200 100 300 <= 300
2 7 15.0 0 0 0 <= 300
3 1 0.4 0 0 0 <= 300
3 2 8.0 0 0 0 <= 300
3 4 1.0 0 180 180 <= 300
3 5 0.5 280 20 300 <= 300
3 6 10.0 0 0 0 <= 300
3 7 12.0 0 20 20 <= 300
4 5 1.2 0 0 0 <= 300
4 6 2.0 100 200 300 <= 300
4 7 12.0 0 0 0 <= 300
Z=5570 5 4 0.8 0 0 0 <= 300
5 6 2.0 280 20 300 <= 300
5 7 12.0 0 0 0 <= 300
6 7 1.0 180 120 300 <= 300
7 6 7.0 0 0 0 <= 300
Network Optimization
Models and Examples cont.
More enhanced Capacitated Plant Location Models
Model 7: Simultaneous location of plants and warehouses
Model 8: Accounting for Taxes, Tariffs, and Customer
Requirements
Model 9: Adding restrictions on the number of locations +
alternative objective functions (see excel file “AI's
Athletic.xls”)
Model 10: Production and shipping through
transshipment points with multiple modes of
transportation + location decisions (see excel file “MIP
network flow with multiple trans modes and location.xls”
Network Model 7
i 1
Min Fi yi to warehouse
xehi1
f e ye e
= h 1
c x c x c
i 1
hi hi
i 1 e 1
ie ie
quantity shipped from supplier h to e 1 j 1
x
ej ej
factory at site i
Network Model 7
subject to
x hi S h for h 1,..., l m
i 1 x
j 1
ej We ye for e 1,..., t
l t
x
hi ie
h 1 e 1 ej D j for j 1,..., m
e 1
t
x K i yi for i 1,..., n
yi , ye 0,1 , xej , xie , xhi 0
ie
e 1
n m
x –x
i 1
ie
j 1
ej 0 for e 1,..., t
Network Model 8
A supply chain network should maximize profits after
tariffs and taxes while meeting customer service
requirements
If rj is the revenue of selling one product unit to market
j, then the objective and constraint are modified as:
m n n n m
Max rj xij – Fi yi – cij xij
j 1 i 1 i 1 i 1 j 1
x
i 1
ij D j for j 1,..., m
Network Model 9
to customer j
P =Min total number
distij of
d jwarehouses
Yij to locate
dj = demandiIof jcustomer
J j
Y
i 1
ij 1 for j 1,..., J
Yij X i i I , j J
x
iI
i P
Network Models 9 & 10
AI’s Athletic excel file
MIP network flow with multiple trans
modes and location excel file
Network Optimization
Models and Examples cont.
Multiple products and modes of transportation?