NETWORK ANALYSIS

-Vehicles flow through

a network of roads-
Siti Madhihah Abdul Rahman
Siti Khirnie Kasbolah
Nur Fatihah Halim
PISMP Mathematics 2008
 Introduction
• The road below represent an area of
downtown Jacksonville, Florida.
• The streets are all one-way with the
arrows indicating the direction of
traffic flow.
• The traffic is measured in vehicles
per hour (vph).
• The figures in and out of the network
given here are based on midweek peak
traffic hours, 7 am to 9 am and 4 pm
to 6 pm.
 Road Of Downtown
Jacksonville , Florida
225 350

A Duval B
400 Street 125
f1 Laura
Street
Hogan f2 f4
Street
D Monroe C
800 Street 300
f3

250 600
 Problems to solve
(a) Set up and solve a system of linear
equations to find the possible flows
f1, f2, f3 and f4
(b) If traffic is regulated on B to C,

so that f4 = 300 vehicles per hours,

what will the average flows on the
streets be?
(c) What are the minimum and maximum

possible flows on each street?

 Question (a)
• Set up and solve a
system of linear
equations to find
the possible flows
for f1, f2, f3 and f4.
 Assume that the following
traffic law applies

– ‘All traffic entering an

intersection must leave that
intersection.’

 Road Of Downtown
Jacksonville , Florida
225 350

A Duval B
400 Street 125
f1 Laura
Street
Hogan f2 f4
Street
D Monroe C
800 Street 300
f3

250 600
Intersections Traffic In Traffic Out Linear
A f1 + f2 400+225 equation
f1 + f2 =
625
B 350 +125 f1 + f4 f1 + f4 =475

C f3 + f4 600 + 300 f3 +f4 = 900

D 800 +250 f2 + f3 f2 + f3
=1050
 The constraints on the traffic
are described by the following
system of linear equations.
 A = f1 + f2 = 625
 B = f1 +f4 = 475
 C = f3+f4 = 900
 D = f2+f3 = 1050
•
• The method of Gauss Jordan
elimination is used to solve
this system of equation.
•
• The augmented matrix and
reduced echelon form of the
preceding system are as
follows.
Using Gauss Jordan
Elimination
 1 0 0 625 
1 1 0 0 1 475 
1 0 0 1 475  1
  R2 R1  1 0 0 625  R2 = R2 - R1
0 0 1 1 900  0 0 1 1 900 
   
 0 1 1 0 1050  0 1 1 0 1050

1 0 0 1 475  1 0 0 1 475
0 150  0
 1 0 −1 R4 = R4 – R2  1 0 −1 150
R4 = R4 - R3
0 0 1 1 900  0 0 1 1 900
   
0 1 1 0 1050 0 0 1 1 900

1 0 0 1 475
0 1 0 − 1 150 

0 0 1 1 900
 
0 0 0 0 0 
The system of equations that
correspond to this reduced row
echelon form is
Øf1 + f4 = 475
Øf2 – f4 = 150
Øf3 + f4 = 900
We see that f4 is free variable.
Therefore, the linear system is
consistent and we have infinitely
many solutions.

• Expressing each leading
variable in terms of the
remaining variable
• Thus the possible flows are :
Øf1 = 475 – f4
Øf2 = 150 + f4
Øf3 = 900 – f4
Øf4 = free variables
Ø
 Question (b)
• If traffic is
regulated on B to C,
so that f4 = 300
vehicles per hours,
what will the average
flows on the streets
be?
 Road Of Downtown
Jacksonville , Florida
225 350

A Duval B
400 Street 125
f1 Laura
Street
Hogan f2 f4
Street
D Monroe C
800 Street 300
f3

250 600
• When, f4 = 300 vph
•
• Therefore the other flows are,
 f1= 475 – 300 = 175 vph
 f2 = 150 + 300 = 450 vph
 f3 = 900 – 300 = 600 vph
 Question (c)
• What are the minimum
and maximum possible
flows on each street?
• f4 is free variable. Therefore, we
setting f4 = t and we obtain


• f1 = 475 – t
• f2 = 150 + t
• f3 = 900 – t
• Each of the flows must be
nonnegative.
• Examining the first equation, we
see t ≤ 475 (otherwise,
f1 would be negative).
• The second equation contributes
no further restrictions on our
parameter t.
• Examining the third equation, we
see t ≤ 900 (otherwise,
f3would be negative), so we have
deduced that 0 ≤ t ≤ 475.
  Combining this result with
the four equations, we see
that
 0 ≤ f1≤ 475
 150 ≤ f2 ≤ 625
 425 ≤ f3 ≤ 900
 0 ≤ f4 ≤ 475
 We now have a complete
description of the possible
flows through this network.

• As the conclusion, to make the
flow is nonnegative, we have to
make sure that the number of
cars that go through the road
must be same with the number of
cars that go out from the road.