Lecture 15: Transportation and other Networks AGEC 352 Spring 2011 – March 23 R. Keeney.

Slides:



Advertisements
Similar presentations
Prepared by: Dayani Jathunge061011V Dissanayake G.P P Fernando C.I X.
Advertisements

Network Models Robert Zimmer Room 6, 25 St James.
Network Models Robert Zimmer Room 6, 25 St James.
Network Models Robert Zimmer Room 6, 25 St James.
Transportation Assignment and Transshipments Problems
Transportation Problem and Related Topics. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics There are 3 plants, 3 warehouses.
BU BU Decision Models Networks 1 Networks Models Summer 2013.
Transportation Problem (TP) and Assignment Problem (AP)
1 Transportation problem The transportation problem seeks the determination of a minimum cost transportation plan for a single commodity from a number.
Transportation, Transshipment and Assignment Models and Assignment Models.
Lecture 13: Transportation ‘Autopower Co. Case’ AGEC 352 Spring 2011 – March 9 R. Keeney.
Session 3a Decision Models -- Prof. Juran.
Introduction to Operations Research
Lecture 15: Transportation and other Networks AGEC 352 Spring 2012 – March 21 R. Keeney.
Lecture 10: Sensitivity Part I: General AGEC 352 Spring 2011 – February 28 R. Keeney.
Lecture 18: Topics Integer Program/Goal Program AGEC 352 Spring 2011 – April 6 R. Keeney.
Lecture 17: Network Models/ Inventory Problems AGEC 352 Spring 2011 – March 28 R. Keeney.
Lecture 12: Transportation Introduction AGEC 352 Spring 2011 – March 7 R. Keeney.
Lecture 16: Network Models/ Scheduling Assignments AGEC 352 Spring 2011 – March 28 R. Keeney.
Previously in Chapter 4 Assignment Problems Network Flow Problems Sequential Decision Problems Vehicle Routing Problems Transportation Problems Staffing.
Transportation Models Transportation problem is about distribution of goods and services from several supply locations to several demand locations. Transportation.
Example 7.1 Pricing Models | 7.3 | 7.4 | 7.5 | 7.6 | 7.7 | 7.8 | 7.9 | 7.10 | Background Information n The Madison.
Linear Programming Applications
Chapter 7 Transportation, Assignment & Transshipment Problems Part 1 ISE204/IE252 Prof. Dr. Arslan M. ÖRNEK.
Transportation, Assignment, Network Models
Optimization II. © The McGraw-Hill Companies, Inc., 2004 Operations Management -- Prof. Juran2 Outline Optimization Extensions Multiperiod Models –Operations.
Simulations and Supply Chain Management David Sparling Court of Experts September 6, 2002 University of Guelph.
Transportation Model (Powerco) Send electric power from power plants to cities where power is needed at minimum cost Transportation between supply and.
Transportation Model Lecture 16 Dr. Arshad Zaheer
1 The Supply Chain Supplier Inventory Distributor Inventory Manufacturer Customer Market research data scheduling information Engineering and design data.
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.
Transportation Problem
2/14: More Transportation Planning & Production Scheduling Roll call Return homework Go over homework Transportation planning w/ transshipments Revisiting.
Assignment Model Lecture 21 By Dr Arshad Zaheer. RECAP  Transportation model (Maximization)  Illustration (Demand > Supply)  Optimal Solution  Modi.
2/7 Transportation LP modeling Turn in homework / Roll call Discussion of homework Transportation modeling Assignment modeling Small group exercise: Transportation.
 Consists of nodes representing a set of origins and a set of destinations.  An arc is used to represent the route from each origins to each destinations.
