Scribd
Upload
34 views

Transportation Problem and Assignment Problem

The document discusses transportation problems and assignment problems. Transportation problems involve selecting optimal routes to transport goods between sources and destinations while minimizing costs. Assignment problems involve allocating resources to activities in a one-to-one manner to minimize costs or maximize profits. Both can be formulated as linear programming problems and solved using methods like the Northwest Corner rule, Vogel's Approximation Method, and the Hungarian method.

Uploaded by

Shravani Palande
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
34 views

Transportation Problem and Assignment Problem

The document discusses transportation problems and assignment problems. Transportation problems involve selecting optimal routes to transport goods between sources and destinations while minimizing costs. Assignment problems involve allocating resources to activities in a one-to-one manner to minimize costs or maximize profits. Both can be formulated as linear programming problems and solved using methods like the Northwest Corner rule, Vogel's Approximation Method, and the Hungarian method.

Uploaded by

Shravani Palande
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 13

Transportation Problem and

Assignment Problem

- Dr. Priyanka Gujrati


What is Transportation Problem?
A transportation problem is concerned with transportation
method or selecting routes in a product distribution network
among the manufacture plant and distribution warehouse
situated in different regions or local outlets.

Transportation problem is a special kind of Linear


Programming Problem (LPP) in which goods are
transported from a set of sources to a set of destinations
subject to the supply and demand of the sources and
destination respectively such that the total cost of
transportation is minimized. It is also sometimes called as
Hitchcock problem.
Types of Transportation problems:

• Balanced: When both supplies and demands are equal then the


problem is said to be a balanced transportation problem.

• Unbalanced: When the supply and demand are not equal then it


is said to be an unbalanced transportation problem. In this type
of problem, either a dummy row or a dummy column is added
according to the requirement to make it a balanced problem.
Then it can be solved similar to the balanced problem.
Methods to Solve:

it requires 2 stages to solve:-


Stage 1:
• North West Corner Cell Method.

• Least Call Cell Method.

• Vogel’s Approximation Method (VAM).


Stage 2:
optimal solution by MODI method.
Basic structure of transportation
problem:
In the
table D1, D2, D3 and D4
 are the destinations
where the
products/goods are to
be delivered from
different
sources S1, S2, S3 and S
4. Si is the supply from
the source Oi. dj is the
demand of the
destination Dj. Cij is the
cost when the product
is delivered from
source Si to
destination Dj.
What is Assignment Problem???
Assignment problem is a special type of linear
programming problem which deals with the allocation of
the various resources to the various activities on one to
one basis. It does it in such a way that the cost or time
involved in the process is minimum and profit or sale is
maximum. Though there problems can be solved by
simplex method or by transportation method but
assignment model gives a simpler approach for these
problems.
An assignment problem is a particular case of
transportation problem where the objective is to assign a
number of resources to an equal number of activities so
as to minimise total cost or maximize total profit of
allocation.

The problem of assignment arises because available


resources such as men, machines etc. have varying
degrees of efficiency for performing different activities,
therefore, cost, profit or loss of performing the different
activities is different.
Assignment Model

Suppose there are n facilitates and n jobs it is clear that in this case, there will be n
assignments. Each facility or say worker can perform each job, one at a time. But
there should be certain procedure by which assignment should be made so that the
profit is maximized or the cost or time is minimized.

In the table, Coij is defined as the cost when jth job is assigned to ith worker. It maybe
noted here that this is a special case of transportation problem when the number of
rows is equal to number of columns.
Methods to Solve:

a)     Completer enumeration method.


b)     Hungarian method (Most Popular)

You might also like