Transportation

(Cont.)

Transportation

Solving Procedure:
1. Find a starting solution
North-west corner method
Least cost method
Vogels approximation method
2. Improve the solution by an entering
variable, and a leaving variable.

Stepping stone method

Improving the north-west corner
solution

10

5
-5

11

-2

10
12

5
-15

20

+18

+9

15
14

+9

20
5

16

18
5

+0 -10+0 -7 +20-18 = - 15

Multipliers Method (U-V

method)
Improving the north-west
corner
solution

Table
1
v2 = 0
v3 = 2

v1 = 10
u1 = 0
u2 = 7
u3 = 5

10
5

v4 = 13

20

11

20

10
12
5
0

cij ui v j

15
14

5
16

18
5

For all cells of basic variables

Multipliers Method (U-V

method)
Improving the north-west
corner
solution

Table
1
v2 = 0
v3 = 2

v1 = 10
10

u1 = 0
u2 = 7
u3 = 5

5
-5

20

+18

11

-2

10
12

5
-15

v4 = 13

+9

cij cij ui v j

15
14

+9

20
5

16

18
5

For all cells of non- basic variables

U-V method
Improving the north-west corner
solution
Table
2
10
0
20
5
0

11

10
15
12

7
5
0

9
15

14

20
5
10

16

18
5

The number of variables should be kept 6.

Re-evaluate u and v to calculate c at each cell. And so on

Non-Standard transportation problems

Table
3

1
10

1
So
ur
ce

Supply

4
11

15
12

20
25

3
Deman
d

Destination
2
3
0
20

14

16

18
5
15

15

15

Sum (Supply) =/ Sum (Demand)

Add a dummy destination (D).

10

/
45
55

45

Transportation table
Table
3
10

Destination
3
0
20

12

20

14

16

18

1
S
o
u
rc
e

1
2
3

Dema
nd

15

15

Add a dummy destination (D).

4
11

10

Supply

D
0

10

15
25
15
55

Questions on
Transportation

Assignment

Problem Definition
Workers
(i)
i = 1,2,
,m

4
c4,3

c1,2
c1,1

Machines
(j)
m
j = 1,2,
,n

Cost

c2,1

c3,4

Given Data

Workers

Machines
1
2
3
4

1
1
9
4
8
1

2
4
7
5
7
1

3
6
10
11
8
1

4
3
9
7
5
1

1
1
1
1

Solved Example

M1 M2 M3

M1 M2 M3

-5
W
W
5
7
9
0
2
4
1
1
-10
W
W
14 10 12 -13
4
0
2
2
2
-2
value
W1- Subtract from each row the minimum
W
15 13
16 column the minimum
2 value
0
3
2Subtract
from
selected
3
3
M1 M2 M3
W1
M1
W
0
2
2
W2
M3
1
W3
M2
W
4
0
0

Special cases for assignment problems

1
2
3
4

1
1
9
4
8

2
4
7
5
7

3
6
10
11
8

4
3
9
7
5

1
2
3
4

1
0
2
0
3

2
3
0
1
2

3
5
3
7
3

4
2
2
3
0

-3

-1
-7
-4
-5

Special cases for assignment problems

1
2
3
4

1
0
2
0
3

2
3
0
1
2

3
2
0
4
0

4
2
2
3
0

- Connect all the zeros with the minimum number of

lines;
- Each zero should be crossed out only ONCE
- Subtract smallest uncrossed value from uncrossed
elements
- Add it at all intersections

Special cases for assignment problems

1
2
3
4

1
0
2
0
3

2
3
0
1
2

3
2
0
4
0

4
2
2
3
0

1
2
3
4

1
0
3
0
4

2
2
0
0

3
1
0
3
0

4
1
2
2
0

Special cases for assignment problems

1
2
3
4

1
0
3
0
4

2
2
0
0
2

3
1
0
3
0

W1
W2

M1
M3

W3

M2

W4

M4

4
1
2
2
0

Special cases for assignment problems

NOTE:
- The procedure of connecting zeros should be
repeated until a feasible solution is reached.

Shortest path
problems

Problem definition
- Given n nodes in a network that are denoted by
(1, 2, 3n), it is required to find the shortest path
from the source node to the sink node.

Illustrative example
3
Source

7
4

2
2

Sink

- Determine the shortest path from the source (1) to

the sink (6), and the length of the path.

Steps to solve
3
Source

7
4

2
2

Sink

- Start at node (1). Its distance is zero.

- Distances to neighboring nodes are written.
- Distances to non-neighboring nodes are infinity.

L(0) [ 0 , 3 , 7 , 4 , , ]

Steps to solve
L(0) [ 0 , 3 , 7 , 4 , , ]
.
*
=

- Give the zero a permanent label (*).

- Give the minimum value a temporary label (.)
- Calculate the distances from the temporary label.
3
Source

7
4

2
2

Sink

Steps to solve
1

L(0) [ 0 , 3 , 7 , 4 , , ]
.
*
=
3

7
4

2
2

- Temp. labels are permanent.

- Choose new temp. label

Fro
m

To

Current

New

3+2

3+

3+

Node ofNodes with

New
Their
no
values
current
2
6

3+9
Temporary
labels starting
values the
label
temporary
Compare
node
and choose
the minimum

L(1) [ 0 , 3 , 5 , 4 , , 12 ]
.
*
*
=

Steps to solve
1

L(1) [ 0 , 3 , 5 , 4 , , 12 ]
.
*
*
=
3

7
4

2
2

- Temp. labels are permanent.

- Choose new temp. label

Fro
m

To

Current

New

4+ 1

4+ 3

12

4+

Node ofNodes with

New
Their
no
values
current
Temporary
labels Compare
starting
values the
and
choose
label
temporary
the
minimum
node

L(2) [ 0 , 3 , 5 , 4 , 7 , 12 ]
.
*
*
*
=

Steps to solve
1

L(2) [ 0 , 3 , 5 , 4 , 7 , 12 ]
.
*
*
*
=
3

7
4

2
2

Fro
m

To

Current

New

5+ 3

12

5+ 6

- Temp. labels are permanent.

- Choose new temp. label

L(3) [ 0 , 3 , 5 , 4 , 7 , 11 ]
.
*
*
*
*
=

Steps to solve
1

L(3) [ 0 , 3 , 5 , 4 , 7 , 11 ]
.
*
*
*
*
=
3

7
4

2
2

Fro
m

To

Current

New

11

7+ 3

L(4) [ 0 , 3 , 5 , 4 , 7 , 10 ]
*
*
*
*
*
*
=
Shortest route distance is 10

- Shortest path is ???

Solved Problem
1

L(0) [
=
L(1) [
=
L(2) [
=
L(3) [
=
L(4)
Path[

0 ,3 , 7 ,4 , , ]
* .
0
* ,3
* , 5 , 4. , , 12 ]
.
*
*
* , 7 , 12 ]
0 ,3 , 5 ,4

* *
0 ,3 ,
* *
01 , ,3 4,

* * .
5 , 4 , 7 , 11 ]
* * * *
5
, 5, 4 ,, 76 , 10 ]

Illustrative example
3
Source

7
4

2
2

Path 1 , 4 , 5 , 6
:

Sink

Another example
Source

5
1
7

2
4

10

6
8

8
Sink

- Given the roads of the city, go from (1) to (8) by the

shortest route.