. 1 Transportation and Assignment Problems. . 2 Applications Physical analog of nodes Physical analog of arcs Flow Communication systems phone exchanges,
Hub Location Problems Chapter 12
November 5, 2012 AGEC 352-R. Keeney.  Recall  With 2000 total units (maximum) at harbor and 2000 units (minimum) demanded at assembly plants it is not.
作業研究 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.
Route Planning Texas Transfer Corp (TTC) Case 1. Linear programming Example: Woodcarving, Inc. Manufactures two types of wooden toys  Soldiers sell for.
Arben Asllani University of Tennessee at Chattanooga Prescriptive Analytics CHAPTER 7 Business Analytics with Shipment Models Business Analytics with Management.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 7 LP Formulation Examples.
Homework Assignment and Labs Monday  Last few minutes of class I will introduce lab  Only the lab (part I) will be posted  You will need to work through.
Network Optimization Network optimization models: Special cases of linear programming models Important to identify problems that can be modeled as networks.
Lecture 5 – Integration of Network Flow Programming Models Topics Min-cost flow problem (general model) Mathematical formulation and problem characteristics.
8/14/04J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 5 – Integration of Network Flow Programming.
Lecture 13: Transportation Introduction AGEC 352 Spring 2012 – March 5 R. Keeney.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 14 Sensitivity Analysis.
The analytics of constrained optimal decisions microeco nomics spring 2016 dynamic pricing (II) ………….1integrated market ………….2 uniform pricing: no capacity.
Review hospitals were rated on several characteristics including daily patient volume and nurse-to- patient ratio, where a daily patient volume.
Lecture 13: Transportation Introduction AGEC 352 Fall 2012 – October 24 R. Keeney.
The Transportation and Assignment Problems
Part 3 Linear Programming
Lecture 5 – Integration of Network Flow Programming Models
The Transportation Model
Lecture 5 – Integration of Network Flow Programming Models
Routing and Logistics with TransCAD
Part 3 Linear Programming
The Theory of the Simplex Method Asst. Prof. Dr. Nergiz Kasımbeyli
Optimization II.
GEOP 4355 Distribution Problems
Chapter 5 Transportation, Assignment, and Transshipment Problems
OUTLINE Questions? Comments? Quiz Results Return Quiz Chapter 5.
Part 3 Linear Programming
Lecture 12 Network Models.
Presentation transcript:

Lecture 15: Transportation and other Networks AGEC 352 Spring 2011 – March 23 R. Keeney

Network Models Entry nodes, exit nodes, transition nodes Classic example: ◦ Production: Enter into the network ◦ Wholesale/Warehouse: Waypoint between production and sale ◦ Retail: Exit the network (final demand)

Transportation Example Entry nodes ◦ Jacksonville and New Orleans Exit nodes ◦ New York City, Chicago Transition nodes ◦ Atlanta, Dallas

Diagrammatic Example Jacksonville New Orleans Atlanta Dallas New York City Chicago Origin Points Waypoints Origin Points End Points

Diagrammatic Example: Additional Routes to Waypoint Jacksonville New Orleans Atlanta Dallas New York City Chicago

Diagrammatic Example: Additional Routes to Retail Jacksonville New Orleans Atlanta Dallas New York City Chicago

Diagrammatic Example: Supply and Demand Numbers Jacksonville New Orleans Atlanta Dallas New York City Chicago 100 Units 200 Units 50 Units 70 Units

Diagrammatic Example: Additional Retail Options Jacksonville New Orleans Atlanta Dallas New York City Chicago 100 Units 200 Units 120 Units 60 Units 50 Units 70 Units

Two nodes are destinations and sources How do we deal with this? Recall the balance equation we saw earlier in the semester for a product like corn ◦ Corn bushels produced (S) >= corn bushels marketed (M) ◦ S – M >= 0 ◦ Assume we wanted to store 500 bushels ◦ S – M >= 500

Balance equation Atlanta ◦ S = Quantity of items entering from Jacksonville and New Orleans ◦ M = Quantity of items shipped to New York and Chicago ◦ S – M >= 70 Dallas?

Diagrammatic Example: Direct Routes Jacksonville New Orleans Atlanta Dallas New York City Chicago 100 Units 200 Units 120 Units 60 Units 50 Units 70 Units

Diagrammatic Example: Cost Information Jacksonville New Orleans Atlanta Dallas New York City Chicago 100 Units 200 Units 120 Units 60 Units 50 Units 70 Units $150 $75 $125 $150 $100

Diagrammatic Example: Cost Information Jacksonville New Orleans Atlanta Dallas New York City Chicago 100 Units 200 Units 120 Units 60 Units 50 Units 70 Units $150 $75 $125 $150 $100

How to model in Excel? Cost Matrix From/ToAtlDalNYChi Jax N.O Atl Dal-- 100

Constraints We can still use the sums at the end of rows and columns, but it will be easier to organize them in a separate location since some constraints will require a both the row and column sum to calculate We will need to force some decision variables to be zero (unavailable routes) ◦ We can do this by constraining them to zero ◦ Or, omitting from the decision variable matrix

Notes If you constrain the routes to zero, there will be meaningless sensitivity information ◦ Force a route to equal zero and there is a shadow price but it depends on the unit cost of using that route ◦ If you had a credible estimate of the unit cost of transportation the shadow price might be useful

Comments We’ll see a couple of different applications of network models that work just like transportation next week Assignments and Inventory Schedules ◦ Source = people; Destination = jobs ◦ Source = supply today; Destination = demand in the future Any network can be modeled, you just can’t expect them all to be cookie cutter versions…

Quiz on Monday Another Transportation Case with Waypoint nodes (serve as source and destination)