CH 07

Network Flow Models
Chapter 7
Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-1

Chapter Topics
■ The Shortest Route Problem
■ The Minimal Spanning Tree Problem
■ The Maximal Flow Problem

Network Components
■ 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 (1 of 2)
■ Network diagrams consist of nodes and branches.
■ Nodes (circles), represent junction points, or locations.
■ Branches (lines), connect nodes and represent flow.

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
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
Definition and Example Problem Data (2 of 2)
Figure 7.3 Network Representation

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

Put (3) in the permanent set. Determine the total distances to all
nodes directly connected to the permanent set. Select the shortest.
Figure 7.5 Network with Nodes 1 and 3 in the Permanent Set

Redefine the permanent set by adding the shortest, iterate.
Figure 7.6 Network with Nodes 1, 2, and 3 in the Permanent Set

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

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

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

Figure 7.10 Network with Optimal Routes

Table 7.1 Shortest Travel Time from Origin to Each Destination

Solution Method Summary
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 of nodes.
4. Select the node with the shortest route from the group
of nodes directly connected to the permanent set of
nodes.
5. Repeat steps 3 & 4 until all nodes have joined the
permanent set.
Computer Solution with QM for Windows (1 of
2)
Exhibit 7.1
Computer Solution with QM for Windows (2 of 2)
Exhibit 7.2
Mathematical Model
Formulation as a 0 - 1 integer linear programming problem.
xij = 1 if branch i-j is selected as part of the shortest route, and 0 if it
is not 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
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

Start with any node in the network (e.g. node (1)) and select the
closest node to join the spanning tree.
Figure 7.12 Spanning Tree with Nodes 1 and 3

Select the closest node not presently in the spanning area.
Figure 7.13 Spanning Tree with Nodes 1, 3, and 4

Continue to select the closest node not presently in the spanning area.
Figure 7.14 Spanning Tree with Nodes 1, 2, 3, and 4

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

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

Optimal Solution
Figure 7.17 Minimal Spanning Tree for Cable TV Network

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 presently in the spanning
tree.
4. Repeat step 3 until all nodes have joined the spanning
tree.

Computer Solution with QM for Windows
Exhibit 7.6
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

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-

Copyright © 20106
Pearson Education, Inc. Publishing as Prentice Hall 7-30
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

Continue
Figure 7.21 Maximal Flow for Path 1-3-6

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

Optimal Solution
Figure 7.23 Maximal Flow for Railway Network

1. Arbitrarily select any path in the network from origin

to 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 QM for Windows
Exhibit 7.7
Mathematical Model
xij = flow along branch i-j (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 Education,
Copyright © 2010 Pearson xij asPrentice
17 Inc. Publishing 0 and Hall integer 7-37
Network Flow Models
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. Assume branches show distance (instead of travel time) between
nodes, develop a minimal spanning tree.

Network Flow Models
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}

Network Flow Models
Example Problem, Shortest Route Solution (2 of 2)

Network Flow Models
Example Problem, Minimal Spanning Tree (1 of 2)
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.

Network Flow Models
Example Problem, Minimal Spanning Tree (2 of 2)

CH 07

Uploaded by

Copyright:

Available Formats

CH 07

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CH 07

Uploaded by

Copyright:

Available Formats

Network Flow Models

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-1

■ The Shortest Route Problem

■ The Minimal Spanning Tree Problem

■ The Maximal Flow Problem

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-2

■ A network is an arrangement of paths (branches) connected at

■ The network is drawn as a diagram providing a picture of the system

■ A large number of real-life systems can be modeled as networks

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-3

■ Network diagrams consist of nodes and branches.

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

■ Branches (lines), connect nodes and represent flow.

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-4

■ Four nodes, four branches in figure.

Figure 7.1 Network of Railroad

Figure 7.3 Network Representation

Figure 7.4 Network with Node 1 in the Permanent Set

Figure 7.5 Network with Nodes 1 and 3 in the Permanent Set

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

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

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

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

Figure 7.10 Network with Optimal Routes

Table 7.1 Shortest Travel Time from Origin to Each Destination

Figure 7.11 Network of Possible Cable TV Paths

Figure 7.12 Spanning Tree with Nodes 1 and 3

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

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

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-23

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

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

Figure 7.17 Minimal Spanning Tree for Cable TV Network

1. Select any starting node (conventionally, node 1).

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-27

Figure 7.18 Network of Railway System

Figure 7.19 Maximal Flow for Path 1-2-5-

Figure 7.20 Maximal Flow for Path 1-4-6

Figure 7.21 Maximal Flow for Path 1-3-6

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

Figure 7.23 Maximal Flow for Railway Network

1. Arbitrarily select any path in the network from origin

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-35

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-38

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-39

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-40

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-41

Copyright © 2010 Pearson Education, Inc. Publishing as Prentice Hall 7-42

You might also like