Dr.

Darla / SMEC / VIT Vellore 1

 BMEE215L Engineering Optimization
Module-3: Network Models
Lecture: Network Models
Sub-topic: Minimum Spanning Tree Algorithm,
Shortest Route Problem,
Maximum Flow Problem
Dr. Siva Prasad Darla
M.Tech., Ph.D.

School of Mechanical Engineering

VIT, Vellore

Muddy City Problem

Once upon a time there was a city that had no roads.
Getting around the city was particularly difficult after
rainstorms because the ground became very muddy, cars
got stuck in the mud and people got their boots dirty.
The mayor of the city decided that some of the streets
must be paved, but did not want to spend more money
than necessary because the city also wanted to build a
swimming pool.
The mayor therefore specified two conditions:
1. Enough streets must be paved so that it is possible for
everyone to travel from their house to anyone else's
house only along paved roads, and
2. The paving should cost as little as possible. Here is
the layout of the city.
The number of paving stones between each house
represents the cost of paving that route. Find the best
route that connects all the houses, but uses as few
counters (paving stones) as possible.
Prof. Darla / SMEC / VIT Vellore 4
Darla

Dr. Darla / SMEC / VIT Vellore 2

 Muddy City Problem: Network Model Representation

Network Model

Prof. Darla / SMEC / VIT Vellore 5

Darla

Introduction to Network Models

• Network: it consists of a set of nodes/vertices linked by arcs or edges or branches
• Flow of materials/goods or weight with each arc
• Standard Notation
▪ Network G
▪ Set of nodes N
▪ Set of arcs E
G = (N, E)
N = {1, 2, 3, ……, N}
E = {(1,2), (1,3), (2,3), (3,1), (2,1) …….. (n-1, n)}
• Node: location is represented as a node
• Arc: connection between one node to other node
• Capacity of arc: allowing the flow of goods/materials i.e. maximum allowing quantity in the arc. The maximum
flow in a network can be finite or infinite, depending on the capacity of its arcs

Prof. Darla / SMEC / VIT Vellore 6

Darla

Dr. Darla / SMEC / VIT Vellore 3

 Introduction to Network Models
Directed arc: allows positive flow in one direction
Directed Network: if all arcs are directed
Undirected Network: arcs are bidirectional
• Network
G = (N, E)
N = {1, 2, 3, ……, N}
E = {(1,2), (1,3), (2,3), (3,1), (2,1) …….. (n-1, n)}
For example: In a region, cities represent nodes and highway roads represent edges, with traffic representing the
edge capacity or flow in constructed transportation network.

G = (N, E)
N = {1, 2, 3, 4, 5}
E = {(1,2), (1,3), (2,3), (2,3), (2,4), (2,5),
(3,4), (3,5), (4,5)}

Prof. Darla / SMEC / VIT Vellore 7

Darla

Introduction to Network Models

• Path: sequence of distinct edges that join the two nodes regardless of the orientation of the individual edges
• Loop/Cycle: A path forms a cycle or a loop if it connects a node back to itself through other nodes.
• Directed Loop (Circuit): a loop in which all the arcs or edges have the same direction or orientation.
• Connected Network: network in which every two distinct nodes are linked by a path (at least one path).

Prof. Darla / SMEC / VIT Vellore 8

Darla

Dr. Darla / SMEC / VIT Vellore 4

 Network Models-Minimum Spanning Tree
• Tree: It is a connected network that may involve only a subset of the nodes with no cycle/loop
• A network which satisfies these properties is called a tree.
✓ The network has no circuits.
✓ The number of edges in the network is one fewer than the number of vertices. So, if the network
has N vertices, it will have N−1 edges.
✓ Every edge in the network is a bridge.
✓ Given any pair of two vertices in the network, only one path exists connecting those two vertices.

Prof. Darla / SMEC / VIT Vellore 9

Darla

Network Models-Minimum Spanning Tree (MST)

