Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
To accompany
Quantitative Analysis for Management, Tenth Edition,
by Render, Stair, and Hanna
Power Point slides created by Jeff Heyl
Edited by CDCJaurigue
Learning Objectives
After completing this chapter, students will be able to:
1. Connect all points of a network while
minimizing total distance using the minimalspanning 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
Chapter Outline
1.1
1.2
1.3
1.4
Introduction
Minimal-Spanning Tree Technique
Maximal-Flow Technique
Shortest-Route Technique
Introduction
This chapter covers three network models
Introduction
Large scale problems may require hundreds
Minimal-Spanning Tree
Terminologies
network consists of a set of nodes linked by arcs
path a sequence of distinct arcs that join two
Minimal-Spanning Tree
Objective:
Select a set of arcs in a network that will
span (or connect) ALL the nodes (or points) of
the network while minimizing total distance/cost.
Remarks:
There may be more than one optimal solution.
Total # of connecting segments = # of nodes 1
Minimal-Spanning Tree
Applications:
Determining the best way to connect all of the
2
3
3
7
7
2
3
6
4
Gulf
Figure 1.1
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
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)
2
3
3
7
7
2
3
6
6
Gulf
Exercise
Find the minimum spanning tree for
each of the following networks. Also
find the minimum total distance.
1.
Exercise
2.
Exercise No.2
3.
Assignment
The Premiere Bank soon will be hooking up computer
terminals at each of its branch offices to the
computer at its main office using special phone
lines with telecommunications devices. The
phone line from a branch office need not be
connected directly to the main office. It can be
connected indirectly by being connected to
another branch office that is connected (directly
or indirectly) to the main office. The only
requirement is that every branch office be
connected by some route to the main office. The
charge for the special phone lines is $100 times
the number of miles involved, where the distance
(in miles) between every pair of offices is as
follows:
Assignment No. 1
Maximal-Flow
Terminologies
source point of origin
sink
destination
Objective:
Determine the maximum amount of
material that can flow through a
network
Maximal-Flow
Applications:
Finding the maximum number of
Maximal-Flow
Applications:
Determining how to route various tram trips from
Maximal-Flow Technique
The maximal-flow technique allows us to determine
Illustration
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.6
The numbers by the nodes indicate the number of
cars that can flow from the node
Maximal-Flow Technique
Road network for Waukesha
Capacity in Hundreds
of Cars per Hour
1
2
1
West
Point
1
3
0
East
Point
11
10
4
6
1
2
5
Figure 12.6
Maximal-Flow Technique
Four steps of the Maximal-Flow Technique
Maximal-Flow Technique
Four steps of the Maximal-Flow Technique
Maximal-Flow Technique
We start by arbitrarily picking the path 126
Maximal-Flow Technique
Capacity adjustment for path 126 iteration 1
Add 2
1
2
2
Subtract 2
Old Path
New Path
6
Figure 12.7
Maximal-Flow Technique
We repeat this process by picking the path 12
46
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 13
56
The maximum capacity along this path is 2
Figure 12.9 shows this adjusted path
Maximal-Flow Technique
Second iteration for Waukesha road system
3
Add 1
2
1
1
11
4
Subtract 1
Old Path
4
0
20
10
3
0
4
6
1
2
6
0
Figure 12.8
New Network
Maximal-Flow Technique
Third and final iteration for Waukesha road
system
4
20
0
1
3
2
4
4
3
0
6
2
Figure 12.9
4
0
Maximal-Flow Technique
There are no more paths from nodes 1 to 6 with
126
200
1246
100
1356
200
Total 500
Exercises
For networks (a)
and (b), find the
flow pattern
giving the
maximum flow
from the source
to the sink,
given that the
arc capacity
from node i to
node j is the
number nearest
node i along the
arc between
these nodes.
Shortest-Route Technique
The shortest
shortest--route technique finds how a person
Illustration 1:
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 Rays plant to warehouse
Plant
50
Figure 12.10
200
150
40
Warehouse
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.
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 123 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 12356 with a distance of
290 miles
Shortest-Route Technique
First iteration for Ray Design
100
Plant
50
Figure 12.11
200
150
40
Warehouse
Shortest-Route Technique
Second iteration for Ray Design
100
Plant
200
50
3
150
Figure 12.12
150
40
Warehouse
Shortest-Route Technique
Third iteration for Ray Design
100
Plant
200
50
3
150
Figure 12.13
150
40
5
190
Warehouse
Shortest-Route Technique
Fourth and final iteration for Ray Design
100
Plant
200
4
290
50
3
150
Figure 12.14
150
40
5
190
Warehouse
Shortest-Route Technique
Illustration 2:
Mr. Santos plans to drive from his home
in Alabang to one of the resorts in
Laguna for a business meeting. Several
paths are available. The number on
each arc is the distance (in kms)
between two locations (or nodes). What
path should Mr. Santos take to minimize
the number of kilometers traveled?
Shortest-Route Technique
12
16
Home
1
14
10
2
20
13
18
15
17
15
19
Resort
7