Unbalanced Transportation

Problem
&
problem of degeneracy
Problem

A company has three plants at location A,B and C which supply to warehouses
located at D,E,F,G and H. Monthly plant capacities are 800,500 and 900 units
respectively. Monthly warehouse requirements are 400,400,500,400 and 800units
respectively. Unit transportation costs(Rs.)are given in the table.
Determine an optimum distribution for the company in order to minimize the
total transportation cost.

D E F G H
A 5 8 6 6 3
B 4 7 7 6 5
C 8 4 6 6 4
SOLUTION
D E F G H Capacity

A 5 8 6 6 3 800

B 4 7 7 6 5 500

C 8 4 6 6 4 900

Requireme 400 400 500 400 800 ∑ai ≠ ∑bj

nt

This is an unbalanced transportation problem.

SOLUTION

D E F G H Capacity

A 5 8 6 6 3 800

B 4 7 7 6 5 500

C 8 4 6 6 4 900

dummy 0 0 0 0 0 300

Requireme 400 400 500 400 800 ∑ai = ∑bj

nt
2500 =2500
IBFS
D E F G H Capacity PENALTY

A 5 8 (500)6 6 (300)3 800/300/0 2/2/2/2/2/X

B (400)4 7 7 (100)6 5 500/400/0 1/1/1/1/1

C 8 (400)4 6 6 (500)4 900/500/0 0/0/2/ 4/ X

dummy 0 0 0 (300)0 0 300/0 0/X

Requirement 400/0 400/0 500/0 400/100/0 800/300/0

PENALTY 4/4/1/1/1 4/4/3/X 6/6 6/0 3/1/1/1/2

CHECK for conditions of optimality test: (m+n-1)(8) ≠ No.of allocations(7). This is a problem of degeneracy
To solve Degeneracy

To make the no.of allocations = 8, introduce a negligible small positive quantity

Δ in the independent cell (2,5) and test the solution for optimality.
D E F G H Capacity

A (500)6 (300)3 800

B (400)4 (100)6 (Δ)5 500+Δ=500

C (400)4 (500)4 900

dummy (300)0 300

Requirement 400 400 500 400 800+Δ=800

Test for Optimality

Matrix of cij for empty cells

D E F G H

A 5 8 6

B 7 7

C 8 6 6

dummy 0 0 0 0
Test for Optimality

Matrix for ui and vj values

D E F G H ui

A 6 3 -2

B 4 6 5 0

C 4 4 -1

dummy 0 -6

vj 4 5 8 6 5 Cij=ui+vj
Test for Optimality

Matrix for (ui + vj) for empty cells

D E F G H ui

A 2 3 4 -2

B 5 8 0

C 3 7 5 -1

dummy -2 -1 2 -1 -6

vj 4 5 8 6 5 Cij=ui+vj
Test for Optimality

Matrix for dij= [cij-(ui + vj)] for empty cells

D E F G H

A 3 5 2

B 2 -1

C 5 -1 1

dummy 2 1 -2 1

The solution under test is not optimal .Go for improvement

First Improvement of the solution

Introduce Ѳ at cell (4,3) corresponding to dij= -2.

D E F G H available

A (500-Ѳ) (300+Ѳ) 800

B (100+Ѳ) (Δ-Ѳ) 500

C 900

dummy (+Ѳ) (300-Ѳ) 300

demand 400 400 500 400 800

Min(500-Ѳ, Δ-Ѳ, 300-Ѳ)= 0, therefore Δ-Ѳ=0, Ѳ=Δ

Improvement of the solution

Introduce Ѳ=Δ

D E F G H available

A (500-Δ) (300+Δ) 800

B (100+Δ) (0) 500

C 900

dummy (+Δ) (300-Δ) 300

demand 400 400 500 400 800

Testing the improved solution

Matrix for cij for empty cells

D E F G H available

A 5 8 6 800

B 7 7 5 500

C 8 6 6 900

dummy 0 0 0 300

demand 400 400 500 400 800

Testing the improved solution

Matrix for ui and vj values

D E F G H ui

A 6 3 0

B 4 6 0

C 4 4 1

dummy 0 0 -6

vj 4 3 6 6 3
Testing the improved solution

Matrix (ui + vj ) for empty values

D E F G H ui

A 4 3 6 0

B 3 6 3 0

C 5 7 7 1

dummy -2 -3 -3 -6

vj 4 3 6 6 3
Testing the improved solution

Matrix dij = [cij -(ui + vj )] for empty values

D E F G H

A 1 5 0

B 4 1 2

C 2 -1 -1

dummy 2 3 3

The solution is not optimal . Go for improvement.

Second Improvemet of solution

Introduce Ѳ at the cell (3,4)

D E F G H

A (500-Ѳ) (300+Ѳ)

B 4 6

C 4 (Ѳ) (500-Ѳ)

dummy Δ+Ѳ (300-Ѳ)

Min(500-Ѳ,300-Ѳ)=0, Ѳ=300
Second Improvemet of solution

Put Ѳ=300

D E F G H

A (500-300) (300+300)

B 4 6

C 4 (300) (500-300)

dummy Δ+300 (300-300)

Second Improvemet of solution

D E F G H

A (200) (600)

B 4 6

C 4 (300) (200)

dummy (300) (0)

Second Improvemet of solution

D E F G H

A (200) (600)

B 4 6

C 4 (300) (200)

dummy (300)
Testing the Improved solution

Matrix for cij for empty cells

D E F G H

A 5 8 6

B 7 7 5

C 8 6

dummy 0 0 0 0
Testing the Improved solution

Matrix for ui and vj values

D E F G H
ui
A 6 3 -1

B 4 6 0

C 4 6 4 0

dummy 0 -7

vj 4 4 7 6 4
Testing the Improved solution

Matrix for (ui +vj ) for empty cells

D E F G H
ui
A 3 3 5 -1

B 4 7 4 0

C 4 7 0

dummy -3 -3 -1 -3 -7

vj 4 4 7 6 4
Testing the Improved solution

Matrix dij = [cij -(ui + vj )] for empty cells

D E F G H

A 2 5 1

B 3 0 1

C 4 -1

dummy 3 3 1 3

The solution is not optimal . Go for improvement.

Third Improvement of solution

Allocate Ѳ to cell (2,3)

D E F G H

A (200-Ѳ) (600+Ѳ)

B 4 6

C 4 (Ѳ) 6 (200-Ѳ)

dummy 0 3

Min(200-Ѳ,200-Ѳ)=0, Ѳ=200
Third Improvement of solution

Allocate Ѳ=200

D E F G H

A (0) (800)

B 4 6

C 4 (200) 6 (0)

dummy 0
Improved solution

Drop the cell (3,5)

D E F G H

A 6 3

B 4 6

C 4 3 6

dummy 0
Test the Improved solution
After testing , it will result in all dij>0 . Therefore the solution obtained can be taken as optimal
solution.
D E F G H

A 2 5 (0)6 1 (800)3

B (400)4 3 0 (100)6 1

C 4 (400)4 (200)3 (300)6 4

dummy 3 3 (300)0 1 3

This is an optimal solution . Therefore

x13=0,x15=800,x21=400,x24=100,x32=400,x33=200,x34=300,x43=300.
Optimum transportation cost = Rs.9200/-