Chapter 6: Transportation, Transshipment, and Assignment Problems

Chapter Topics
The Transportation Model
Computer Solution of a Transportation Problem
The Transshipment Model
Computer Solution of a Transshipment Problem
The Assignment Model
Computer Solution of an Assignment Problem
Overview
Part of a larger class of linear programming problems known as network flow models.
Possess special mathematical features that enabled deelopment of er! efficient, uni"ue
solution methods.
Methods are ariations of traditional simple# procedure.
$etailed description of methods is contained in C$%&'M Module (, Transportation
and Assignment Solution Methods.
Te#t focuses on model formulation and solution with )#cel and *M for windows.
The Transportation Model Characteristics
A product is transported from a number of sources to a number of destinations at the
minimum possible cost.
)ach source is able to suppl! a fi#ed number of units of the product, and each destination
has a fi#ed demand for the product.
The linear programming model has constraints for suppl! at each source and demand at
each destination.
All constraints are e"ualities in a balanced transportation model where suppl! e"uals
demand.
Constraints contain ine"ualities in unbalanced models where suppl! does not e"ual
demand.
Transportation Model Example Problem Definition and Data
Problem: +ow man! tons of wheat to transport from each grain eleator to each mill on
a monthl! basis in order to minimi,e the total cost of transportation-
$ata:
Grain Elevator Supply Mill Demand
! "ansas City #$ %! Chica&o ''$
'! Omaha (# )! St! *ouis $$
+! Des Moines '(# C! Cincinnati +$$
Total ,$$ tons Total ,$$ tons
Transport Cost from Grain Elevator to Mill ($/ton)
Grain Elevator A. Chicago B. St. Lois C. Cincinnati
!. "ansas Cit#
$. %maha
&. 'es Moines
$ (
)
*
$ +
!!
,
$!-
!!
!$
Transportation Model Example Model -ormulation
Minimi,e . / 06#1A 2 3#1( 2 14#1C 2 5#6A 2 11#6( 2 11#6C 2 7#8A 2 9#8(
2 16#8C
sub:ect to:
#1A 2 #1( 2 #1C / 194
#6A 2 #6( 2 #6C / 159
#8A 2 #8( 2 #8C / 659
#1A 2 #6A 2 #8A / 644
#1( 2 #6( 2 #8( / 144
#1C 2 #6C 2 #8C / 844
#i: 4
#i: / tons of wheat from each grain eleator, i, i / 1, 6, 8, to each mill :, : / A,(,C
6
8
The Transshipment Model Characteristics
)#tension of the transportation model.
;ntermediate transshipment points are added between the sources and destinations.
;tems ma! be transported from:
Sources through transshipment points to destinations
'ne source to another
'ne transshipment point to another
'ne destination to another
$irectl! from sources to to destinations
Some combination of these
Transshipment Model Example Problem Definition and Data
)#tension of the transportation model in which intermediate transshipment points are
added between sources and destinations.
$ata:
7
Model <ormulation:
Minimi,e . / 016#18 2 14#17 2 16#19 2 19#68 2 17#67 2 15#69 2 6#86 2 3#85 2 14#83 2
5#76 2 11#75 2 11#73 2 7#96 2 9#95 2 16#93
sub:ect to:
#18 2 #17 2 #19 / 844
#68 2 #67 2 #69 / 844
#86 2 #76 2 #96 / 644
#85 2 #75 2 #95 / 144
#83 2 #73 2 #93 / 844
#18 2 #68 % #86 % #85 % #83 / 4
#17 2 #67 % #76 % #75 % #73 / 4
#19 2 #69 % #96 % #95 % #93 / 4
#i: 4
9
The %ssi&nment Model Characteristics
Special form of linear programming model similar to the transportation model.
Suppl! at each source and demand at each destination limited to one unit.
;n a balanced model suppl! e"uals demand.
;n an unbalanced model suppl! does not e"ual demand.
%ssi&nment Model Example Problem Definition and Data
Problem: Assign four teams of officials to four games in a wa! that will minimi,e total
distance traeled b! the officials. Suppl! is alwa!s one team of officials, demand is for
onl! one team of officials at each game.
$ata:
6
%ssi&nment Model Example Model -ormulation
Minimi,e . / 614#A& 2 =4#AA 2 134#A$ 2 164#AC 2 144#(& 2
54#(A 2 184#($ 2 644#(C 2 159#C& 2 149#CA 2
174#C$ 2 154#CC 2 34#$& 2 69#$A 2 149#$$ 2
164#$C
sub:ect to:
#A& 2 #AA 2 #A$ 2 #AC / 1 #i: 4
#(& 2 #(A 2 #($ 2 #(C / 1
#C& 2 #CA 2 #C$ 2 #CC / 1
#$& 2 #$A 2 #$$ 2 #$C / 1
#A& 2 #(& 2 #C& 2 #$& / 1
#AA 2 #(A 2 #CA 2 #$A / 1
#A$ 2 #($ 2 #C$ 2 #$$ / 1
#AC 2 #(C 2 #CC 2 #$C / 1
5
3
Example Problem Solution Transportation Problem Statement
$etermine linear programming model formulation and sole using )#cel:
Construction site
Plant % ) C
Supply
.tons/

'
+
0 1
#
+
0 #
$
2
0 ,
'
$
'$
1$
1$
Demand .tons/ #$ ($ $$
=
Example Problem Solution Model -ormulation
Minimi,e . / 03#1A 2 9#1( 2 6#1C 2 19#6A 2 14#6( 2 16#6C 2 8#8A 2 =#8( 2 14#8C

sub:ect to:
#1A 2 #1( 2 #1C / 164
#6A 2 #6( 2 #6C / 34
#8A 2 #8( 2 #8C / 34
#1A 2 #6A 2 #8A 194
#1( 2 #6( 2 #8( 54
#1C 2 #6C 2 #8C 144
#i: 4
14