TRANSPORTATION PROBLEM

Click to edit Master subtitle style

5/1/12

Objective:
To transport various quantities of a single homogeneous commodity, that are initially stored at various origins, to different destinations in such a way that the total transportation cost is min.

General transportation model: Let ai = quantity of commodity available at origin j bi =quantity of commodity demanded at destination j xij =quantity transported from origin i to destination j Then the problem is to determine the transportation schedule so as to minimize the transportation cost satisfying supply and demand constraints Minimize z= cij xij i= 1,2,.,m , j= 1,2,.,n

subject to the constraints: xij =ai xij =bj i= 1,2,.,m j= 1,2,.,n 5/1/12

The transportation table Destination

X11 C11 X12

. X21 C21 O1 .
Xm1 Cm1

C12 D1 X22 Dn C22 . Xm2 Cm2

... .

X1n X2n Supply

C1n D2 C2n .

a1 Xmn a2 am

Cmn

Origin O2 . . Om Demand b1

5/1/12

b2

Solution of a transportation problem

Finding an initial basic feasible solution: 1. North West Corner method
Step 1. select the north west ( upper left hand) corner cell of

the transportation table and allocate as much as possible so that either the capacity of the first row is exhausted or the destination requirement of the first column is satisfied, i.e. x11= min(a1,b1) Step 2. If b1 a1 we move down vertically to the second row and make the second allocation of magnitude x21= min(a2,b1 - x11) in the cell (2,1) If b1 a1 we move right horizontally to the second column and make the second allocation of magnitude x12= min(a1 - x11,b2) in the cell (1,2) If b1=a1 there is a tie for the second allocation. One can make the second allocation of magnitude x21= min(a2,b1 - b1) 5/1/12 =0 in the cell (2,1)

Obtain an initial BFS to the following transportation problem using NWC rule

Availab le A 11 13 17 14 250 B 16 18 14 10 300 C 21 24 13 10 400 Require 200 225 275 250 ment

Since ai = bj = 950 there exists a feasible solution to the problem

5/1/12

Solution of a transportation problem

Finding an initial basic feasible solution: 2. Least Cost Method or Matrix Minima Method
Step 1.Determine the smallest cost in the cost matrix of the

transportation table. Let it be cij. Allocate xij= min(ai,bj) in the cell (i,j) Step 2. If xij =ai cross off the ith row of the table and decrease bj by ai , Go to step 3. If xij =bj cross off the jth column of the table and decrease ai by bj , Go to step 3. If xij =ai =bj cross off either the ith row or the jth column of the table but not both. Step 3. Repeat steps 1 and 2 for the resulting reduced transportation table until all rim requirements 5/1/12 are satisfied. Whenever the min. cost is not unique, make an arbiatery

Obtain an initial BFS to the following transportation problem using Least cost method

D 1 4 0 4

G 4 0 1 6

A B C Require ment

2 3 2 6

3 2 2 8

Availab le 6 8 10

Since ai = bj = 24 there exists a feasible solution to the problem

5/1/12

Solution of a transportation problem

Finding an initial basic feasible solution: 3. Vogels Approximation Method (VAM) VAM method takes into account not only the least cost cij but also the costs that just exceed cij
Step 1. For each row of the transportation table identify the

smallest and the next smallest costs. Determine the difference between them for each row. Display them along side the transportation table by enclosing them in parenthesis against the respective rows. Similarly compute the difference for each column Step 2. Identify the row or the column with the largest difference among all the rows and columns. Let the greatest difference correspond to the ith row and let cij be the smallest cost in the ith row. Allocate the max. feasible amount xij= min(ai,bj) in the cell (i,j) and cross off the ith row or the jth column 5/1/12

Obtain an initial BFS to the following transportation problem using VAM method

Availab le A 11 13 17 14 250 B 16 18 14 10 300 C 21 24 13 10 400 Require 200 225 275 250 ment

Since ai = bj = 950 there exists a feasible solution to the problem Following VAM method we get:

5/1/12

5/1/12