Professional Documents
Culture Documents
ch06 Revised
ch06 Revised
Transshipment, and
Assignment Problems
Chapter 6
Exhibit 6.7
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 6-8
Transportation Model Example
Computer Solution with QM for Windows (2 of 3)
Exhibit 6.8
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 6-9
Transportation Model Example
Computer Solution with QM for Windows (3 of 3)
Exhibit 6.9
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 6-10
The Transshipment Model
Characteristics
■ Extension of the transportation model.
■ Intermediate transshipment points (distribution centers or
warehouses) are added between the sources and destinations.
■ Items may be transported from:
Sources through transshipment points to destinations
One source to another
One transshipment point to another
S1 T1
One destination to another D1
Directly from sources to destinations S T2
2
Some combination of these
Before being shipped to three mills (200, 100, 300 tons), the
wheat is shipped to three grain elavators in:
Kansas City
Omaha
Des Moines
Figure 6.4
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 6-17
The Assignment Model
Characteristics
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Exhibit 6.16 6-21
Assignment Model Example
Computer Solution with QM for Windows (2 of 2)
Exhibit 6.17
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 6-22
Example Problem Solution
Transportation Problem Statement
A concrete company transports concrete from three
plants to three construction sites. Determine the linear
programming model formulation and solve using QM:
Construction site
Plant A B C Supply (tons)
1 $8 $5 $6 120
2 15 10 12 80
3 3 9 10 80
Demand (tons) 150 70 100
Tailor
Garment 1 2 3 4 5
Wedding gown 19 23 20 21 18
Clown costume 11 14 X 12 10
Admiral's uniform 12 8 11 X 9
Bullfighter's outfit X 20 20 18 21
Zeron N Zeron S
Arnold 5 8
Supershelf 7 4
Network Representation
ZROX
Zrox 50
5 1
Zeron
75 ARNOLD
Arnold
N 5
8 8
Hewes 60
HEWES
7 3
Super Zeron
WASH 4
75 Shelf S
BURN
4 4 Rock-
Rite 40
Constraints Defined
Amount Out of Arnold: x13 + x14 < 75
Amount Out of Supershelf: x23 + x24 < 75
Amount Through Zeron N: x13 + x23 - x35 - x36 - x37 = 0
Amount Through Zeron S: x14 + x24 - x45 - x46 - x47 = 0
Amount Into Zrox: x35 + x45 = 50
Amount Into Hewes: x36 + x46 = 60
Amount Into Rockrite: x37 + x47 = 40
Optimal Solution
ZROX
Zrox 50
50
5
75 1
Zeron
75 ARNOLD
Arnold
N 5 25
8 8
Hewes 60
HEWES
35
7 3 4
Super Zeron
WASH 40
75 Shelf 4 S
BURN
75 4 Rock-
Rite 40
Network Representation
50
West. A
36
Subcontractors 16 Projects
28
30
Fed.
Fed. B
18
35 32
Gol.
Gol. C
20
25 25
Univ.
14
© 2004 Thomson/South-Western Slide
40
Example: Who Does What?
Linear Programming Formulation
Min 50x11+36x12+16x13+28x21+30x22+18x23
+35x31+32x32+20x33+25x41+25x42+14x43
s.t. x11+x12+x13 < 1
x21+x22+x23 < 1 Agents
x31+x32+x33 < 1
x41+x42+x43 < 1
x11+x21+x31+x41 = 1 Tasks
x12+x22+x32+x42 = 1
x13+x23+x33+x43 = 1
xij = 0 or 1 for all i and j
© 2004 Thomson/South-Western Slide
41
Example: Who Does What?