TRANSPORTATION PROBLEM Finding Initial Basic Feasible Solution Shubhagata Roy.

Slides:



Advertisements
Similar presentations
INTRODUCTION The transportation problems are one of the types of the LLP (Linear Programming Problems), In which objective is to transport various quantities.
Advertisements

Transportation simplex method. B1B2B3B4 R R R Balanced?
Chapter 5: Linear Programming: The Simplex Method
© Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17v Slide 1 Network Models Lecture 17 (Part v.) Vogel’s Approximation.
Operations Management Transportation Models
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
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.
1Transportation ModelsLesson 4 LECTURE FOUR Transportation Models.
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India.
ITGD4207 Operations Research
Chapter 7: Transportation Models Skip Ship Routing & Scheduling (pp ) Service Selection Shortest Path Transportation Problem Vehicle Routing &
Introduction to Operations Research
Transportation and Assignment Solution Procedures
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.,
Operations Research Assignment Problem.
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India.
Part 3 Linear Programming 3.4 Transportation Problem.
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 Model Lecture 16 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
The Assignment Problem. In many business situations, management needs to assign - personnel to jobs, - jobs to machines, - machines to job locations,
Transportation Problem
Assignment Model Lecture 21 By Dr Arshad Zaheer. RECAP  Transportation model (Maximization)  Illustration (Demand > Supply)  Optimal Solution  Modi.
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.
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.
Transportation problems – The north-west corner method A manufacturer has 70 products at depot A, 30 at depot B and 40 at depot C. He has orders for 50.
BOX PLOTS (BOX AND WHISKERS). Boxplot A graph of a set of data obtained by drawing a horizontal line from the minimum to maximum values with quartiles.
A transportation problem.  Let c ik be cold stream i in interval k and h jl be hot stream j in the interval l.  Define a ik as the heat.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
Operations Management MBA Sem II Module IV Transportation.
Transportation Problems Joko Waluyo, Ir., MT., PhD Dept. of Mechanical and Industrial Engineering.
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.
Distribution Model Meaning Types Transportation Model Assignment Model.
1 1 Slide Operations Research (OR) Transportation, Assignment, and Transshipment Problems.
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
Transportation Problem
The Transportation Model
Chapter 10 Transportation and Assignment Models
Chapter 7 Transportation, Assignment & Transshipment Problems
TRANSPORTATION PROBLEM
Transportation Problems
Chapter 5 Transportation, Assignment, and Transshipment Problems
Operations Management
IENG 212 Modeling and Optimization
Operations Management
Decision Science Chapter 6 Assignment Models.
TRANSPORTATION PROBLEMS
Transportation and Assignment Problems
Presentation transcript:

TRANSPORTATION PROBLEM Finding Initial Basic Feasible Solution Shubhagata Roy

North-West Corner Method Step1: Select the upper left (north-west) cell of the transportation matrix and allocate the maximum possible value to X 11 which is equal to min(a 1,b 1 ). Step2: If allocation made is equal to the supply available at the first source (a 1 in first row), then move vertically down to the cell (2,1). If allocation made is equal to demand of the first destination (b 1 in first column), then move horizontally to the cell (1,2). If a 1 =b 1, then allocate X 11 = a 1 or b 1 and move to cell (2,2). Step3: Continue the process until an allocation is made in the south-east corner cell of the transportation table.

Example: Solve the Transportation Table to find Initial Basic Feasible Solution using North-West Corner Method. Total Cost =19*5+30*2+30*6+40*3+70*4+20*14 = Rs. 1015

Least Cost Method Step1: Select the cell having lowest unit cost in the entire table and allocate the minimum of supply or demand values in that cell. Step2: Then eliminate the row or column in which supply or demand is exhausted. If both the supply and demand values are same, either of the row or column can be eliminated. In case, the smallest unit cost is not unique, then select the cell where maximum allocation can be made. Step3: Repeat the process with next lowest unit cost and continue until the entire available supply at various sources and demand at various destinations is satisfied.

The total transportation cost obtained by this method = 8*8+10*7+20*7+40*7+70*2+40*3 = Rs.814 Here, we can see that the Least Cost Method involves a lower cost than the North-West Corner Method.

Vogel’s Approximation Method Step1: Calculate penalty for each row and column by taking the difference between the two smallest unit costs. This penalty or extra cost has to be paid if one fails to allocate the minimum unit transportation cost. Step2: Select the row or column with the highest penalty and select the minimum unit cost of that row or column. Then, allocate the minimum of supply or demand values in that cell. If there is a tie, then select the cell where maximum allocation could be made. Step3: Adjust the supply and demand and eliminate the satisfied row or column. If a row and column are satisfied simultaneously, only of them is eliminated and the other one is assigned a zero value.Any row or column having zero supply or demand, can not be used in calculating future penalties. Step4: Repeat the process until all the supply sources and demand destinations are satisfied.

The total transportation cost obtained by this method = 8*8+19*5+20*10+10*2+40*7+60*2 = Rs.779 Here, we can see that Vogel’s Approximation Method involves the lowest cost than North-West Corner Method and Least Cost Method and hence is the most preferred method of finding initial basic feasible solution.