Transportation Problems

Slides:



Advertisements
Similar presentations
Using Solver to solve a minimization LP + interpretation of output BSAD 30 Dave Novak Source: Anderson et al., 2013 Quantitative Methods for Business 12.
Advertisements

BA 452 Lesson B.3 Integer Programming 11ReadingsReadings Chapter 7 Integer Linear Programming.
Transshipment Problem
SOLVING LINEAR PROGRAMS USING EXCEL Dr. Ron Lembke.
Linear Programming Example 5 Transportation Problem.
Operations Management Dr. Ron Lembke
QM B Linear Programming
Transportation Problems Dr. Ron Tibben-Lembke. Transportation Problems Linear programming is good at solving problems with zillions of options, and finding.
Transportation and Assignment Problems
Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.
Computational Methods for Management and Economics Carla Gomes Module 4 Displaying and Solving LP Models on a Spreadsheet.
Example 15.4 Distributing Tomato Products at the RedBrand Company
Transportation Model Lecture 16 Dr. Arshad Zaheer
Spreadsheet Modeling of Linear Programming (LP). Spreadsheet Modeling There is no exact one way to develop an LP spreadsheet model. We will work through.
The Supply Chain Customer Supplier Manufacturer Distributor
GAMS Anwendung Nutzeroberfläche eigene Programme Modellierungs- System GAMS AMPL ILOG Studio … Solver CPLEX, CONOPT, MINOS, COIN, BARON,...
Chapter 7 Transportation, Assignment & Transshipment Problems
Location planning and analysis
Transportation and Assignment Problems
作業研究 Using Excel to Formulate and Solve Transportation Problems.
Transportation Problems Dr. Ron Lembke. Transportation Problems Linear programming is good at solving problems with zillions of options, and finding the.
Linear Programming last topic of the semester What is linear programming (LP)? Not about computer programming “Programming” means “planning” “Linear” refers.
Goal Seek and Solver. Goal seeking helps you n Find a specific value for a target cell by adjusting the value of one other cell whose value is allowed.
OTHER LOCATION METHODS Dr. Ron Lembke. P-Median Problem Minimize average weighted distance to customers, when locating P facilities, where P>=1. Can consider.
Arben Asllani University of Tennessee at Chattanooga Prescriptive Analytics CHAPTER 7 Business Analytics with Shipment Models Business Analytics with Management.
The Transportation Model McGraw-Hill/Irwin Copyright © 2012 by The McGraw-Hill Companies, Inc. All rights reserved.
1 System Planning 2013 Lecture 7: Optimization Appendix A Contents: –General about optimization –Formulating optimization problems –Linear Programming.
Operations Management
Highline Class, BI 348 Basic Business Analytics using Excel Chapter 08 & 09: Introduction to Linear Programing 1.
Log Truck Scheduling Problem
IT Applications for Decision Making. Operations Research Initiated in England during the world war II Make scientifically based decisions regarding the.
3 Components for a Spreadsheet Optimization Problem  There is one cell which can be identified as the Target or Set Cell, the single objective of the.
1 utdallas.edu/~metin SC Design Facility Location Models.
Introduction to Integer Programming Integer programming models Thursday, April 4 Handouts: Lecture Notes.
Transportation and Distribution Planning Matthew J. Liberatore John F. Connelly Chair in Management Professor, Decision and Information Techologies.
Appendix A.6 Solving Inequalities. Introduction Solve an inequality  Finding all values of x for which the inequality is true. The set of all real numbers.
Reid & Sanders, Operations Management © Wiley 2002 Solving Transportation Problems C SUPPLEMENT.
Introduction to Optimization
A Multiperiod Production Problem
Chapter 7 Transportation, Assignment, and Transshipment Problems
Solver & Optimization Problems
BIA 674 – Supply Chain Analytics
Solving 1-step Inequalities
The Transportation Model
The Transportation Problem: An Introduction
ENGM 631 Optimization Transportation Problems.
Wyndor Example; Enter data
Introduction to linear programming (LP): Minimization
Assignment Problem A balanced transportation problem in which
Solving and Graphing Linear Inequalities
Optimization II.
1.6 Solve Linear Inequalities
Chapter 7 Transportation, Assignment & Transshipment Problems
Objective Graph and solve systems of linear inequalities in two variables.
Transportation Problems
Solving Linear Inequalities
Chapter 5 Transportation, Assignment, and Transshipment Problems
Modeling and Solving LP Problems in a Spreadsheet
Slides by John Loucks St. Edward’s University.
A network problem is one that can be represented by...
Notes Over 1.7 Solving Inequalities
Notes Over 1.7 Solving Inequalities
Is 3 a solution for the inequality x – 2 < 6?
1.6 Solving Linear Inequalities
Simplex Transportation (skip)
Network Optimization Models: Maximum Flow Problems
Assignment Problem A balanced transportation problem in which
Applied Statistical and Optimization Models
Presentation transcript:

Transportation Problems Dr. Ron Lembke

Transportation Problems Linear programming is good at solving problems with zillions of options, and finding the optimal solution. Could it work for transportation problems? Costs are linear, and shipment quantities are linear, so maybe so.

Defining Variables Define cij as the cost to ship one unit from i to j. Demand at location j is dj. Supply at DC i is Si Xij is the quantity shipped from DC i to customer j.

Formulation

Transportation Method You have 3 DCs, and need to deliver product to 4 customers. Find cheapest way to satisfy all demand D 2 A 10 E 4 B 10 F 12 C 10 G 11

Solving Transportation Problems Trial and Error Linear Programming – ooh, what’s that?! Tell me more! D E F G A 10 9 8 7 B 11 4 5 C

Setting up LP Create a matrix of shipment costs (in grey in example). Create a matrix to hold the decision variables, shipment quantities (in yellow). Sum amount sent to each destination. Sum amount sent from each DC. Enter demands and supplies at each location. Compute total cost of shipments (in blue).

Using Solver

If you don’t check “assume non-negative” we get the following results: Solver doesn’t converge to an optimal solution. Why not?

Inequalities Use <= for shipments from DCs. Use >= for shipments to customers. Do we really need to? What do we do if supply is greater than demand?

Product Shortages If total demand is greater than total supply, what happens? If demand in G is 15, we get this:

Product Shortages If demand at G is 15, there are no feasible solutions, much less a best one. We need to add a phantom source, Z, with huge capacity. Think of it as a supplier that ships empty boxes. Now supply can satisfy total demand.

Shortage Costs What cost should we use for supplier Z? It should be the last resort, so it should be higher than any real costs. The cost of a shipment from Z is really the cost of shorting the customer. If all customers are created equal, give them all the same shortage cost. If some are more important, give them higher shortage costs, and we’ll only short them as a last resort.

Shortage Solution Shortage is dealt with by shorting customer A, and B. Demand exceeds supply by 3 units. Our first choice is to short A, because they are the cheapest. We can only short them by 2, their total demand. Next, short B by 1 unit.