Network Models Chapter 12

Slides:



Advertisements
Similar presentations
Network Models Chapter 11
Advertisements

ITS THE FINAL LECTURE! (SING IT, YOU KNOW YOU WANT TO) Operations Research.
Chapter 11 To accompany Quantitative Analysis for Management, Eleventh Edition, Global Edition by Render, Stair, and Hanna Power Point slides created by.
WOOD 492 MODELLING FOR DECISION SUPPORT Lecture 22 Network Problems.
MC - 1© 2014 Pearson Education, Inc. Transportation Models PowerPoint presentation to accompany Heizer and Render Operations Management, Eleventh Edition.
PowerPoint presentation to accompany Operations Management, 6E (Heizer & Render) © 2001 by Prentice Hall, Inc., Upper Saddle River, N.J C-1 Operations.
Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.
Transparency Masters to accompany Heizer/Render – Principles of Operations Management, 5e, and Operations Management, 7e © 2004 by Prentice Hall, Inc.,
To accompany Quantitative Analysis for Management, 8e by Render/Stair/Hanna 10-1 © 2003 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 10.
1 Minimal Spanning Tree This is a technique used when we need to connect many places to a system(network).
Optimisation Methods Network Models.
Chapter 7 Network Flow Models.
Chapter 11 Network Models. What You Need to Know For each of the three models: –What is the model? (what are given and what is to calculate) –What is.
© 2008 Prentice-Hall, Inc. Chapter 12 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides.
Network Flow Models Chapter 7.
Transportation, Assignment, Network Models
Operations Management
MNG221 - Management Science
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
To accompany Quantitative Analysis for Management, 9e by Render/Stair/Hanna 12-1 © 2006 by Prentice Hall, Inc. Upper Saddle River, NJ Chapter 12.
1 1 Slide © 2000 South-Western College Publishing/ITP Slides Prepared by JOHN LOUCKS.
Introduction to Management Science
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.
Computational Methods for Management and Economics Carla Gomes Module 9d Network Models Maximum Flow Problem (Slides adapted from J.Orlin’s and Hillier’s)
Table 1. Shipping costs, Supply, and Demand for Powerco Example
7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
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
Operations Research Assistant Professor Dr. Sana’a Wafa Al-Sayegh 2 nd Semester ITGD4207 University of Palestine.
Networks and the Shortest Path Problem.  Physical Networks  Road Networks  Railway Networks  Airline traffic Networks  Electrical networks, e.g.,
How to Build Network? ISAT 625 Network Problems Build highways to connect cities Build highways to connect cities Build network to connect computers.
Network Optimization Models
Introduction to Operations Research
Network Optimization Problems
Welcome to MM305 Unit 6 Seminar Larry Musolino
QUANTITATIVE ANALYSIS FOR MANAGERS TRANSPORTATION MODEL
C - 1© 2011 Pearson Education, Inc. publishing as Prentice Hall C C Transportation Models PowerPoint presentation to accompany Heizer and Render Operations.
An-Najah N. University Faculty of Engineering and Information Technology Department of Management Information systems Operations Research and Applications.
Stevenson and Ozgur First Edition Introduction to Management Science with Spreadsheets McGraw-Hill/Irwin Copyright © 2007 by The McGraw-Hill Companies,
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.
Welcome Unit 6 Seminar MM305 Wednesday 8:00 PM ET Quantitative Analysis for Management Delfina Isaac.
Welcome to MM305 Unit 6 Seminar Dr. Bob Network Models.
Chapter 5: Transportation, Assignment and Network Models © 2007 Pearson Education.
7-1 Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall Network Flow Models Chapter 7.
Network Problems A D O B T E C
ENGM 631 Maximum Flow Solutions. Maximum Flow Models (Flow, Capacity) (0,3) (2,2) (5,7) (0,8) (3,6) (6,8) (3,3) (4,4) (4,10)
Mjdah Al Shehri Hamdy A. Taha, Operations Research: An introduction, 8 th Edition Chapter 6: Network Models.
Transportation, Assignment, and Network Models 9 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna and Hale Power.
Lecture 20. Graphs and network models 1. Recap Binary search tree is a special binary tree which is designed to make the search of elements or keys in.
Transportation, Assignment, and Network Algorithms 8 To accompany Quantitative Analysis for Management, Twelfth Edition, by Render, Stair, Hanna and Hale.
Network Analyst. Network A network is a system of linear features that has the appropriate attributes for the flow of objects. A network is typically.
1 Chapter 13 Mathematical models of networks give us algorithms so computationally efficient that we can employ them to evaluate problems too big to be.
1 1 Slide © 2005 Thomson/South-Western Chapter 9 Network Models n Shortest-Route Problem n Minimal Spanning Tree Problem n Maximal Flow Problem.
Operations Research II Course,, September Part 2: Network Flow Operations Research II Dr. Aref Rashad.
Network Models Chapter 12
St. Edward’s University
Network Models Chapter 12
Chapter 12 Network Models 12-1
Business Statistics with Quantitative Analysis
Transportation, Assignment and Network Models
Chapter 3 Dynamic Programming.
MATS Quantitative Methods Dr Huw Owens
Network Models 7-1.
Prepared by Lee Revere and John Large
Chapter 5 Transportation, Assignment, and Transshipment Problems
Chapter 6 Network Flow Models.
Operations Management
Operations Management
TRANSPORTATION PROBLEMS
Presentation transcript:

