NSW 571 (3) Logistics Network PDF
NSW 571 (3) Logistics Network PDF
NSW 571 (3) Logistics Network PDF
Outline
Introduction
2. Data collection
3. Model and data validation
4. Solution techniques
1.
Logistics Network
The Logistics Network consists of:
Facilities:
Sources:
plants
vendors
ports
Regional
Warehouses:
stocking
points
Field
Warehouses:
stocking
points
Customers,
demand
centers
sinks
Supply
Production/
purchase
costs
Inventory &
warehousing
costs
Transportation
costs
Inventory &
warehousing
costs
Transportation
costs
Decision Classifications
1.
2.
3.
Plant
Strategic
DC
Retailer
Resource Allocation
Tactical
Operational
Inventory
Safety stock allocation
Inventory policy
optimization
Production
Lot-sizing
Scheduling
Transportation
Delivery
Vehicle Routing
2. Data
Data specifies the costs of your supply chain
The baseline cost data should match your accounting
data
The output data allows you to quantify changes to the
supply chain
3. Engine
Optimization Techniques
Aggregating customers
Customers located in close proximity are aggregated
Rules of thumb
Use at least 300 aggregated points
Make sure each zone has an equal amount of total
demand
Place the aggregated point at the center of the zone
In this case, the error is typically no more than 1%
locations
Aggregated Data had 800 3-digit ship-to locations
Total demand was the same in both cases
Comparing Output
Total Cost:$5,796,000
Total Customers: 18,000
Total Cost:$5,793,000
Total Customers: 800
Product Aggregation
Companies may have hundreds to thousands of
characteristics:
Weight
Volume
Holding Cost
60.0
50.0
40.0
30.0
20.0
10.0
0.0
0.000
0.010
0.020
0.030
0.040
0.050
0.060
0.070
0.080
0.090
0.100
Total Cost:$104,599,000
Total Products: 4
information.
To calibrate some of the parameters used in the
model and to suggest improvements in the utilization
of the existing network.
$90
Cost (millions $)
$80
$70
$60
Total Cost
Transportation Cost
Fixed Cost
Inventory Cost
$50
$40
$30
$20
$10
$-
Number of Warehouses
10
(capacitated)
There is a known demand for each product at each
customer zone, satisfied by shipping the products via
regional distribution centers.
There may be an upper bound on total throughput at each
distribution center and on the distance between a
distribution center and a market area served by it.
Set-up costs
Transportation cost is proportional to the distance
Storage and handling costs
Production/supply costs
Solution Techniques
Mathematical optimization techniques:
Exact algorithms: find optimal solutions
Heuristics: find good solutions, not necessarily
optimal
Simulation models: provide a mechanism to evaluate
Heuristics and
the Need for Exact Algorithms
Single product
Two plants p1 and p2 with the same production cost
Plant p1 has an annual capacity of 200,000 units.
Plant p2 has an annual capacity of 60,000 units.
There are two warehouses w1 and w2 with identical
P1
P2
C1
C2
C3
0
5
4
2
3
2
4
1
5
2
$0
Cap = 200,000
$4
$5
$5
D = 100,000
$2
$4
Cap = 60,000
D = 50,000
$3
$2
$1
$2
D = 50,000
Production costs are the same, warehousing costs are the same
D = 50,000
Cap = 200,000
$5 x 140,000
D = 100,000
$2 x 50,000
Cap = 60,000
$2 x 60,000
$1 x 100,000
$2 x 50,000
D = 50,000
$0
Cap = 200,000
P1 to WH1
P1 to WH2
P2 to WH1
P2 to WH 2
$4
$5
$5
$2
$3
$7
$7
$4
D = 100,000
$2
$4
Cap = 60,000
D = 50,000
$3
$1
$2
P1 to WH1
P1 to WH2
P2 to WH1
P2 to WH 2
$4
$6
$8
$3
D = 50,000
P1 to WH1
P1 to WH2
P2 to WH1
P2 to WH 2
$5
$7
$9
$4
$0 x 50,000
D = 50,000
$3 x 50,000
Cap = 200,000
P1 to WH1
P1 to WH2
P2 to WH1
P2 to WH 2
$5 x 90,000
Cap = 60,000
$2 x 60,000
D = 100,000
$1 x 100,000
$2 x 50,000
P1 to WH1
P1 to WH2
P2 to WH1
P2 to WH 2
$4
$6
$8
$3
D = 50,000
P1 to WH1
P1 to WH2
P2 to WH1
P2 to WH 2
$3
$7
$7
$4
$5
$7
$9
$4
Let :
pw
ij
x wm
jk = the flow from warehouse j to market k
s.t.
pw
x2pw
+
x
,1
2 , 2 60,000
pw
wm
wm
wm
x1pw
,1 + x2 ,1 = x1,1 + x1, 2 + x1, 3
pw
wm
wm
wm
x1pw
, 2 + x2 , 2 = x2 ,1 + x2 , 2 + x2 , 3
wm
x1wm
+
x
,1
2 ,1 = 50,000
wm
x1wm
, 2 + x2 , 2 = 100,000
wm
x1wm
, 3 + x2 , 2 = 50,000
P1
P2
C1
C2
C3
140000
0
0
60000
50000
0
40000
60000
50000
0