Quantitative Analysis for Management

Thirteenth Edition

Chapter 11
Network Models

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Learning Objectives
After completing this module, students will be able to:
• Use the maximal flow algorithm.
• Use the shortest-route method.
• Use 0f Minimal-Spanning Tree Problem

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Minimal-Spanning Tree Problem (1 of 8)
• Connecting all points of a network together while
minimizing the total distance of the connections
• Linear programming can be used but is complex
• Minimal-spanning tree technique is quite easy

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Minimal-Spanning Tree Problem (2 of 8)
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 of the nodes that are now connected,
find and connect the nearest node that is not
connected. If there is a tie for the nearest node, select
one arbitrarily. A tie suggests there may be more than
one optimal solution.
4. Repeat the third step until all nodes are connected.

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Minimal-Spanning Tree Problem (3 of 8)
• Lauderdale Construction FIGURE 9.6 Network for
– Housing project in Lauderdale Construction
Panama City Beach
– Determine the
least expensive
way to provide
water and power
to each house

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Minimal-Spanning Tree Problem (4 of 8)
Step 1 – Arbitrarily select node 1
Step 2 – Connect node 1 to node 3
(nearest)

FIGURE 9.7 First Iteration for

Lauderdale Construction

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Minimal-Spanning Tree Problem (5 of 8)
Step 3 – Connect next nearest unconnected node, node 4
Continue for other unconnected nodes
FIGURE 9.8 Second and Third Iterations for Lauderdale
Construction

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Minimal-Spanning Tree Problem (6 of 8)
Step 4 – Repeat the process
FIGURE 9.9 Last Four Iterations for Lauderdale Construction

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Minimal-Spanning Tree Problem (7 of 8)
Step 4 – Repeat the process
FIGURE 9.9 Last Four Iterations for Lauderdale Construction

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Minimal-Spanning Tree Problem (8 of 8)
TABLE 9.4 Summary of Steps in Lauderdale Construction
Minimal-Spanning Tree Problem

CLOSE
CONNECTED UNCONNECTED UNCONNECTED ARC ARC TOTAL
STEP NODES NODES NODES SELECTED LENGTH DISTANCE
1 1 2, 3, 4, 5, 6, 7, 8 3 1–3 2 2
2 1, 3 2, 4, 5, 6, 7, 8 4 3–4 2 4
3 1, 3, 4 2, 5, 6, 7, 8 2 or 6 3–2 3 7
4 1, 2, 3, 4 5, 6, 7, 8 5 or 6 2–5 3 10
5 1, 2, 3, 4, 5 6, 7, 8 6 3–6 3 13
6 1, 2, 3, 4, 5, 6 7, 8 8 6–8 1 14
7 1, 2, 3, 4, 5, 6, 8 7 7 8–7 2 16

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Maximal-Flow Problem (1 of 6)
• Determine the maximum amount of material that can flow
from one point (the source) to another (the sink) in a
network
– Road network problem
– Traffic flows in both directions

FIGURE M8.2 Road

Network for Waukesha

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Maximal-Flow Problem (2 of 6)
• Four Steps of the Maximal-Flow Technique
1. 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.
2. Find the arc on this path with the smallest flow
capacity available. Call this capacity C.
3. For each node on this path, decrease the flow
capacity in the direction of flow by the amount C. For
each node on this 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.
Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Maximal-Flow Problem (3 of 6)
FIGURE M8.3 Capacity
Adjustment for Path 1–2–6
Iteration 1

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Maximal-Flow Problem (4 of 6)
FIGURE M8.4 Second Iteration for Waukesha Road System

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Maximal-Flow Problem (5 of 6)
FIGURE M8.5 Third and Final Iteration for Waukesha Road
System

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Maximal-Flow Problem (6 of 6)

blank FLOW
PATH (CARS PER HOUR)
1-2-6 blank 200
1-2-4-6 blank 100
1-3-5-6 blank 200
blank Total 500

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Shortest-Route Problem (1 of 5)
• Find the shortest distance from one location to another
• Shortest-Route Technique
– Transport furniture from factory to warehouse
– Find shortest route
FIGURE M8.6 Roads from Ray’s Plant to Warehouse

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Shortest-Route Problem (2 of 5)
• 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 (plant), and
put the distance in a box by the node. In some cases,
several paths will have to be checked to find the
nearest node.

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Shortest-Route Problem (3 of 5)
• Steps of the Shortest-route Technique
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. You should
note that the distance placed in the box by each node
is the shortest route to this node. These distances are
used as intermediate results in finding the next-
nearest node.

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Shortest-Route Problem (4 of 5)
FIGURE M8.7 First Iteration
for Ray Design

FIGURE M8.8 Second

Iteration for Ray Design

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Shortest-Route Problem (5 of 5)
FIGURE M8.9 Third Iteration
for Ray Design

FIGURE M8.10 Fourth and

Final Iteration for Ray Design

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.
Copyright

Copyright © 2018, 2015, 2012 Pearson Education, Inc. All Rights Reserved.