Scribd
Upload
14 views6 pages

T.C. Theory

This document discusses different types and methods for solving transportation problems. There are four types of transportation problems: balanced, unbalanced, preferred route, and prohibited route. The three main methods for finding a basic feasible solution are the northwest corner method, least cost method, and Vogel's approximation method. The northwest corner method allocates supply starting from the upper left corner cell. The least cost method allocates to the lowest cost cell. Vogel's method allocates to the row or column with the lowest penalty based on differences between cell values.

Uploaded by

jagritiprakash00100
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
14 views6 pages

T.C. Theory

This document discusses different types and methods for solving transportation problems. There are four types of transportation problems: balanced, unbalanced, preferred route, and prohibited route. The three main methods for finding a basic feasible solution are the northwest corner method, least cost method, and Vogel's approximation method. The northwest corner method allocates supply starting from the upper left corner cell. The least cost method allocates to the lowest cost cell. Vogel's method allocates to the row or column with the lowest penalty based on differences between cell values.

Uploaded by

jagritiprakash00100
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 6

Transportation Problems/Models 135

Types of Transportation Problems


Th~ transportation problems are categorized into following
categories:
1. Balanced Transportation Problem
2. Unbalanced Transportation Problem
3. Preferred Route Transportation Problem
4. Prohibited Route Transportation Problem
Methods of Basic ~easible Solution of
Transportation Problem
Generally, any basic feasible solution of a transportation problem
relates with 'm' origins and 'n' destinations. It should be m + n - 1
as non-zero basic variables. If the transportation problem has a basic
feasible solution with number of non-zero basic variables less than m
+ n - 1, it is called as unbalanced transportation problem.
For determining basic feasible solution of a transportation
problem, fallowing three methods are used:
1. North west corner method (NWCM)
2. Least cost me_thod (LCM)
3. Vogel's approximation method (VAM)
The detailed study of the above methods are as follows:

I. North West Corner Method (NWCM)


In this method, the allocation is made from the first ai. i.e. upper
left corner cell on the basis of availability of supply for thlt row and
demand requirement for the column. The main object of this method
is to minimiz~ the transportation cost. Fallowing steps are used to
solve the transportation problem: .
Stet>• 1. : Make allocation t~ the uppe~ left_ c~rner cell in the first
row on the basis of _ava1lab1hty of supply -and
requirement of demand.
Step-2 : Move the next ctll or the first row if demand of first
cell has fulfilled. _
Step-3. : Move to the next row and make allocation to the cell
below the cell of preceding row in which the last
allocation W&S made.
Operations Research and Q. T. for Managemen.t

Step-4 : Repeat steps ·1 and 2 for allocation.


Step-5 : R epeat steps 1 to 3 till and rim requirements are ful-
filled.
Step-6 : Calcul~te the total transportation cos~ by _multiply all
the allocation with the transportation cost.
2• least Cost Method
In this method, the allocation is made to least cost in all the
transp,ortation cost in the table. For basic feasible solution, following
.steps,are used. '
138 Operations Research and Q.T. for l~anagernent

Step-1 Make allotment in the least cost cell out of all cells in
table on the basis of availability of supply and
requirement of demand.
Step-'2 Move next cell of least cost and allot the supply and
fulfill the demand.
Step-3 Repeat steps 1 and 2 for allocation.
Step-4 Repeat steps i to 3 till all requir~ments are fulfilled.
Step-5 Calculate total transportation cost by multiply all the
allocation with the transportation cost.
3. Vogal's Approxhnation Method .
. This ~ethod is_ mainly ~opted by all the re~ear~hers for finding
basic feasible solution. In this method, allocation 1s made in least
penalty row/column a~cordin_g to the demand and supply. The
transportation cost in this method is very less as compared to other .
methods. Following steps are used:
n.tvwations Research. and Q.T. for Managernen t
"'I'~''

Find the differences between ~two smallest cell values


Step-1
from each row and write the difference as a penalty 00
the right hand side of the coI}.cerned row.
Find.the difference between two smallest cell values from
Step-1 :
each column and write the different as penalty below
the concerned column.
Step-3 -: Select the maximum difference/penalty among all the
penalty rows/ columns and made allocation in the row/
column having least cost/value.
Step-4 Shade the row/ column whose demand has fulfilled by
supply so that this row/column shell not be considered
for further calculation of penalty as well as allocation.
Step-5 Repeat steps 1 to 4 till the supply fulfills the demand in
all the table.
Step-6 Calculate the value of transportation cost.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy