EXAMPLES OF

TRANSPORT &
ASSIGNMENT
MODELS

Ral Magaa Nieto A01207545

Rodrigo Soria Aguirre A01202754

TRANSPORT MODEL
Objectives:

Satisfying all the

requirements established by
the destinies.
Minimize the total costs.

Indexes & Variables:

i= plants
j= destinies

Xi,j= amount of millions of

KW sent from plant i to
destiny j

TRANSPORT MODEL
Table of Costs

Requiremen
ts

(millions
of Kw)

Cal

70

Bogot

40

Medelln

70

Barranquilla

35

Capacities

(millions
of KW)

Plant 1

80

Plant 2

30

Plant 3

60

Plant 4

45

TRANSPORT MODEL
Supply Restrictions
X1,1
X2,1
X3,1
X4,1

+
+
+
+

X1,2
X2,2
X3,2
X4,2

+
+
+
+

X1,3
X2,3
X3,3
X4,3

+
+
+
+

X1,4
X2,4
X3,4
X4,4

Demand Restrictions

80
30
60
45

X1,1
X1,2
X1,3
X1,4

+
+
+
+

X2,1
X2,2
X2,3
X2,4

+
+
+
+

X3,1
X3,2
X3,3
X3,4

+
+
+
+

X4,1
X4,2
X4,3
X4,4

Objective Function
ZMIN = 5X1,1 + 2X1,2 + 7X1,3 + 3X1,4 + 3X2,1 + 6X2,2 + 6X2,3 + 1X2,4 +
6X3,1 + 1X3,2 + 2X3,3 + 4X3,4 + 4X4,1 + 3X4,2 + 6X4,3 + 6X4,4

70
40
70
35

TRANSHIPMENT MODEL
supplier

DC

customer

Its a variation of the transport

model that adjusts to the

posibility of having intermidiate
nodes.

TRANSHIPMENT MODEL
Supply Restrictions
x
x

+x
23 + x
13

+x
24 + x
14

Balance Restrictions

Demand Restrictions

= 300
25 <= 300

x
x
x

15 <

+x
37 + x
38 + x
36

+x
47 + x
48 + x
46

x
x
x

= 200
57 >= 100
58 >= 300
56 >

+x
14 + x
15 + x
13

=x
24 = x
25 = x
23

+x
46 + x
56 + x
36

+x
47 + x
57 + x
37

Objective Function
min Z

16 x

13

+7x

+ 10 x

46

14

+ 11 x

+ 12 x

47

+ 11x

15

+ 15 x

48

+ 4x

23

56

+ 14 x

+5x

57

24

+ 17 x

+ 12 x

58

25

+6x

36

+8x

37

+ 10 x

38

38
48
58

 In the assignment model, the supply at

each source and the demand at each
destination are each limited to one unit.

ASSIGNMENT MODEL
Officials

RALEIGH

ATLANTA

DURHAM

CLEMSON

210

90

180

160

100

70

130

200

175

105

140

170

80

65

105

120

The Atlantic Coast Conference (ACC) has four basketball games on a particular night. The
conference office wants to assign four teams of officials to the four games in a way that
will minimize the total distance traveled by the officials.

 NOTE: this is a balanced assignment

model.

ASSIGNMENT MODEL

min Z
XCR

Supply Restrictions

Demand Restrictions

XAR + XAA + XAD + XAC = 1

XAR + XBR + XCR + XDR = 1

XBR + XBA + XBD + XBC =

1

XAA + XBA + XCA + XDA =

1

XCR + XCA + XCD + XCC =

1

XAD + XBD + XCD + XDD =

1

XDR + XDA + XDD + XDC =

1

XAC + XBC + XCC + XDC =

1

Objective Function

210 XAR + 90 XAA + 180 XAD + 160 XAC + 100 XBR + 70 XBA + 130 XBD + 200 XBC + 175
+ 105 XCA + 140 XCD + 170 XCC + 80 XDR + 65 XDA + 105 XDD + 120 XDC

REFERENCES
PROBLEMA DEL TRANSPORTE O DISTRIBUCIN. (n.d.). Retrieved January 20,
2016, from
http://www.ingenieriaindustrialonline.com/herramientas-para-el-ingeniero-i
ndustrial/investigacin-de-operaciones/problema-del-transporte-o-distribuc
in
/
Taylor, B. (n.d.). The Transhipment Model. Retrieved January 19, 2016, from
http://flylib.com/books/en/3.287.1.82/1/