Spring 2015 Mathematics in Management Science Transportation Problems Tableaus Shipping Solutions NorthWest Corner Rule Stepping Stone Algorithm.

Slides:



Advertisements
Similar presentations
Transportation Assignment and Transshipments Problems
Advertisements

Bus 480 – Lecture 2 Transportation and Assignment models
Operations Management Transportation 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.
Chapter 6 Linear Programming: The Simplex Method
Quantitative Techniques for Decision Making M.P. Gupta & R.B. Khanna © Prentice Hall India.
ITGD4207 Operations Research
Introduction to Operations Research
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.
Chapter 4: Linear Programming Presented by Paul Moore.
Computational Methods for Management and Economics Carla Gomes Module 8b The transportation simplex method.
PowerPoint presentation to accompany Operations Management, 6E (Heizer & Render) © 2001 by Prentice Hall, Inc., Upper Saddle River, N.J C-1 Operations.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
Chapter 6 Linear Programming: The Simplex Method
Part 3 Linear Programming 3.4 Transportation Problem.
Chapter 2 Matrices Finite Mathematics & Its Applications, 11/e by Goldstein/Schneider/Siegel Copyright © 2014 Pearson Education, Inc.
The Transportation and Assignment Problems
Goldstein/Schnieder/Lay: Finite Math & Its Applications, 9e 1 of 86 Chapter 2 Matrices.
Example 5.3 More General Logistics Models | 5.2 | 5.4 | 5.5 | 5.6 | 5.7 | 5.8 | 5.9 | 5.10 | 5.10a a Background Information.
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.
Finite Mathematics & Its Applications, 10/e by Goldstein/Schneider/SiegelCopyright © 2010 Pearson Education, Inc. 1 of 86 Chapter 2 Matrices.
Transportation Models
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Example 15.4 Distributing Tomato Products at the RedBrand Company
Recall that a square matrix is one in which there are the same amount of rows as columns. A square matrix must exist in order to evaluate a determinant.
Transportation Model Lecture 16 Dr. Arshad Zaheer
Learning Objectives for Section 6.2
The Supply Chain Customer Supplier Manufacturer Distributor
Transportation Transportation models deals with the transportation of a product manufactured at different plants or factories supply origins) to a number.
8. Linear Programming (Simplex Method) Objectives: 1.Simplex Method- Standard Maximum problem 2. (i) Greedy Rule (ii) Ratio Test (iii) Pivot Operation.
Chapter 6 Linear Programming: The Simplex Method Section 2 The Simplex Method: Maximization with Problem Constraints of the Form ≤
Chapter 7 Transportation, Assignment & Transshipment Problems
. 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
作業研究 Using Excel to Formulate and Solve Transportation Problems.
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.
Chapter 6 Linear Programming: The Simplex Method Section 3 The Dual Problem: Minimization with Problem Constraints of the Form ≥
Barnett/Ziegler/Byleen Finite Mathematics 11e1 Learning Objectives for Section 6.3 The student will be able to formulate the dual problem. The student.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 7 LP Formulation Examples.
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.
Two Discrete Optimization Problems Problem: The Transportation Problem.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
Relations, Functions, and Matrices Mathematical Structures for Computer Science Chapter 4 Copyright © 2006 W.H. Freeman & Co.MSCS Slides Relations, Functions.
Log Truck Scheduling Problem
Chapter 4: Linear Programming Lesson Plan Mixture Problems  Combining Resources to Maximize Profit Finding the Optimal Production Policy Why the Corner.
Grid References.
What is Matrix Multiplication? Matrix multiplication is the process of multiplying two matrices together to get another matrix. It differs from scalar.
MATRIX A set of numbers arranged in rows and columns enclosed in round or square brackets is called a matrix. The order of a matrix gives the number of.
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.
CHAPTER 5 Specially Structured Linear Programmes I:
1.5 Matricies.
Transportation Problem
Chapter 4: Linear Programming Lesson Plan
Special Cases In Linear Programming
Why network models? Visualize a mathematical model
Chapter 7 Transportation, Assignment & Transshipment Problems
Data Tables and Arrays.
Chapter 5 Transportation, Assignment, and Transshipment Problems
Transportation Models
Operations Management
IENG 212 Modeling and Optimization
Operations Management
Problem Constraints of the Form 
TRANSPORTATION PROBLEMS
Transportation and Assignment Problems
Presentation transcript:

