Suche senden
Hochladen
Chp12networksmodel 121128084640-phpapp01
•
0 gefällt mir
•
1,224 views
Firas Husseini
Folgen
Quantitative Analysis for Management, 11e (Render)
Weniger lesen
Mehr lesen
Business
Melden
Teilen
Melden
Teilen
1 von 29
Jetzt herunterladen
Downloaden Sie, um offline zu lesen
Empfohlen
Quantitative Management - Ch 11 Network Models
Quantitative Management - Ch 11 Network Models
Agnes Puspita
Engineering Management ( Communicating )
Engineering Management ( Communicating )
Cristine Joy Santos
Shortest Route, Minimal Spanning Tree
Shortest Route, Minimal Spanning Tree
ahmed jubayer
Transportation model powerpoint
Transportation model powerpoint
Giselle Gaas
Vam
Vam
itsvineeth209
5. transportation problems
5. transportation problems
Hakeem-Ur- Rehman
Maxflow
Maxflow
MuhammadTahir513
Vogel's Approximation Method & Modified Distribution Method
Vogel's Approximation Method & Modified Distribution Method
Kaushik Maitra
Empfohlen
Quantitative Management - Ch 11 Network Models
Quantitative Management - Ch 11 Network Models
Agnes Puspita
Engineering Management ( Communicating )
Engineering Management ( Communicating )
Cristine Joy Santos
Shortest Route, Minimal Spanning Tree
Shortest Route, Minimal Spanning Tree
ahmed jubayer
Transportation model powerpoint
Transportation model powerpoint
Giselle Gaas
Vam
Vam
itsvineeth209
5. transportation problems
5. transportation problems
Hakeem-Ur- Rehman
Maxflow
Maxflow
MuhammadTahir513
Vogel's Approximation Method & Modified Distribution Method
Vogel's Approximation Method & Modified Distribution Method
Kaushik Maitra
transportation-model.ppt
transportation-model.ppt
anubhuti18
Network flow problems
Network flow problems
Dr Sandeep Kumar Poonia
Using excel solver in solving lp, and transportation problems
Using excel solver in solving lp, and transportation problems
Ahmed Dahesh
Linear programming - Model formulation, Graphical Method
Linear programming - Model formulation, Graphical Method
Joseph Konnully
Deepika(14 mba5012) transportation ppt
Deepika(14 mba5012) transportation ppt
Deepika Bansal
Questions
Questions
venkat27
Hungarian algorithm
Hungarian algorithm
Charith Suriyakula
Vogel's Approximation Method
Vogel's Approximation Method
UsharaniRavikumar
Transportation Problem In Linear Programming
Transportation Problem In Linear Programming
Mirza Tanzida
North West Corner Method
North West Corner Method
Muhammad Waleed
Transportation problem
Transportation problem
Kamel Attar
Stepping Stone Method
Stepping Stone Method
Himanshi Gupta
Goal programming
Goal programming
Hakeem-Ur- Rehman
Transportation Method Operation Research
Transportation Method Operation Research
R A Shah
Transportation problem
Transportation problem
Shubhagata Roy
transporation problem - stepping stone method
transporation problem - stepping stone method
oragon291764
Transportation Problem- Stepping Stone Method
Transportation Problem- Stepping Stone Method
Lakshminarayan Ramjee
Minimization model by simplex method
Minimization model by simplex method
San Antonio de Padua - Center for Alternative Mathematics
LECTURE Notes on compressor
LECTURE Notes on compressor
Yuri Melliza
Markov exercises
Markov exercises
De La Salle University-Manila
Quantitative Analysis for Management, Tenth Edition
Quantitative Analysis for Management, Tenth Edition
wilmeg
MDM-Chapter-9-Updated latest.pptx
MDM-Chapter-9-Updated latest.pptx
JimSotio
Weitere ähnliche Inhalte
Was ist angesagt?
transportation-model.ppt
transportation-model.ppt
anubhuti18
Network flow problems
Network flow problems
Dr Sandeep Kumar Poonia
Using excel solver in solving lp, and transportation problems
Using excel solver in solving lp, and transportation problems
Ahmed Dahesh
Linear programming - Model formulation, Graphical Method
Linear programming - Model formulation, Graphical Method
Joseph Konnully
Deepika(14 mba5012) transportation ppt
Deepika(14 mba5012) transportation ppt
Deepika Bansal
Questions
Questions
venkat27
Hungarian algorithm
Hungarian algorithm
Charith Suriyakula
Vogel's Approximation Method
Vogel's Approximation Method
UsharaniRavikumar
Transportation Problem In Linear Programming
Transportation Problem In Linear Programming
Mirza Tanzida
North West Corner Method
North West Corner Method
Muhammad Waleed
Transportation problem
Transportation problem
Kamel Attar
Stepping Stone Method
Stepping Stone Method
Himanshi Gupta
Goal programming
Goal programming
Hakeem-Ur- Rehman
Transportation Method Operation Research
Transportation Method Operation Research
R A Shah
Transportation problem
Transportation problem
Shubhagata Roy
transporation problem - stepping stone method
transporation problem - stepping stone method
oragon291764
Transportation Problem- Stepping Stone Method
Transportation Problem- Stepping Stone Method
Lakshminarayan Ramjee
Minimization model by simplex method
Minimization model by simplex method
San Antonio de Padua - Center for Alternative Mathematics
LECTURE Notes on compressor
LECTURE Notes on compressor
Yuri Melliza
Markov exercises
Markov exercises
De La Salle University-Manila
Was ist angesagt?
(20)
transportation-model.ppt
transportation-model.ppt
Network flow problems
Network flow problems
Using excel solver in solving lp, and transportation problems
Using excel solver in solving lp, and transportation problems
Linear programming - Model formulation, Graphical Method
Linear programming - Model formulation, Graphical Method
Deepika(14 mba5012) transportation ppt
Deepika(14 mba5012) transportation ppt
Questions
Questions
Hungarian algorithm
Hungarian algorithm
Vogel's Approximation Method
Vogel's Approximation Method
Transportation Problem In Linear Programming
Transportation Problem In Linear Programming
North West Corner Method
North West Corner Method
Transportation problem
Transportation problem
Stepping Stone Method
Stepping Stone Method
Goal programming
Goal programming
Transportation Method Operation Research
Transportation Method Operation Research
Transportation problem
Transportation problem
transporation problem - stepping stone method
transporation problem - stepping stone method
Transportation Problem- Stepping Stone Method
Transportation Problem- Stepping Stone Method
Minimization model by simplex method
Minimization model by simplex method
LECTURE Notes on compressor
LECTURE Notes on compressor
Markov exercises
Markov exercises
Ähnlich wie Chp12networksmodel 121128084640-phpapp01
Quantitative Analysis for Management, Tenth Edition
Quantitative Analysis for Management, Tenth Edition
wilmeg
MDM-Chapter-9-Updated latest.pptx
MDM-Chapter-9-Updated latest.pptx
JimSotio
Network flow
Network flow
Ahmed Sobhi
Chapter5.pdf
Chapter5.pdf
MuhammadAsifAfzal2
Prim's Algorithm for Optimizing Fiber Optic Trajectory Planning
Prim's Algorithm for Optimizing Fiber Optic Trajectory Planning
Universitas Pembangunan Panca Budi
Network analysis
Network analysis
Moudud Hasan
352735336 rsh-qam11-tif-11-doc
352735336 rsh-qam11-tif-11-doc
BookStoreLib
352735336 rsh-qam11-tif-11-doc
352735336 rsh-qam11-tif-11-doc
Firas Husseini
On minimizing data forwarding schedule in multi transmit receive wireless mes...
On minimizing data forwarding schedule in multi transmit receive wireless mes...
redpel dot com
Internetworking devices
Internetworking devices
A Singh
Newton-raphson method to solve systems of non-linear equations in VANET perfo...
Newton-raphson method to solve systems of non-linear equations in VANET perfo...
journalBEEI
IMPROVEMENT IVESTIGATION OF THE TCP ALGORITHMS.pptx
IMPROVEMENT IVESTIGATION OF THE TCP ALGORITHMS.pptx
ssuser7256f7
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...
IJMER
12 Multiple Access
12 Multiple Access
Ahmar Hashmi
Mitigating Link Failures & Implementing Security Mechanism in Multipath Flows...
Mitigating Link Failures & Implementing Security Mechanism in Multipath Flows...
Eswar Publications
Efectos de nodos ieee 802.15.4 zig bee
Efectos de nodos ieee 802.15.4 zig bee
Gregorio Toro Rivera
A CROSS-LAYER BASED SCALABLE CHANNEL SLOT RE-UTILIZATION TECHNIQUE FOR WIRELE...
A CROSS-LAYER BASED SCALABLE CHANNEL SLOT RE-UTILIZATION TECHNIQUE FOR WIRELE...
cscpconf
A Cross Layer Based Scalable Channel Slot Re-Utilization Technique for Wirele...
A Cross Layer Based Scalable Channel Slot Re-Utilization Technique for Wirele...
csandit
Y11 m02 networks
Y11 m02 networks
Xu Wei
Routing for Sensors with Parameters as used in Agricultural Field
Routing for Sensors with Parameters as used in Agricultural Field
IDES Editor
Ähnlich wie Chp12networksmodel 121128084640-phpapp01
(20)
Quantitative Analysis for Management, Tenth Edition
Quantitative Analysis for Management, Tenth Edition
MDM-Chapter-9-Updated latest.pptx
MDM-Chapter-9-Updated latest.pptx
Network flow
Network flow
Chapter5.pdf
Chapter5.pdf
Prim's Algorithm for Optimizing Fiber Optic Trajectory Planning
Prim's Algorithm for Optimizing Fiber Optic Trajectory Planning
Network analysis
Network analysis
352735336 rsh-qam11-tif-11-doc
352735336 rsh-qam11-tif-11-doc
352735336 rsh-qam11-tif-11-doc
352735336 rsh-qam11-tif-11-doc
On minimizing data forwarding schedule in multi transmit receive wireless mes...
On minimizing data forwarding schedule in multi transmit receive wireless mes...
Internetworking devices
Internetworking devices
Newton-raphson method to solve systems of non-linear equations in VANET perfo...
Newton-raphson method to solve systems of non-linear equations in VANET perfo...
IMPROVEMENT IVESTIGATION OF THE TCP ALGORITHMS.pptx
IMPROVEMENT IVESTIGATION OF THE TCP ALGORITHMS.pptx
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...
An Adaptive Routing Algorithm for Communication Networks using Back Pressure...
12 Multiple Access
12 Multiple Access
Mitigating Link Failures & Implementing Security Mechanism in Multipath Flows...
Mitigating Link Failures & Implementing Security Mechanism in Multipath Flows...
Efectos de nodos ieee 802.15.4 zig bee
Efectos de nodos ieee 802.15.4 zig bee
A CROSS-LAYER BASED SCALABLE CHANNEL SLOT RE-UTILIZATION TECHNIQUE FOR WIRELE...
A CROSS-LAYER BASED SCALABLE CHANNEL SLOT RE-UTILIZATION TECHNIQUE FOR WIRELE...
A Cross Layer Based Scalable Channel Slot Re-Utilization Technique for Wirele...
A Cross Layer Based Scalable Channel Slot Re-Utilization Technique for Wirele...
Y11 m02 networks
Y11 m02 networks
Routing for Sensors with Parameters as used in Agricultural Field
Routing for Sensors with Parameters as used in Agricultural Field
Mehr von Firas Husseini
Ali M Fadel CV
Ali M Fadel CV
Firas Husseini
Transportation problems1
Transportation problems1
Firas Husseini
Slides for ch08
Slides for ch08
Firas Husseini
Slides for ch07
Slides for ch07
Firas Husseini
Slides for ch06
Slides for ch06
Firas Husseini
Slides for ch05
Slides for ch05
Firas Husseini
Rsh qam11 ch10 ge
Rsh qam11 ch10 ge
Firas Husseini
Rsh qam11 ch09 ge
Rsh qam11 ch09 ge
Firas Husseini
Rsh qam11 ch08 ge
Rsh qam11 ch08 ge
Firas Husseini
Rsh qam11 ch07 ge
Rsh qam11 ch07 ge
Firas Husseini
Rsh qam11 ch06 ge
Rsh qam11 ch06 ge
Firas Husseini
Rsh qam11 ch05 ge
Rsh qam11 ch05 ge
Firas Husseini
Rsh qam11 ch04 ge
Rsh qam11 ch04 ge
Firas Husseini
Rsh qam11 ch03
Rsh qam11 ch03
Firas Husseini
Rsh qam11 ch03 ge
Rsh qam11 ch03 ge
Firas Husseini
Rsh qam11 ch02
Rsh qam11 ch02
Firas Husseini
Rsh qam11 ch01
Rsh qam11 ch01
Firas Husseini
Render03 140622012601-phpapp02
Render03 140622012601-phpapp02
Firas Husseini
Render03 140622012601-phpapp02 (1)
Render03 140622012601-phpapp02 (1)
Firas Husseini
Render01edited 121120194704-phpapp02
Render01edited 121120194704-phpapp02
Firas Husseini
Mehr von Firas Husseini
(20)
Ali M Fadel CV
Ali M Fadel CV
Transportation problems1
Transportation problems1
Slides for ch08
Slides for ch08
Slides for ch07
Slides for ch07
Slides for ch06
Slides for ch06
Slides for ch05
Slides for ch05
Rsh qam11 ch10 ge
Rsh qam11 ch10 ge
Rsh qam11 ch09 ge
Rsh qam11 ch09 ge
Rsh qam11 ch08 ge
Rsh qam11 ch08 ge
Rsh qam11 ch07 ge
Rsh qam11 ch07 ge
Rsh qam11 ch06 ge
Rsh qam11 ch06 ge
Rsh qam11 ch05 ge
Rsh qam11 ch05 ge
Rsh qam11 ch04 ge
Rsh qam11 ch04 ge
Rsh qam11 ch03
Rsh qam11 ch03
Rsh qam11 ch03 ge
Rsh qam11 ch03 ge
Rsh qam11 ch02
Rsh qam11 ch02
Rsh qam11 ch01
Rsh qam11 ch01
Render03 140622012601-phpapp02
Render03 140622012601-phpapp02
Render03 140622012601-phpapp02 (1)
Render03 140622012601-phpapp02 (1)
Render01edited 121120194704-phpapp02
Render01edited 121120194704-phpapp02
Kürzlich hochgeladen
Planetary and Vedic Yagyas Bring Positive Impacts in Life
Planetary and Vedic Yagyas Bring Positive Impacts in Life
Bhavana Pujan Kendra
digital marketing , introduction of digital marketing
digital marketing , introduction of digital marketing
rajputmeenakshi733
Jewish Resources in the Family Resource Centre
Jewish Resources in the Family Resource Centre
NZSG
Pitch Deck Teardown: Xpanceo's $40M Seed deck
Pitch Deck Teardown: Xpanceo's $40M Seed deck
HajeJanKamps
How To Simplify Your Scheduling with AI Calendarfly The Hassle-Free Online Bo...
How To Simplify Your Scheduling with AI Calendarfly The Hassle-Free Online Bo...
SOFTTECHHUB
Horngren’s Financial & Managerial Accounting, 7th edition by Miller-Nobles so...
Horngren’s Financial & Managerial Accounting, 7th edition by Miller-Nobles so...
ssuserf63bd7
Fordham -How effective decision-making is within the IT department - Analysis...
Fordham -How effective decision-making is within the IT department - Analysis...
Peter Ward
Introducing the Analogic framework for business planning applications
Introducing the Analogic framework for business planning applications
KnowledgeSeed
Welding Electrode Making Machine By Deccan Dynamics
Welding Electrode Making Machine By Deccan Dynamics
IndiaMART InterMESH Limited
20200128 Ethical by Design - Whitepaper.pdf
20200128 Ethical by Design - Whitepaper.pdf
Chris Skinner
PSCC - Capability Statement Presentation
PSCC - Capability Statement Presentation
Anamaria Contreras
Appkodes Tinder Clone Script with Customisable Solutions.pptx
Appkodes Tinder Clone Script with Customisable Solutions.pptx
appkodes
Traction part 2 - EOS Model JAX Bridges.
Traction part 2 - EOS Model JAX Bridges.
Anamaria Contreras
Memorándum de Entendimiento (MoU) entre Codelco y SQM
Memorándum de Entendimiento (MoU) entre Codelco y SQM
Voces Mineras
Onemonitar Android Spy App Features: Explore Advanced Monitoring Capabilities
Onemonitar Android Spy App Features: Explore Advanced Monitoring Capabilities
One Monitar
Cyber Security Training in Office Environment
Cyber Security Training in Office Environment
elijahj01012
Intermediate Accounting, Volume 2, 13th Canadian Edition by Donald E. Kieso t...
Intermediate Accounting, Volume 2, 13th Canadian Edition by Donald E. Kieso t...
ssuserf63bd7
Healthcare Feb. & Mar. Healthcare Newsletter
Healthcare Feb. & Mar. Healthcare Newsletter
JamesConcepcion7
Church Building Grants To Assist With New Construction, Additions, And Restor...
Church Building Grants To Assist With New Construction, Additions, And Restor...
Americas Got Grants
The-Ethical-issues-ghhhhhhhhjof-Byjus.pptx
The-Ethical-issues-ghhhhhhhhjof-Byjus.pptx
mbikashkanyari
Kürzlich hochgeladen
(20)
Planetary and Vedic Yagyas Bring Positive Impacts in Life
Planetary and Vedic Yagyas Bring Positive Impacts in Life
digital marketing , introduction of digital marketing
digital marketing , introduction of digital marketing
Jewish Resources in the Family Resource Centre
Jewish Resources in the Family Resource Centre
Pitch Deck Teardown: Xpanceo's $40M Seed deck
Pitch Deck Teardown: Xpanceo's $40M Seed deck
How To Simplify Your Scheduling with AI Calendarfly The Hassle-Free Online Bo...
How To Simplify Your Scheduling with AI Calendarfly The Hassle-Free Online Bo...
Horngren’s Financial & Managerial Accounting, 7th edition by Miller-Nobles so...
Horngren’s Financial & Managerial Accounting, 7th edition by Miller-Nobles so...
Fordham -How effective decision-making is within the IT department - Analysis...
Fordham -How effective decision-making is within the IT department - Analysis...
Introducing the Analogic framework for business planning applications
Introducing the Analogic framework for business planning applications
Welding Electrode Making Machine By Deccan Dynamics
Welding Electrode Making Machine By Deccan Dynamics
20200128 Ethical by Design - Whitepaper.pdf
20200128 Ethical by Design - Whitepaper.pdf
PSCC - Capability Statement Presentation
PSCC - Capability Statement Presentation
Appkodes Tinder Clone Script with Customisable Solutions.pptx
Appkodes Tinder Clone Script with Customisable Solutions.pptx
Traction part 2 - EOS Model JAX Bridges.
Traction part 2 - EOS Model JAX Bridges.
Memorándum de Entendimiento (MoU) entre Codelco y SQM
Memorándum de Entendimiento (MoU) entre Codelco y SQM
Onemonitar Android Spy App Features: Explore Advanced Monitoring Capabilities
Onemonitar Android Spy App Features: Explore Advanced Monitoring Capabilities
Cyber Security Training in Office Environment
Cyber Security Training in Office Environment
Intermediate Accounting, Volume 2, 13th Canadian Edition by Donald E. Kieso t...
Intermediate Accounting, Volume 2, 13th Canadian Edition by Donald E. Kieso t...
Healthcare Feb. & Mar. Healthcare Newsletter
Healthcare Feb. & Mar. Healthcare Newsletter
Church Building Grants To Assist With New Construction, Additions, And Restor...
Church Building Grants To Assist With New Construction, Additions, And Restor...
The-Ethical-issues-ghhhhhhhhjof-Byjus.pptx
The-Ethical-issues-ghhhhhhhhjof-Byjus.pptx
Chp12networksmodel 121128084640-phpapp01
1.
© 2008 Prentice-Hall,
Inc. Chapter 12 To accompany Quantitative Analysis for Management, Tenth Edition, by Render, Stair, and Hanna Power Point slides created by Jeff Heyl Network Models © 2009 Prentice-Hall, Inc.
2.
© 2009 Prentice-Hall,
Inc. 12 – 2 Learning Objectives 1. Connect all points of a network while minimizing total distance using the minimal- spanning tree technique 2. Determine the maximum flow through a network using the maximal-flow technique 3. Find the shortest path through a network using the shortest-route technique 4. Understand the important role of software in solving network problems After completing this chapter, students will be able to:After completing this chapter, students will be able to:
3.
© 2009 Prentice-Hall,
Inc. 12 – 3 Chapter Outline 12.112.1 Introduction 12.212.2 Minimal-Spanning Tree Technique 12.312.3 Maximal-Flow Technique 12.412.4 Shortest-Route Technique
4.
© 2009 Prentice-Hall,
Inc. 12 – 4 This chapter covers three network models that can be used to solve a variety of problems The minimal-spanning tree techniqueminimal-spanning tree technique determines a path through a network that connects all the points while minimizing the total distance The maximal-flow techniquemaximal-flow technique finds the maximum flow of any quantity or substance through a network The shortest-route techniqueshortest-route technique can find the shortest path through a network Introduction
5.
© 2009 Prentice-Hall,
Inc. 12 – 5 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 nodesnodes and may be represented as circles of squares The lines connecting the nodes are called arcsarcs Introduction
6.
© 2009 Prentice-Hall,
Inc. 12 – 6 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
7.
© 2009 Prentice-Hall,
Inc. 12 – 7 Minimal-Spanning Tree Technique Steps for the minimal-spanning tree technique 1. Select any node in the network 2. Connect this node to the nearest node that minimizes the total distance 3. 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. 4. Repeat the third step until all nodes are connected
8.
© 2009 Prentice-Hall,
Inc. 12 – 8 Minimal-Spanning Tree Technique Network for Lauderdale Construction 3 3 2 3 2 4 2 5 6 7 1 5 1 2 3 4 5 6 7 8 3 Gulf Figure 12.1
9.
© 2009 Prentice-Hall,
Inc. 12 – 9 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
10.
© 2009 Prentice-Hall,
Inc. 12 – 10 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)
11.
© 2009 Prentice-Hall,
Inc. 12 – 11 Minimal-Spanning Tree Technique All iterations for Lauderdale Construction Figures 12.2 – 12.5 3 3 2 3 2 4 2 5 6 7 1 5 1 2 3 4 5 6 7 8 3 Gulf
12.
© 2009 Prentice-Hall,
Inc. 12 – 12 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 fromfrom the node
13.
© 2009 Prentice-Hall,
Inc. 12 – 13 Maximal-Flow Technique Four steps of the Maximal-Flow Technique 1. Pick any path from the start (sourcesource) to the finish (sinksink) with some flow. If no path with flow exists, then the optimal solution has been found. 2. 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.
14.
© 2009 Prentice-Hall,
Inc. 12 – 14 Maximal-Flow Technique Four steps of the Maximal-Flow Technique 3. 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. 4. Repeat these steps until an increase in flow is no longer possible
15.
© 2009 Prentice-Hall,
Inc. 12 – 15 Maximal-Flow Technique Road network for Waukesha Capacity in Hundreds of Cars per Hour West Point East Point Figure 12.6 10 0 2 1 3 1 1 1 2 2 1 3 6 0 2 0 1 1 1 2 3 4 5 6
16.
© 2009 Prentice-Hall,
Inc. 12 – 16 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
17.
© 2009 Prentice-Hall,
Inc. 12 – 17 Maximal-Flow Technique Capacity adjustment for path 1–2–6 iteration 1 Figure 12.7 2 2 1 3 1 2 6 4 0 3 1 1 2 6 Old Path New Path Add 2 Subtract 2
18.
© 2009 Prentice-Hall,
Inc. 12 – 18 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
19.
© 2009 Prentice-Hall,
Inc. 12 – 19 Maximal-Flow Technique Second iteration for Waukesha road system Figure 12.8 10 0 2 1 3 1 2 0 4 0 4 0 6 0 2 0 2 0 1 2 3 4 5 6 1 1 3 1 1 1 1 2 4 6 Old Path New Network Add 1 Subtract 1
20.
© 2009 Prentice-Hall,
Inc. 12 – 20 Maximal-Flow Technique Third and final iteration for Waukesha road system Figure 12.9 8 2 0 3 3 1 2 0 4 0 4 0 4 2 2 0 2 0 1 2 3 4 5 6
21.
© 2009 Prentice-Hall,
Inc. 12 – 21 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 200 Total 500
22.
© 2009 Prentice-Hall,
Inc. 12 – 22 Shortest-Route Technique The shortest-route techniqueshortest-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
23.
© 2009 Prentice-Hall,
Inc. 12 – 23 Shortest-Route Technique Roads from Ray’s plant to warehouse Plant Warehouse 100 200 50 40 100 200 100 100 1501 2 3 4 5 6 Figure 12.10
24.
© 2009 Prentice-Hall,
Inc. 12 – 24 Shortest-Route Technique Steps of the shortest-route technique 1. Find the nearest node to the origin (plant). Put the distance in a box by the node. 2. 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. 3. 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.
25.
© 2009 Prentice-Hall,
Inc. 12 – 25 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
26.
© 2009 Prentice-Hall,
Inc. 12 – 26 Shortest-Route Technique First iteration for Ray Design Plant Warehouse 100 200 50 40 100 200 100 100 1501 2 3 4 5 6 Figure 12.11 100
27.
© 2009 Prentice-Hall,
Inc. 12 – 27 Shortest-Route Technique Second iteration for Ray Design Figure 12.12 Plant Warehouse 100 200 50 40 100 200 100 100 1501 2 3 4 5 6 100 150
28.
© 2009 Prentice-Hall,
Inc. 12 – 28 Shortest-Route Technique Third iteration for Ray Design Figure 12.13 Plant Warehouse 100 200 50 40 100 200 100 100 1501 2 3 4 5 6 100 150 190
29.
© 2009 Prentice-Hall,
Inc. 12 – 29 Shortest-Route Technique Fourth and final iteration for Ray Design Figure 12.14 Plant Warehouse 100 200 50 40 100 200 100 100 1501 2 3 4 5 6 100 150 190 290
Jetzt herunterladen