Bus 480 – Lecture 2 Transportation and Assignment models

Slides:



Advertisements
Similar presentations
Rzuty prostokątne.
Advertisements

Your performance improvement partner 2/25/
The following 5 questions are about VOLTAGE DIVIDERS. You have 20 seconds for each question What is the voltage at the point X ? A9v B5v C0v D10v Question.
Inside the binary adder. Electro-mechanical relay A solid state relay is a switch that is controlled by a current. When current flows from A to B, the.
The Science of Biology The study of living things.
Click GraphClick Plot Double click at C2 under Y and C1 under X in Graph Variable Window. Click OK Click on the pointer beside Display and select Project.
February 7, 2002 A brief review of Linear Algebra Linear Programming Models Handouts: Lecture Notes.
Thursday, March 14 Introduction to Network Flows
M & M’s Counting Activity
Enter. The Scene Type text here Choice A1 Text for decisions Guidelines Guideline text Click on A, B or C A B C Choice B1 Choice C1 Click on A, B or C.
Fill-in headings across in the first row. (Type "Month in cell A1, Beginning Balance in cell B1, etc…) Month Beginning BalancePaymentInterestPrincipalEnd.
Session II – Sequencing
UCAS & CAO TARIFF SYSTEM FOR N I APPLICANTS. A/S LEVELS UCAS POINTS A60 B50 C40 D30 E20.
Free Macro Download from i-present.co.uk by GMARK Ltd.i-present.co.ukGMARK my text Lorem for more information :
Copyright © 2000, Denise Sakai Troxell. All rights reserved. (updated from © Joe Aieta and Denise Sakai Troxell – Summer 1999.) Solving Linear Optimization.
An Application of Linear Programming Lesson 12 The Transportation Model.
Maximum flow problems IV. MA252 Combinatorial Optimization.
Understand and use cell references j then press F5 or click Slide Show > From Beginning to start the course. In the message bar, click Enable Editing,
IEOR 4004 Maximum flow problems. Connectivity t t s s Q1: Can Alice send a message to Bob ? Yes if every (s,t)-cut contains at least one forward edge.
Functions Rosen 1.8.
The IF function Bernard Liengme. Objectives To know how to: Construct a condition using the comparison operators =, >=, >, ; Construct a formula using.
Web-pa – the tutors’ view Web-PA – a tutors’ view Peter Willmot (School of Mechanical and Manufacturing Engineering)
CST-094 Basic SpreadSheet Click your left mouse button to proceed... © Delta College CST Faculty.
Two parallel lines intersected by another line   A B Corresponding angles (sehadap) Corresponding angles are congruent  A1 =  B1.
ENGIN112 L15: Magnitude Comparator and Multiplexers October 6, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 15 Magnitude Comparators.
Transportation problem Factories Customers Requirement for goods Production capacity... Minimum cost of transportation satisfying the demand of customers.
IPE – Calendar Seite 1 Application deadline : February 28 Track length: 12 weeks + 2 weeks German class in Heidelberg Semester dates Intensive german class.
Creativity What/Who is creative? What/Who is creative? Folded bike, breathing sofa, futon Folded bike, breathing sofa, futon Fried instant noodles, (your.
Transportation simplex method. B1B2B3B4 R R R Balanced?
Transportation Problem and Related Topics. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics There are 3 plants, 3 warehouses.
Transportation Problem (TP) and Assignment Problem (AP)
1 Department of Business Administration SPRING Management Science by Asst. Prof. Sami Fethi © 2007 Pearson Education.
6-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Transportation, Transshipment, and Assignment Problems Chapter 6.
Masalah Penugasan.
Assignment Meeting 15 Course: D Deterministic Optimization Year: 2009.
Introduction to Operations Research
TRANSPORTATION PROBLEM Finding Initial Basic Feasible Solution Shubhagata Roy.
Part 3 Linear Programming 3.4 Transportation Problem.
Linear Programming Example 5 Transportation Problem.
Transportation Models Transportation problem is about distribution of goods and services from several supply locations to several demand locations. Transportation.
Transportation and Assignment Problems
Linear Programming Applications
Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.
Example 15.3 Supplying Power at Midwest Electric Logistics Model.
Transportation Model Lecture 16 Dr. Arshad Zaheer
Spring 2015 Mathematics in Management Science Transportation Problems Tableaus Shipping Solutions NorthWest Corner Rule Stepping Stone Algorithm.
. 1 Transportation and Assignment Problems. . 2 Applications Physical analog of nodes Physical analog of arcs Flow Communication systems phone exchanges,
Assignment Problem. Definition Assignment Problem is a balanced transportation problem in which all supplies and demand are equal to 1.
作業研究 Using Excel to Formulate and Solve Transportation Problems.
Model 2: Transportation Problem Roshnika Fernando.
Location decisions are strategic decisions. The reasons for location decisions Growth –Expand existing facilities –Add new facilities Production Cost.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
6-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Transportation, Transshipment, and Assignment Problems Chapter 6.
8.2 Operations With Matrices
In some cases, the waste generated by the production of material at a facility must be disposed of at special waste disposal locations. We need to identify.
Operations Management MBA Sem II Module IV Transportation.
Matrix Multiplication The Introduction. Look at the matrix sizes.
Reid & Sanders, Operations Management © Wiley 2002 Solving Transportation Problems C SUPPLEMENT.
The Transportation Problem Simplex Method Remember our initial transportation problem with the associated cost to send a unit from the factory to each.
Simplex Method for BLENDING OF AGGREGATES The contract specifications of a building project require that the course aggregate grading for concrete mixing.
CHAPTER 5 Specially Structured Linear Programmes I:
The Transportation Model
The assignment problem
The Transportation Model
Why network models? Visualize a mathematical model
Assignment Problem A balanced transportation problem in which
GEOP 4355 Distribution Problems
TRANSPORTATION PROBLEM
Area Models A strategy for Multiplication
Matrix Multiplication Sec. 4.2
Presentation transcript:

Bus 480 – Lecture 2 Transportation and Assignment models

Transportation Model Product is transported from location to location minimum cost Each source able to supply a fixed number of units Each destination has a demand for a fixed number of units Can have multiple solutions, but the same minimum cost

Transportation Model Let Xij = amount of product from point i to point j We will minimize cost The constraints will be the amount that is shipped out of point i to point j Supply Constraints Demand Constraints Each row will be its own constraint Each column will be its own constraint

Example #4 From/To Site 1 Site 2 Site 3 Supply A $6 $9 $11 130 B $12 $3 $5 70 C $4 $8 100 Demand 80 110 60 Each cell represents the cost of shipping one unit from site i to site j The cost of sending one unit of product from site A to site 1 is $6 Site 1 has a demand of 80 units Site A can supply 130 units

Example #4 Let XA1=amount shipped from site A to site 1 XB1=amount shipped from site B to site 1 XB2=amount shipped from site B to site 2 XB3=amount shipped from site B to site 3 XC1=amount shipped from site C to site 1 XC2=amount shipped from site C to site 2 XC3=amount shipped from site C to site 3

Demand/Supply Check Check to see if total supply equals total demand. If yes, then constraints are equality If no, then if supply > demand then supply constraints are <= and demand is = if supply < demand then supply constraints are = and demand is <=

Example 4 Total demand : 80 + 110 + 60 = 250 Total supply : 130 + 70 + 100 = 300 Supply is greater than demand. Cannot ship more product than is demanded Supply constraints will be <= Can meet all the demand Demand constraints will be =

Example 4 Objective Function Min 6XA1 + 9XA2 + 11XA3 + 12XB1 + 3XB2 + 5XB3 + 4XC1 + 8XC2 + 11XC3 Note the structure. It’s the same as the table

Example 4 Supply Constraints XA1 + XA2 + XA3 ≤ 130 XB1 + XB2 + XB3 ≤ 70 XC1 + XC2 + XC3 ≤ 100 Why are the signs ≤ ? Demand Constraints XA1 + XB1 + XC1 = 80 XA2 + XB2 + XC2 = 110 XA3 + XB3 + XC3 = 60 Why are the signs =?

Example 4 Hint : Copy the table twice. Once for the decision variables and one for costs Each row will be a sum. Each column will be a sum. Objective function will be sumproduct

Example 4

Example 4 - Solution Site A : Ship 80 units to site 2 Site B : Ship 10 units to site 2 and 60 units to site 3 Site C : Ship 80 units to site 1 and 20 units to site 2 Minimum cost = $1530 Check All constraints to verify the results

Transshipment Problems Have intermediate sites If an intermediate site cannot hold product then everything going into the site must equal that going out of the site Still have supply and demand constraints One extra constraint for each site

Transshipment Diagram Site D and E are intermediary Sites Sites A, B, C are supply sites Sites F, G, H are demand sites A B C E D H G F

Transshipment Constraints Everything going into site d must equal everything leaving site d Xad + Xbd + Xcd = Xdf + Xdg + Xdh In Excel, move all variables to the left side of the equation Xad + Xbd + Xcd - Xdf - Xdg - Xdh = 0

Example 41 Ship from European port to US port Once product gets to US port, it is immediately shipped to the inland port This makes the transshipment constraints=0 If the port can hold product, then 0 will change to the amount of product the port can hold, typically ≤ . Why?

Example 41- Solution

Example 41- Solution

Example 41- Solution

Example 41- Solution Cost function is the addition of multiple sumproducts

Assignment Problem Set up identical the transportation problem All constraints are equal to 1 Xij will be binary = 1 if selected, 0 otherwise

Assignment Example