Operations Management MBA Sem II Module IV Transportation.

Slides:



Advertisements
Similar presentations
An Application of Linear Programming Lesson 12 The Transportation Model.
Advertisements

INTRODUCTION The transportation problems are one of the types of the LLP (Linear Programming Problems), In which objective is to transport various quantities.
Transportation Problem
© Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 18 Slide 1 Network Models Lecture 18 The Transportation Algorithm II.
Transportation simplex method. B1B2B3B4 R R R Balanced?
Operations Management Transportation Models
Transportation Problem
Transportation Problem (TP) and Assignment Problem (AP)
Chapter 10 Transportation and Assignment Models
Transportation and Assignment Models
1 Transportation Model. 2 Basic Problem The basic idea in a transportation problem is that there are sites or sources of product that need to be shipped.
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India.
ITGD4207 Operations Research
Introduction to Operations Research
TRANSPORTATION PROBLEM Finding Initial Basic Feasible Solution Shubhagata Roy.
Transportation Problems MHA Medical Supply Transportation Problem A Medical Supply company produces catheters in packs at three productions facilities.
1 Transportation Problems Transportation is considered as a “special case” of LP Reasons? –it can be formulated using LP technique so is its solution (to.
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
© 2006 Prentice Hall, Inc.C – 1 Transportation Modeling Module C.
MC - 1© 2014 Pearson Education, Inc. Transportation Models PowerPoint presentation to accompany Heizer and Render Operations Management, Eleventh Edition.
PowerPoint presentation to accompany Operations Management, 6E (Heizer & Render) © 2001 by Prentice Hall, Inc., Upper Saddle River, N.J C-1 Operations.
C - 1© 2011 Pearson Education C C Transportation Modeling PowerPoint presentation to accompany Heizer and Render Operations Management, 10e, Global Edition.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
The Transportation and Assignment Problems
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 10.
Transportation Models Transportation problem is about distribution of goods and services from several supply locations to several demand locations. Transportation.
Linear Programming Applications
Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.
Operations Management
Transportation Problem Moving towards Optimality ATISH KHADSE.
Transportation Model Lecture 16 Dr. Arshad Zaheer
Transportation Method Lecture 20 By Dr. Arshad Zaheer.
Transportation Transportation models deals with the transportation of a product manufactured at different plants or factories supply origins) to a number.
Transportation Problem
Transportation Problem
Chapter 7 Transportation, Assignment & Transshipment Problems
The Transportation Model Copyright © 2015 McGraw-Hill Education. All rights reserved. No reproduction or distribution without the prior written consent.
. 1 Transportation and Assignment Problems. . 2 Applications Physical analog of nodes Physical analog of arcs Flow Communication systems phone exchanges,
QUANTITATIVE ANALYSIS FOR MANAGERS TRANSPORTATION MODEL
C - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall C C Transportation Models PowerPoint presentation to accompany Heizer and Render Operations.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
PROBLEM 5 (A) SCHOOL DISTRICT ADDEENBASHIRONCOBBITHDAIMMAN STUDENT POPULATION NORTH 250 5,5,5,5,5,-,- SOUTH 340 6,6,6,-,-,-,- EAST ,2,2,2,4,4,4,4.
Operations Research - Tutorial 2. Transportation Problem A dairy firm has three plants located in a state. The daily milk production at each plant is.
Transportation Problems Joko Waluyo, Ir., MT., PhD Dept. of Mechanical and Industrial Engineering.
Transportation problems Operational Research Level 4
1 1 Slide Subject Name: Operation Research Subject Code: 10CS661 Prepared By:Mrs.Pramela Devi, Mrs.Sindhuja.K Mrs.Annapoorani Department:CSE 3/1/2016.
Reid & Sanders, Operations Management © Wiley 2002 Solving Transportation Problems C SUPPLEMENT.
The Transportation Problem Simplex Method Remember our initial transportation problem with the associated cost to send a unit from the factory to each.
The Transportation and Assignment Problems
SEMINAR ON TRANSPORTATION PROBLEM
CHAPTER 5 Specially Structured Linear Programmes I:
Transportation Problem
Special Cases In Linear Programming
The Transportation Model
Chapter 10 Transportation and Assignment Models
The Transportation Model
ENGM 631 Optimization Transportation Problems.
نموذج النقل Transportation Model.
Chapter 7 Transportation, Assignment & Transshipment Problems
TRANSPORTATION PROBLEM
Transportation Problems
Operations Research (OR)
Transportation Problems
Chapter 5 Transportation, Assignment, and Transshipment Problems
Operations Management
IENG 212 Modeling and Optimization
Operations Management
TRANSPORTATION PROBLEMS
Transportation and Assignment Problems
Presentation transcript:

