Professional Documents
Culture Documents
John
Loucks
St. Edwards
University
Modifications by
A. Asef-Vaziri
1
Chapter 6, Part A
Distribution and Network Models
Transportation Problem
Network Representation
General LP Formulation
Assignment Problem
Network Representation
General LP Formulation
Transshipment Problem
Network Representation
General LP Formulation
2
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, transshipment,
shortest-route, and maximal flow problems of
this chapter as well as the minimal spanning
tree and PERT/CPM problems (in others
chapter) are all examples of network
problems.
3
Transportation, Assignment, and
Transshipment Problems
Each of the five problems of this chapter can
be formulated as linear programs and solved
by general purpose linear programming
codes.
For each of the five problems, 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
that contain separate computer codes for
these problems which take advantage of their
network structure.
4
Transportation Problem
5
Transportation Problem
Network Representation
1 d1
c1
s1 1 1
c12
c13
2 d2
c21
s2 2 c22
c23
3 d3
Sources Destinations
6
Transportation Problem: Example #1
Northwood Westwood
Eastwood
Plant 1 24 30
40
Plant 2 30 40 42
Decision Variables. the tons of concrete blocks,
xij , to be shipped from source i to destination j.
9
Transportation Problem: Example
#2
= Constraints
Define the Constraints
Supply constraints:
(1) x11 + x12 + x13 = 50
(2) x21 + x22 + x23 = 50
Demand constraints:
(4) x11 + x21 = 25
(5) x12 + x22 = 45
(6) x13 + x23 = 10
Non-negativity of variables:
xij > 0, i = 1, 2 and j = 1, 2, 3
10
Transportation Problem: Example
#2
and Constraints
Define the Constraints
Supply constraints:
(1) x11 + x12 + x13 50
(2) x21 + x22 + x23 50
Demand constraints:
(4) x11 + x21 25
(5) x12 + x22 45
(6) x13 + x23 10
Non-negativity of variables:
xij > 0, i = 1, 2 and j = 1, 2, 3
11
Transportation Problem: Example #1
1 L H S C o e f f ic ie n t s
2 C o n s t r a in t X 1 1 X 1 2 X 1 3 X 2 1 X 2 2 X 2 3 R H S
3 # 1 1 1 1 5 0
4 # 2 1 1 1 5 0
5 # 3 1 1 2 5
6 # 4 1 1 4 5
7 # 5 1 1 1 0
8 O b j.C o e f f ic ie n t s 2 4 3 0 4 0 3 0 4 0 4 2 3 0
12
Transportation Problem: Example #1
13
Transportation Problem: Example #1
Optimal Solution
14
Transportation Problem: Example #1
Sensitivity Report
15
Transportation Problem: Example
#2
The Navy has 9,000 pounds of material in
Albany,
Georgia that it wishes to ship to three
installations:
San Diego, Norfolk, and Pensacola. They require
4,000,
2,500, and 2,500 pounds, respectively.
Government
regulations require equal distribution of shipping
among the three carriers.
The shipping costs per pound for truck,
railroad,
and airplane transit are shown on the next slide.
Formulate and solve a linear program to 16
Transportation Problem: Example
#2
Destination
Mode San Diego Norfolk
Pensacola
Truck $12 $6
$5
Railroad 20 11
9
Airplane 30 26
28
17
Transportation Problem: Example
#2
Define the Decision Variables
We want to determine the pounds of
material, xij , to be shipped by mode i to
destination j. The following table
summarizes the decision variables:
San Diego Norfolk
Pensacola
Truck x11 x12
x13
Railroad x21 x22
x23
Airplane x31 x32
x33 18
Transportation Problem: Example
#2
Define the Objective Function
Minimize the total shipping cost.
Min: (shipping cost per pound for each
mode per destination pairing) x (number of
pounds shipped by mode per destination
pairing).
Min: 12x11 + 6x12 + 5x13 + 20x21 + 11x22 +
9x23
+ 30x31 + 26x32 + 28x33
19
Transportation Problem: Example
#2
Define the Constraints
Equal use of transportation modes:
(1) x11 + x12 + x13 = 3000
(2) x21 + x22 + x23 = 3000
(3) x31 + x32 + x33 = 3000
Destination material requirements:
(4) x11 + x21 + x31 = 4000
(5) x12 + x22 + x32 = 2500
(6) x13 + x23 + x33 = 2500
Non-negativity of variables:
xij > 0, i = 1, 2, 3 and j = 1, 2, 3
20
Transportation Problem: Example
#2
21
Transportation Problem
22
Transportation Problem
x
j 1
ij si i 1,2, ,m Supply
m
x > d
i 1
ij j j 1,2, ,n Demand
23
Transportation Problem
24
Transportation Problem
Unacceptable route:
Remove the corresponding decision
variable. 25
Assignment Problem
26
Assignment Problem
Network Representation
c11
1 1
c12
c13
Agents Tasks
c21
c22
2 2
c23
c31
c32
3 c33 3
27
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
29
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
Tasks
x12+x22+x32+x42 = 1
x13+x23+x33+x43 = 1
xij = 0 or 1 for all i and j
30
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
Tasks
x12+x22+x32+x42 1
x13+x23+x33+x43 1
xij = 0 or 1 for all i and j
31
Transportation Problem: Example
#2
32
Assignment Problem: Example
33
Assignment Problem
34
Assignment Problem
x
j 1
ij 1 i 1,2, ,m Agents
m
x
i 1
ij 1 j 1,2, ,n Tasks
35
Assignment Problem
Number
agents:
of tasks exceeds the number of
36
Assignment Problem
x t i 1,2, ,m Agents
j 1
ij
37
Transshipment Problem
38
Transshipment Problem
Network Representation
c36
3
c13
s1 1 c37 6 d1
c14
c15 c46
Supply 4 c47 Deman
c23 d
c24 c56
s2 2 7 d2
c25
5 c57
Sources Destinations
Intermediate Nodes
39
Transshipment Problem
40
Transshipment Problem
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 dj Destination nodes j
41
Transshipment Problem
42
Transshipment Problem: Example
43
Transshipment Problem: Example
44
Transshipment Problem: Example
Network Representation
ZROX
Zrox 50
5 1
ARNOLD Zeron
75 Arnold N 5
8 8
Hewes
HEWES 60
7 3
Super Zeron
WASH 4
75 Shelf S
BURN
4 4 Rock-
Rite 40
45
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
48
Transshipment Problem: Example
Solution
ZROX
Zrox 50
50
75 1
ARNOLD
5 Zeron
75 Arnold N 5 25
8 8
Hewes
HEWES 60
35
7 3 4
Super Zeron
WASH 40
75 Shelf S
4 75
BURN
4 Rock-
Rite 40
49
Transshipment Problem: Example
50
Transshipment Problem: Example
54
End of Chapter 6, Part A
55