• Spanning Tree: It is a connected network and also tree that includes all the nodes in the
network with no loops.
• A spanning tree for a connected network is a subset of nodes which is a tree and which
connects every vertex of the original network.
• Minimum Spanning Tree
It is desired to determine, the spanning tree that results in the smallest sum of the
connecting edges or arcs’ weight or cost
• Minimum Spanning Tree (MST) deals with finding the most efficient connections among
all the nodes in the network, which, by definition, cannot include any loops or cycles.
• In a network with N vertices, every spanning tree has exactly N - 1 edges.

• In a network with N vertices, if a set of N-1 edges is acyclic, then it connects

all the vertices, so it is a spanning tree.

Prof. Darla / SMEC / VIT Vellore 10

Darla

Dr. Darla / SMEC / VIT Vellore 5

 Algorithm for MST (Prim’s Algorithm)
Here N = {1, 2, 3, ….. n} be the set of nodes of the network
Ck = Set of connected nodes at iteration k
Ck¯ = Set of unconnected nodes at iteration k
Step 0. Set C0 =  and C0¯ = N
Step 1. Start with any node i in the unconnected set C0¯ and set C1 = {i}, rendering
C1¯ = N – {i}. Set k = 2.
Step K. Select a node, j*, in the unconnected set C¯k - 1 that yields the shortest
arc to a node in the connected set Ck - 1.
Link j* permanently to Ck - 1 and remove it from C¯k - 1 to obtain Ck and C¯k, respectively.
Stop if Ck is empty;
else, set k = k + 1 and repeat the step k.

Prof. Darla / SMEC / VIT Vellore 11

Darla

Algorithm for MST (Prim’s Algorithm)

Need Source Node/Vertex in the problem statement.

Step 1: Start with source node.

Step 2: Pick an edge/arc connecting any tree vertex and fringe vertex (adjacent vertex
to visited vertex) having the minimum edge weight.
Step 3: Add the selected edge/arc to MST only if it doesn't form any closed cycle.
Step 4: Keep repeating steps 2 and 3 until the fringe vertices exist.

Prim’s algorithm begins with a single node and adds up adjacent nodes one by one by
discovering all of the connected edges along the way. Edges with the lowest weights that
don't generate cycles are chosen for inclusion in the MST structure.

Prof. Darla / SMEC / VIT Vellore 12

Darla

Dr. Darla / SMEC / VIT Vellore 6

 Example Problem – 1 (to illustrate MST)
The Vellore Internet company is in the process of planning a network for providing wire internet service to housing
development areas as summarized in the figure. Determine the links that will results in the use of minimum wire
miles while guaranteeing that all areas are connected (directly or indirectly) to the internet station.

Prof. Darla / SMEC / VIT Vellore 13

Darla

Exampl-2 (to illustrate MST)

Determine the minimal spanning tree of the following network with arc weight is cost (Rs.)

Prof. Darla / SMEC / VIT Vellore 14

Darla

Dr. Darla / SMEC / VIT Vellore 7

 Algorithm for MST (Kruskal’s Algorithm)

Step 1: Sort all edges in increasing order of their edge weights.

Step 2: Pick the smallest edge.
Step 3: Check if the new edge creates a cycle or loop in a spanning tree.
Step 4: If it doesn’t form the cycle, then include that edge in MST. Otherwise, discard it.
Step 5: Repeat from step 2 until it includes (number of vertices – 1) edges in MST.

Prof. Darla / SMEC / VIT Vellore 15

Darla

Introduction to Shortest Route Problem

Problems such as finding the
shortest route from one place
to another, choosing a moving
direction where people can
escape as many as possible in a
disaster, war, etc, can be
categorized as network
optimization problems.

Prof. Darla / SMEC / VIT Vellore 16

Darla

Dr. Darla / SMEC / VIT Vellore 8

 Introduction to Shortest Route Problem
• The shortest-route problem determines the shortest route between a source and destination
in a transportation network.
• The shortest-route problem can be formulated as a network and apply the shortest route
algorithms for solution of the problem.
• Examples
➢Equipment Replacement
➢Best Reliable Route

Prof. Darla / SMEC / VIT Vellore 17

Darla

Shortest Route Problem