Operations Management MBA Sem II Module IV Transportation

…the physical distribution of goods and services from several supply centers to several demand centres.

Transportation The structure of transportation problem involves a large no. of shipping routes from several supply origins to several demand centres.

Objective : To determine the number of units of an item that should be shipped from an origin to a destination in order to satisfy the required quantity of goods or services at each destination centre.

Method 1.Formulate the problem and arrange the data in matrix form 2.Obtain an initial basic feasible solution by - North West Corner Method - Least Cost method - Vogel’s Approximation Method

The solution must satisfy all the supply and demand constraints The number of positive allocations must be m+n-1, where m is the no. of rows and n is the no. of columns 3. Test the initial solution for optimality (MODI) 4. Update the solution

Initial basic solution by North west corner method

Q A company has three production facilities S1,S2, S3 with production capacity of 7,9 and 18 units (in 100’s) per week of a product, respectively. These units are to be shipped to four warehouses D1, D2, D3 and D4 with requirement of 5,6,7 and 14 units (in 100’s) per week, respectively.

The transportation costs(in rupees) per unit between factories to warehouses are given in the table in the next slide. Minimize the total transportation cost.

D1D2D3D4CAPACI TY S S S Demand

The no. of positive allocations (occupied cells) = m + n -1 = 6 D1D2D3D4CAPACI TY S S S Demand

Total cost = 5 * * * * * * 20 = Rs. 1,015

Initial basic solution by VAM

Choose largest value  22 in columnD 2 Choose cell with lowest cost Satisfy it D1D1 D2D2 D3D3 D4D4 capacityRow differences S1S S2S S3S Demand Column differences ghj

D1D1 D2D2 D3D3 D4D4 capRow diff S1S S2S S3S Demand Column difference s

D1D1 D2D2 D3D3 D4D4 capac ity Row diff S1S S2S S3S Demand Column differences

D1D1 D2D2 D3D3 D4D4 capa city Row diff S1S S2S S3S Demand Column difference s

D1D1 D2D2 D3D3 D4D4 capa city Row diff S1S S2S S3S Demand Column differences

Total cost : 5*19 + 2* *40 + 2* * *20 = Rs 779

Q consider the following transportation problem involving 3 sources and four destinations. The cell entries represent the cost of transportation per unit. Obtain the initial basic feasible soln using 1.NWCM 2.VAM Find the optimal soln (after NWCM) using UV method

Dest source 1234supply Demand

By VAM

Dest source 1234supply Demand

m+n-1 = 6 Hence this is a feasible soln

Total Cost = Rs. 2850

By NWCM Dest source 1234supply Demand

Total cost = Rs. 4400

Optimal soln Row 1,2,3 are assigned values U1,U2,U3 AND Col 1, col2, col3 and col 4 are assigned variables V 1,V 2,V 3,V 4 FOR BASIC cells Ui + Vj = c ij Take U1 = 0

V1=3V2=1V3=0V4= supply U1= U2= U3=

If all pij<=0; optimality is reached Compute Pij (penalties) for the non basic cells by using the formula : Pij = Ui + Vj - cij

V1=3V2=1V3=0V4= supply U1= U2= U3= ve 1

If all Pij are <= 0; then optimality is reached; Cell (2,1) with penalty 6, has the most positive penalty. So, there is scope for improving soln. Construct a loop using one basic cell and other non basic cells. Assign + and – signs alternatively to the basic cells.

Choose the minimum among the –vely assigned basic cells = 250 Add to all +vely cells. Subtract from all –vely assigned cells.

V1=3V2=1V3=0V4= supply U1= U2=522 +  U3= ve ve ve 200

V1=-3V2=1V3=0V4= supply U1= U2= U3= X ve 300 -ve ve

V1=-2V2=1V3=1V4=0 1234supply U1= U2= U3= ve 300 -ve ve 50 -ve

All penalties <=0; Hence optimum solution is reached Total = 2850

Q Consider the transportation problem as shown in the table. Find the initial basic solution using 1.NWCM 2.VAM APPLY UV method to find the optimal solution.

12345supply Deman d

The given problem is unbalanced because the total demand(1550) < total supply (2000) Convert to a balanced transportation problem.

123456Supply De man d

Initial basic soln using NWCM

123456supply Dem and

Total cost = Rs. 19,700

Initial basic solution using VAM

123456Supply Demand

Total cost = Rs Asssign Ui & Vj

V1=6V2=2V3=12V4= 10 V5= 8 V6= Supply U1= U2= U3= U4= D ve 0 2

V1=6V2=2V3=12V4=10 V5=8V6= S U1= U2= U3= U4= D ve

V1=6V2=2V3=12V4= 6 V5=8V6= S U1= U2= U3= U4= D ve

Total cost = Rs. 11,500