Traffic Flow Fundamentals
Traffic Flow Fundamentals
UNINTERRUPTED
Flow occurring at long sections of road where vehicles are not required to
stop by any cause external to the traffic stream.
INTERRUPTED
Flow occurring at intersections or driveways where vehicles are required
to stop by any cause outside the traffic stream such as traffic signs
(STOP or YIELD), traffic signal lights,etc.
q=
N
T
Again if the observation period T is set to one hour, q is called volume and will
have a unit of vehicles per hour. In general, flow rate have units like vehicles per
minute or vehicles per day.
Speed
-is defined as the rate of motion in distance per unit time. When describing traffic
strea, two types of speed are used: time mean speed and space mean speed.
a) Time mean speed
Also called spot speed, time mean speed is simply the arithmetic
mean of the speeds of vehicles passing a point within a given interval of
time. Strictly speaking, distance or length of road must be known in order
to measure speed. However, with the use of speed radar, spot speed can
be measured at a certain point on the road. Also, spot speed can be
reasonably measured if a point is approximated by a short distance say
15-50 m of road. This distance is normally called trap length.
ui=
x
ti
Where:
ui
ti
Knowing the individual speeds of n vehicles observed within the time T, the mean
speed or spot speed of the traffic stream is given by
n
ui
ut = i =1
n
Density or Concentration
-is defined as the number of vehicles in a given length of road at an instant point
in time. If n vehicles are found within the section L, density k is computed as:
k=
n
L
Time Headway
-is defined as the time interval between passage of consecutive vehicles at a
specified point on the road with a unit of time per vehicle.
1
ht =
q
Spacing
-is the distance between two vehicles measured from front bumper of vehicle to
that of another. Similar to the estimation of time headway, if there are n vehicles
within a given road section, the sum of (n-1) spacing s, will be almost equal to L.
Average spacing, therefore, may be computed as the inverse of density.
1
s=
k
Time Occupancy
-it can only be measured, however, if a detector is installed at a specific point on
the carriageway. It is defined as the total time a detector is occupied divided by
the total time of observation.
ti
It is oftentimes useful to determine the relation between any two variables. Surveys at
the South Luzon Expressway were conducted. Scattered plots of the data are shown in
figure 3.5.
us
k
ui=(1 )
k
The equation of the line that gives the relation between speed and density can be easily
determined by ratio and proportion.
ui = uf(1-k/kj)
Solution:
A common way of analyzing relation of two variables is through linear regression.
The so-called best fit line represents the data points with the least error. A scatter
diagram of the data points would show that a linear equation may be well suited for the
analysis.
where
u speed
k density
a, b constants to be determined
The constants a and b are determined using the following formulas. ( The reader
is advised to refer to any statistics books for the derivation of these formulas. See Ang
and Tang 1975.)
b=
k i u in ku
k 2i n k2
a=ub k
sk
su
Where
s 2u=
1
1
(u iu )2s 2k =
(k k )2
n1
n1 i
Point
Ku
K2
(k-83)2
(u-42.5)2
1
2
3
4
Sum
Mean
b=
75
1
142
100
332
83
45
85
10
30
170
42.5
3375
1275
1420
3000
9070
5625
225
20164
10000
36014
64
4626
3481
289
8458
6.25
1806.25
1056.25
156.25
3025
( uiu ) = 41 3205=1008.33
1
s=
n1
2
u
s u=31.75
1
( k ik ) = 3 8458=2819.33
1
s=
n1
2
k
s k =53.10
r=b
sk
53.10
=0.5959
=0.9964
su
31.75
This is almost close to -1.0, which means that the correlation between the two variables
is very high.
There negative sign confirms that as density increases, speed decreases.
Example 3.7
Using the results of the previous example, determine the free flow speed and jam
density.
Solution:
The density-speed relation obtained from the previous example is
u = 91.96-0.5959 k
or
Volume-density relation
Substituting equation 3.9 to the general relation (equation 3.8):
q = ku4 = k uj(1-k/kj) = uj(k-k2/kj)
(3.10)
Due to the symmetry of the figure, it can be said that the maximum flow q max occurs
when the density has a value km equal to half of jam density kj . However , when the
relation cannot be easily identified, it is useful to differentiate the function and equate to
zero to get the value of km corresponding to maximum flow, as follows:
2 km
dq
=u f 1
=0
dk
kj
k m =k j /2
Volume-speed relation
From equation 3.9, it can also shown that
ui
uf
( )
k =k j 1
(3.11)
(3.12)
Again, it can be shown that maximum flow qmax occurs at speed um equal to half
of the free flow speed uf.
Therefore, the value of the maximum flow, also called capacity is
q max=k m x um =
k j uf k juf
x =
2 2
4
Going back to the speed density relation, qmax is shown to be the shaded area
of the rectangle.
Example 3.8
In the previous example ,determine the capacity of the rural highway in
one direction.
Solution:
As already shown, the density-speed relation can be moldeled by a straight line.
The formula for qmax can be used to compute for the capacity.
q max=
k j u f 154.32 91.96
x =
x
=3,547.82 vehicle /hr
2 2
2
2
DESCRIPTION
Free flow, with low volumes and high speeds. Drivers are virtually
unaffected by the presence of others. Little or no restriction in
LEVEL OF
SERVICE
A
B
C
D
E
F
VOLUME-CAPACITY RATIO
Less than 0.20
0.21 0.50
0.51 0.70
0.71 0.85
0.86 1.00
Greater than 1.0
Measure of Effectiveness for Different Types
Type of Facility
Measure of Effectiveness
Unsignalized intersections
Arterials
Let
Ni number of cars passing station i during time interval
qi flow (volume) passing station I during
By definition,
qi =
Ni
t
(3.13)
N =( N 2N 1)
With
Let k :
q=
N
; N = q t
t
Then,
k=
( N 2N 1 ) N
=
;( period for building)
x
x
N= k x
(3.15)
q k
+
=0 (3.16)
x t
With q = uk
(uk ) k
+ =0
x
t
(3.17)
Expanding :
k
k
u
+u
+k
=0 ;
t
x
x
(3.18)
(3.19)
'
k
k
+u
+k u x =0;
t
x
k
k
+ ( u +k u' ) =0
t
x
(3.20)
du c 2 k
=
dt
k x
(3.21)
k
x
k
x is negative, the traffic flow tends to faster.
(3.22)
'
u
k
u+u t +c 2 k n
=0
x
x
k
k 2 n k
u+u '
c k
=0
x
t
x
(3.23)
This exactly has the same form as equation 3.20. Equating equations 3.20 and
3.23 :
k
c k k k (
k
+ u+ '
= + u+ k u' ) =0
t
x
u x t
c k
u+ ' =( u+k u' )
u
(u' )2 =c 2 k n1 ; u' =
du
=c k (n1)/2
dk
Considering that u and k always have an inverse relationship, the negative sign
is added on the right side of the equation.
du
=ck (n 1)/ 2
dk
(3.24)
We can now consider some specific models, the first of which is the
Greenshields model (n=1).
du
0
=c k =c ; du=cdk
dk
u=ck + a
When k=0 ; u = uf . Therefore a = uf .
u = uf ck
c=
uf
kj
k
)
kj
Greenbergs model : n = -1
(3.25)
Parabolic model : n = 0
Table 3.4 summarizes the different macroscopic models depending on the value
of n:
Table 3.4
Macroscopic Models
Element
n-1
n=-1
n=0
n>-1
Constant of
proportionality
uf
kj
um
uf
(n+1)u f
2 k (nj +1)/2
u-k relation
u=u f (1
2k
k
)
kj
1/2
j
k
u=u m (ln j )
k
k 1 /2
1( )
kj
]
u=uf
Optimum
density , kn
kj
2
kj
e
4
k
9 j
Optimum
speed, Un
uj
2
uj
3
3.6
k
u=u f [1
kj
( )
k j(
n+1
2
QUEUING THEORY
n+1
)u
n+3 f
planes waiting before being given the signal land or takeoff-these are everyday
occurrences that would surely test ones patience.
Queuing analysis provides was assessing the impacts of these activities by
knowing the magnitude of vehicular delay and the extent of queue propagated. The
models that will discussed in this section are derived based on some assumptions
related to arrival and departure patterns and the prevailing queue discipline. Consider
the system shown in figure 3.7.
Service station
Input
Output
Figure 3.7
Queuing system
The input is normally characterized by some form of arrival pattern usually given
by its arrival distribution. The output generally depends on the queue discipline and the
service mechanism at the service station. The most common type of queue discipline is
the so-called FIFO or first-in first out, i.e., the first one that arrives at the service station
gets served first and therefore the first to leave the system as well. (Another type of
queue discipline, which has limited application to traffic flow, is the so-called LIFO or
last-in first-out. Typical examples of this discipline are the following: the last rider of an
elevator normally gets out first; the last document piled on top gets signed first-not a
recommended practice!) Service mechanism refers to the manner customers are served
at the station. For example, a toll booth that charges a single fee, accepts only a fixed
amount, and does not give back any change will have a fairly uniform service rate
compared to a booth that charges variable toll fees and gives back change up to the last
centavo.
Kendalls notation is popularly used to describe queuing system. It takes the form
A B C (n)
Where
A represents the input or arrival pattern
M M 1()
queue
D D 1(100) - regular arrival; regular service rate or departure; single server;
limit of queue is 100
A combination of Markov and deterministic processes, say M/D/1 may also
be used.
3.6.1 D/D/1 Queuing
Due to the regularity of both arrivals and departures, it is more convenient to
analyse a D/D/1 queuing system graphically. Arrivals and departures are easily
represented by straight lines with the slopes corresponding to their rates.
The M/D/I queuing system assumes that the arrival of vehicles follow a negative
exponential distributions, a probability distribution characterized by randomness.
Departure is assumed to be regular as in the D/D/1. The reader is advised to refer to
other books on queuing theory for the derivation of formulas.
Let - arrival rate; and - departure rate.
Then
Note that if
then
2
m=
2(1)
b. Average waiting time
w=
2 (1 )
2
2 (1)
m=
2
()
( )
1
( )
Otherwise the driver may have to wait in queue if all gates are full. Again the
arrivals are assumed with a rate of and the service rate per server is . is still
defined as
. However,
m=
Po
[
N!N
1
N
(3.32)
Where
Pw = N 1
n=0
1
N
N !(1
p
)
N
(3.33)
+ m
1
(3.34)