Shortest Route Algorithms
1. Dijkstra’s algorithm for determining the shortest routes between the source node and
every other node in the network.
2. Floyd’s algorithm (Floyd-Warshall algorithm) for determining the shortest route between
any two nodes in the network.

Prof. Darla / SMEC / VIT Vellore 18

Darla

Dr. Darla / SMEC / VIT Vellore 9

 Floyd-Warshall Algorithm (Floyd’s Algorithm)
• The problem is to find the shortest distances between every pair of vertices in a given edge-
weighted directed network and undirected network.
• Floyd-Warshall’s algorithm is more general than Dijkstra’s because it determines the shortest
route between any two nodes in the network.
• The algorithm represents an n-node network as a square matrix with n rows and n columns.
• Main step:
Given three nodes i, j, and k in figure with the connecting distances shown on the three
arcs, it is shorter to reach j from i passing through k if

In this case, it is optimal to replace the direct

route from i j with the indirect route
i k j.

Prof. Darla / SMEC / VIT Vellore 19

Darla

Floyd-Warshall Algorithm (Floyd’s Algorithm)

• The algorithm represents an n-node network as a square matrix with n rows and n columns.
• Form the distance matrix (n x n) and sequence matrix (n x n) for given n node network.
• Entry (i, j) of the matrix gives the distance dij from node i to node j, which is finite if i is linked
directly to j, and infinite  otherwise.

Prof. Darla / SMEC / VIT Vellore 20

Darla

Dr. Darla / SMEC / VIT Vellore 10

 Floyd-Warshall Algorithm (Floyd’s Algorithm)
• Step 0:
Define the starting distance matrix D0 and node sequence matrix S0 (all diagonal elements are blocked i.e. -)
• Step k:
Set k = 1
Define row k and column k as pivot row and pivot column. Apply the triple operation to each element dij in
Dk - 1, for all i and j.
If the condition
is satisfied, make the following changes:
(a) Create Dk by replacing dij in Dk - 1 with dik + dkj.
(b) Create Sk by replacing sij in Sk - 1 with k.
Else, no changes in values (i.e. copy the same values in the distance matrix D k and sequence matrix Sk
from Dk-1 and Sk-1 respectively. )
Set k = k + 1.
If k = n + 1, stop; else repeat step k.

Prof. Darla / SMEC / VIT Vellore 21

Darla

Floyd-Warshall Algorithm (Floyd’s Algorithm)

• Step final (Concluding the optimal solution):
After n steps, we can determine the shortest route between nodes i and j from the matrices Dn
and Sn using the following rules:
1. From Dn, dij gives the shortest distance between nodes i and j.
2. From Sn, determine the intermediate node k = sij that yields the route i k j.
If sik = k and skj = j, stop; all the intermediate nodes of the route have been found.
Otherwise, repeat the procedure between nodes i and k and between nodes k and j.

Prof. Darla / SMEC / VIT Vellore 22

Darla

Dr. Darla / SMEC / VIT Vellore 11

 Example-3 (to illustrate Floyd’s Algorithm)
• Consider the following network of a route problem , determine the shortest route between all
pairs of nodes of the network.

Prof. Darla / SMEC / VIT Vellore 23

Darla

Example-4 (to illustrate Floyd’s Algorithm)

• Consider the following network of a route problem , determine the shortest route between all
pairs of nodes of the network.

Prof. Darla / SMEC / VIT Vellore 24

Darla

Dr. Darla / SMEC / VIT Vellore 12

 Introduction to Maximum flow algorithm
• Consider a network of pipelines that transports
crude oil from oil wells to refineries.
• Intermediate booster and pumping stations are
installed at appropriate design distances to
move the crude in the network.
• Each pipe segment has a finite discharge rate
(or capacity) of crude flow.
• A pipe segment may be unidirectional or
bidirectional, depending on its design.

Question: Determine the maximum flow

capacity of the given pipeline network.

Prof. Darla / SMEC / VIT Vellore 25

Darla

Maximum flow algorithm

The solution of the pipeline network

problem requires adding a single
source and a single sink using
unidirectional infinite capacity arcs.