Network Models Chapter 12 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created by Jeff Heyl © 2009 Prentice-Hall, Inc.

Learning Objectives After completing this chapter, students will be able to: Connect all points of a network while minimizing total distance using the minimal-spanning tree technique Determine the maximum flow through a network using the maximal-flow technique Find the shortest path through a network using the shortest-route technique Understand the important role of software in solving network problems

Chapter Outline 12.1 Introduction 12.2 Minimal-Spanning Tree Technique 12.3 Maximal-Flow Technique 12.4 Shortest-Route Technique

Introduction This chapter covers three network models that can be used to solve a variety of problems The minimal-spanning tree technique determines a path through a network that connects all the points while minimizing the total distance The maximal-flow technique finds the maximum flow of any quantity or substance through a network The shortest-route technique can find the shortest path through a network

Introduction Large scale problems may require hundreds or thousands of iterations making efficient computer programs a necessity All types of networks use a common terminology The points on a network are called nodes and may be represented as circles of squares The lines connecting the nodes are called arcs

Minimal-Spanning Tree Technique The minimal-spanning tree technique involves connecting all the points of a network together while minimizing the distance between them The Lauderdale Construction Company is developing a housing project They want to determine the least expensive way to provide water and power to each house There are eight houses in the project and the distance between them is shown in Figure 12.1

Minimal-Spanning Tree Technique Steps for the minimal-spanning tree technique Select any node in the network Connect this node to the nearest node that minimizes the total distance Considering all the nodes that are now connected, find and connect the nearest node that is not connected. If there is a tie, select one arbitrarily. A tie suggests there may be more than one optimal solution. Repeat the third step until all nodes are connected

Minimal-Spanning Tree Technique Network for Lauderdale Construction 3 2 4 5 6 7 1 8 Gulf Figure 12.1

Minimal-Spanning Tree Technique Start by arbitrarily selecting node 1 The nearest node is node 3 at a distance of 2 (200 feet) and we connect those nodes Considering nodes 1 and 3, we look for the next nearest node This is node 4, the closest to node 3 We connect those nodes We now look for the nearest unconnected node to nodes 1, 3, and 4 This is either node 2 or node 6 We pick node 2 and connect it to node 3

Minimal-Spanning Tree Technique Following this same process we connect from node 2 to node 5 We then connect node 3 to node 6 Node 6 will connect to node 8 The last connection to be made is node 8 to node 7 The total distance is found by adding up the distances in the arcs used in the spanning tree 2 + 2 + 3 + 3 + 3 + 1 + 2 = 16 (or 1,600 feet)

Minimal-Spanning Tree Technique All iterations for Lauderdale Construction 3 2 4 5 6 7 1 8 Gulf Figures 12.2 – 12.5

Maximal-Flow Technique The maximal-flow technique allows us to determine the maximum amount of a material that can flow through a network Waukesha Wisconsin is in the process of developing a road system for the downtown area They want to determine the maximum number of cars that can flow through the town from west to east The road network is shown in Figure 12.7 The numbers by the nodes indicate the number of cars that can flow from the node

