Network

Models
Group 4 (BSA – 1A)
INTRODUCTION
Some managerial problems can be described
graphically as a network. It is a set of nodes and
arcs that diagrams the relationships between
objects of the real system. Network models can
represent e.g. a transportation system where nodes
are the cities and arcs are the connections between
them (roads).
INTRODUCTION
The network expression is also suitable for
description of computer systems (Local Area
Network, World Wide Web, etc.), the company
organization and production process, piping systems,
or projects. In the following section there will be
discussed the basic terminology and notation for
network problems and some applications will be
outlined.
INTRODUCTION
The network model is a database model
conceived as a flexible way of representing objects
and their relationships. Its distinguishing feature is
that the schema, is viewed as a graph in which
object types are nodes and relationship types are
arcs, is not restricted to being a hierarchy or lattice.
INTRODUCTION

The network model’s original

inventor was Charles Bachman, and it
was developed into a standard
specification published in 1969 by the
Conference on Data Systems Languages
Consortium.
ADVANTAGES
1. Simplicity
2. Ability to handle relationships
3. Ease of data access
4. Data Integrity
5. Data Indepedence
DISADVANTAGES

1. System Complexity
2. Lack of Structural
Independence
NETWORK MODELS
As we defined above, the network is a set of nodes
and arcs. The arc is a connector between a pair of nodes
and can be directed (oriented) or undirected. A
directed arc indicates which node is considered as the
point of origin. The orientation of the arc is marked with
the arrowhead.
If a network contains directed arcs it is called a
directed network. Otherwise it is called an undirected
network.
NETWORK MODELS

i j

Undirected Network

i j

Directed Network
NETWORK MODELS
A path in a network is a specific sequence of
arcs in which the initial node of each arc is identical
with the terminal node of the preceding arc in the
sequence. This sequence must cross the different
nodes. In Figure 3.2 the example of such a path is
shown (the sequence across the nodes 1 – 2 – 4 – 5
– 6).
NETWORK MODELS
2 5

1
4

3 6
The path figure is an open path, since it starts and
ends in different nodes. If the path starts and ends in the
same node (closed path) it is called a circuit (cycle).
NETWORK MODELS
2 5

1
4

3 6
A network is called connected if there is a path connecting every pair of
nodes in the network. The network shown above is connected. If we removed the
arcs (1, 2) and (1, 3), we would no longer have the connected network.
NETWORK MODELS
The connected network without any
circuit is called a tree. If we denote the total
number of nodes in the network as n it is
evident that the tree involving all nodes must
contain exactly (n – 1) arcs. If we add any arc
to the tree, the circuit will appear.
NETWORK MODELS

A spanning tree is a tree including all the

nodes from the original network. The tree
shown in Figure 3.4 is an example of spanning
tree. Removing of any arc from the spanning
tree changes the tree into unconnected
network.
NETWORK MODELS
2 5

1
4

3 6
Spanning Tree
In real situation the network is evaluated. The values
can be added to noded or/and to arcs and can represent
time, distance, cost, capacity, etc.
BASIC NETWORK MODELS

Before describing the most often applications

of network theory - project management- we
mention some simple situations where the network
representation is successfully used. With respect to
the limited space in this textbook, it is not possible
to describe all the methods used for solving
problems and we will concentrate just on some
simpler methods.
SHORTEST PATH
PROBLEMS
The problems in this category concern situations
where we have to find the shortest path from an origin
to a destination. Usually, there is no direct connection
between these two points and the path crossing many
other points must be found. A network represents the
possible connections (arcs) between all points (nodes).
Distance between the pair of
connected nodes is attributed to each arc.
SHORTEST PATH
PROBLEMS
18
2 5

14
12 23

30
1 10
4
15 15
25
3 6
16
In the figure shown there is an example with 6 cities. Direct distances
between the cities are in kilometers. The objective is to run from the city 1 to the city 6
through shortest path. It is very easy to find the path across the cities 2 and 3. The
length of the shortest path is 40 km.
SHORTEST PATH
PROBLEMS
The problem can be formulated as finding the
shortest paths not only from one origin to one
destination, but from each node to all the other
nodes. Since the network is undirected the matrix of
shortest paths is symmetric (e.g. the length of the
path from 1 to 6 equals the length of the path from
6 to 1).
 To 1 2 3 4 5 6