Question: Determine the maximum flow

capacity of the given pipeline network.

Prof. Darla / SMEC / VIT Vellore 26

Darla

Dr. Darla / SMEC / VIT Vellore 13

 Maximum flow algorithm

OR

( , )

Arc (i, j),

flow capacity Cij: from i to j and
flow capacity Cji: from j to i

Prof. Darla / SMEC / VIT Vellore 27

Darla

Maximum flow algorithm

• The maximal flow algorithm is based on finding breakthrough paths with positive flow
between the source and sink/terminal nodes.
• Each path commits part or all of the capacities of its arcs to the total flow in the network.
• Consider arc (i, j) with the bidirectional (design) capacities (Cij, Cji). As portions of these
capacities are committed to the flow in the arc, the residuals (or unused capacities) of the arc
are updated. We use the notation (rij, rji) to represent the residuals.
• For a node j that receives flow from node i, we attach a label [aj, i], where aj is the flow from
node i to node j.

Prof. Darla / SMEC / VIT Vellore 28

Darla

Dr. Darla / SMEC / VIT Vellore 14

 Maximum flow algorithm
Steps:
• Step1: For all arcs (i, j), set the residual capacity equal to the design capacity.
i.e. (cij, cji) = (Cij, Cji).
Let a1 = ∞, and label source node 1 with [∞, -]. Set i = 1, and go to step 2.

• Step2: Determine Si, the set of unlabeled nodes j that can be reached directly from node i by arcs with
positive residuals (i.e., cij > 0 for all j ∈ Si).
If Si ≠ ∅, go to step 3. Otherwise, a partial path is dead-ended at node i. Go to step 4.

• Step3: Determine k ∈ Si such that

𝑚𝑎𝑥
𝑐𝑖𝑘 = 𝑗 ∈ 𝑆 𝑐𝑖𝑗
𝑖
Set ak = cik and label node k with [ak, i]. If k = n, the sink node has been labeled, and
a breakthrough path is found, go to step 5. Otherwise, set i = k, and go to step 2.

Prof. Darla / SMEC / VIT Vellore 29

Darla

Maximum flow algorithm

• Step4: (Backtracking). If i = 1, no breakthrough is possible; go to step 6.
Otherwise, let r be the node (on the partial path) that was labeled immediately before current
node i, and remove i from the set of nodes adjacent to r. Set i = r, and go to step 2.

• Step5: (Determination of residuals). Let Np = (1, k1, k2,…..n) define the nodes of the pth breakthrough
path from source node 1 to sink node n. Then the maximum flow along the path is computed as
fp = min(a1, ak1, ak2,….. an)
The residual capacity of each arc along the breakthrough path is decreased by fp in the direction
of the flow and increased by fp in the reverse direction –
i.e. for nodes i and j on the path, the residual flow is changed from the current (cij, cji) to
(a) (cij - fp, cji + fp) if the flow is from i to j
(b) (cij + fp, cji – fp) if the flow is from j to i
Reinstate any nodes that were removed in step 4. Set i = 1, and return to step 2.
Prof. Darla / SMEC / VIT Vellore 30
Darla

Dr. Darla / SMEC / VIT Vellore 15

 Maximum flow algorithm
• Step6 (Solution). (a) Given that m breakthrough paths have been determined, the maximal flow in the
network is F = f1 + f2 + ……. + fm
(b) Using the (initial) design capacities and final residuals of arc (i, j), (Cij, Cji), and (cij, cji),
respectively, the optimal flow in arc (i, j) is determined by computing
(, ) = (Cij - cij, Cji – cji).
If  > 0, the optimal flow from i to j is .
Otherwise, if  > 0, the optimal flow from j to i is .
(It is impossible to have both  and  positive.)

Prof. Darla / SMEC / VIT Vellore 31

Darla

Example-5 (to illustrate maximum flow algorithm)

Consider the given network, in which design capacity is represented in the arc. Determine the
maximum flow from the source node 1 and to terminal node 5. Find the maximum flow in all
arcs.

Prof. Darla / SMEC / VIT Vellore 32

Darla

