To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ 07458 Chapter 10.

Slides:



Advertisements
Similar presentations
The Assignment Problem
Advertisements

The Transportation Problem
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)
Transportation, Transshipment and Assignment Models and Assignment Models.
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
Assignment Meeting 15 Course: D Deterministic Optimization Year: 2009.
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 9-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 9 Linear.
Introduction to Operations Research
Transportation and Assignment Solution Procedures
TRANSPORTATION PROBLEM Finding Initial Basic Feasible Solution Shubhagata Roy.
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.
Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
Transportation and Assignment Models
C – 1 Linear Programming. C – 2 Linear Programming  A mathematical technique to help plan and make decisions relative to the trade-offs necessary to.
Operations Research Assignment Problem.
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India.
The Transportation and Assignment Problems
Transportation and Assignment Problems
Operations Management
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 12-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 12.
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
Chapter 7 Transportation, Assignment & Transshipment Problems
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.
© 2008 Prentice-Hall, Inc. Chapter 10 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides.
Assignment Models Dr. Kirti Arekar
SUPPLEMENT TO CHAPTER EIGHT Irwin/McGraw-Hill © The McGraw-Hill Companies, Inc., 1999 THE TRANSPORTATION MODEL 8S-1 Chapter 8 Supplement The Transportation.
Transportation & Assignment Models IE 311 Operations Research by Mohamed Hassan Faculty of Engineering Northern Border University.
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.
8 - 1 Chapter 8: Location Strategies Outline  The Strategic Importance of Location  Factors That Affect Location Decisions  Labor Productivity.
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.
Transportation, Assignment, and Network Models 9 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna and Hale Power.
Transportation, Assignment, and Network Algorithms 8 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna and Hale.
The Transportation Model
Transportation and Assignment Models
CHAPTER 5 Specially Structured Linear Programmes I:
The Transportation Model
Chapter 10 Transportation and Assignment Models
Chapter 12 Network Models 12-1
Assignment Problem A balanced transportation problem in which
نموذج النقل Transportation Model.
Chapter 7 Transportation, Assignment & Transshipment Problems
TRANSPORTATION PROBLEM
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:

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 and Assignment Models

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-2 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Learning Objectives Students will be able to Structure special LP problems using the transportation and assignment models. Use the N.W. corner, VAM, MODI, and stepping-stone method. Solve facility location and other application problems with transportation methods. Solve assignment problems with the Hungarian (matrix reduction) method

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-3 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter Outline 10.1 Introduction 10.2 Setting Up a Transportation Problem 10.2 Developing an Initial Solution:Northwest Corner Rule 10.4 Stepping-Stone Method: Finding a Least-Cost Solution 10.5 MODI Method 10.6 Vogel’s Approximation Method 10.7 Unbalanced Transportation Problems

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-4 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter Outline - continued 10.8 Degeneracy in Transportation Problems 10.9 More Than One Optimal Solution 10.10Maximization Transportation Problems Unacceptable or Prohibited Routes 10.12Facility Location Analysis 10.13Approach of the Assignment Model 10.14Unbalanced Assignment Models 10.15Maximization Assignment Problems

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-5 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Specialized Problems Transportation Problem Distribution of items from several sources to several destinations. Supply capacities and destination requirements known. Assignment Problem One-to-one assignment of people to jobs, etc. Specialized algorithms save time!

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-6 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Importance of Special Purpose Algorithms Fewer, less complicated, computations than with simplex Less computer memory required Produce integer solutions

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-7 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Transportation Problem Des Moines (100 units) capacity Cleveland (200 units) required Boston (200 units) required Evansville (300 units) capacity Ft. Lauderdale (300 units) capacity Albuquerque (300 units) required

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-8 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Transportation Costs From (Sources) To (Destinations) Albuquerque Boston Cleveland Des Moines Evansville Fort Lauderdale $5 $8 $9 $4 $7 $3 $5

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-9 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Unit Shipping Cost:1Unit, Factory to Warehouse Des Moines (D) Evansville (E) Fort Lauderdale (F) Warehouse Req. Albuquerque (A) Boston (B) Cleveland (C) Factory Capacity

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Total Demand and Total Supply Des Moines (D) Evansville (E) Fort Lauderdale (F) Warehouse Req. Albuquerque (A) Boston (B) Cleveland (C) Factory Capacity

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Transportation Table For Executive Furniture Corp. Des Moines (D) Evansville (E) Fort Lauderdale (F) Warehouse Req. Albuquerque (A) Boston (B) Cleveland (C) Factory Capacity

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Initial Solution Using the Northwest Corner Rule Start in the upper left-hand cell and allocate units to shipping routes as follows: Exhaust the supply (factory capacity) of each row before moving down to the next row. Exhaust the demand (warehouse) requirements of each column before moving to the next column to the right. Check that all supply and demand requirements are met.

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Initial Solution North West Corner Rule Des Moines (D) Evansville (E) Fort Lauderdale (F) Warehouse Req. Albuquerque (A) Boston (B) Cleveland (C) Factory Capacity

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Stepping-Stone Method 1. Select any unused square to evaluate. 2. Begin at this square. Trace a closed path back to the original square via squares that are currently being used (only horizontal or vertical moves allowed). 3. Place + in unused square; alternate - and + on each corner square of the closed path. 4. Calculate improvement index: add together the unit cost figures found in each square containing a +; subtract the unit cost figure in each square containing a Repeat steps for each unused square.

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Stepping-Stone Method - The Des Moines-to- Cleveland Route Des Moines (D) Evansville (E) Fort Lauderdale (F) Warehouse Req. Albuquerque (A) Boston (B) Cleveland (C) Factory Capacity Start

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Stepping-Stone Method An Improved Solution Des Moines (D) Evansville (E) Fort Lauderdale (F) Warehouse Req. Albuquerque (A) Boston (B) Cleveland (C) Factory Capacity

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Third and Final Solution Des Moines (D) Evansville (E) Ft Lauderdale (F) Warehouse Req. Albuquerque (A) Boston (B) Cleveland (C) Factory Capacity

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ MODI Method: 5 Steps 1. Compute the values for each row and column: set R i + K j = C ij for those squares currently used or occupied. 2. After writing all equations, set R 1 = Solve the system of equations for R i and K j values. 4. Compute the improvement index for each unused square by the formula improvement index: C ij - R i - K j 5. Select the largest negative index and proceed to solve the problem as you did using the stepping-stone method.

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Vogel’s Approximation 1. For each row/column of table, find difference between two lowest costs. (Opportunity cost) 2. Find greatest opportunity cost. 3. Assign as many units as possible to lowest cost square in row/column with greatest opportunity cost. 4. Eliminate row or column which has been completely satisfied. 4. Begin again, omitting eliminated rows/columns.

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Special Problems in Transportation Method Unbalanced Problem Demand Less than Supply Demand Greater than Supply Degeneracy More Than One Optimal Solution

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Unbalanced Problem Demand Less than Supply Factory 1 Factory 2 Factory 3 Customer Requirements Customer 1 Customer 2 Dummy Factory Capacity

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Unbalanced Problem Supply Less than Demand Factory 1 Factory 2 Dummy Customer Requirements Customer 1 Customer 2 Customer 3 Factory Capacity

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Degeneracy Factory 1 Factory 2 Factory 3 Customer Requirements Customer 1 Customer 2 Customer 3 Factory Capacity

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Degeneracy - Coming Up! Factory 1 Factory 2 Factory 3 Customer Requirements Customer 1 Customer 2 Customer 3 Factory Capacity

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Stepping-Stone Method - The Des Moines-to- Cleveland Route Des Moines (D) Evansville (E) Fort Lauderdale (F) Warehouse Req. Albuquerque (A) Boston (B) Cleveland (C) Factory Capacity Start

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Assignment Problem Project Person123 Adams$11$14$6 Brown$8$10$11 Cooper$9$12$7

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Assignment Method 1. subtract the smallest number in each row from every number in that row subtract the smallest number in each column from every number in that column 2. draw the minimum number of vertical and horizontal straight lines necessary to cover zeros in the table if the number of lines equals the number of rows or columns, then one can make an optimal assignment (step 4)

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ The Assignment Method - continued 3. if the number of lines does not equal the number of rows or columns subtract the smallest number not covered by a line from every other uncovered number add the same number to any number lying at the intersection of any two lines return to step 2 4. make optimal assignments at locations of zeros within the table PG 10.13b

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Hungarian Method Initial Table PersonProject 123 Adams Brown81011 Cooper9127

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Hungarian Method Row Reduction PersonProject 123 Adams Brown Cooper

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Hungarian Method Column Reduction PersonProject 123 Adams560 Brown003 Cooper230

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Hungarian Method PersonProject 123 Adams Brown Cooper Testing Covering Line 2 Covering Line 1

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Hungarian Method PersonProject 123 Adams340 Brown005 Cooper010 Revised Opportunity Cost Table

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Hungarian Method PersonProject 123 Adams 340 Brown 005 Cooper 010 Testing Covering Line 1 Covering Line 2 Covering Line 3

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Hungarian Method Assignments PersonProject 123 Adams 6 Brown10 Cooper 9

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Maximization Assignment Problem Project 123Dummy Adams$11$14$6$0 Brown$8$10$11$0 Cooper$9$12$7$0 Davis$10$13$8$0

To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Maximization Assignment Problem Project 123Dummy Adams$32$0$8$14 Brown$6$4$3$14 Cooper$5$2$77$14 Davis$4$1$6$14