Vishwakarma Institute of Information
Technology,Pune
OPERATION RESEARCH
SCE PRESENTATION
TRANSPORTATION MODEL
GROUP MEMBERS
NAME ROLL NO. GR NO.
SIDDHANT MORE 351059 22020030
ADITYA DOMBALE 351063 22020095
JEEVAN PAWAR 351064 22020107
ANIKET RAJPUT 351065 22020152
INTRODUCTION
Transportation Model is a special case of LPP(Linear Programming
Problem) in which the main objective is to transport a product from
various sources to various destinations at total minimum cost.
In Transportation Models, the sources and destinations are known, the
supply and demand at each source and destinations are also known.
It is designed to find the best arrangement for transportation such that the
transportation cost is minimum.
EXAMPLE
Consider three companies (Company1, Company2 and Company3) which
produce mobile phones and are located in different regions.
Similarly, consider three cities (namely CityA, CityB & CityC) where the
mobile phones are transported.
The companies where mobile phones are available are known as sources and
the cities where mobile phones are transported are called destinations.
Let, Company1 produces a1 units, Let, demand in CityA is b1 units,
Company2 produces a2 units, demand in CityB is b2 units,
demand in CityC is b3 units.
Company3 produces a3 units.
The cost of transportation from each source to destination is given in table
The transportation of mobile phones should be done in such a way that the total
transportation cost is minimum.
TYPES
There are two types of transportation problems:
i) Balanced transportation problem:
The sum of supply and sum of demand are same.
Σ Supply=Σ Demand
ii) Unbalanced transportation problem:
The sum of supply and sum of demand are different.
Σ Supply=/Σ Demand
PHASES OF SOLUTION
PHASE 1 : Obtain the Initial Basic Feasible Solution
i. North West Corner Rule
ii. Row Minima Method
iii. Column Minima Method
iv. Least Cost Method
v. Vogle Approximation Method
PHASE 2 : Obtain the Optimal Basic Solution
i. Stepping Stone Method
ii. MODI Method
METHODS TO SOLVE
TRANSPORTATION MODEL
North-West corner method
Least cost method
Vogel's Approximation Method (VAM)
INDUSTRIAL APPLICATIONS
Minimize the transportation cost from source to destination.
Determine lowest cost location for new industries, offices,
warehouse, etc.
Determine the number of products to be manufactured according to
demand.
Courier Services: Helps in taking proper decisions to find the best
route for transportation.
ASSUMPTIONS
Total quantity of the item available at different sources is equal to the total
requirement
Item can be transported conveniently from all sources to destinations.
The unit transportation cost of the item from all sources to destinations is
certainly and pecisely known.
A The transportation cost on a given route is directly proportional to the
number of units shipped on that route.
The objective is to minimize the total transportation cost for the
organisation as a whole and not for individual supply and distribution
centres.
Problem statement:
Projects
1 2 3 Supply
A 5 1 9 300
Warehouse B 4 2 8 600
C 8 7 2 600
Demand 150 450 900
transportation model.py
Projects
1 2 3 Supply
A 5 1 300 9 300
Warehouse B 4 150 2 150 8 300 600
C 8 7 2 600 600
Demand 150 450 900
Minimum Transportation cost = (300*1)+(150*4)+(150*2)+(300*8)+(600*2) = 4800 Rs.
Check Optimism of Initial Basic Feasible solution by
stepping stone method.
1. Non Degeneracy : M+N-1 Allocation
2.Evaluation of unallocation Cells: Net Change
C(1,1) = 5-4+2-1 = 2
C(1,3) = 9-1+2-8 = 2
C(3,1) = 8-2+8-2+4 = 16
C(3,2) = 7-2+8-2 = 11
All Values comes positive means Initial Basic feasible
solution is optimum solution.
THANK YOU