Dr. Darla / SMEC / VIT Vellore 16

 Example-5 (to illustrate maximum flow algorithm)
Maximum flow algorithm or method

Prof. Darla / SMEC / VIT Vellore 33

Darla

Example-6 (maximum flow algorithm)

Consider the given network, in which design capacity is represented in the arc. Determine the
maximum flow from the source node S and to terminal node T. Find the maximum flow in all
arcs.

Prof. Darla / SMEC / VIT Vellore 34

Darla

Dr. Darla / SMEC / VIT Vellore 17

 BMEE215L Engineering Optimization
Module-3: Network Models
Lecture: Project Network
Sub-topic: CPM and PERT

Dr. Siva Prasad Darla

M.Tech., Ph.D.

School of Mechanical Engineering

VIT, Vellore

Introduction to Project
A project is a temporary endeavour involving a connected sequence of activities and a range of
resources, which is designed to achieve a specific and unique outcome and which operates
within time, cost and quality constraints and which is often used to introduce change.
Characteristic of a project
A unique, one-time operational activity or effort
Requires the completion of a large number of interrelated activities
Established to achieve specific objective
Resources, such as time and/or money, are limited
Typically has its own management structure
Need leadership
Examples
▪ constructing houses, factories, shopping malls, athletic stadiums or arenas
▪ developing military weapons systems, aircrafts, new ships

Prof. Darla / SMEC / VIT Vellore 36

Darla

Dr. Darla / SMEC / VIT Vellore 18

 Introduction to Project
• Pl go through the following my presentation on CPM and PERT of Module-3
• Search on
“Project Management – CPM/PERT Siva Prasad Darla, VIT University, Vellore”
in any search engine
• (OR) Search the following in google
https://vdocuments.mx/project-management-cpmpert-siva-prasad-darla-sr-lecturer-school-of-
mechanical.html?page=1

https://www.slideserve.com/evangelia-chloe/project-management-cpm-pert

Prof. Darla / SMEC / VIT Vellore 37

Darla

Introduction to Project
Note:
In my presentation material on Project Management, kindly find the
typo error.
In slide number: 23
Last line:
Typo error is identified and corrected as follows:

“ LF = minimum LS of immediate successors “

Prof. Darla / SMEC / VIT Vellore 38

Darla

Dr. Darla / SMEC / VIT Vellore 19

 Introduction to Project-Project Network Diagram
Activity-on-arrow (AOA) Project Network for House
3
Lay Dummy
foundation
2 0 Build Finish
3 1 house work
1 2 4 6 7
Design house Order and 3 1
and obtain receive Select 1 1 Select
financing materials paint carpet
5

Activity-on-node (AON) Project Network for House

Lay foundations Build house
2 4 Finish work
2 3
7
Start 1 1 Finish
3
Design house and 6
3
obtain financing 1 5 1
Order and receive
1 Select carpet
Prof. Darla / SMEC / VIT Vellore 39
Select paint Darla
materials

Network diagram construction

B
A A must finish before either B or C can start

C
A
C both A and B must finish before C can start
B
A C both A and C must finish before either of B
B or D can start
D

A B
A must finish before B can start
Dummy both A and C must finish before D can start
C darla/smbs/vit Prof. Darla / SMEC / VIT Vellore 40 40
D Darla

Dr. Darla / SMEC / VIT Vellore 20

 Network diagram construction

3
Lay foundation Lay
Dummy
foundation
2 0
2 3
1
Order material 2 4
Order material

(a) Incorrect precedence (b) Correct precedence

relationship relationship

darla/smbs/vit Prof. Darla / SMEC / VIT Vellore 41 41

Darla

Construction of Project Network- example-7

Construct the arrow diagram comprising activities A, B, C, ……. K and L such that the
following relationships are satisfied:
(i) A, B, and C the first activities of the project, can start simultaneously,
(ii) A and B precede D,
(iii) B precedes E, F and H,
(iv) F and C precede G,
(v) E and H precede I and J,
(vi) C, D, F and J precede K,
(vii) K precedes L,
(viii) I, G and L are the terminal activities of the project.

