QUANTITATIVE ANALYSIS FOR MANAGERS TRANSPORTATION MODEL

Slides:



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

The Transportation Problem
INTRODUCTION The transportation problems are one of the types of the LLP (Linear Programming Problems), In which objective is to transport various quantities.
Operations Management
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.
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India.
ITGD4207 Operations Research
Introduction to Operations Research
Transportation and Assignment Solution Procedures
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.
Transportation and Assignment Models
© 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.,
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India.
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 Models
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.
C - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall C C Transportation Models PowerPoint presentation to accompany Heizer and Render Operations.
© 2008 Prentice-Hall, Inc. Chapter 10 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides.
SUPPLEMENT TO CHAPTER EIGHT Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 THE TRANSPORTATION MODEL 8S-1 Chapter 8 Supplement The Transportation.
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 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.
8s-1 McGraw-Hill Ryerson Operations Management, 2 nd Canadian Edition, by Stevenson & Hojati Copyright © 2004 by The McGraw-Hill Companies, Inc. All rights.
Reid & Sanders, Operations Management © Wiley 2002 Solving Transportation Problems C SUPPLEMENT.
9/22: Transportation: review Initial allocation –NorthWest corner method –Least Cost method –Remember: this is for the INITIAL LAYOUT ONLY -- this is NOT.
Distribution Model Meaning Types Transportation Model Assignment Model.
1 1 Slide Operations Research (OR) Transportation, Assignment, and Transshipment Problems.
Transportation, Assignment, and Network Algorithms 8 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna and Hale.
The Transportation and Assignment Problems
The Transportation Model
Transportation and Assignment Models
CHAPTER 5 Specially Structured Linear Programmes I:
The Transportation Model
Transportation Problem
The Transportation Model
Chapter 10 Transportation and Assignment Models
Assignment Problem A balanced transportation problem in which
نموذج النقل Transportation Model.
TRANSPORTATION PROBLEM
Transportation Problems
Chapter 5 Transportation, Assignment, and Transshipment Problems
Operations Management
Operations Management
Decision Science Chapter 6 Assignment Models.
TRANSPORTATION PROBLEMS
Transportation and Assignment Problems
Presentation transcript:

QUANTITATIVE ANALYSIS FOR MANAGERS TRANSPORTATION MODEL LECTURE 3

Learning Objectives When you complete this chapter, you should be able to identify or define: Transportation modelling to explain or use: Northwest-corner method Least Cost method Vogel’s Approximation method Stepping-stone method LECTURE 3

Outline Transportation Modelling Developing an Initial Solution The Northwest-Corner Method The Least-Cost Method The Vogel’s Approximation Method The Stepping-Stone Method Special issues in modelling - Demand Not Equal to Supply LECTURE 3

Transportation Problem How much should be shipped from several sources to several destinations Sources: Factories, warehouses, etc. Destinations: Warehouses, stores, etc. Transportation models Find lowest cost shipping arrangement Used primarily for existing distribution systems LECTURE 3

A Transportation Model Requires The origin points, and the capacity or supply per period at each The destination points and the demand per period at each The cost of shipping one unit from each origin to each destination LECTURE 3

Transportation Problem Solutions steps Define problem Set up transportation table (matrix) Summarizes all data Keeps track of computations Develop initial solution Northwest corner Method Vogel’s Approximation Method Find optimal solution Stepping stone method LECTURE 3

Methods for finding Initial Solution 1. North-West Corner Method (NWCM) Begin in the upper-left-hand corner of the transportation table for a shipment and allocate as many units as possible equal to minimum between available capacity and requirement; i.e. min (a1, b1). Allocate the maximum that is possible, min (100, 90) = 90. Now move horizontally to the second column in the first row. Repeat the above steps

Example 1: A company has three factories F1, F2 and F3 with production capacity 100, 250 and 150 units per week respectively. These units are to be shipped to four warehouses W1, W2, W3 and W4 with requirement of 90, 160, 200 and 50 units per week respectively. The transportation costs (in Rs) per unit between factories and warehouses are given as follows: Warehouse W1 W2 W3 W4 Capacity F1 30 25 40 20 100 F2 29 26 35 250 F3 31 33 37 150 Requirement 90 160 200 50 Factory

The total cost of transportation is obtained as follows: Route Units per unit From To shipped X cost (Rs) = Total Cost F1 W1 F1 W2 F2 W2 F2 W3 F3 W3 F3 F4 Total =

2. The Least Cost Method Identify the cell with the lowest cost. Arbitrarily break any ties for the lowest cost. Allocate as many units as possible to that cell without exceeding the supply or demand. Then cross out that row or column (or both) that is exhausted by this assignment. Find the cell with the lowest cost from the remaining cells. Repeat steps 2 & 3 until all units have been allocated.

Total Transportation cost = Rs 15, 020 Condition: LCM Total Transportation cost = Rs 15, 020 Condition: Occupied shipping routes = (no. of rows + no. of columns) – 1 = 3 + 4 –1 = 6 This cost is less than the cost determined by NWCM. Therefore, this method is preferred over the NWCM.

3. Vogel’s Approximation Method (VAM) This method is preferred over the other two methods because the initial basic feasible solution obtained is either optimal or very close to the optimal solution. For each row and column, find the difference between the two lowest unit shipping costs. Identify the row or column with the greatest opportunity cost or difference. Assign as many units as possible to the lowest-cost square in the row or in the column selected.

W1 W2 W3 W4 Capacity F1 30 25 40 20 100 F2 29 26 35 250 F3 31 33 37 150 Requirement 90 160 200 50 500

Stepping-Stone Method Optimality Test Stepping-Stone Method This method starts with an evaluation of each of the unoccupied cells to decide whether it would be economical to introduce any of these cells into the current solution.

The Stepping Stone Method Apply any of the three methods to obtain the initial basic feasible solution Select any unused cell to be evaluated Begin at this cell. Trace a closed path back to the original cell via cells that are currently being used (only horizontal or vertical moves allowed) Place + in unused cell; alternate - and + on each corner cell of the closed path Calculate improvement index: add together the unit cost figures found in each cell containing a +; subtract the unit cost figure in each cell containing a -. Repeat steps 1-4 for each unused square LECTURE 3

Stepping Stone Method contd. Check the sign of each of the net change in the unit transportation costs. If all net changes are plus (+) or zero, then an optimal solution has been achieved, otherwise go to next step Select the unoccupied cell with most negative net change among all unoccupied cells. If two minus values are equal, select that one which will result in moving as many units as possible into the selected unoccupied cell with the minimum cost Assign the maximum unit that can be shipped on the new route. This is done by looking at the closed paths (-) sign and we select the smallest number found in the cells with (-) signs and make the transfer

Example 2: A company is spending Rs1000 on transportation of its units from three plants to four distribution centres. The availabilities and requirements of units with units cost of transportations are given as: Distribution Centres D1 D2 D3 D4 Availabilities P1 19 30 50 12 7 P2 70 40 60 10 P3 20 18 Requirements 5 8 15 What can be the maximum saving for the company by optimum distribution?

Special Issues in the Transportation Model Demand not equal to supply Called ‘unbalanced’ problem Add dummy source if demand > supply Add dummy destination if supply > demand Degeneracy in Stepping Stone Method Too few shipping routes (cells) used Number of occupied cells should be: m + n - 1 Create artificially occupied cell (0 value) Represents fake shipment LECTURE 3