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

Slides:



Advertisements
Similar presentations
Chapter 10, Part B Distribution and Network Models
Advertisements

1 1 Slides by John Loucks St. Edwards University Modifications by A. Asef-Vaziri.
Outline LP formulation of minimal cost flow problem
ECE Longest Path dual 1 ECE 665 Spring 2005 ECE 665 Spring 2005 Computer Algorithms with Applications to VLSI CAD Linear Programming Duality – Longest.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
Network Flows. 2 Ardavan Asef-Vaziri June-2013Transportation Problem and Related Topics Table of Contents Chapter 6 (Network Optimization Problems) Minimum-Cost.
1 1 BA 452 Lesson B.2 Transshipment and Shortest Route ReadingsReadings Chapter 6 Distribution and Network Models.
1 1 Slides by John Loucks St. Edward’s University Modifications by A. Asef-Vaziri.
Chapter 10, Part A Distribution and Network Models
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.
Transportation, Assignment, and Transshipment Problems
Chapter 11 To accompany Quantitative Analysis for Management, Eleventh Edition, Global Edition by Render, Stair, and Hanna Power Point slides created by.
1 1 Slide © 2001 South-Western College Publishing/Thomson Learning Anderson Sweeney Williams Anderson Sweeney Williams Slides Prepared by JOHN LOUCKS QUANTITATIVE.
1 Network Models Chapter Introduction A network problem is one that can be represented by... Nodes Arcs Function on Arcs.
Chapter 6 Maximum Flow Problems Flows and Cuts Augmenting Path Algorithm.
Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.
Linear Programming Example 5 Transportation Problem.
1 1 Slide © 2006 Thomson South-Western. All Rights Reserved. Slides prepared by JOHN LOUCKS St. Edward’s University.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
NetworkModel-1 Network Optimization Models. NetworkModel-2 Network Terminology A network consists of a set of nodes and arcs. The arcs may have some flow.
1 Lecture 4 Maximal Flow Problems Set Covering Problems.
Kerimcan OzcanMNGT 379 Operations Research1 Transportation, Assignment, and Transshipment Problems Chapter 7.
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
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.
7-1 Copyright © 2013 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
Shortest Route, Minimal Spanning Tree and Maximal Flow Models
Network Models (2) Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Network Models Tran Van Hoai Faculty of Computer Science & Engineering HCMC University of Technology Tran Van Hoai.
Section 2.9 Maximum Flow Problems Minimum Cost Network Flows Shortest Path Problems.
1 1 Slide Transportation, Assignment, and Transshipment Professor Ahmadi.
1 Minimum Cost Flows Goal: Minimize costs to meet all demands in a network subject to capacities (combines elements of both shortest path and max flow.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Chapter 7 Transportation, Assignment, and Transshipment Problems
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
EMIS 8373: Integer Programming “Easy” Integer Programming Problems: Network Flow Problems updated 11 February 2007.
Network Optimization Problems
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
Route Planning Texas Transfer Corp (TTC) Case 1. Linear programming Example: Woodcarving, Inc. Manufactures two types of wooden toys  Soldiers sell for.
1 1 Slide © 2009 South-Western, a part of Cengage Learning Slides by John Loucks St. Edward’s University.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
DISTRIBUTION AND NETWORK MODELS (1/2)
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
1 Network Models Transportation Problem (TP) Distributing any commodity from any group of supply centers, called sources, to any group of receiving.
EMIS 8374 Network Flow Models updated 29 January 2008.
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.
IE 311 Operations Research– I
1 1 Slide © 2008 Thomson South-Western. All Rights Reserved Slides by JOHN LOUCKS St. Edward’s University.
Transportation, Assignment, and Transshipment Problems Pertemuan 7 Matakuliah: K0442-Metode Kuantitatif Tahun: 2009.
8/14/04J. Bard and J. W. Barnes Operations Research Models and Methods Copyright All rights reserved Lecture 5 – Integration of Network Flow Programming.
Network Flow Problems Example of Network Flow problems:
Chapter 8 Network Models to accompany Operations Research: Applications and Algorithms 4th edition by Wayne L. Winston Copyright (c) 2004 Brooks/Cole,
1 1 © 2003 Thomson  /South-Western Slide Slides Prepared by JOHN S. LOUCKS St. Edward’s University.
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.
1 1 Slide © 2005 Thomson/South-Western Chapter 9 Network Models n Shortest-Route Problem n Minimal Spanning Tree Problem n Maximal Flow Problem.
St. Edward’s University
Network Optimization J.B. Orlin
Lecture 5 – Integration of Network Flow Programming Models
1.206J/16.77J/ESD.215J Airline Schedule Planning
Transportation, Assignment and Network Models
Introduction Basic formulations Applications
Chapter 5 Transportation, Assignment, and Transshipment Problems
Chapter 6 Network Flow Models.
Slides by John Loucks St. Edward’s University.
Network Flow Problems – Maximal Flow Problems
Presentation transcript:

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

2 2 Slide © 2008 Thomson South-Western. All Rights Reserved Chapter 6, Part B Distribution and Network Models n Shortest-Route Problem n Maximal Flow Problem

3 3 Slide © 2008 Thomson South-Western. All Rights Reserved Shortest-Route Problem n The shortest-route problem is concerned with finding the shortest path in a network from one node (or set of nodes) to another node (or set of nodes). n If all arcs in the network have nonnegative values then a labeling algorithm can be used to find the shortest paths from a particular node to all other nodes in the network. n The criterion to be minimized in the shortest-route problem is not limited to distance even though the term "shortest" is used in describing the procedure. Other criteria include time and cost. (Neither time nor cost are necessarily linearly related to distance.)

4 4 Slide © 2008 Thomson South-Western. All Rights Reserved n Linear Programming Formulation Using the notation: Using the notation: x ij = 1 if the arc from node i to node j x ij = 1 if the arc from node i to node j is on the shortest route is on the shortest route 0 otherwise 0 otherwise c ij = distance, time, or cost associated c ij = distance, time, or cost associated with the arc from node i to node j with the arc from node i to node j continued Shortest-Route Problem

5 5 Slide © 2008 Thomson South-Western. All Rights Reserved n Linear Programming Formulation (continued) Shortest-Route Problem

6 6 Slide © 2008 Thomson South-Western. All Rights Reserved Susan Winslow has an important business meeting Susan Winslow has an important business meeting in Paducah this evening. She has a number of alternate routes by which she can travel from the company headquarters in Lewisburg to Paducah. The network of alternate routes and their respective travel time, ticket cost, and transport mode appear on the next two slides. If Susan earns a wage of $15 per hour, what route If Susan earns a wage of $15 per hour, what route should she take to minimize the total travel cost? Example: Shortest Route

7 7 Slide © 2008 Thomson South-Western. All Rights Reserved 6 A B C D E F G H I J K L M Example: Shortest Route Paducah Lewisburg n Network Model

8 8 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Shortest Route Transport Time Ticket Transport Time Ticket Route Mode (hours) Cost A Train 4 $ 20 A Train 4 $ 20 B Plane 1 $115 B Plane 1 $115 C Bus 2 $ 10 C Bus 2 $ 10 D Taxi 6 $ 90 D Taxi 6 $ 90 E Train 3  $ 30 E Train 3  $ 30 F Bus 3 $ 15 F Bus 3 $ 15 G Bus 4  $ 20 G Bus 4  $ 20 H Taxi 1 $ 15 H Taxi 1 $ 15 I Train 2  $ 15 I Train 2  $ 15 J Bus 6  $ 25 J Bus 6  $ 25 K Taxi 3  $ 50 K Taxi 3  $ 50 L Train 1  $ 10 L Train 1  $ 10 M Bus 4  $ 20 M Bus 4  $ 20

9 9 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Shortest Route Transport Time Time Ticket Total Transport Time Time Ticket Total Route Mode (hours) Cost Cost Cost A Train 4 $60 $ 20$ 80 A Train 4 $60 $ 20$ 80 B Plane 1 $15 $115$130 B Plane 1 $15 $115$130 C Bus 2 $30 $ 10$ 40 C Bus 2 $30 $ 10$ 40 D Taxi 6 $90 $ 90$180 D Taxi 6 $90 $ 90$180 E Train 3  $50 $ 30$ 80 E Train 3  $50 $ 30$ 80 F Bus 3 $45 $ 15$ 60 F Bus 3 $45 $ 15$ 60 G Bus 4  $70 $ 20$ 90 G Bus 4  $70 $ 20$ 90 H Taxi 1 $15 $ 15$ 30 H Taxi 1 $15 $ 15$ 30 I Train 2  $35 $ 15$ 50 I Train 2  $35 $ 15$ 50 J Bus 6  $95 $ 25$120 J Bus 6  $95 $ 25$120 K Taxi 3  $50 $ 50$100 K Taxi 3  $50 $ 50$100 L Train 1  $20 $ 10$ 30 L Train 1  $20 $ 10$ 30 M Bus 4  $70 $ 20$ 90 M Bus 4  $70 $ 20$ 90

10 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Shortest Route n LP Formulation Objective Function Objective Function Min 80 x x x x x x 25 Min 80 x x x x x x x x x x x x x x x x x x x x x x x x x x x x 56 Node Flow-Conservation Constraints Node Flow-Conservation Constraints x 12 + x 13 + x 14 + x 15 + x 16 = 1 (origin) x 12 + x 13 + x 14 + x 15 + x 16 = 1 (origin) – x 12 + x 25 + x 26 – x 52 = 0 (node 2) – x 12 + x 25 + x 26 – x 52 = 0 (node 2) – x 13 + x 34 + x 35 + x 36 – x 43 – x 53 = 0 (node 3) – x 13 + x 34 + x 35 + x 36 – x 43 – x 53 = 0 (node 3) – x 14 – x 34 + x 43 + x 45 + x 46 – x 54 = 0 (node 4) – x 14 – x 34 + x 43 + x 45 + x 46 – x 54 = 0 (node 4) – x 15 – x 25 – x 35 – x 45 + x 52 + x 53 + x 54 + x 56 = 0 (node 5) – x 15 – x 25 – x 35 – x 45 + x 52 + x 53 + x 54 + x 56 = 0 (node 5) x 16 + x 26 + x 36 + x 46 + x 56 = 1 (destination) x 16 + x 26 + x 36 + x 46 + x 56 = 1 (destination)

11 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Shortest Route n Solution Summary Minimum total cost = $150 x 12 = 0 x 25 = 0 x 34 = 1 x 43 = 0 x 52 = 0 x 13 = 1 x 26 = 0 x 35 = 0 x 45 = 1 x 53 = 0 x 13 = 1 x 26 = 0 x 35 = 0 x 45 = 1 x 53 = 0 x 14 = 0 x 36 = 0 x 46 = 0 x 54 = 0 x 14 = 0 x 36 = 0 x 46 = 0 x 54 = 0 x 15 = 0 x 56 = 1 x 15 = 0 x 56 = 1 x 16 = 0 x 16 = 0

12 Slide © 2008 Thomson South-Western. All Rights Reserved Maximal Flow Problem n The maximal flow problem is concerned with determining the maximal volume of flow from one node (called the source) to another node (called the sink). n In the maximal flow problem, each arc has a maximum arc flow capacity which limits the flow through the arc.

13 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Maximal Flow n A capacitated transshipment model can be developed for the maximal flow problem. n We will add an arc from the sink node back to the source node to represent the total flow through the network. n There is no capacity on the newly added sink-to- source arc. n We want to maximize the flow over the sink-to-source arc.

14 Slide © 2008 Thomson South-Western. All Rights Reserved Maximal Flow Problem n LP Formulation (as Capacitated Transshipment Problem) (as Capacitated Transshipment Problem) There is a variable for every arc. There is a variable for every arc. There is a constraint for every node; the flow out must equal the flow in. There is a constraint for every node; the flow out must equal the flow in. There is a constraint for every arc (except the added sink-to-source arc); arc capacity cannot be exceeded. There is a constraint for every arc (except the added sink-to-source arc); arc capacity cannot be exceeded. The objective is to maximize the flow over the added, sink-to-source arc. The objective is to maximize the flow over the added, sink-to-source arc.

15 Slide © 2008 Thomson South-Western. All Rights Reserved Maximal Flow Problem n LP Formulation (as Capacitated Transshipment Problem) (as Capacitated Transshipment Problem) Max x k 1 ( k is sink node, 1 is source node) Max x k 1 ( k is sink node, 1 is source node) s.t.  x ij -  x ji = 0 (conservation of flow) i j s.t.  x ij -  x ji = 0 (conservation of flow) i j x ij < c ij ( c ij is capacity of ij arc) x ij > 0, for all i and j (non-negativity) x ij > 0, for all i and j (non-negativity) (x ij represents the flow from node i to node j) (x ij represents the flow from node i to node j)

16 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Maximal Flow National Express operates a fleet of cargo planes and National Express operates a fleet of cargo planes and is in the package delivery business. NatEx is interested in knowing what is the maximum it could transport in one day indirectly from San Diego to Tampa (via Denver, St. Louis, Dallas, Houston and/or Atlanta) if its direct flight was out of service. NatEx's indirect routes from San Diego to Tampa, along with their respective estimated excess shipping capacities (measured in hundreds of cubic feet per day), are shown on the next slide. Is there sufficient excess capacity to indirectly ship 5000 cubic feet of packages in one day?

17 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Maximal Flow n Network Model Denver SanDiego St. Louis Houston Tampa Atlanta Dallas

18 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Maximal Flow n Modified Network Model Sink Source Addedarc

19 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Maximal Flow n LP Formulation 18 variables (for 17 original arcs and 1 added arc) 18 variables (for 17 original arcs and 1 added arc) 24 constraints 24 constraints 7 node flow-conservation constraints7 node flow-conservation constraints 17 arc capacity constraints (for original arcs)17 arc capacity constraints (for original arcs)

20 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Maximal Flow n LP Formulation Objective Function Objective Function Max x 71 Max x 71 Node Flow-Conservation Constraints Node Flow-Conservation Constraints x 12 + x 13 + x 14 – x 71 = 0 (node 1) x 12 + x 13 + x 14 – x 71 = 0 (node 1) – x 12 + x 24 + x 25 – x 42 – x 52 = 0 (node 2) – x 12 + x 24 + x 25 – x 42 – x 52 = 0 (node 2) – x 13 + x 34 + x 36 – x 43 = 0 (and so on) – x 13 + x 34 + x 36 – x 43 = 0 (and so on) – x 14 – x 24 – x 34 + x 42 + x 43 + x 45 + x 46 + x 47 – x 54 – x 64 = 0 – x 14 – x 24 – x 34 + x 42 + x 43 + x 45 + x 46 + x 47 – x 54 – x 64 = 0 – x 25 – x 45 + x 52 + x 54 + x 57 = 0 – x 25 – x 45 + x 52 + x 54 + x 57 = 0 – x 36 – x 46 + x 64 + x 67 = 0 – x 36 – x 46 + x 64 + x 67 = 0 – x 47 – x 57 – x 67 + x 71 = 0 – x 47 – x 57 – x 67 + x 71 = 0

21 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Maximal Flow n LP Formulation (continued) Arc Capacity Constraints Arc Capacity Constraints x 12 < 4 x 13 < 3 x 14 < 4 x 12 < 4 x 13 < 3 x 14 < 4 x 24 < 2 x 25 < 3 x 24 < 2 x 25 < 3 x 34 < 3 x 36 < 6 x 34 < 3 x 36 < 6 x 42 < 3 x 43 < 5 x 45 < 3 x 46 < 1 x 47 < 3 x 42 < 3 x 43 < 5 x 45 < 3 x 46 < 1 x 47 < 3 x 52 < 3 x 54 < 4 x 57 < 2 x 52 < 3 x 54 < 4 x 57 < 2 x 64 < 1 x 67 < 5 x 64 < 1 x 67 < 5

22 Slide © 2008 Thomson South-Western. All Rights Reserved n Alternative Optimal Solution #1 Example: Maximal Flow Objective Function Value = Variable Value x x x x x x x x x Variable Value x x x x x x x x x

23 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Maximal Flow n Alternative Optimal Solution # Sink Source 10

24 Slide © 2008 Thomson South-Western. All Rights Reserved n Alternative Optimal Solution #2 Example: Maximal Flow Objective Function Value = Variable Value x x x x x x x x x Variable Value x x x x x x x x x

25 Slide © 2008 Thomson South-Western. All Rights Reserved Example: Maximal Flow n Alternative Optimal Solution # Sink Source 10

26 Slide © 2008 Thomson South-Western. All Rights Reserved End of Chapter 6, Part B