Prof. Darla / SMEC / VIT Vellore 42

Darla

Dr. Darla / SMEC / VIT Vellore 21

 Critical Path Method (CPM)- example-8
Consider the following network of a project. The name and execution time of an activity is
indicated on the arrows. Determine the critical path of the project and the duration of project.
f, 15

g, 17 h, 9
a, 6
i, 6

b, 8

d, 13 j, 12

c, 5
e, 9

Prof. Darla / SMEC / VIT Vellore 43

Darla

CPM –example-9
Consider the following network of a project that starts at node 1 and terminate at node 7. The
time required to perform each activity is indicated on the arrows. Determine the critical path with
calculation of total float (or float) of the activity. Find the free float of each activity.
2 5 5
7
3 3
1 6
7
3 6

2 3

2 2 2
4

Prof. Darla / SMEC / VIT Vellore 44

Darla

Dr. Darla / SMEC / VIT Vellore 22

 PERT – example-10
Consider the following activities of a project. network of a project that starts at node 1 and
terminate at node 7. The time (days) required to perform each activity is indicated with three
estimated values. Determine the probability that the project will be completed in 25 days.
Immed. Optimistic Most Likely Pessimistic
Activity Predec. Time (Hr.) Time (Hr.) Time (Hr.)
A -- 4 6 8
B -- 1 4.5 5
C A 3 3 3
D A 4 5 6
E A 0.5 1 1.5
F B,C 3 4 5
G B,C 1 1.5 5
H E,F 5 6 7
I E,F 2 5 8
J D,H 2.5 2.75 4.5
K G,I 3 5 7
Prof. Darla / SMEC / VIT Vellore 45
Darla

Solution of PERT – example-10

Constructed network of the given problem

A E H J

B I K
F

Prof. Darla / SMEC / VIT Vellore 46

Darla

Dr. Darla / SMEC / VIT Vellore 23

 Solution of PERT – example-10
Expected mean time and variance of the activity

Activity Expected Mean Time Variance

A (1-2) 6 4/9
B (1-3) 4 4/9
C (2-3) 3 0
D (2-5) 5 1/9
E (2-4) 1 1/36
F (3-4) 4 1/9
G (3-6) 2 4/9
H (4-5) 6 1/9
I (4-6) 5 1
J (5-7) 3 1/9
K (6-7) 5 4/9
Prof. Darla / SMEC / VIT Vellore 47
Darla

Solution of PERT – example-10

Calculations for critical path
Activity ES EF LS LF Slack
A (1-2) 0 6 0 6 0 *critical
B(1-3) 0 4 5 9 5
C(2-3) 6 9 6 9 0*
D (2-5) 6 11 15 20 9
E (2-4) 6 7 12 13 6
F (3-4) 9 13 9 13 0*
G (3-6) 9 11 16 18 7
H (4-5) 13 19 14 20 1
I (4-6) 13 18 13 18 0*
J (5-7) 19 22 20 23 1
K (6-7) 18 23 18 23 0*

Prof. Darla / SMEC / VIT Vellore 48

Darla

Dr. Darla / SMEC / VIT Vellore 24

 Solution of PERT – example 11
An opinion survey involves designing and printing questionnaires, hiring and training personnel, selecting participants,
mailing questionnaires and analyzing data etc. The manager is not in position to determine the duration (days) of activities
involved in the survey project. So he estimates the duration of activities in various conditions like the activity execution
goes extremely well, badly and normal. The project information is tabulated as given below:

Determine the probabilities for the event-3 that will meet a specified scheduled time of 5 days and the event-6 that
will meet a specified scheduled time of 20 days.

Prof. Darla / SMEC / VIT Vellore 49

Darla

Thank you

References: recommended text books in curriculum syllabus.

Prof. Darla / SMEC / VIT Vellore 50

Darla

Dr. Darla / SMEC / VIT Vellore 25

 Thank you

References: recommended text books in curriculum syllabus.

Prof. Darla / SMEC / VIT Vellore 51

Darla

Dr. Darla / SMEC / VIT Vellore 26