IENG 212 Modeling and Optimization

Slides:

Advertisements

Similar presentations

An Application of Linear Programming Lesson 12 The Transportation Model.

Advertisements

The 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?

© 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

Transportation Problem

Transportation Problem (TP) and Assignment Problem (AP)

© Copyright Andrew Hall, 2002 FOMGT 353 Introduction to Management Science Lecture 17n. Slide 1 Network Models Lecture 17 (part n.) The Northwest Corner.

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

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.

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.,

C – 1 Linear Programming. C – 2 Linear Programming  A mathematical technique to help plan and make decisions relative to the trade-offs necessary to.

Inverses of n x n Matrices. The Inverse Matrix If A is an n x n matrix, the inverse of A (call it A -1 ) is the matrix such that A * A -1 is equal to.

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.

Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.

Operations Management

Chapter 1 Section 1.2 Echelon Form and Gauss-Jordan Elimination.

Systems of Equations and Inequalities

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

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.

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.

The Transportation Problem Simplex Method Remember our initial transportation problem with the associated cost to send a unit from the factory to each.

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

SEMINAR ON TRANSPORTATION PROBLEM

Transportation and Assignment Models

CHAPTER 5 Specially Structured Linear Programmes I:

Transportation Problem

Chapter 4: Linear Programming Lesson Plan

Special Cases In Linear Programming

The assignment problem

The Transportation Model

Chapter 10 Transportation and Assignment Models

نموذج النقل Transportation Model.

Chapter 7 Transportation, Assignment & Transshipment Problems

TRANSPORTATION PROBLEM

Ch 6: Transportation I. Formulation II. Northwest Corner

Chapter 5 Transportation, Assignment, and Transshipment Problems

Operations Management

Operations Management

Decision Science Chapter 6 Assignment Models.

Prepared by Po-Chuan on 2016/05/24

TRANSPORTATION PROBLEMS

Transportation and Assignment Problems

Presentation transcript:

IENG 212 Modeling and Optimization Name: Uğur Surname: ASLAN No:131882

I will talk about transportation models and show example.

Transportation Models

Transportation Models

Basic feasible solution can be obtained by three methods, they are North - west corner method, Least - cost cell method, Vogel's Approximation Method, generally known as VAM.

NORTH-WEST Corner Method Albuquerque Boston Cleveland Capacity Des Moines 5 4 3 100 Evansville 8 300 Fort Lauderdale 9 7 Demand 200 700

Step1 Start from the left hand side top corner or cell and make allocations depending on the availability and requirement constraint.

Step 2 By satisfying availability and requirement constraints fill the other cells. Z=1005 + 2008+1004+1007+2005=500+1600+400+700+1000=4200 $

LEAST COST method Identify the lowest cost cell in the given matrix. In this particular example it is 3. Make allocations to this cell. After filling search for lowest cost cell. Proceed this way until all allocations are made. Z=3009+2004+1003+1003=2700+800+300+300=4100 $

Vogel’s Approximation Method (VAM) Step 1: For each row and column find the difference between the two lowest unit shipping costs.

Step 2 Assign as many units as possible to the lowest-cost square in the row and column selected.

Step 3 Eliminate the column or row that has been satisfied.

Z= 1005+2004+1003+2009+1005=500+800+300+1800+500=3900 $

Thank you for watching and listening. Any questions?