DA05 Transportation, Assignment, and Transshipment
DA05 Transportation, Assignment, and Transshipment
DA05 Transportation, Assignment, and Transshipment
Session 5:
1
Learning Objectives
1) Know the basic characteristics of the transportation problem.
2) Be able to draw the network representation/map
3) Be able to formulate the LP problem and solve the
transportation problem.
4) Know the basic characteristics of the assignment problem.
5) Be able to draw the network representation/map
6) Be able to formulate the LP problem and solve the assignment
problem.
7) Know the basic characteristics of the transshipment problem.
8) Be able to draw the network representation/map
9) Be able to formulate the LP problem and solve the
transshipment problem.
OPIM 101 DA - Low CS 2
Distribution and Network Models
(Chapter 6)
Transportation Problem
• Network Representation
• General LP Formulation
Assignment Problem
• Network Representation
• General LP Formulation
Transshipment Problem
• Network Representation
• General LP Formulation
3
Transportation, Assignment, and
Transshipment Problems
4
Transportation, Assignment, and
Transshipment Problems
Each of the five models of this chapter can be
formulated as linear programs and solved by
general purpose linear programming codes.
For each of the five models, if the right-hand side
of the linear programming formulations are all
integers, the optimal solution will be in terms of
integer values for the decision variables.
However, there are many computer packages
(including The Management Scientist) that contain
separate computer codes for these models which
take advantage of their network structure.
5
Transportation Problem
6
Transportation Problem
Network Representation
1 d1
c11
s1 1 c12
c13
2 d2
c21
s2 2 c22
c23
3 d3
Sources Destinations
7
Transportation Problem
Linear Programming Formulation
8
Transportation Problem
x
j =1
ij si i =1, 2, ,m Supply
x
i =1
ij dj
= j =1, 2, ,n Demand
10
Transportation Problem: Example
11
Transportation Problem: Example
12
Transportation Problem: Example
13
Transportation Problem: Example
14
Transportation Problem: Example
15
Transportation Problem: Example
Objective Function
Total Cost (MIN) 2490
16
Transportation Problem: Example
Optimal Solution
17
Assignment Problem
18
Assignment Problem
Network Representation
c11
1 1
c12
c13
Agents Tasks
c21
c22
2 2
c23
c31
c32
3 c33 3
19
Assignment Problem
continued
20
Assignment Problem
x
j =1
ij 1 i =1, 2, ,m Agents
m
x
i =1
ij = 1 j =1, 2, ,n Tasks
Note: As a special case of the transportation model, and with all the
supply and demand values equal 1, the optimal solution must be
integer valued and in this case, must be 0 or 1.
21
Assignment Problem
22
Assignment Problem
x
j =1
ij t i =1, 2, ,m Agents
23
Assignment Problem: Example
24
Assignment Problem: Example
Network Representation
50
West. A
36
Subcontractors 16 Projects
28
Fed.
30 B
18
35 32
Gol. C
20
25 25
Univ.
14
25
Assignment Problem: Example
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
x12+x22+x32+x42 = 1 Tasks
x13+x23+x33+x43 = 1
xij = 0 or 1 for all i and j
26
Assignment Problem: Example
27
Assignment Problem: In-Class Exercise
Sweeney Chapter 6
28
Assignment Problem: In-Class Exercise
29
Assignment Problem: In-Class Exercise
DCs Los Angeles Chicago Columbus Atlanta Newark Kansas Denver Dallas
Plano X11 X12 X13 X14 X15 X16 X17 X18
Nashville X21 X22 X23 X24 X25 X26 X27 X28
Flagstaff X31 X32 X33 X34 X35 X36 X37 X38
Springfield X41 X42 X43 X44 X45 X46 X47 X48
Boulder X51 X52 X53 X54 X55 X56 X57 X58
DCs Los Angeles Chicago Columbus Atlanta Newark Kansas Denver Dallas
Plano 70 47 22 53 98 21 27 13
Nashville 75 38 19 58 90 34 40 26
Flagstaff 15 78 37 82 111 40 29 32
Springfield 60 23 8 39 82 36 32 45
Boulder 45 40 29 75 86 25 11 37
DCs Los Angeles Chicago Columbus Atlanta Newark Kansas Denver Dallas Sum RHS
Plano 0 0 0 0 0 1 0 1 2 < 3
Nashville 0 0 0 0 0 0 0 0 0 < 3
Flagstaff 1 0 0 0 0 0 0 0 1 < 3
Springfield 0 1 1 1 0 0 0 0 3 < 3
Boulder 0 0 0 0 1 0 1 0 2 < 3
Sum 1 1 1 1 1 1 1 1
30
Transshipment Problem
31
Transshipment Problem
Network Representation
c36
3
c13
s1 1
c37 6 d1
c14
c15 c46
Supply 4 c47 Demand
c23
c24 c56
s2 2 7 d2
c25
5 c57
Sources Destinations
Intermediate Nodes
32
Transshipment Problem
33
Transshipment Problem
Min cx
all arcs
ij ij
s.t.
arcs out
xij − x
arcs in
ij si Origin nodes i
arcs out
xij − x
arcs in
ij =0 Transhipment nodes
x
arcs in
ij −
arcs out
xij = d j Destination nodes j
34
Transshipment Problem
35
Transshipment Problem: Example
36
Transshipment Problem: Example
Zeron N Zeron S
Arnold 5 8
Supershelf 7 4
The costs to install the shelving at the various
locations are:
37
Transshipment Problem: Example
Network Representation
ZROX
Zrox 50
5 1
Zeron
75 Arnold
ARNOLD
N 5
8 8
Hewes
HEWES 60
7 3
75
Super Zeron
WASH 4
Shelf S
4 BURN
4 Rock-
Rite 40
38
Transshipment Problem: Example
39
Transshipment Problem: Example
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
40
Transshipment Problem: Example
Zeron Industries
x13 x14 x23 x24 x35 x36 x37 x45 x46 x47
Decision Variables 75 0 0 75 50 25 0 0 35 40 Value
Obj Function Coeff 5 8 7 4 1 5 8 3 4 4 1150
LHS RHS
Const #1 1 1 75 < 75
Const #2 1 1 75 < 75
Const #3 1 1 -1 -1 -1 0 = 0
Const #4 1 1 -1 -1 -1 0 = 0
Const #5 1 1 50 = 50
Const #6 1 1 60 = 60
Const #7 1 1 40 = 40
41
Transshipment Problem: Example
Solution
ZROX
Zrox 50
5 75 1
Zeron
75 Arnold
ARNOLD
N 5
8 8
Hewes
HEWES 60
7 3 4
Super Zeron
75 Shelf
WASH
S
4 BURN
4 Rock-
Rite 40
42
Transshipment Problem: Example
Variable Cells
Final Reduced Objective Allowable Allowable
Cell Name Value Cost Coefficient Increase Decrease
$B$4 Decision Variables x13 75 0 5 2 2
$C$4 Decision Variables x14 0 2 8 1E+30 2
$D$4 Decision Variables x23 0 4 7 1E+30 4
$E$4 Decision Variables x24 75 0 4 2 1E+30
$F$4 Decision Variables x35 50 0 1 3 1E+30
$G$4 Decision Variables x36 25 0 5 2 2
$H$4 Decision Variables x37 0 3 8 1E+30 3
$I$4 Decision Variables x45 0 3 3 1E+30 3
$J$4 Decision Variables x46 35 0 4 2 2
$K$4 Decision Variables x47 40 0 4 3 1E+30
Constraints
Final Shadow Constraint Allowable Allowable
Cell Name Value Price R.H. Side Increase Decrease
$L$10 Const #3 LHS 0 5 0 0 75
$L$11 Const #4 LHS 0 6 0 0 25
$L$12 Const #5 LHS 50 6 50 0 50
$L$13 Const #6 LHS 60 10 60 0 25
$L$14 Const #7 LHS 40 10 40 0 25
$L$8 Const #1 LHS 75 0 75 1E+30 0
$L$9 Const #2 LHS 75 -2 75 25 0 43
End of Session
44