From
1 0 14 24 26 32 40
2 14 0 10 12 18 26
3 24 10 0 15 28 16
4 26 12 15 0 23 15
5 32 18 28 23 0 30
6 40 26 16 15 30 0
TRAVELING SALESPERSON
PROBLEM
A salesperson has to visit a specified group of
cities and come back to the origin (home city).
This tour should be as short as possible in terms of
the total distance. In Figure 3.6 such a tour
(circuit) is displayed (it crosses the nodes 1, 2, 5, 4,
6, 3, 1). The optimal total distance is 111 km.
TRAVELING SALESPERSON
PROBLEM

18
2 5

14
12 23

30
1 10
4
15 15
25
3 6
16
 To 1 2 3 4 5 6
From
1 - 14 25 - - -
2 14 - 10 12 18 -
3 25 10 - 15 - 16
4 - 12 15 - 23 15
5 - 18 - 23 - 30
6 - - 16 15 30 -
TRAVELING SALESPERSON
PROBLEM
If the task had been solved as the classical assignment
problem many solutions would have been found, infeasible
in case of traveling salesperson problem. One of those
solutions is strongly shaded in Table 3.3. When we graph this
solution, we can see two sub-tours 1-2-3-1 and 4-5-6-4.
Whereas it is feasible solution of assignment problem, it is
infeasible in traveling salesperson problem. Therefore in
formulation of the model, it is necessary to add constraints
that prevent building sub-tours.
 To 1 2 3 4 5 6
From
1 - 14 25 - - -
2 14 - 10 12 18 -
3 25 10 - 15 - 16
4 - 12 15 - 23 15
5 - 18 - 23 - 30
6 - - 16 15 30 -
Assignment Problem
TRAVELING SALESPERSON
PROBLEM
18
2 5

14
12 23

30
1 10
4
15 15
25
3 6
16

Infeasible Sub Tours in TSP

MINIMAL SPANNING
TREE
In some situations, instead of finding the shortest
path or the shortest tour, the goal is to assure a connection
between all nodes in the network. Assuming n nodes in the
network, a spanning tree is such sub-network that
contains exactly (n-1) arcs and no circuits. In case we have
the evaluated network (e.g. by distances), the minimal
spanning tree is a spanning tree with the minimal sum of
values.
MINIMAL SPANNING
TREE
We illustrate one of the possible algorithms on this
elementary example. Suppose that the managerial
problem is to connect 9 locations of an exhibition area
with the source of electricity power. The objective is to
minimize the cost of all the extensions. The direct
distances (in meters) between locations can be found in
Figure 3.8. The node 1 is the source of power. The price per
1 meter of a cable is 10 CZK.
MINIMAL SPANNING
TREE
85
2 7 61
88
76 63 9
Power
70
1 90
5
40 55 43
75 54
80
60 3 8

52 68 74 35
10
4
71 6 120
SOLUTION

•First Step (Finding Two Arcs with

Minimal Length)
In the first step we find two arcs
with minimal distances. These are the
arcs (8, 10) and (3, 5) with direct
distances 35 and 40 meters.
SOLUTION
85
2 7 61
88
76 63 9
Power
70
1 90
5
40 55 43
75 54
80
60 3 8

52 68 74 35
10
4
71 6 120
SOLUTION
•Second Step (Adding a New Arc)
In the second step we search for another arc (from
the set of all the remaining arcs in the network) with the
minimal distance. This arc is added into the set of the arcs
selected before. We must respect the important rule: no
circuit can occur after adding a new arc. If the circuit
appeared we would ignore this arc in the searching
process.
SOLUTION
85
2 7 61
88
76 63 9
Power
70
1 90
5
40 55 43
75 54
80
60 3 8

52 68 74 35
10
4
71 6 120
SOLUTION
•Third Step (Repeat the Second Step until
Minimal Spanning Tree
We repeat the second step until a minimal
spanning tree is found.
The total length of the cable necessary for all the
extensions is 490 meters. Thus, total cost of
distribution of electricity power in the exhibition
area is 4900 CZK.
SOLUTION
85
2 7 61
88
76 63 9
Power
70
1 90
5
40 55 43
75 54
80
60 3 8

52 68 74 35
10
4
71 6 120
THANK
YOU!!!