Lecture 18: MGTSC 352 Distribution Planning

Slides:

Advertisements

Similar presentations

Thursday, March 14 Introduction to Network Flows

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.

Outline LP formulation of minimal cost flow problem

1 Lecture 2 Shortest-Path Problems Assignment Problems Transportation Problems.

BU BU Decision Models Networks 1 Networks Models Summer 2013.

Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.

Max Flow Problem Given network N=(V,A), two nodes s,t of V, and capacities on the arcs: uij is the capacity on arc (i,j). Find non-negative flow fij for.

1 1 BA 452 Lesson B.2 Transshipment and Shortest Route ReadingsReadings Chapter 6 Distribution and Network Models.

The minimum cost flow problem

Management Science 461 Lecture 6 – Network Flow Problems October 21, 2008.

Spreadsheet Modeling & Decision Analysis A Practical Introduction to Management Science 5 th edition Cliff T. Ragsdale.

Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.

Management Science 461 Lecture 2b – Shortest Paths September 16, 2008.

1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.

Network Optimization Models: Maximum Flow Problems

Network Optimization Models: Maximum Flow Problems In this handout: The problem statement Solving by linear programming Augmenting path algorithm.

Chapter 7 Network Flow Models.

Transportation Models Transportation problem is about distribution of goods and services from several supply locations to several demand locations. Transportation.

Minimum Cost Flow Lecture 5: Jan 25. Problems Recap Bipartite matchings General matchings Maximum flows Stable matchings Shortest paths Minimum spanning.

Transportation Model (Powerco) Send electric power from power plants to cities where power is needed at minimum cost Transportation between supply and.

Example 15.4 Distributing Tomato Products at the RedBrand Company

Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.

Computational Methods for Management and Economics Carla Gomes Module 9d Network Models Maximum Flow Problem (Slides adapted from J.Orlin’s and Hillier’s)

Lecture 4 – Network Flow Programming

1 1 Slide © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or posted to a publicly accessible website, in whole.

and 6.855J The Capacity Scaling Algorithm.

Chapter 5 Network Models. Thomson/South-Western 2007 © South-Western/Cengage Learning © 2012 Practical Management Science, 4e Winston/Albright Introduction.

Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.

ENGM 732 Network Flow Programming Network Flow Models.

Spreadsheet Modeling & Decision Analysis:

Section 2.9 Maximum Flow Problems Minimum Cost Network Flows Shortest Path Problems.

Network Optimization Problems

Route Planning Texas Transfer Corp (TTC) Case 1. Linear programming Example: Woodcarving, Inc. Manufactures two types of wooden toys  Soldiers sell for.

CS 4407, Algorithms University College Cork, Gregory M. Provan Network Optimization Models: Maximum Flow Problems In this handout: The problem statement.

1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.

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.

Network Flow Problems Example of Network Flow problems:

Distribution Manager Supply Chain Man. (SCM), “Logistics” Transport Plans (Production Plans) Facility Location f.ex. warehouses Network Models: Minimal.

Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.

1 1 Slide © 2008 Thomson South-Western. All Rights Reserved © 2011 Cengage Learning. All Rights Reserved. May not be scanned, copied or duplicated, or.

Lecture 4 – Network Flow Programming Topics Terminology and Notation Network diagrams Generic problems (TP, AP, SPP, STP, MF) LP formulations Finding solutions.

Network Problems A D O B T E C

Minimum Cost Flow Algorithms and Networks. Algorithms and Networks: Minimum Cost Flow2 This lecture The minimum cost flow problem: statement and applications.

Managerial Decision Making Chapter 5 Network Modelling.

Part 3 Linear Programming

The Transportation Model

Algorithms and Networks

ENGM 535 Optimization Networks

Routing and Logistics with TransCAD

Part 3 Linear Programming

The Shortest Augmenting Path Algorithm for the Maximum Flow Problem

Transportation, Assignment and Network Models

Lecture 19: MGTSC 352 Distribution Planning

Introduction Basic formulations Applications

Network Models with Excel

Network Models Robert Zimmer Room 6, 25 St James.

Spreadsheet Modeling & Decision Analysis

and 6.855J Flow Decomposition

Chapter 5 Network Modeling.

Successive Shortest Path Algorithm

Algorithms and Networks

The Shortest Augmenting Path Algorithm for the Maximum Flow Problem

The Shortest Augmenting Path Algorithm for the Maximum Flow Problem

Part 3 Linear Programming

INTRODUCTION TO NETWORK FLOWS

Network Flow Problems – Maximal Flow Problems

Lecture 12 Network Models.

Presentation transcript:

Lecture 18: MGTSC 352 Distribution Planning Rent-A-Dent example: a transportation problem Oil example: a minimum cost flow problem Henderson Food Company: shortest path problem

Distribution Planning Rent-a-Dent example: Transportation problem Oil example: Minimum cost network flow problem Henderson Food Company example: Shortest path problem

Transportation Problem “arcs” / “links”  Demand nodes Supply nodes 

Minimum Cost Flow Problem (pg. 118) Task: Send flow from supply (-) to demand (+) nodes Goal: Minimize transport cost Changing cells: flow on each link Constraints: flows  arc capacities flow in + supply  flow out + demand flows  0 To Excel

Min Cost Flow: Testing Your Intuition What if total supply < total demand, and we use flow in + supply  flow out + demand? What if total supply > total demand, and we use flow in + supply = flow out + demand (= instead of )?

Rent-a-Dent vs Oil Rent-a-Dent (transportation problem) Every node is a supply or demand node “Arcs” correspond to routes Finds From-To shipments Oil (minimum cost flow problem) Full network Arcs correspond to route segments Finds flows on each segment

Relations Transportation problem is a special case of the min cost flow problem Shortest path problem is (also) a special case of min cost flow problem. What?

Find the “cheapest” path from Node 1 to Node 5 Can you manipulate the problem data so as to “trick” Excel? -1 +1 to Excel

Quickest route from Lethbridge to Fort McMurray that... Pg. 125 Quickest route from Lethbridge to Fort McMurray that... ..does not go through Calgary? ..goes through Rocky Mountain House? ..includes the Drumheller-Red Deer arc? Suppose you are interested in the shortest route from Lethbridge to Fort McMurray, not the fastest route. Now what?

Shortest Path from Vancouver to Miami that goes through Toronto What’s wrong with this picture? Miami