Tailor - Chapter 7

Network Flow Models

Learning Objectives
7.1 Network Components
7.2 The Shortest Route Problem
7.3 The Minimal Spanning Tree Problem
7.4 The Maximal Flow Problem
Learning Objective 7.1
• Network Components
Network Components (1 of 3)
• A network is an arrangement of paths (branches)
connected at various points (nodes) through which one
or more items move from one point to another.
• The network is drawn as a diagram providing a picture of
the system, thus enabling visual representation and
enhanced understanding.
• A large number of real-life systems can be modeled as
networks which are relatively easy to conceive and
construct.
Network Components (2 of 3)
• Network diagrams consist of nodes and branches.
• Nodes (circles), represent junction points, or locations.
• Branches (lines), connect nodes and represent flow.
Network Components (3 of 3)
• Four nodes, four branches in figure.
• “Atlanta”, node 1, termed the origin; any of others, destination.
• Branches identified by beginning and ending node numbers.
• Value assigned to each branch (distance, time, cost, etc.).

Figure 7.1 Network of railroad routes

Learning Objective 7.2
• The Shortest Route Problem
Definition and Example Problem Data 1 (1 of 2)
Problem: Determine the shortest routes from the origin to all
destinations.

Figure 7.2 Shipping routes from Los Angeles

Definition and Example Problem Data 1 (2 of 2)
Figure 7.3 Network representation of shortest route problem
Solution Approach 1 (1 of 8)
Determine the initial shortest route from the origin (node 1) to the
closest node (3).
The permanent set indicates the nodes for which the shortest route to
has been found.

Figure 7.4 Network with node 1 in the permanent set

Solution Approach 1 (2 of 8)
Determine all nodes directly connected to the permanent set.

Figure 7.5 Network with nodes 1 and 3 in the permanent set

Solution Approach 1 (3 of 8)
Redefine the permanent set.
Figure 7.6 Network with nodes 1, 2, and 3 in the
permanent set
Solution Approach 1 (4 of 8)
Figure 7.7 Network with nodes 1, 2, 3, and 4 in the
permanent set
Solution Approach 1 (5 of 8)
Figure 7.8 Network with nodes 1, 2, 3, 4, & 6 in the
permanent set
Solution Approach 1 (6 of 8)
Figure 7.9 Network with nodes 1, 2, 3, 4, 5 & 6 in the
permanent set
Solution Approach 1 (7 of 8)
Figure 7.10 Network with optimal routes from LA to all
destinations
Solution Approach 1 (8 of 8)
Table 7.1 Shortest travel time from origin to each
destination

From Los Angeles to: Route Total Hours

Salt Lake City (node 2) 1–2 16
Phoenix (node 3) 1–3 9
Denver (node 4) 1–3–4 24
Des Moines (node 5) 1–3–4–5 38
Dallas (node 6) 1–3–6 31
St. Louis (node 7) 1–3–4–7 43
Solution Method Summary 1
1. Select the node with the shortest direct route from the
origin.
2. Establish a permanent set with the origin node and the
node that was selected in step 1.
3. Determine all nodes directly connected to the
permanent set nodes.
4. Select the node with the shortest route from the group of
nodes directly connected to the permanent set nodes.
5. Repeat steps 3 & 4 until all nodes have joined the
permanent set.
Computer Solution with Excel 1 (1 of 4)
Formulation as a 0–1 integer linear programming problem.
xij  0 if branch i–j is not selected as part of the shortest
route and 1 if it is selected.
Minimize Z  16 x12  9 x13  35 x14  12 x 24  25 x 25  15 x34   
22 x36  14 x45  17 x 46  19 x47  8 x57  14 x 67
subject to :       x12  x13  x14  1
x12  x24  x25  0
x13  x34  x36  0
x14  x24  x34  x 45  x 46  x 47  0
x25  x45  x57  0
x36  x46  x67  0
x47  x57  x67  1      xij  0 or 1  
Computer Solution with Excel 1 (2 of 4)
Exhibit 7.3
Computer Solution with Excel 1 (3 of 4)
Exhibit 7.4
Computer Solution with Excel 1 (4 of 4)
Exhibit 7.5
Learning Objective 7.3
• The Minimal Spanning Tree Problem
Definition and Example Problem Data 2
Problem: Connect all nodes in a network so that the total of
the branch lengths are minimized.