Spring 2015 Mathematics in Management Science Transportation Problems Tableaus Shipping Solutions NorthWest Corner Rule Stepping Stone Algorithm

Transportation Problems Problems where group of suppliers must meet the needs/demands of a group of users of these supplies. (Think corporate sized users, not individuals.) Have cost associated with shipping from a particular supplier to particular “consumer”. Objective is to minimize total shipping cost.

Example The military buys fuel from many refineries, and needs to it delivered to multiple bases.

Example During World War II, supplies needed to be shipped from multiple US ports to many different European ports. (This is the origin of these types of problems.)

Example A supermarket chain buys bread from a supplier that makes its bread in multiple bakeries. The bread must be shipped from individual bakeries to individual stores.

Bakery Example Chain gets bread deliveries from a bakery chain that does its baking in different places. Each store needs certain number of loaves/day. Supplier bakes enough to exactly meet demands. How many loaves ship (b to s) to stay within the demands and to minimize the cost?

Transportation Problems Have suppliers, users, shipping costs. Each supplier has a fixed amount that they can supply. Each user has a fixed amount they need/demand. The total capacity of the suppliers exactly matches the needs of the users.

Transportation Problems Inputs: individual capacities of the suppliers, individual needs of the users, and shipping costs from any one supplier to any one user. This information is collected in a table called a tableau.

Transportation Problems Have suppliers, users, shipping costs. Tableau: displays info with rim conditions. Each cell has two entries: costs and amount to ship. Shipping solution: obeys all constraints. NorthWest Corner Rule: an algorthim for obtaining a shipping solution. Indicator Values. Stepping Stone Algorithm.

Mines & Plants Two mines (extract/supply ore) and three plants (process/demand ore). Mine A supplies 7 m tons, B 3 m tons. Plant 1 needs 2 tons, 2&3 each 4 tons. Shipping costs are from A to P1,P2,P , 1, 3 from B to P1,P2,P , 5, 12

Tableaus The tableau is a table with one row per supplier (mines—labeled with A,B) and one column per consumer/demander (plants—labeled with 1,2,3).

Plant 1 Plant 2 Plant 3 Mine A Mine B Suppliers on left; demanders on top. Next add rim conditions: Supply amounts in last column. Demand amounts in last row. Check that amounts agree!

Plant 1 Plant 2 Plant 3 Mine A 7 Mine B

Plant 1 Plant 2 Plant 3 Mine A 7 Mine B Next add shipping costs. Cell (m,p) is cost to ship from mine m to plant p.

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B Need shipping solution to start with.

NorthWest Corner Rule Locate top far-left-hand cell. Ship via this cell with smaller of the two rim cells (call the value s) ; circle entry in tableau. Cross out row or column with rim value s, & reduce other rim value for this cell by s. When a single cell remains, shud be tie for rim conditions of row and column involved; put this amount into cell and circle.

Plant 1 Plant 2 Plant 3 Mine A Mine B Here!

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B Cost= =57

Plant 1 Plant 2 Plant 3 Mine A Mine B Check Indicator Values

Example A supermarket chain has three stores. Their bread supplier makes their bread in three bakeries. The stores require 3 dozen, 7 dozen, and 1 dozen loaves of bread. The bakeries are able to produce 8 dozen, 1 dozen, and 2 dozen loaves. Note: (Needs) = 11 = (Supplies) The tableau will be a table with one row per supplier (bakeries) labeled with Roman numerals and one column per consumer (stores) labeled with Arabic numerals.

Tableau The tableau for this problem is the following: Stores 2 13 Ba k e ri e s I II III Each square is called a cell and the top-right corner of each cell shows the shipping cost for the given supplier → user.

Stores 2 13 Ba k e ri e s I II III Cells are labeled by row and column: e.g., I-2 or III-1. Shipping costs are per unit (here 1 dozen loaves). The numbers along the bottom are the needs of the corresponding users. (Store 2 needs 7 doz.) The numbers along the right are the capacities of the corresponding suppliers. (Bakery III can supply 2 doz.) Collectively the numbers along the bottom and right are called the rim conditions.

Plant 1 Plant 2 Plant 3 Mine A Mine B Check Indicator Values

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B

Plant 1 Plant 2 Plant 3 Mine A Mine B Mine C

Plant 1 Plant 2 Plant 3 Mine A Mine B Mine C