1.

1 Introduction
1.2 Minimal-Spanning Tree Problem
1.3 Maximal-Flow Problem
1.4 Shortest-Route Problem

11-2
 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.

11-3
 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.

11-4
 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.
 It wants 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 11.1.

11-5
 3
2 5
4
3
5
3 7
7
1 2 2
3
3 8
5 1
2 6
6
4

Figure 1.1 Gulf

11-6
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.

11-7
 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.

11-8
 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-9
 First Iteration for Lauderdale Construction

Figure 1.2

11-10
 Second and Third Iterations for Lauderdale
Construction

Figure 1.3

11-11
Fourth and Fifth Iterations for Lauderdale Construction

Figure 1.4

11-12
 Sixth and Seventh (Final) Iterations for Lauderdale
Construction

Figure 1.5

11-13
Step Connected Unconnected Closest Un- Arc Arc Total
Nodes Nodes connected Selected Length Distance
Node
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 2-3 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, 7 7 7-8 2 16
8
Table 1.1

11-14
 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.
 Town leaders 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 11.6.
 The numbers by the nodes indicate the number
of cars that can flow from the node.
11-15
 Road network for Waukesha
Capacity in Hundreds
of Cars per Hour

2
1 2 2 East
1 1 6 Point
3 0
West 2
Point 1
10 0 11
4
1
6
1
3 5
Figure 1.6 0 2
3

11-16
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. This
represents the maximum additional capacity that
can be allocated to this route.

11-17
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.

11-18
 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 11.7 which
shows the new relative capacity of the path at
this stage.

11-19
 Capacity Adjustment for Path 1–2–6 Iteration 1
Add 2
2
1 2 2
6
3
1 Subtract 2
Old Path

0
3 2 4
6
1
Figure 1.7
1
New Path

11-20
 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 11.8.
 We repeat this process by picking the path 1–3–5–6.
 The maximum capacity along this path is 2.
 Figure 11.9 shows this adjusted path.

11-21
 Second Iteration for Waukesha Road System
3 Add 1
2
1 1 6
1
1
11 0
4 2 4
4 0 6
2
0 0
Subtract 1
1 2
Old Path 0 20
10
4
1
6
1
3 5
Figure 1.8 0 2
3
New Network
11-22
 Third and Final Iteration for Waukesha Road System

0
4 2 4
0 2 6
0 2
1 2
8 0 20
4
1
4
3
3 5
2 0
Figure 1.9
3

11-23
 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

11-24
 Define the variables as:
 Xij = flow from node i to node j.

 Goal: Maximize Flow = X61

11-25
 Constraints
X12 ≤ 3 X13 ≤ 10 X14 ≤ 2
X21 ≤ 1 X24 ≤ 1 X26 ≤ 2
X34 ≤ 3 X35 ≤ 2 X42 ≤ 1
X43 ≤ 1 X46 ≤ 1 X53 ≤ 1
X56 ≤ 1 X62 ≤ 2 X64 ≤ 1

11-26
 Constraints continued:
X61 = X12 + X13 + X14 or X61 – X12 – X13 – X14 =0
X12+X42+X62 = X21+X24+X26 or X12+X42+X62-X21-X24-X26 =0
X13+X43+X53 = X34 +X35 or X13+X43+X53-X34-X35 =0
X14+X24+
X34+X64 = X42 + X43 + X46 or X14+X24 +X34+X64
– X42 – X43 – X53 = 0
X35 = X56 + X53 or X35 – X53 – X56 =0
X26+X46+X56 = X61 or X26 + X46 + X56 – X61 =0
Xij ≥0 and integer

This problems can now be solved in QM for Windows or using Excel Solver.
11-27
 The shortest-route technique identifies 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.
 The company would like to find the route with
the shortest distance.
 The road network is shown in Figure 11.10.
11-28
 Roads from Ray’s Plant to Warehouse

200
2 4
Plant

50 150
1 6

40
3 5 Warehouse
Figure 1.10

11-29
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.

11-30
 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.
11-31
 First Iteration for Ray Design
100
200
2 4
Plant

50 150
1 6

40
3 5 Warehouse

Figure 1.11

11-32
 Second Iteration for Ray Design
100
200
2 4
Plant

50 150
1 6

40
150
3 5 Warehouse
Figure 1.12

11-33
 Third Iteration for Ray Design
100
200
2 4
Plant

1 50 150 6

40
3 5 Warehouse
190
Figure 1.13 150

11-34
 Fourth and Final Iteration for Ray Design
100
200
2 4
Plant
290

1 50 150 6

40
3 5 Warehouse
Figure 1.14
150 190

11-35
 Objective is to minimize the total distance (cost)
from the start to finish.
 Variables:
Xij = 1 if arc from node i to node j is selected
= 0 otherwise.
 Itis helpful to view this as a transshipment
problem.

11-36
Minimize distance =
100X12 + 200X13 + 50X23 + 50X32 + 200X24 + 200X42 +
100X25 + 100X52 + 40X35 + 40X53 + 150X45 + 150X54 +
100X46 + 100X56
Subject to:
X12 + X13 =1 Node 1
X12 + X32 – X23 – X24 – X25 =0 Node 2
X13 + X23 – X32 – X35 =0 Node 3
X24 + X54 – X42 – X45 – X46 =0 Node 4
X25 + X35 + X45 – X52 – X53 – X54 – X56 =0 Node 5
X46 + X56 =1 Node 6
All variables = 0 or 1
This problems can now be solved in QM for Windows or using Excel Solver.

11-37