Figure 7.11 Network of possible cable TV paths

Solution Approach 2 (1 of 6)
Start with any node in the network and select the closest
node to join the spanning tree.

Figure 7.12 Spanning tree with nodes 1 and 3

Solution Approach 2 (2 of 6)
Select the closest node not presently in the spanning area.

Figure 7.13 Spanning tree with nodes 1, 3, and 4

Solution Approach 2 (3 of 6)
Figure 7.14 Spanning tree with nodes 1, 2, 3, and 4
Solution Approach 2 (4 of 6)
Figure 7.15 Spanning tree with nodes 1, 2, 3, 4, and 5
Solution Approach 2 (5 of 6)
Figure 7.16 Spanning tree with nodes 1, 2, 3, 4, 5, and 7
Solution Approach 2 (6 of 6)
Optimal Solution
Figure 7.17 Minimal spanning tree for cable TV network
Solution Method Summary 2
1. Select any starting node (conventionally, node 1).
2. Select the node closest to the starting node to join the
spanning tree.
3. Select the closest node not currently in the spanning
tree.
4. Repeat step 3 until all nodes have joined the spanning
tree.
Learning Objective 7.4
• The Maximal Flow Problem
Definition and Example Problem Data 3
Problem: Maximize the amount of flow of items from an
origin to a destination.

Figure 7.18 Network of railway system

Solution Approach 3 (1 of 5)
Step 1: Arbitrarily choose any path through the network
from origin to destination and ship as much as possible.
Figure 7.19 Maximal flow for path 1–2–5–6
Solution Approach 3 (2 of 5)
Step 2: Re-compute branch flow in both directions
Step 3: Select other feasible paths arbitrarily and determine
maximum flow along the paths until flow is no longer possible.

Figure 7.20 Maximal flow for path 1–4–6

Solution Approach 3 (3 of 5)
Figure 7.21 Maximal flow for path 1–3–6
Solution Approach 3 (4 of 5)
Figure 7.22 Maximal flow for path 1–3–4–6
Solution Approach 3 (5 of 5)
Optimal Solution
Figure 7.23 Maximal flow for railway network
Solution Method Summary 3
1. Arbitrarily select any path in the network from the origin
to the destination.
2. Adjust the capacities at each node by subtracting the
maximal flow for the path selected in step 1.
3. Add the maximal flow along the path to the flow in the
opposite direction at each node.
4. Repeat steps 1, 2, and 3 until there are no more paths
with available flow capacity.
Computer Solution with Excel (1 of 4)

xij  flow along branch i–j and integer

Maximize z  x61

subject to: x61  x12  x13  x14  0

x12  x24  x25  0
x13  x34  x36  0
x14  x24  x34  x46  0
x25  x56  0
x36  x46  x56  x61  0
x12  6  x24  3  x34  2
x13  7  x25  8  x36  6 
x14  4  x46  5   x56  4
x61  17   xij  0  and integer
Computer Solution with Excel (2 of 4)

Exhibit 7.8
Computer Solution with Excel (3 of 4)

Exhibit 7.9
Computer Solution with Excel (4 of 4)

Exhibit 7.10
Example Problem Statement and Data
1. Determine the shortest route from Atlanta (node 1) to each of
the other five nodes (branches show travel time between
nodes).
2. Assuming the branches show distance (instead of travel
time) between the nodes, develop a minimal spanning tree.
Example Problem, Shortest Route
Solution (1 of 2)
Step 1 (part A): Determine the Shortest Route Solution
Example Problem, Shortest Route
Solution (2 of 2)
Shortest route network
Example Problem, Minimal Spanning Tree
1. The closest unconnected node to node 1 is node 2.
2. The closest to 1 and 2 is node 3.
3. The closest to 1, 2, and 3 is node 4.
4. The closest to 1, 2, 3, and 4 is node 6.
5. The closest to 1, 2, 3, 4 and 6 is 5.
6. The shortest total distance is 17 miles.