Maximal-Flow Technique Four steps of the Maximal-Flow Technique Pick any path from the start (source) to the finish (sink) with some flow. If no path with flow exists, then the optimal solution has been found. Find the arc on this path with the smallest flow capacity available. Call this capacity C. This represents the maximum additional capacity that can be allocated to this route.

Maximal-Flow Technique Four steps of the Maximal-Flow Technique For each node on this path, decrease the flow capacity in the direction of flow by the amount C. For each node on the path, increase the flow capacity in the reverse direction by the amount C. Repeat these steps until an increase in flow is no longer possible

Maximal-Flow Technique Road network for Waukesha Capacity in Hundreds of Cars per Hour 10 2 1 3 6 4 5 East Point West Point Figure 12.6

Maximal-Flow Technique We start by arbitrarily picking the path 1–2–6 which is at the top of the network The maximum flow is 2 units from node 2 to node 6 The path capacity is adjusted by adding 2 to the westbound flows and subtracting 2 from the eastbound flows The result is the new path in Figure 12.7 which shows the new relative capacity of the path at this stage

Maximal-Flow Technique Capacity adjustment for path 1–2–6 iteration 1 Add 2 2 1 3 6 Subtract 2 Old Path 4 3 1 2 6 New Path Figure 12.7

Maximal-Flow Technique We repeat this process by picking the path 1–2–4–6 The maximum capacity along this path is 1 The path capacity is adjusted by adding 1 to the westbound flows and subtracting 1 from the eastbound flows The result is the new path in Figure 12.8 We repeat this process by picking the path 1–3–5–6 The maximum capacity along this path is 2 Figure 12.9 shows this adjusted path

Maximal-Flow Technique Second iteration for Waukesha road system Add 1 1 3 2 4 6 10 2 1 3 4 6 5 Subtract 1 Old Path Figure 12.8 New Network

Maximal-Flow Technique Third and final iteration for Waukesha road system 8 2 3 1 4 5 6 Figure 12.9

Maximal-Flow Technique There are no more paths from nodes 1 to 6 with unused capacity so this represents a final iteration The maximum flow through this network is 500 cars PATH FLOW (CARS PER HOUR) 1–2–6 200 1–2–4–6 100 1–3–5–6 Total 500

Shortest-Route Technique The shortest-route technique finds how a person or item can travel from one location to another while minimizing the total distance traveled It finds the shortest route to a series of destinations Ray Design, Inc. transports beds, chairs, and other furniture from the factory to the warehouse They would like to find the route with the shortest distance The road network is shown in Figure 12.10

Shortest-Route Technique Roads from Ray’s plant to warehouse Plant Warehouse 100 200 50 40 150 1 2 3 4 5 6 Figure 12.10

Shortest-Route Technique Steps of the shortest-route technique Find the nearest node to the origin (plant). Put the distance in a box by the node. Find the next-nearest node to the origin and put the distance in a box by the node. Several paths may have to be checked to find the nearest node. Repeat this process until you have gone through the entire network. The last distance at the ending node will be the distance of the shortest route.

Shortest-Route Technique We can see that the nearest node to the plant is node 2 We connect these two nodes After investigation, we find node 3 is the next nearest node but there are two possible paths The shortest path is 1–2–3 with a distance of 150 We repeat the process and find the next node is node 5 by going through node 3 The next nearest node is either 4 or 6 and 6 turns out to be closer The shortest path is 1–2–3–5–6 with a distance of 290 miles

Shortest-Route Technique First iteration for Ray Design 100 Plant Warehouse 100 200 50 40 150 1 2 3 4 5 6 Figure 12.11

Shortest-Route Technique Second iteration for Ray Design Plant Warehouse 100 200 50 40 150 1 2 3 4 5 6 150 Figure 12.12

Shortest-Route Technique Third iteration for Ray Design Plant Warehouse 100 200 50 40 150 1 2 3 4 5 6 190 Figure 12.13

Shortest-Route Technique Fourth and final iteration for Ray Design Plant Warehouse 100 200 50 40 150 1 2 3 4 5 6 190 290 Figure 12.14