Introduction to Management Science

9th Edition
by Bernard W. Taylor III

Chapter 7
Network Flow Models

© 2007 Pearson Education

Chapter 7 - Network Flow Models 1

Chapter Topics

The Shortest Route Problem

The Minimal Spanning Tree Problem

The Maximal Flow Problem

Chapter 7 - Network Flow Models 2

Overview

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.

Chapter 7 - Network Flow Models 3

Network Components (1 of 2)

Network diagrams consist of nodes and branches.

Nodes (circles), represent junction points, or locations.

Branches (lines), connect nodes and represent flow.

Chapter 7 - Network Flow Models 4

Network Components (2 of 2)
Four nodes, four branches in figure.
“Atlanta”, node 1, termed 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

Chapter 7 - Network Flow Models 5
The Shortest Route Problem
Definition and Example Problem Data (1 of 2)
Problem: Determine the shortest routes from the origin to
all destinations.

Figure 7.2 Shipping Routes from Los Angeles

Chapter 7 - Network Flow Models 6
The Shortest Route Problem
Definition and Example Problem Data (2 of 2)

Figure 7.3 Network of Shipping Routes

Chapter 7 - Network Flow Models 7

The Shortest Route Problem
Solution Approach (1 of 8)
Determine the initial shortest route from the origin (node 1)
to the closest node (3).

Figure 7.4 Network with Node 1 in the Permanent Set

Chapter 7 - Network Flow Models 8

