Professional Documents
Culture Documents
Transportation and Assignment Problem
Transportation and Assignment Problem
Transportation and Assignment Problem
Chapter 8
Transportation, Assignment, and
Transshipment Problems
Slide
1
Transportation, Assignment, and
Transshipment Problems
A network model is one which can be represented by
a set of nodes, a set of arcs, and functions (e.g. costs,
supplies, demands, etc.) associated with the arcs
and/or nodes.
Transportation, assignment, and transshipment
problems of this chapter, as well as the shortest route,
minimal spanning tree, and maximal flow problems
(Chapter 9) and PERT/CPM problems (Chapter 10)
are all examples of network problems.
Slide
2
Transportation, Assignment, and
Transshipment Problems
Each of the three models of this chapter
(transportation, assignment, and transshipment
models) can be formulated as linear programs and
solved by general purpose linear programming
Algorithms (simplex method).
For each of the three 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, DS, QSB) which
contain separate computer codes for these models
which take advantage of their network structure.
Slide
3
Transportation Problem
Network Representation
1 d1
c11
s1 1 c12
c13
2 d2
c21 c
22
s2 2
c23
3 d3
SOURCES DESTINATIONS
Slide
5
Transportation Problem
LP Formulation
The linear programming formulation in terms of the
amounts shipped from the sources to the destinations, xij ,
can be written as:
Min cijxij (total transportation cost)
ij
s.t. xij < si for each source i (supply constraints)
j
xij = dj for each destination j (demand constraints)
i
xij > 0 for all i and j (nonnegativity constraints)
Slide
6
Transportation Problem
Slide
7
Transportation Problem
D1 D2 D3 Supply
15 30 20
S1 50
30 40 35
S2 30
Demand 25 45 10
Slide
8
Problem formulation
The LP model for this problem is as follows:
Min Z = 15 X11 + 30 X12 + 20 X13 + 30 X21 + 40X22 + 35X23
S.t.
X11 + X12 + X13 ≤ 50
Supply constraints
X21 + X22 + X23 ≤ 30
X11 + X21 = 25
X12 + X22 = 45
X13 + X23 = 10 demand constraints
X11, …, X23 0
Slide
9
Transportation Problem
Slide
10
Initial Tableau
Slide
11
Northwest corner
30 40 35
S2 20 10 30
Demand 25 45 10
Demand 25 45 10 Slide
13
Transportation Algorithm
Slide
14
Transportation Algorithm
Slide
15
Transportation Algorithm
Slide
16
Example: BBC
Slide
17
Example: BBC
30
30 40
40 42 00
Plant 2 50
Demand 25 45 10 20
Slide
18
Example: BBC
Slide
19
Example: BBC
Initial tableau
30
30 40
40 42 00
Plant 2 40 10 50
Demand 25 45 10 20
Slide
20
Example: BBC
Iteration 1
• MODI Method
1. Set u1 = 0
2. Since u1 + vj = c1j for occupied cells in row 1, then
v1 = 24, v2 = 30, v4 = 0.
3. Since ui + v2 = ci2 for occupied cells in column 2,
then u2 + 30 = 40, hence u2 = 10.
4. Since u2 + vj = c2j for occupied cells in row 2, then
10 + v3 = 42, hence v3 = 32.
Slide
21
Example: BBC
Iteration 1
• MODI Method (continued)
Calculate the reduced costs (circled numbers on the
next slide) by cij - ui + vj.
Iteration 1 Tableau
30
30 40
40 42
42 00
Plant 2 -4 40 10 -10 10
vj 24 30 32 0
Slide
23
Example: BBC
Iteration 1
• Stepping Stone Method
The stepping stone path for cell (2,4) is (2,4), (1,4),
(1,2), (2,2). The allocations in the subtraction cells are 20
and 40, respectively. The minimum is 20, and hence
reallocate 20 along this path. Thus for the next tableau:
x24 = 0 + 20 = 20 (0 is its current allocation)
x14 = 20 - 20 = 0 (blank for the next tableau)
x12 = 5 + 20 = 25
x22 = 40 - 20 = 20
The other occupied cells remain the same.
Slide
24
Example: BBC
30
30 40
40 42 00
Plant 2 20 10 20 50
Demand 25 45 10 20
New
quantity
Total transportation cost is $2570 = 2770 – 10 (20)
Reduced cost of cell
(2,4) Slide
25
Example: BBC
Iteration 2
• MODI Method
The reduced costs are found by calculating
the ui's and vj's for this tableau.
1. Set u1 = 0.
2. Since u1 + vj = cij for occupied cells in row 1, then
v1 = 24, v2 = 30.
3. Since ui + v2 = ci2 for occupied cells in column 2,
then u2 + 30 = 40, or u2 = 10.
4. Since u2 + vj = c2j for occupied cells in row 2, then
10 + v3 = 42 or v3 = 32; and, 10 + v4 = 0 or v4 = -10.
Slide
26
Example: BBC
Iteration 2
• MODI Method (continued)
Calculate the reduced costs (circled numbers on the
next slide) by cij - ui + vj.
Iteration 2 Tableau
30
30 40
40 42
42 0
Plant 2 -4 20 10 20 10
vj 24 30 36 -6
Slide
28
Example: BBC
Iteration 2
• Stepping Stone Method
The most negative reduced cost is = -4 determined by x21.
The stepping stone path for this cell is (2,1),(1,1),(1,2),
(2,2). The allocations in the subtraction cells are 25 and 20
respectively. Thus the new solution is obtained by
reallocating 20 on the stepping stone path. Thus for the
next tableau:
x21 = 0 + 20 = 20 (0 is its current allocation)
x11 = 25 - 20 = 5
x12 = 25 + 20 = 45
x22 = 20 - 20 = 0 (blank for the next tableau)
The other occupied cells remain the same.
Slide
29
Example: BBC
30
30 40
40 42 00
Plant 2 20 10 20 50
Demand 25 45 10 20
Slide
30
Example: BBC
Iteration 3
• MODI Method
The reduced costs are found by calculating
the ui's and vj's for this tableau.
1. Set u1 = 0
2. Since u1 + vj = c1j for occupied cells in row 1, then
v1 = 24 and v2 = 30.
3. Since ui + v1 = ci1 for occupied cells in column 2,
then u2 + 24 = 30 or u2 = 6.
4. Since u2 + vj = c2j for occupied cells in row 2, then
6 + v3 = 42 or v3 = 36, and 6 + v4 = 0 or v4 = -6.
Slide
31
Example: BBC
Iteration 3
• MODI Method (continued)
Calculate the reduced costs (circled numbers on the
next slide) by cij - ui + vj.
Iteration 3 Tableau
Since all the reduced costs are non-negative, this is
the optimal tableau.
30
30 40 42
42 00
Plant 2 20 +4 10 20 6
vj 24 30 36 -6
Slide
33
Example: BBC
Optimal Solution
Slide
34
Assignment Problem
Slide
35
Assignment Problem
Network Representation
c11
1 11
c12
c13
c21
2 c22 22
c23
c32
c31
3 c33 33
WORKERS JOBS
Slide
36
Assignment Problem
Min cijxij
ij
s.t. xij = 1 for each worker i
j
xij = 1 for each job j
i
xij = 0 or 1 for all i and j.
Slide
37
Example: Hungry Owner
A contractor pays his subcontractors a fixed fee plus
mileage for work performed. On a given day the contractor
is faced with three electrical jobs associated with various
projects. Given below are the distances between the
subcontractors and the projects.
Project
A B C
Westside 50 36 16
Subcontractors Federated 28 30 18
Goliath 35 32 20
Universal 25 25 14
How should the contractors be assigned to minimize total
distance (and total cost)?
Slide
38
Example: Hungry Owner
Network Representation
50
West. 36
A
16
28
30
Fed. B
18
35 32
20
Gol. C
25 25
14
Univ.
Slide
39
Example: Hungry Owner
LP Formulation
• Decision Variables Defined
xij = 1 if subcontractor i is assigned to project j
= 0 otherwise
Slide
40
Example: Hungry Owner
LP Formulation
• Objective Function
Minimize total distance:
Min 50x11 + 36x12 + 16x13 + 28x21 + 30x22 + 18x23
+ 35x31 + 32x32 + 20x33 + 25x41 + 25x42 + 14x43
Slide
41
Example: Hungry Owner
LP Formulation
• Constraints
x11 + x12 + x13 < 1 (no more than one
x21 + x22 + x23 < 1 project assigned
x31 + x32 + x33 < 1 to any one
x41 + x42 + x43 < 1 subcontractor)
x11 + x21 + x31 + x41 = 1 (each project must
x12 + x22 + x32 + x42 = 1 be assigned to just
x13 + x23 + x33 + x43 = 1 one subcontractor)
all xij > 0 (non-negativity)
Slide
42
Example: Hungry Owner
Optimal Assignment
Slide
43
Variations of Assignment Problem
Slide
44
Hungarian Method
Slide
45
Hungarian Method
Slide
46
Hungarian Method
Slide
47
Example: Hungry Owner
Slide
48
Example: Hungry Owner
0 16
28
30
Subcontractors
Fed. B
18
Projects
0
35 32
20
Gol. C
0
25 25
14
Univ. Dum.
0
Slide
49
Example: Hungry Owner
A B C Dummy
Westside 50 36 16 0
Federated 28 30 18 0
Goliath 35 32 20 0
Universal 25 25 14 0
Slide
50
Example: Hungry Owner
A B C Dummy
Westside 25 11 2 0
Federated 3 5 4 0
Goliath 10 7 6 0
Universal 0 0 0 0
Slide
51
Example: Hungry Owner
Slide
52
Example: Hungry Owner
A B C Dummy
Westside 23 9 0 0
Federated 1 3 2 0
Goliath 8 5 4 0
Universal 0 0 0 2
Slide
53
Example: Hungry Owner
Slide
54
Example: Hungry Owner
A B C Dummy
Westside 23 9 0 1
Federated 0 2 1 0
Goliath 7 4 3 0
Universal 0 0 0 3
Slide
55
Example: Hungry Owner
Slide
56
Transshipment Problem
Slide
57
Transshipment Problem
Network Representation
3 c36
c13 c37
s1 1 c14 6 d1
c15 c46
4 c47
c23 c24
c56 7 d2
s2 2
c25
5 c57
Slide
59
Example: Transshipping
Slide
60
Example: Transshipping
Slide
61
Example: Transshipping
Network Representation
ZROX
Zrox 50
5 1
75 ARNOLD
Arnold Thomas 5
8 8
Hewes
HEWES 60
3 4
7
Super Wash-
WASH
75 Shelf Burn
BURN
4 4
Rock-
Wright 40
Slide
62
Example: Transshipping
Slide
63
Example: Transshipping
Constraints Defined
Amount Out of Arnold: x13 + x14 < 75
Amount Out of Supershelf:x23 + x24 < 75
Amount Through Thomas: x13 + x23 - x35 - x36 - x37 = 0
Amount Through Washburn: x14 + x24 - x45 - x46 - x47 = 0
Amount Into Zrox: x35 + x45 = 50
Amount Into Hewes: x36 + x46 = 60
Amount Into Rockwright: x37 + x47 = 40
Slide
64
Solving the transshipment problem using transportation
algorithm
Slide
65
Solving the transshipment problem using transportation
algorithm
a transshipment problem can be transformed to a balanced
transportation problem by using the following procedure:
• Step 1: if necessary, add a dummy demand point or a dummy
supply point as needed
• Step 2: construct a transportation tableau as follows:
A row in the tableau will be needed for each supply point
and transshipment point.
A column will be needed for each demand point and
transshipment point
Each supply point will have a supply equal to its original
supply, and each demand point will have a demand equals
to its original demand.
each transshipment point will have
supply = its original supply + total available supply, and
demand = its original demand + total available supply
Then the problem can be solved as a transportation problem
Slide
66
Example: transshipping
The balanced transportation tableau for the transshipment problem will
be as follows:
Supper M M M 7 4 75
shell
Thomas 1 5 8 0 M 150
Washburn 3 4 4 M 0 150
• Where M is a very large number and used when the route is not valid
• Zero cost is used from a destination to itself.
•There is no need for dummy row or column, since the problem is balanced
Slide
67