The Shortest Route Problem
Solution Approach (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

Chapter 7 - Network Flow Models 9

The Shortest Route Problem
Solution Approach (3 of 8)
Redefine the permanent set.

Figure 7.6 Network with Nodes 1, 2, and 3 in the Permanent Set

Chapter 7 - Network Flow Models 10

The Shortest Route Problem
Solution Approach (4 of 8)
Continue

Figure 7.7 Network with Nodes 1, 2, 3, and 4 in the Permanent Set

Chapter 7 - Network Flow Models 11

The Shortest Route Problem
Solution Approach (5 of 8)
Continue

Figure 7.8 Network with Nodes 1, 2, 3, 4, and 6 in the Permanent Set

Chapter 7 - Network Flow Models 12
The Shortest Route Problem
Solution Approach (6 of 8)
Continue

Figure 7.9 Network with Nodes 1, 2, 3, 4, 5, and 6 in the Permanent Set

Chapter 7 - Network Flow Models 13
The Shortest Route Problem
Solution Approach (7 of 8)
Optimal Solution

Figure 7.10 Network with Optimal Routes from Los Angeles to All Destinations
Chapter 7 - Network Flow Models 14
The Shortest Route Problem
Solution Approach (8 of 8)
Solution Summary

Table 7.1 Shortest Travel Time from Origin to Each Destination

Chapter 7 - Network Flow Models 15
The Shortest Route Problem
Solution Method Summary
Select the node with the shortest direct route from the
origin.
Establish a permanent set with the origin node and the
node that was selected in step 1.
Determine all nodes directly connected to the permanent
set nodes.
Select the node with the shortest route (branch) from the
group of nodes directly connected to the permanent set
nodes.
Repeat steps 3 and 4 until all nodes have joined the
permanent set.

Chapter 7 - Network Flow Models 16

The Shortest Route Problem
Computer Solution with QM for Windows (1 of 2)

Exhibit 7.1

Chapter 7 - Network Flow Models 17

The Shortest Route Problem
Computer Solution with QM for Windows (2 of 2)

Exhibit 7.2
Chapter 7 - Network Flow Models 18
The Shortest Route Problem
Computer Solution with Excel (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 = 16x12 + 9x13 + 35x14 + 12x24 + 25x25 + 15x34 +
22x36 + 14x45 + 17x46 + 19x47 + 8x57 + 14x67
subject to: x12 + x13 + x14= 1
x12 - x24 - x25 = 0
x13 - x34 - x36 = 0
x14 + x24 + x34 - x45 - x46 - x47 = 0
x25 + x45 - x57 = 0
x36 + x46 - x67 = 0
x47 + x57 + x67 = 1 xij = 0 or 1
Chapter 7 - Network Flow Models 19
The Shortest Route Problem
Computer Solution with Excel (2 of 4)

Exhibit 7.3
Chapter 7 - Network Flow Models 20
The Shortest Route Problem
Computer Solution with Excel (3 of 4)

Exhibit 7.4
Chapter 7 - Network Flow Models 21
The Shortest Route Problem
Computer Solution with Excel (4 of 4)

Exhibit 7.5
Chapter 7 - Network Flow Models 22
The Minimal Spanning Tree Problem
Definition and Example Problem Data
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

Chapter 7 - Network Flow Models 23

The Minimal Spanning Tree Problem
Solution Approach (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

Chapter 7 - Network Flow Models 24

The Minimal Spanning Tree Problem
Solution Approach (2 of 6)
Select the closest node not presently in the spanning area.

Figure 7.13 Spanning Tree with Nodes 1, 3, and 4

Chapter 7 - Network Flow Models 25

The Minimal Spanning Tree Problem
Solution Approach (3 of 6)

Continue

Figure 7.14 Spanning Tree with Nodes 1, 2, 3, and 4

Chapter 7 - Network Flow Models 26

The Minimal Spanning Tree Problem
Solution Approach (4 of 6)

Continue

Figure 7.15 Spanning Tree with Nodes 1, 2, 3, 4, and 5

Chapter 7 - Network Flow Models 27

The Minimal Spanning Tree Problem
Solution Approach (5 of 6)
Continue

Figure 7.16 Spanning Tree with Nodes 1, 2, 3, 4, 5, and 7

Chapter 7 - Network Flow Models 28
The Minimal Spanning Tree Problem
Solution Approach (6 of 6)

Optimal Solution

Figure 7.17 Minimal Spanning Tree for Cable TV Network

Chapter 7 - Network Flow Models 29
The Minimal Spanning Tree Problem
Solution Method Summary

Select any starting node (conventionally, node 1).

Select the node closest to the starting node to join the
spanning tree.
Select the closest node not presently in the spanning tree.
Repeat step 3 until all nodes have joined the spanning tree.

Chapter 7 - Network Flow Models 30

The Minimal Spanning Tree Problem
Computer Solution with QM for Windows

Exhibit 7.6
Chapter 7 - Network Flow Models 31
The Maximal Flow Problem
Definition and Example Problem Data
Problem: Maximize the amount of flow of items from an
origin to a destination.

Figure 7.18 Network of Railway System

Chapter 7 - Network Flow Models 32

The Maximal Flow Problem
Solution Approach (1 of 5)
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

Chapter 7 - Network Flow Models 33

The Maximal Flow Problem
Solution Approach (2 of 5)
Re-compute branch flow in both directions and then 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

Chapter 7 - Network Flow Models 34
 The Maximal Flow Problem
Solution Approach (3 of 5)

Continue

0 4 1 4
14 14
1
6
6
6 6

Figure 7.21 Maximal Flow for Path 1-3-6

Chapter 7 - Network Flow Models 35
The Maximal Flow Problem
Solution Approach (4 of 5)
Continue

Figure 7.22 Maximal Flow for Path 1-3-4-6

Chapter 7 - Network Flow Models 36

The Maximal Flow Problem
Solution Approach (5 of 5)
Optimal Solution

Figure 7.23 Maximal Flow for Railway Network

Chapter 7 - Network Flow Models 37

The Maximal Flow Problem
Solution Method Summary

Arbitrarily select any path in the network from origin to

destination.
Adjust the capacities at each node by subtracting the
maximal flow for the path selected in step 1.
Add the maximal flow along the path to the flow in the
opposite direction at each node.
Repeat steps 1, 2, and 3 until there are no more paths with
available flow capacity.

Chapter 7 - Network Flow Models 38

The Maximal Flow Problem
Computer Solution with QM for Windows

Exhibit 7.7
Chapter 7 - Network Flow Models 39
The Maximal Flow Problem
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  0 7and
xij Chapter integer
- Network Flow Models 40
The Maximal Flow Problem
Computer Solution with Excel (2 of 4)

Exhibit 7.8
Chapter 7 - Network Flow Models 41
The Maximal Flow Problem
Computer Solution with Excel (3 of 4)

Exhibit 7.9

Chapter 7 - Network Flow Models 42

The Maximal Flow Problem
Computer Solution with Excel (4 of 4)

Exhibit 7.10
Chapter 7 - Network Flow Models 43
The Maximal Flow Problem
Example Problem Statement and Data (1 of 2)

Determine the shortest route from Atlanta (node 1) to each

of the other five nodes (branches show travel time between
nodes).
Assume branches show distance (instead of travel time)
between nodes, develop a minimal spanning tree.

Chapter 7 - Network Flow Models 44

The Maximal Flow Problem
Example Problem Statement and Data (2 of 2)

Chapter 7 - Network Flow Models 45

The Maximal Flow Problem
Example Problem, Shortest Route Solution (1 of 2)

Step 1 (part A): Determine the Shortest Route Solution

1. Permanent Set Branch Time
{1} 1-2 [5]
1-3 5
1-4 7
2. {1,2} 1-3 [5]
1-4 7
2-5 11
3. {1,2,3} 1-4 [7]
2-5 11
3-4 7
4. {1,2,3,4} 4-5 10
4-6 [9]
5. {1,2,3,4,6} 4-5 [10]
6-5 13
6. {1,2,3,4,5,6}

Chapter 7 - Network Flow Models 46

The Maximal Flow Problem
Example Problem, Shortest Route Solution (2 of 2)

Chapter 7 - Network Flow Models 47

The Maximal Flow Problem
Example Problem, Minimal Spanning Tree (1 of 2)

The closest unconnected node to node 1 is node 2.

The closest to 1 and 2 is node 3.
The closest to 1, 2, and 3 is node 4.
The closest to 1, 2, 3, and 4 is node 6.
The closest to 1, 2, 3, 4 and 6 is 5.
The shortest total distance is 17 miles.

Chapter 7 - Network Flow Models 48

The Maximal Flow Problem
Example Problem, Minimal Spanning Tree (2 of 2)

Chapter 7 - Network Flow Models 49

End of Chapter

Chapter 7 - Network Flow Models 50