Tom Matthew
Tom Matthew
Chapter 1
1.1 Overview
Traffic engineering pertains to the analysis of the behavior of traffic and to design the facilities
for a smooth, safe and economical operation of traffic. Traffic flow, like the flow of water,
has several parameters associated with it. The traffic stream parameters provide information
regarding the nature of traffic flow, which helps the analyst in detecting any variation in flow
characteristics. Understanding traffic behavior requires a thorough knowledge of traffic stream
parameters and their mutual relationships. In this chapter the basic concepts of traffic flow is
presented.
includes density and flow of traffic and measurements of quality which includes speed. The
traffic stream parameters can be macroscopic which characterizes the traffic as a whole or
microscopic which studies the behavior of individual vehicle in the stream with respect to each
other.
As far as the macroscopic characteristics are concerned, they can be grouped as measurement
of quantity or quality as described above, i.e. flow, density, and speed. While the microscopic
characteristics include the measures of separation, i.e. the headway or separation between
vehicles which can be either time or space headway. The fundamental stream characteristics
are speed, flow, and density and are discussed below.
1.3 Speed
Speed is considered as a quality measurement of travel as the drivers and passengers will be
concerned more about the speed of the journey than the design aspects of the traffic. It is
defined as the rate of motion in distance per unit of time. Mathematically speed or velocity v
is given by,
d
v= (1.1)
t
where, v is the speed of the vehicle in m/s, d is distance traveled in m in time t seconds. Speed
of different vehicles will vary with respect to time and space. To represent these variation,
several types of speed can be defined. Important among them are spot speed, running speed,
journey speed, time mean speed and space mean speed. These are discussed below.
1.4 Flow
There are practically two ways of counting the number of vehicles on a road. One is flow or
volume, which is defined as the number of vehicles that pass a point on a highway or a given
lane or direction of a highway during a specific time interval. The measurement is carried out
by counting the number of vehicles, nt , passing a particular point in one lane in a defined period
t. Then the flow q expressed in vehicles/hour is given by
nt
q= (1.2)
t
Flow is expressed in planning and design field taking a day as the measurement of time.
The relationship between AAWT and AWT is analogous to that between AADT and ADT.
Volume in general is measured using different ways like manual counting, detector/sensor count-
ing, moving-car observer method, etc. Mainly the volume study establishes the importance of
a particular route with respect to the other routes, the distribution of traffic on road, and the
fluctuations in flow. All which eventually determines the design of a highway and the related
facilities. Thus, volume is treated as the most important of all the parameters of traffic stream.
1.5 Density
Density is defined as the number of vehicles occupying a given length of highway or lane and
is generally expressed as vehicles per km. One can photograph a length of road x, count the
number of vehicles, nx , in one lane of the road at that point of time and derive the density k
as,
nx
k= (1.3)
x
This is illustrated in figure 1:1. From the figure, the density is the number of vehicles between
the point A and B divided by the distance between A and B. Density is also equally important
as flow but from a different angle as it is the measure most directly related to traffic demand.
Again it measures the proximity of vehicles in the stream which in turn affects the freedom to
maneuver and comfortable driving.
distance headway and travel time. They are discussed one by one below.
But the flow is defined as the number of vehicles nt measured in time interval t, that is,
nt nt 1
q= = Pnt = (1.5)
t 1 hi hav
where, hav is the average headway. Thus average headway is the inverse of flow. Time headway
is often referred to as simply the headway.
distance
distance
time time
(a) (b)
distance
time
(c)
proportional to the speed. However, in practice, the speed of a vehicle fluctuates over time and
the travel time represents an average measure.
From the figure, steeply increasing section of x(t) denote a rapidly advancing vehicle and
horizontal portions of x(t) denote a stopped vehicle while shallow sections show a slow-moving
vehicle. A straight line denotes constant speed motion and curving sections denote accelerated
motion; and if the curve is concave downwards it denotes acceleration. But a curve which is
convex upwards denotes deceleration.
x2
spacing (s)
headway(h)
distance
x1
t1
t t2
Time
1.8 Summary
Speed, flow and density are the basic parameters of traffic flow. Different measures of speed
are used in traffic flow analysis like spot speed, time mean speed, space mean speed etc. Time-
space diagram also can be used for determining these parameters. Speed and flow of the traffic
stream can be computed using moving observer method.
1.9 References
1. Highway Capacity Manual. Transportation Research Board. National Research Council,
Washington, D.C., 2000.
3. Adolf D. May. Fundamentals of Traffic Flow. Prentice - Hall, Inc. Englewood Cliff New
Jersey 07632, second edition, 1990.
4. William R McShane, Roger P Roesss, and Elena S Prassas. Traffic Engineering. Prentice-
Hall, Inc, Upper Saddle River, New Jesery, 1998.
Chapter 2
2.1 Overview
Speed is one of the basic parameters of traffic flow and time mean speed and space mean
speed are the two representations of speed. Time mean speed and space mean speed and the
relationship between them will be discussed in detail in this chapter. The relationship between
the fundamental parameters of traffic flow will also be derived. In addition, this relationship
can be represented in graphical form resulting in the fundamental diagrams of traffic flow.
1X
n
vt = vi , (2.1)
n i=1
where vi is the spot speed of ith vehicle, and n is the number of observations. In many speed
studies, speeds are represented in the form of frequency table. Then the time mean speed is
given by, Pn
qi vi
vt = Pi=1
n , (2.2)
i=1 qi
where qi is the number of vehicles having speed vi , and n is the number of such speed categories.
This is simply the harmonic mean of the spot speed. If the spot speeds are expressed as a
frequency table, then, Pn
qi
vs = Pni=1 qi (2.5)
i=1 vi
where qi vehicle will have vi speed and ni is the number of such observations.
Numerical Example
If the spot speeds are 50, 40, 60, 54 and 45, then find the time mean speed and space mean
speed.
Numerical Example
The results of a speed study is given in the form of a frequency distribution table. Find the
time mean speed and space mean speed.
Solution The time mean speed and space mean speed can be found out from the frequency
table given below. First, the average speed is computed, which is the mean of the speed range.
For example, for the first speed range, average speed, vi = 2+5
2
= 3.5 seconds. The volume of
flow qi for that speed range is same as the frequency. The terms vi .qi and vqii are also tabulated,
50 50 50 50
100 100
Figure 2:1: Illustration of relation between time mean speed and space mean speed
Σqi vi
and their summations given in the last row. Time mean speed can be computed as, vt = Σqi
=
142
12
= 11.83. Similarly, space mean speed can be computed as, vs = ΣΣqqii = 3.28
12
= 3.65.
vi
duration of time. For this reason, in many fundamental traffic equations, space mean speed is
preferred over time mean speed.
q = k × vs (2.8)
qi = ki × vi (2.9)
The summation of all sub-stream flows will give the total flow q:
Σqi = q. (2.10)
Similarly the summation of all sub-stream density will give the total density k.
Σki = k. (2.11)
Space mean speed averages the speed over space. Therefore, if ki vehicles has vi speed, then
space mean speed is given by,
Σki vi
vs = . (2.13)
k
Time mean speed averages the speed over time. Therefore,
Σqi vi
vt = . (2.14)
q
Substituting 2.9, vt can be written as,
Σki vi 2
vt = (2.15)
q
Rewriting the above equation and substituting 2.12, and then substituting 2.8, we get,
ki
vt = kΣ vi2
k
kΣfi vi 2
=
q
Σfi vi 2
=
vs
By adding and subtracting vs and doing algebraic manipulations, vt can be written as,
Σfi (vs + (vi − vs ))2
vt = (2.16)
vs
Σfi (vs ) + (vi − vs )2 + 2.vs .(vi − vs )
2
= (2.17)
vs
Σfi vs 2 Σfi (vi − vs )2 2.vs .Σfi (vi − vs )
= + + (2.18)
vs vs vs
The third term of the equation will be zero because Σfi (vi − vs ) will be zero, since vs is the
mean speed of vi . The numerator of the second term gives the standard deviation of vi . Σfi
by definition is 1.Therefore,
σ2
vt = vs Σfi + +0 (2.19)
vs
σ2
= vs + (2.20)
vs
Hence, time mean speed is space mean speed plus standard deviation of the spot speed divided
by the space mean speed. Time mean speed will be always greater than space mean speed since
standard deviation cannot be negative. If all the speed of the vehicles are the same, then spot
speed, time mean speed and space mean speed will also be same.
Numerical Example
For the data given below,compute the time mean speed and space mean speed. Also verify the
relationship between them. Finally compute the density of the stream.
Solution The solution of this problem consist of computing the time mean speed vt =
Σqi vi σ2
Σqi
,space mean speed vs = Σq
Σqi ,verifying their relation by the equation vt = vs + v ,and
i
s
vi
using this to compute the density. To verify their relation, the standard deviation also need to
2
be computed σ 2 = Σqv
Σq
− vt2 . For convenience,the calculation can be done in a tabular form as
shown in table 2.5.1.
The time mean speed(vt ) is computed as:
Σqi vi
vt =
Σqi
2510
= = 28.52
88
Σqi
vs = Σqi
vi
88
= = 20.38
4.3187
Σqv 2
σ2 = − vt2
Σq
83800
= − 28.522 = 138.727
88
The time mean speed can also vt can also be computed as:
σ2 138.727
vt = vs + = 20.38 + = 27.184
vs 20.38
n1 = q. (2.21)
Similarly, by definition, density is the number of vehicles in unit distance. Therefore number
of vehicles n2 in a road stretch of distance v1 will be density × distance.Therefore,
n2 = k × v. (2.22)
8 7 6 5 4 3 2 1
Since all the vehicles have speed v, the number of vehicles counted in 1 hour and the number
of vehicles in the stretch of distance v will also be same.(ie n1 = n2 ). Therefore,
q = k × v. (2.23)
This is the fundamental equation of traffic flow. Please note that, v in the above equation refers
to the space mean speed will also be same.
1. When the density is zero, flow will also be zero,since there is no vehicles on the road.
2. When the number of vehicles gradually increases the density as well as flow increases.
3. When more and more vehicles are added, it reaches a situation where vehicles can’t move.
This is referred to as the jam density or the maximum density. At jam density, flow will
be zero because the vehicles are not moving.
4. There will be some density between zero density and jam density, when the flow is maxi-
mum. The relationship is normally represented by a parabolic curve as shown in figure 2:3
B
qmax
A
q D E
flow(q)
O kjam
k0 k1 kmax k2
density (k)
The point O refers to the case with zero density and zero flow. The point B refers to the
maximum flow and the corresponding density is kmax . The point C refers to the maximum
density kjam and the corresponding flow is zero. OA is the tangent drawn to the parabola at O,
and the slope of the line OA gives the mean free flow speed, ie the speed with which a vehicle
can travel when there is no flow. It can also be noted that points D and E correspond to same
flow but has two different densities. Further, the slope of the line OD gives the mean speed at
density k1 and slope of the line OE will give mean speed at density k2 . Clearly the speed at
density k1 will be higher since there are less number of vehicles on the road.
uf
speed u
uf
u2
speed u
u1
u0
q Qmax
flow q
speed u
speed u
density k qmax
flow q
flow q
density k
2.8 Summary
Time mean speed and space mean speed are two important measures of speed. It is possible to
have a relation between them and was derived in this chapter. Also, time mean speed will be
always greater than or equal to space mean speed. The fundamental diagrams of traffic flow
are vital tools which enables analysis of fundamental relationships. There are three diagrams -
speed-density, speed-flow and flow-density. They can be together combined in a single diagram
as discussed in the last section of the chapter.
2.9 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
Chapter 3
3.1 Overview
To figure out the exact relationship between the traffic parameters, a great deal of research
has been done over the past several decades. The results of these researches yielded many
mathematical models. Some important models among them will be discussed in this chapter.
where v is the mean speed at density k, vf is the free speed and kj is the jam density. This
equation ( 3.1) is often referred to as the Greenshield’s model. It indicates that when density
becomes zero, speed approaches free flow speed (ie. v → vf when k → 0). Once the relation
between speed and flow is established, the relation with flow can be derived. This relation
between flow and density is parabolic in shape and is shown in figure 3:3. Also, we know that
q = k.v (3.2)
uf
speed u
uf
u
speed, u
u0 q qmax
flow, q
B
qmax
A
q D E
flow(q)
O kjam
k0 k1 kmax k2
density (k)
Similarly we can find the relation between speed and flow. For this, put k = vq in equation 3.1
and solving, we get
kj 2
q = kj .v − v (3.4)
vf
This relationship is again parabolic and is shown in figure 3:2. Once the relationship between
the fundamental variables of traffic flow is established, the boundary conditions can be derived.
The boundary conditions that are of interest are jam density, free-flow speed, and maximum
flow. To find density at maximum flow, differentiate equation 3.3 with respect to k and equate
it to zero. ie.,
dq
= 0
dk
vf
vf − .2k = 0
kj
kj
k =
2
Thus the maximum flow is one fourth the product of free flow and jam density. Finally to get
the speed at maximum flow, v0 , substitute equation 3.5 in equation 3.1 and solving we get,
vf kj
v0 = vf − .
kj 2
vf
v0 = (3.6)
2
Therefore, speed at maximum flow is half of the free speed.
a = ȳ − bx̄ (3.8)
where xi and yi are the samples, n is the number of samples, and x̄ and ȳ are the mean of xi
and yi respectively.
Numerical example
For the following data on speed and density, determine the parameters of the Greenshield’s
model. Also find the maximum flow and density corresponding to a speed of 30 km/hr.
k v
171 5
129 15
20 40
70 25
x(k) y(v) (xi − x̄) (yi − ȳ) (xi − x̄)(yi − ȳ) (xi − x̄2 )
171 5 73.5 -16.3 -1198.1 5402.3
129 15 31.5 -6.3 -198.5 992.3
20 40 -77.5 18.7 -1449.3 6006.3
70 25 -27.5 3.7 -101.8 756.3
390 85 -2947.7 13157.2
Solution Denoting y = v and x = k, solve for a and b using equation 3.8 and equation 3.9.
The solution is tabulated as shown below. x̄ = Σx n
= 390
4
= 97.5, ȳ = Σy
n
= 85
4
= 21.3. From
equation 3.9, b = −2947.7
13157.2
= -0.2 a = y − bx̄ = 21.3 + 0.2×97.5 = 40.8 So the linear regression
equation will be,
v = 40.8 − 0.2k (3.10)
v
Here vf = 40.8 and kfj = 0.2. This implies, kj = 40.8
0.2
= 204 veh/km. The basic parameters of
Greenshield’s model are free flow speed and jam density and they are obtained as 40.8 kmph
and 204 veh/km respectively. To find maximum flow, use equation 3.6, i.e., qmax = 40.8×204
4
=
2080.8 veh/hr Density corresponding to the speed 30 km/hr can be found out by substituting
v = 30 in equation 3.10. i.e, 30 = 40.8 - 0.2 × k Therefore, k = 40.8−30
0.2
= 54 veh/km.
speed, v
density, k
density, k
qA, vA, kA qB , vB , kB
When n is set to one, Pipe’s model resembles Greenshield’s model. Thus by varying the values
of n, a family of models can be developed.
vA
qA A
vB
flow
B
qB
kA density kB kj
B
A
time
stream is also plotted in figure 3:8. All the lines are having the same slope which implies that
they are moving with constant speed. The sudden change in the characteristics of the stream
leads to the formation of a shock wave. There will be a cascading effect of the vehicles in the
upstream direction. Thus shock wave is basically the movement of the point that demarcates
the two stream conditions. This is clearly marked in the figure 3:7. Thus the shock waves
produced at state B are propagated in the backward direction. The speed of the vehicles at
state B is the line joining the origin and point B of the flow-density curve. Slope of the line AB
gives the speed of the shock wave (refer figure 3:7). If speed of the shock-wave is represented
as ωAB , then
qA − qB
ωAB = (3.14)
kA − kB
The above result can be analytically solved by equating the expressions for the number vehicles
leaving the upstream and joining the downstream of the shock wave boundary (this assumption
is true since the vehicles cannot be created or destroyed. Let NA be the number of vehicles
leaving the section A. Then, NA = qB t. The relative speed of these vehicles with respect to
the shock wave will be vA − ωAB . Hence,
Equating equations 3.15 and 3.16, and solving for ωAB as follows will yield to:
NA = NB
kA (vA − ωAB ) t = kB (vB − ωAB ) t
kA vA t − kA ωAB t = kB vB t − kB ωAB t
kA ωAB t − kB ωAB t = kA vA − kB vB
ωAB (kA − kB ) = qA − qB
This will yield the following expression for the shock-wave speed.
qA − qB
ωAB = (3.17)
kA − kB
In this case, the shock wave move against the direction of traffic and is therefore called a
backward moving shock wave. There are other possibilities of shock waves such as forward
moving shock waves and stationary shock waves. The forward moving shock waves are formed
when a stream with higher density and higher flow meets a stream with relatively lesser density
and flow. For example, when the width of the road increases suddenly, there are chances for a
forward moving shock wave. Stationary shock waves will occur when two streams having the
same flow value but different densities meet.
the empirical observation or from microscopic theories. Therefore, the flow rate q is a function
of the vehicular density k; q = q(k). Thus, the balance equation takes the form
q(k2 ) − q(k1 )
vs = (3.24)
k2 − k1
where q(k2 ) and q(k1 ) are the flow rates corresponding to the upstream density k2 and down-
stream density k1 of the shock wave. Unlike Stock’s shock wave formula there is only one
variable here.
3.7 Summary
Traffic stream models attempt to establish a better relationship between the traffic parameters.
These models were based on many assumptions, for instance, Greenshield’s model assumed a
linear speed-density relationship. Other models were also discussed in this chapter. The models
are used for explaining several phenomena in connection with traffic flow like shock wave. The
topics of further interest are multi-regime model (formulation of both two and three regime
models) and three dimensional representation of these models.
3.8 References
1. Adolf D. May. Fundamentals of Traffic Flow. Prentice - Hall, Inc. Englewood Cliff New
Jersey 07632, second edition, 1990.
Chapter 4
4.1 Overview
For a complete description of traffic stream modeling, one would require flow, speed, and density.
Obtaining these parameters simultaneously is a difficult task if we use separate techniques.
Since we have a fundamental equation of traffic flow, which gives the flow as the product of
density and space mean speed, if we knew any two parameters, the third can be computed.
Moving car or moving observer method of traffic stream measurement has been developed to
provide simultaneous measurement of traffic stream variables. It has the advantage of obtaining
the complete state with just three observers, and a vehicle. Determination of any of the two
parameters of the traffic flow will provide the third one by the equation q = u.k. Thus,
moving observer method is the most commonly used method to get the relationship between
the fundamental stream characteristics. In this method, the observer moves in the traffic stream
unlike all other previous methods.
4.2 Theory
Consider a stream of vehicles moving in the north bound direction. Two different cases of
motion can be considered. The first case considers the traffic stream to be moving and the
observer to be stationary. If no is the number of vehicles overtaking the observer during a
period, t, then flow q is nt0 , or
n0 = q × t (4.1)
The second case assumes that the stream is stationary and the observer moves with speed vo .
If np is the number of vehicles overtaken by observer over a length l, then by definition, density
k is nlp , or
np = k × l (4.2)
or
np = k.vo .t (4.3)
where v0 is the speed of the observer and t is the time taken for the observer to cover the road
stretch. Now consider the case when the observer is moving within the stream. In that case
mo vehicles will overtake the observer and mp vehicles will be overtaken by the observer in the
test vehicle. Let the difference m is given by m0 - mp , then from equation 4.1 and equation
4.3,
m = m0 − mp = q t − k vo t (4.4)
This equation is the basic equation of moving observer method, which relates q, k to the counts
m, t and vo that can be obtained from the test. However, we have two unknowns, q and k, but
only one equation. For generating another equation, the test vehicle is run twice once with the
traffic stream and another one against traffic stream, i.e.
mw = q tw − k vw tw (4.5)
= q tw − k l
ma = q ta + k va ta (4.6)
= q ta + k l
where, a, w denotes against and with traffic flow. It may be noted that the sign of equation 4.6
is negative, because test vehicle moving in the opposite direction can be considered as a case
when the test vehicle is moving in the stream with negative velocity. Further, in this case, all
the vehicles will be overtaking, since it is moving with negative speed. In other words, when the
test vehicle moves in the opposite direction, the observer simply counts the number of vehicles
in the opposite direction. Adding equation 4.5 and 4.6, we will get the first parameter of the
mw tavg
= tw (1 − ) = tw − tavg
q tw
mw l
tavg = tw − = ,
q v
Rewriting the above equation, we get the second parameter of the traffic flow, namely the mean
speed vs and can be written as,
l
vs = (4.8)
tw − mqw
Thus two parameters of the stream can be determined. Knowing the two parameters the third
parameter of traffic flow density (k) can be found out as
q
k= (4.9)
vs
For increase accuracy and reliability, the test is performed a number of times and the average
results are to be taken.
4.3 Proof
4.4 Assumptions
Numerical Example
The length of a road stretch used for conducting the moving observer test is 0.5 km and the speed
with which the test vehicle moved is 20 km/hr. Given that the number of vehicles encountered
in the stream while the test vehicle was moving against the traffic stream is 107, number of
vehicles that had overtaken the test vehicle is 10, and the number of vehicles overtaken by the
test vehicle is 74, find the flow, density and average speed of the stream.
Solution Time taken by the test vehicle to reach the other end of the stream while it is
moving along with the traffic is tw = 0.5
20
= 0.025 hr
Time taken by the observer to reach the other end of the stream while it is moving against the
traffic is ta = tw = 0.025 hr
Flow is given by equation, q = 107+(10−74)
0.025+0.025
= 860 veh/hr
0.5
Stream speed vs can be found out from equationvs = 0.025− 10.74 = 5 km/hr
860
860
Density can be found out from equation as k = 5
= 172veh/km
Numerical Example
The data from four moving observer test methods are shown in the table. Column 1 gives
the sample number, column 2 gives the number of vehicles moving against the stream, column
3 gives the number of vehicles that had overtaken the test vehicle, and last column gives the
number of vehicles overtaken by the test vehicle. Find the three fundamental stream parameters
for each set of data. Also plot the fundamental diagrams of traffic flow.
Sample no. 1 2 3
1 107 10 74
2 113 25 41
3 30 15 5
4 79 18 9
Solution From the calculated values of flow, density and speed, the three fundamental dia-
grams can be plotted as shown in figure 4:2.
ma +mw l q
Sample no. ma mo mp mw = (mo − mp ) ta tw q= ta +tw
u= tw − mqw
k= v
800
40
speed u
speed u
25.14 1760
15.04 1940
5.03 860
density k flow q
flow q
20 70 129171
density k
4.5 Summary
Traffic engineering studies differ from other studies in the fact that they require extensive data
from the field which cannot be exactly created in any laboratory. Speed data are collected
from measurements at a point or over a short section or over an area. Traffic flow data are
collected at a point. Moving observer method is one in which both speed and traffic flow data
are obtained by a single experiment.
4.6 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
Chapter 5
Measurement at a Point
5.1 Introduction
The data required by a traffic engineer can mainly be observed on field rather than at laboratory.
Now the field studies can be classified into three types depending upon the length of observation:
1. Measurement at a point
Out of these we will be discussing the first type here. Flow is the main traffic parameter
measured at a point. Flow can be defined as the no of vehicles passing a section per unit time.
Traffic volume studies are mainly carried out to obtain factual data concerning the movement
of vehicles at selected point on the street or highway system.
This is given by the total no. of vehicles passing through a section in a year divided by 365.
This can be used for following purposes:
3. Evaluating the present traffic flow with respect to the street system
4. Locating areas where new facilities or improvements to existing facilities are needed.
This is defined as the average 24-hour traffic volume occurring on weekdays over a full year.
An average 24-hour traffic volume at a given location for some period of time less than a year.
It may be measured for six months, a season, a month, a week, or as little as two days. An
ADT is a valid number only for the period over which it was measured.
An average 24-hour traffic volume occurring on weekdays for some period of time less than one
year, such as for a month or a season.
Cordon Count
These are made at the perimeter of an enclosed area (CBD, shopping center etc.). Vehicles or
persons entering and leaving the area during a specified time period are counted.
These are classified counts taken at all streets intersecting an imaginary line (screen line)
bisecting the area. These counts are used to determine trends, expand urban travel data,
traffic assignment etc.
Pedestrian Count
These are used in evaluating sidewalk and crosswalk needs, justifying pedestrian signals, traffic
signal timings etc.
Intersection Count
These are measured at the intersections and are used in planning turn prohibitions, designing
channelization, computing capacity, analyzing high accident intersections etc.
Manual counting
In its simplest form an observer counts the numbers of vehicles along with its type, passing
through the section for a definite time interval. For light volumes, tally marks on a form are
adequate. Mechanical or electrical counters are used for heavy traffic. Although it is good to
take some manual observations for every counting for checking the instruments, some other
specific uses of manual counts are following:
1. Turning and through movement studies
3. For analysis of crosswalks, sidewalks, street corner space and other pedestrian facilities
Automatic counting
These can be used to obtain vehicular counts at non-intersection points. Total volume, direc-
tional volume or lane volumes can be obtained depending upon the equipment available.
Permanent Counters
These are installed to obtain control counts on a continuous basis. A detector (sensor) which
responds on the passage of vehicle past a selected point is an essential part of this type of
counters. These can be mainly grouped into contact types, pulsed types, radar types. Among
the contact type counters, pneumatic tubes are mostly used. Air pulse actuated by vehicle
wheels, pass along the tube thereby increasing the count. Pulsed types mainly depend upon
the interruption of a beam generated from a station located near the site, which is detected
by the receiver. In radar types, a continuous beam of energy is directed towards the vehicle.
The frequency shift of energy reflected from approaching vehicle is conceived by sensors. Due
to tedious reduction of the voluminous amount of data obtained, use of such counters was
decreasing. But the use of computers and data readable counters has reversed the trend.
Portable Counters
These are used to obtain temporary or short term counts. Generally these make use of a
transducer unit actuated by energy pulses. Each axle or vehicle passage operates a switch
attached to a counter which is usually set to register one unit for every two axles. If significant
number of multi-axle vehicles is present, an error is introduced. A correction factor, obtained
from a sample classification count, is introduced to reduce this error. This can further be
sub-divided into two types:
1. 24-hour counts normally covering any 24-hour period between noon Monday and noon
Friday. If a specific day count is desired, the count should be from midnight to midnight.
4. Peak Period counting times vary depending upon size of metropolitan area, proximity to
major generators and the type of facility. Commonly used periods are 7 to 9 am and 4
to 6 pm.
flow. Weekdays, Saturdays and Sundays usually show different patterns. That’s why comparing
day with day is much more useful. Peak Hour Volume is very important factor in the design of
roads and control of traffic, and is usually 2 - 2.5 times the average hourly volume. Apart from
this there is one additional feature of this variation: two dominant peaks (morning and evening
peak), especially in urban areas. These mainly include work trips and are not dependent on
weather and other travel conditions.
Similar to daily variation, weekly variation gives volumes expressed as a percentage of total
flow for the week. Weekdays flows are approximately constant but the weekend flows vary a
lot depending upon the season, weather and socio-economic factors. Seasonal variation is the
most consistent of all variation patterns and represents the economic and social condition of
the area served.
Peak hour factors should be applied in most capacity analyses in accordance with the
Highway Capacity Manual, which selected 15 minute flow rates as the basis for most of its
procedures. The peak-hour factor (PHF) is descriptive of trip generation patterns and may
apply to an area or portion of a street and highway system. The PHF is typically calculated
from traffic counts. It is the average volume during the peak 60 minute period Vav60 divided by
four times the average volume during the peak 15 minute’s period Vav15 .
60
Vav
P HF = (5.1)
4 × Vav15
One can also use 5, 10, or 20 minutes instead of 15 minutes interval for the calculation of
PHF. But in that case we have to change the multiplying factor in the denominator from 4.
Generalizing,
V 60
P HF = 60 av n (5.2)
n
× V av
where Vavn is the peak n minute flow. The Highway Capacity Manual advises that in absence
of field measurements reasonable approximations for peak hour factor can be made as follows:
General guidelines for finding future PHF can be found in the Development Review Guidelines,
which are as follows:
Numerical Example
The table below shows the volumetric data observed at an intersection. Calculate the peak
hour volume, peak hour factor (PHF), and the actual (design) flow rate for this approach.
Solution We can locate the hour with the highest volume and the 15 minute interval with
the highest volume. The peak hour is shown in blue below with the peak 15 minute period
shown in bold font. The peak hour volume is just the sum of the volumes of the four 15 minute
intervals within the peak hour (219). The peak 15 minute volume is 65 in this case. The peak
hour factor (PHF) is found by dividing the peak hour volume by four times the peak 15 minute
219
volume. P HF = 4×65 = 0.84 The actual (design) flow rate can be calculated by dividing the
peak hour volume by the PHF, 219/0.84 = 260 vehicles/hr, or by multiplying the peak 15
minute volume by four, 4 × 65 = 260 vehicles per hour.
Car 1.0
Motorcycle 0.5
Bicycle 0.2
LCV 2.2
Bus, Truck 3.5
3-wheeler 0.8
car. This is also known as passenger car equivalent. For example, typical values of PCU (or
PCE) are: Highway capacity is measured in PCU/hour daily.
Numerical Example
The table below shows the volumetric data collected at an intersection: Calculate the peak
hour volume, peak hour factor (PHF), and the actual (design) flow rate for this approach.
Solution The first step in this solution is to find the total traffic volume for each 15 minute
period in terms of passenger car units. For this purpose the PCU values given in the table are
used. Once we have this, we can locate the hour with the highest volume and the 15 minute
interval with the highest volume. The peak hour is shown in blue below with the peak 15
minute period shown in a darker shade of blue. The peak hour volume is just the sum of the
volumes of the six 10 minute intervals within the peak hour (743.6 PCU). The peak 10 minute
volume is 146.5 PCU in this case. The peak hour factor (PHF) is found by dividing the peak
hour volume by four times the peak 10 minute volume.
743.6
P HF = = 0.85
6 × 146.5
The actual (design) flow rate can be calculated by dividing the peak hour volume by the PHF,
743.6/0.85 = 879 P CU/hr, or by multiplying the peak 10 minute volume by six, 6 × 146.5 =
879 P CU/hr.
• Chandra’s method
• Headway method
• Simulation method
It may be appropriate to use different values for the same vehicle type according to circum-
stances like volume of traffic, speed of vehicle, lane width and several external factors.
where Dij is the delay to passenger cars due to vehicle type i under condition j and Db is the
base delay to standard passenger cars due to slower passenger cars.
PCUs in the 1965 HCM were reported for grades of specific length and percent, proportion
of trucks, and LOS grouped as A through C or D and E. As expected, the highest PCU was
reported for the longest and steepest grade with the highest proportion of trucks and the lowest
LOS. However, in many cases the PCU for a given grade and LOS decreased with increasing
proportion of trucks. PCUs in the 1965 HCM were reported for grades of specific length and
percent, proportion of trucks, and LOS grouped as A through C or D and E. As expected,
the highest PCU was reported for the longest and steepest grade with the highest proportion
of trucks and the lowest LOS. However, in many cases the PCU for a given grade and LOS
decreased with increasing proportion of trucks.
hm hc pc pt
2.70 2.5 0.90 0.10
2.80 2.5 0.85 0.15
2.94 2.5 0.80 0.20
3.10 2.5 0.75 0.25
3.25 2.5 0.70 0.30
3.35 2.5 0.65 0.35
3.70 2.5 0.50 0.50
3.80 2.5 0.45 0.55
3.95 2.5 0.40 0.60
4.20 2.5 0.30 0.70
where HM is the average headway for a sample including all vehicle types, HB is the average
headway for a sample of passenger cars only, PC is the proportion of cars, and PT is the
proportion of trucks.
Numerical Example
The table given below show headway data for a number of traffic conditions. It is assumed that
the traffic contains only car and truck. Compute the PCU value for each traffic condition Note
that hm , hc , pc , pt respectively denote the average headway for mixed traffic, average headway
for traffic consisting of cars only, the percentage of cars and percentage of trucks of the traffic
stream.
Solution Use the formula given above to find the value of PCU.
hm hc pc pt Et
2.70 2.5 0.90 0.10 1.80
2.80 2.5 0.85 0.15 1.80
2.94 2.5 0.80 0.20 1.88
3.10 2.5 0.75 0.25 1.96
3.25 2.5 0.70 0.30 2.00
3.35 2.5 0.65 0.35 1.97
3.70 2.5 0.50 0.50 1.96
3.80 2.5 0.45 0.55 1.95
3.95 2.5 0.40 0.60 1.97
4.20 2.5 0.30 0.70 1.97
2.00
PCU
1.95
1.90
1.85
1.80
1.75
0 0.2 0.4 0.6 0.8
Percentage of trucks
Figure 5:1: Graph showing the variation of PCU with percentage of truck using the data of the
problem given above
Numerical Example
The table given shows the data obtained in spot speed study for various vehicle types. Find
the PCU value for each vehicle type using the Chandra’s Method.
Solution Step 1 We have to find the space mean speed for each vehicle type using the
formula:
n
Vs =
Σi=1 ( v1i )
n
Table 5:9: Table of spot speed study for various vehicle types
From To HCV Flow HCV Mean Speed CAR Flow CAR Mean Speed
2.30 2.40 4 10.4 16 14.32
2.40 2.50 6 9.09 19 12.74
2.50 3.00 5 8.88 18 13.11
3.00 3.10 6 9.38 20 10.67
3.10 3.20 6 10.66 17 12.11
3.20 3.30 6 9.66 21 13.41
3.30 3.40 5 9.55 18 13.11
3.40 3.50 8 10.12 17 10.93
3.50 4.00 7 9.2 22 13.33
4.00 4.10 6 9.54 19 13.58
4.10 4.20 10 10.67 25 12.34
4.20 4.30 8 9.61 20 10.58
Table 5:12: space mean speed of Car and HCV in a two lane road without shoulders
and Et is the passenger car unit of the trucks given homogeneous traffic behaviour. In density
method where car following and lane discipline behaviour prevails, all traffic entities use an
equal Wl .
Numerical Example
The table given below shows the data of flow and space mean speed of Car and HCV in a two
lane road without shoulders. Assume the 85 percentile distribution width of HCV and Car to
be 9.50m. and 7.50m. Compute the PCU value of HCV for each time interval.
Solution We know that PCU value can be calculated using the formula:
(Kcar /W l)
(P CU)truck = (5.8)
(Ktruck /W l)
Step 1 Find the density of car and truck using basic relationship between the traffic flow
parameters
Q=K×V (5.9)
Step 2 The using the method stated above we can find the PCU values. The table showing
the PCU values has been illustrated below.
From To HCV Flow HCV Speed Car Flow Car Speed Car density PCU
2.30 2.40 4 10.4 27 14.32 1.86 3.68
2.40 2.50 6 9.09 32 12.74 2.49 2.86
2.50 3.00 5 8.88 30 13.11 2.29 3.09
3.00 3.10 6 9.38 33 10.67 3.12 3.71
3.10 3.20 6 10.66 28 12.11 2.34 3.16
3.20 3.30 6 9.66 35 13.41 2.61 3.19
3.30 3.40 5 9.55 30 13.11 2.29 3.32
3.40 3.50 8 10.12 28 10.93 2.59 2.49
3.50 4.00 7 9.2 37 13.33 2.75 2.75
4.00 4.10 6 9.54 32 13.58 2.33 2.82
4.10 4.20 10 10.67 42 12.34 3.38 2.74
4.20 4.30 8 9.61 33 10.58 3.15 2.88
5.6 Conclusion
Measurement over a section is probably one of the easiest field parameter that can be mea-
sured. Various types of volume counts and counting techniques have been discussed in brief.
Along with this a brief insight into various methods of calculating Passenger Car unit has been
provided. Out of the various methods discussed, Chandra’s Method is only method that can
be applied to the Indian condition of heterogeneous traffic that is characterized by loose lane
discipline. All the other methods are primarily based on homogeneous traffic conditions mainly
prevailing in developed countries.
5.7 References
1. S Chandra and U Kumar. Effect of lane width on capacity under mixed traffic conditions
in india. Journal of Transportation Engineering, ASCE, 129:155–160, 2003.
2. F D Hobbs. Traffic Planning and Engineering. Pergamon Press, 1979. 2nd Edition.
4. Anthony Ingle. Development of Passenger Car Equivalents for Basic Freeway Segments.
Blacksburg, Virginia, July 8, 2004.
5. Geetam Tiwari, Joseph Fazio, and Sri Pavitravas. Passenger Car Units for Heterogeneous
Traffic Using a Modified Density Method. 2019.
Chapter 6
6.1 Overview
The main purpose of this chapter is to determine traffic parameter, specially speed. Speed
measurements are most often taken at a point (or a short section) of road way under conditions
of free flow. The intent is to determine the speeds that drivers select, unaffected by the existence
of congestion. This information is used to determine general speed trends, to help determine
reasonable speed limits, and to assess safety.
1. Spot speed This is the instantaneous speed of a vehicle at any specific location.
2. Running speed This is the average speed maintained over a particular course while the
vehicle is in the motion.
3. Journey speed This is the effective speed of the vehicle on a journey between two points
and the distance between two points and the distance between these points divided by
the total time taken for the vehicle to complete the journey, it includes all delay.
1. Speed trends,
3. Accidental analysis,
4. Geometric design,
5. Research studies.
required to collect the data, of which one is stand at the starting point to start and stop the
stop watch and other one is stand at end point to give indication to stop the watch when vehicle
passes the end line. Advantages of this method are that after the initial installation no set-up
time is required, markings are easily renewed, and disadvantage of this is that substantial error
can be introduced, and magnitude of error may change for substitute studies and this method
is only applicable for low traffic conditions.
Vertical Reference
point Vertical Reference
End Timing point
Study length
Approaching Vehicle
Start timing
Observer 2 Observer 1
X
Base length
Weather: Time:
Measurement Technique:
7
8
9
10
Surveyor:
Figure 6:3: Data collection sheet for Enoscope and Pavement Marking Methods
Spot Speed Data Collection Form
Location: Data:
Time:
Weather:
Measurement Technique:
Type of road:
Surveyor:
Spot Speed Data Collection Form
Location: Date:
Weather: Time:
Measurement Technique:
5 10
10 15
15 20
20 25
25 30
30 35
35 40
40 45
45 50
50 55
55 60
60 65
Surveyor:
$\% Frequency
20
15
Pace
10
0
32 36 40 44 48 52 56 60 64 Speed
100 (kph)
$Cum.\%freq$
90
80 $86\%$
70
60 $\% Veh in pace =86−14= 72\%$
50 Median
40
30
20 $14\%$
10
0 Speed
32 36 40 44 48 52 56 60 64 (kph)
Mean Speed
The arithmetic (or harmonic) average speed is the most frequently used speed statistics. It is
the measure of central tendency of the data. Mean calculated gives two kinds of mean speeds.
Σfi vi
vt = (6.1)
n
where, vt is the mean or average speed, vi is the individual speed of the ith vehicle, fi is the
frequency of speed, and n is the total no of vehicle observed (sample size). Time mean Speed
If data collected at a point over a period of time, e.g. by radar meter or stopwatch, produce
speed distribution over time, so the mean of speed is time mean speed. Space mean Speed
If data obtained over a stretch (section) of road almost instantaneously, aerial photography or
enoscope, result in speed distribution in space and mean is space mean speed. Distribution
over space and time are not same. Time mean speed is higher than the space mean speed. The
spot speed sample at one end taken over a finite period of time will tend to include some fast
vehicles which had not yet entered the section at the start of the survey, but will exclude some
of the slower vehicles. The relationship between the two mean speeds is expressed by:
σs2
vt = vs + (6.2)
vs
where, vt and vs are the time mean speed and space mean speed respectively. And σs is the
standard deviation of distribution space.
Median Speed
The median speed is defined as the speed that divides the distribution in to equal parts (i.e.,
there are as many observations of speeds higher than the median as there are lower than
the median). It is a positional value and is not affected by the absolute value of extreme
observations. By definition, the median equally divides the distribution. Therefore, 50% of all
observed speeds should be less than the median. In the cumulative frequency curve, the 50th
percentile speed is the median of the speed distribution. Median Speed = v50
Pace
The pace is a traffic engineering measure not commonly used for other statistical analyses. It is
defined as the 10Km/h increment in speed in which the highest percentage of drivers is observed.
It is also found graphically using the frequency distribution curve. As shown in fig 6.5. The
pace is found as follows: A 10 Km/h template is scaled from the horizontal axis. Keeping this
template horizontal, place an end on the lower left side of the curve and move slowly along the
curve. When the right side of the template intersects the right side of the curve, the pace has
been located. This procedure identifies the 10 Km/h increments that intersect the peak of the
curve; this contains the most area and, therefore, the highest percentage of vehicles.
Modal Speed
The mode is defined as the single value of speed that is most likely to occur. As no discrete values
were recorded, the modal speed is also determined graphically from the frequency distribution
curve. A vertical line is dropped from the peak of the curve, with the result found on the
horizontal axis.
Standard Deviation
The most common statistical measure of dispersion in a distribution is the standard deviation.
It is a measure of how far data spreads around the mean value. In simple terms, the standard
deviation is the average value of the difference between individual observations and the average
value of those observations. The Standard deviation, σs , of the sample can be calculated by
r
Σfi (vi − vv )2
σs = (6.3)
n−1
Percentile Speeds
The 85th and 15th percentile speeds give a general description of the high and low speeds
observed by most reasonable drivers. It is generally thought that the upper and lower 15% of
the distribution represents speeds that are either too fast or too slow for existing conditions.
These values are found graphically from the cumulative frequency distribution curve of Figure
6.4. The curve is entered on the vertical axis at values of 85% and 15%. The respective speeds
are found on the horizontal axis. The 85th and 15th percentile speeds can be used to roughly
estimate the standard deviation of the distribution σest , although this is not recommended when
the data is available for a precise determination.
v85 − v15
σest = (6.4)
2
The 85th and 15th percentile speeds give insight to both the central tendency and dispersion of
the distribution. As these values get closer to the mean, less dispersion exists and the stronger
the central tendency of the distribution becomes.
The 98th percentile speed is also determining from the cumulative frequency curve, this
speed is generally used for geometric design of the road.
µ = vt ± Zσs (6.7)
where, µ is the confidence interval, vt is mean speed, σs is standard deviation and Z is constant
for specified confidence.
Solution For the spot speed study, first draw a frequency distribution table show below.
1. From the table 6.3, we can draw frequency distribution and cumulative frequency distri-
bution curve.(shown in Fig 6.6 and 6.7)
2. From the curves, Median speed, v50 = 43 kmph; Modal speed, = 38 kmph; the Pace =
33 - 43 kmph; Percent vehicles in pace = 54-20= 34%; and the 85th Percentile speed =
58 kmph.
fi × (Vi − Vm )2
P
Speed Range Mid speed Vi Frequency fi % fi % fi fi × Vi
21-25 23 2 2% 2% 46 1036.876
26-30 28 6 5% 6% 168 1894.473
31-35 33 18 14% 20% 594 2934.959
36-40 38 25 19% 39% 950 1509.024
41-45 43 19 15% 54% 817 145.7041
46-50 48 16 12% 66% 768 79.6213
51-55 53 17 13% 79% 901 888.8284
56-60 58 12 9% 88% 696 1795.101
61-65 63 7 5% 94% 441 2078.296
66-70 68 4 3% 97% 272 1976.828
71-75 73 3 2% 99% 219 2224.544
76-80 78 1 1% 100% 78 1038.822
Total 130 100% 5950 17603.08
20\%
Mode
Frequency(\%)
pace
15\%
10\%
5\%
0\%
33 38 43
0 10 20 30 40 50 60 70 80 90
Speed (kmph)
90\% $v_85$
85\%
80\%
cumulative frequency(\%)
70\%
60\%
$v_50$
50\%
40\%
30\%
20\%
$v_15$
15\%
10\%
32 43 58
0 10 20 30 40 50 60 70 80 90
Speed (kmph)
4. The confidence bounds on the estimate of the true mean speed of the underlying distri-
bution are:
µ = vt ± Zσs
Parameter Value
Median speed 43 kmph
Modal speed 38 kmph
Pace 33-43 kmph
Vehicles in pace 34%
Mean speed 45.77 kmph
Standard Deviation 11.7 kmph
85th percentile speed 58 kmph
15th percentile speed 32 kmph
98th percentile Speed 72 kmph
Confidence interval
For 95%. 45.7722.93 kmph
For 99.7% 45.7725.1 kmph
Required sample Size 234
5. Sample size required for 95% confidence with acceptable error of 1.5 kmph
Z 2 σs2
nr =
Se2
1.962 × 11.72
= = 234.
1.52
So, given sample size is not sufficient and we require minimum 234 samples to achieve
that confidence with given acceptable error. The results are summaries in table 6.8.4
should be taken in advance of the curve, before deceleration begins. It may also be appro-
priate, however, to measure speeds at the point where accidents are occurring for evaluation
with approach speeds. This would allow the traffic engineer to assess whether the problem is
excessive approach speed or that drivers are not decelerating sufficiently through the subject
geometric element, or a combination of both. A study of intersection approach speeds must
also be taken at a point before drivers begin to decelerate. This may be a moving point, given
that queues get shorter and longer at different periods of the day.
6.10 Summary
This chapter has presented the basic concepts of speed studies. Spot speed studies are conducted
to estimate the distribution of speeds of vehicle in the traffic stream at a particular position
on highway. This is done by recording the speeds of vehicle at the specified location. These
data are used to obtain speed characteristics such as mean speed, modal speed, pace, standard
deviation and different percentile of speeds. The important factors which should consider during
plan of studies is the location of study, time and duration of study. The data sample collected
should contain samples size. These gives precision and accuracy of result.
6.11 References
1. F D Hobbs. Traffic Planning and Engineering. Pergamon Press, 1979. 2nd Edition.
2. Nicholas J Garber Lester A Hoe. Traffic and Highway Engineering. Cengage Learning
Product, Fourth Edition, 2009.
3. Theodore M Matson, Wilbure S smith, and Fredric W Hurd. Traffic engineering, 1955.
Chapter 7
7.1 Overview
This is normally used to obtain variations in speed over a stretch of road. Usually the stretch
will be having a length more than 500 meters. We can also get speed ,travel time and delay.
Speed and travel time are the most commonly used indicators of performance for traffic facilities
and networks. Delays are often used to measure the performance of traffic flow at intersections.
the amount, cause, location, duration and frequency of delay as well as travel time and similar
value. The time lost by traffic due to traffic friction and traffic control device is called delay.
2. Fixed Delay- The delay to which a vehicle is subjected regardless of the amount of traffic
volume and interference present.
3. Operational Delay-The delay caused by interference from other component of the traffic
stream. Examples include time lost while waiting for a gap in a conflicting traffic stream,
or resulting from congestion, parking maneuvers, pedestrians, and turning movement.
5. Travel Time Delay- The difference between the actual time required to traverse a section
of street or highway and the time corresponding to the average speed of traffic under
uncongested condition. It includes acceleration and deceleration delay in addition to
stopped delay.
2. This study method can be used to compare operational conditions before and after road-
way or intersection improvements have been made. It can also be used as a tool to assist
in prioritizing projects by comparing the magnitude of the operational deficiencies (such
as delays and stops) for each project under consideration.
3. The Travel Time and Delay Study can also be used by planners to monitor level of service
for local government comprehensive plans.
4. The methodology presented herein provides the engineer with quantitative information
with which he can develop recommendations for improvements such as traffic signal re-
timing, safety improvements, turn lane additions, and channelization enhancements
2. Average Speed Method: In this method the driver is instructed to travel at a speed
that is judge to the representative of the speed of all traffic at the time.
3. Moving-vehicle method: In this method, the observer moves in the traffic stream and
makes a round trip on a test section. The observer starts at section, drives the car in a
particular direction say eastward to another section, turns the vehicle around drives in
the opposite direction say westward toward the previous section again. Let, the time in
minutes it takes to travel east (from X-X to Y-Y) is ta, the time in minutes it takes to
travel west (from Y-Y to X-X) is tw, the number of vehicles traveling east in the opposite
lane while the test car is traveling west be ma, the number of vehicles that overtake the
test car while it is traveling west be mo, and the number of vehicles that the test car
passes while it is traveling west from be mp. The volume (qw) in the westbound direction
X Y
West
East
X Y
4. Maximum-car method: In this procedure, the driver is asked to drive as fast as is safely
practical in the traffic stream without ever exceeding the design speed of the facility.
6. License Plate Method: when the amount of turning off and on the route is not great
and only over all speed value are to be secured, the license-plate method of speed study
may be satisfactorily employed. Investigator stationed at control point along the route
enters, on a time control basis, the license-plate numbers of passing vehicles. These
are compared from point to point along the route, and the difference in time values,
through use of synchronized watches, is computed. This method requires careful and
time-consuming office work and does not show locations, causes, frequency, or duration of
delay. Four basic methods of collecting and processing license plates normally considered
are:
(a) Manual: collecting license plates via pen and paper or audio tape recorders and
manually entering license plates and arrival times into a computer.
(b) Portable Computer: collecting license plates in the field using portable computers
that automatically provide an arrival time stamp.
(c) Video with Manual Transcription: collecting license plates in the field using
video cameras or camcorders and manually transcribing license plates using human
observers.
(d) Video with Character Recognition: collecting license plates in the field using
video, and then automatically transcribing license plates and arrival times into a
computer using computerized license plate character recognition.
8. Interview Method: this method may be useful where a large amount of material is
needed in a minimum of time and at little expense for field observation. Usually the
employees of a farm or establishment are asked to record their travel time to and from
work on a particular day.
9. Highway Capacity Manual 2000 or (Cycle- based method): This method is ap-
plicable to all under saturated signalized intersections. For over-saturated conditions,
queue buildup normally makes the method impractical. The method described here is
applicable to situations in which the average maximum queue per cycle is no more than
about 20 to 25 veh/ln. When queues are long or the demand to capacity ratio is near
1.0, care must be taken to continue the vehicle-in-queue count past the end of the arrival
count period, vehicles that arrived during the survey period until all of them have exited
the intersection.as detailed below. This requirement is for consistency with the analytic
delay equation used in the chapter text.method does not directly measure delay during
deceleration and during a portion of acceleration, which are very difficult to measure with-
out sophisticated tracking equipment. However, this method has been shown to yield a
reasonable estimate of control delay.
The method includes an adjustment for errors that may occurred when this type of
sampling technique is used, as well as an acceleration-deceleration delay correction factor
Table 7:1. The acceleration-deceleration factor is a function of the typical number of
vehicles in queue during each cycle and the normal free-flow speed when vehicles are
unimpeded by the signal. Before beginning the detailed survey, the observers need to
make an estimate of the average free-flow speed during the study period. Free-flow speed
is the speed at which vehicles would pass unimpeded through the intersection if the signal
were green for an extended period.be obtained by driving through the intersection a few
times when the signal is green and there is no queue and recording the speed at a location
least affected by signal control. Typically, the recording location should be upstream
about mid-block. Table 7:2 is a worksheet that can be used for recording observations
and computation of average time-in-queue delay Steps for data reduction
(a) Sum each column of vehicle-in-queue counts, then sum the column totals for the
entire survey period.
(b) A vehicle recorded as part of a vehicle-in-queue count is in queue, on average, for the
time interval between counts. The average time-in-queue per vehicle arriving during
the survey period is estimated.
ΣViq
dvq = Is × 0.9
Vtot
Numerical Example
A test was conducted to determine the delay in an intersection. Table 7:3 presents a sample
computation on direct observation of vehicle-in-queue counts at the intersection. The traffic
signal at the intersection operates with a cycle time of 115 sec. The test was conducted on the
2 lane road over a 15-min period, which is almost thirteen cycles . Count interval was 15-s.
The total number of vehicle is 530 and the total number of stopped vehicle is 223. Assume the
free flow speed to be 65 km/h and the empirical adjustment factor 0.9
Total
Computations
2 6 12 15 16 6 0 0 2
3 7 " 14 14 2 0 0
4 5 7 10 13 13 2 0 1
4:42 5 4 6 10 12 3 0 0 1
6 5 7 9 13 4 0 0
7 3 6 8 12 12 0 0 0
4:47 8 4 7 " 16 9 0
Total 37 64 88 ’" 61 4 0 6
Solution:
7.7 Summary
The information assembled as part of this travel time and delay study forms a baseline for
future assessment. This study helps to determine the amount of time required to travel from
one point to another on a given route. Often, information may also be collected on the locations,
durations, and causes of delays. Good indication of the level of service and identifying problem
locations
7.8 References
1. Highway capacity manual, 2000. chapter-16.
2. Manual on uniform traffic studies, 2000. Topic No. 750-020-007 Travel Time and Delay
Study.
4. F D Hobbs. Traffic Planning and Engineering. Pergamon Press, 1979. 2nd Edition.
6. Theodore M Matson, Wilbure S smith, and Fredric W Hurd. Traffic engineering, 1955.
Chapter 8
8.1 Introduction
This present paper offers a review on some of the latest automated traffic data collection tech-
nologies. This automated technology briefly summarizes as two methods. The first technology
is in-situ technology and second one is in vehicle technology. Broadly speaking, “in-situ” tech-
nologies refer to traffic data measured by the means of detectors located along the roadside.
Generally, traffic count technologies can be split into two categories: the intrusive and non-
intrusive methods. The intrusive methods basically consist of a data recorder and a sensor
placing on or in the road. Non-intrusive techniques are based on remote observations. Then
the next order automated traffic data technology is floating car data (FCD). FCD is an alter-
native or rather complement source of high quality data to existing technologies. They will
help improve safety, efficiency and reliability of the transportation system. They are becom-
ing crucial in the development of new Intelligent Transportation Systems (ITS). Then finally
discussed travel time prediction by these technologies.
8.1.1 General
The vehicular traffic is increasing tremendously in today’s/this world, simultaneously conges-
tion also increases. In order to prevent congestion, one option is to increase the capacity by
increasing the number of existing transportation system. A second option is to develop alterna-
tives that increase capacity by improving the efficiency of the existing transportation system.
The later focuses on building fewer lane-miles, while investing in Intelligent Transportation
Systems (ITS) infrastructure. The goals of ITS include the following:
1. Enhance public safety;
2. Reduce congestion;
4. Generate cost savings to motor carriers, transit operators, toll authorities, and government
agencies; and
2. Vehicle Classification
3. Vehicle Occupancy
4. Travel Time
5. Delay
Most applications of manual counts require small samples of data at any given location. Manual
counts are rarely used when the effort and expense of automated equipment are not justified.
Manual counts are necessary when automated equipment is not available. Manual counts are
typically used for period of less than a day. Normal intervals for a manual count are 5, 10,
or 15 minutes. Traffic counts during a rush hour of Monday morning and Friday evening rush
hours shows exceptionally high volumes and is not normally used in analysis; therefore, counts
are usually conducted on Tuesday, Wednesday, or Thursday.
The automatic count method provides a means for gathering large amounts of traffic data.
Automatic counts are usually taken in 1-hour interval for each 24-hour period. The counts
extend for a week, month, or year. When the counts are recorded for each 24-hour time period,
the peak flow period can be identified. Automatic counts are recorded using one of three
methods: portable counters, permanent counters, and videotape.
The vehicle classification counts required should not be considered separate from the volume
counts traditionally performed. Instead, they should be integrated with the traditional volume
counts. Because classification counts provide both classification and total volume information,
they can replace traditional volume counts reducing duplication and error. Traffic surveillance
equipment is used as part of advanced traffic management systems (ATMS) or advanced traveler
information systems (ATIS) can be used to supply both total volume and vehicle classification
information. Intelligent transportation system (ITS) technology and its resulting data are
often present at high profile locations as part of safety enhancement systems. These systems
can supply useful, continuous traffic monitoring data. Coordinating these traffic monitoring
activities can lead to significant improvements in the amount of data available to users, while
at the same time reducing the cost of data collection.
Vehicle classification data are of considerable use to agencies involved in almost all aspects of
transportation planning and engineering. The need for information on truck volumes and freight
movements is growing with the recognition of role that freight mobility plays in the economy,
and as highway engineers realize the importance of truck volume and operating characteristics
on the geometric and structural design of roadways and bridges.
1. pavement design
2. pavement management
location to another and recommendation of different route alternatives using real time traffic
density information are very valuable for metropolitan city residents.
8.1.6 Delay
The delay defines as “The additional travel time experienced by a driver, passenger, or pedes-
trian”. Delay is thus the difference between an “ideal” travel time and “actual” travel time.
Since the definition of delay depends on a hypothetical “ideal travel time”, delay is not always
directly measurable in the field. If the ideal travel time is defined as off-peak travel time, then
the measured delay is difference between the actual measured travel time during peak period,
and the actual measured travel time during off-peak period. If the ideal travel time is defined
as travel at the posted speed limit, then the delay cannot be directly measured in the field.
It is estimated by subtracting the hypothetical travel time at the posted speed limit from the
measured mean travel time in the field.
Intrusive Technologies
Typical examples of intrusive technologies, their sensor types and installation locations are
shown in Fig. 8:1. The first types of units (Fig. 8:1, Type 1) are passive magnetic or magneto-
meter sensors that are either permanently mounted within holes in the road, or affixed to the
road surface in some fashion. The unit communicates to a nearby base station processing unit
using either wires buried in the road, or wireless communications. The sensor has a circular or
2
3
1
1
Figure 8:1: Typical intrusive detector configurations, Source: IMAGINE- Collection Methods
for Additional Data
The second types of units (Fig. 8:1, Type 2) use pneumatic tubes that are stretched across
the carriageway and affixed at the kerb side at both ends. Such systems are only be deployed
on a temporary basis, due to the fragile nature of tubes, which are easily damaged or torn up
by heavy or fast moving vehicles.
The third type (Fig. 8:1, Type 3) are inductive detector loops (IDL), consisting of coated
wire coils buried in grooves cut in the road surface, sealed over with bituminous filler. A ca-
ble buried with the loop sends data to a roadside processing unit. The zone of detection for
inductive loop sensors depends on the cut shape of the loop slots. The zones depending on
the overall sensitivity of system not correspond precisely to the slot dimensions. IDLs are a
cheap and mature technology. They are installed on both major roads and within urban areas,
forming the backbone detector network for most traffic control systems.
The fourth type of intrusive system is Weigh-In-Motion (WIM) shown in Fig. 8:2, detectors
that consist of a piezoelectric sensor (e.g. ‘bending-plate’ or fiber-optic) system laid in a chan-
nel across the road. These systems are relatively rare and are used in specific locations for
enforcement or access control. They are usually coupled with other systems, either intrusive or
non-intrusive, to provide additional cross-checks on collected data.
Signal sent
to processor
vehicles tire passes over the tube. The pulse of air pressure closes an air switch, producing
an electrical signal that is transmitted to a counter or analysis software. The pneumatic
road tube sensor is portable, using lead-acid, gel, or other rechargeable batteries as a
power source. The road tube is installed perpendicular to the traffic flow direction and
is commonly used for short-term traffic counting, vehicle classification by axle count and
spacing. Some data to calculate vehicle gaps, intersection stop delay, stop sign delay, and
saturation flow rate, spot speed as a function of vehicle class, and travel time when the
counter is utilized in conjunction with a vehicle transmission sensor.
Advantages
(a) Cheap and self-contained, the easiest to deploy of all intrusive systems, recognized
technology with acceptable accuracy for strategic traffic modeling purposes, hence
very widely used.
(b) Axle-based classification appears attractive, given sub-vehicle categories are partially
axle based.
Disadvantages
Advantages
(a) It is a very cheap technology. Almost every dynamic traffic control system in this
world uses IDL data.
Disadvantages
(a) Loops are damaged by utility and street maintenance activities or penetration of
water.
(b) IDLs with low sensitivity fail to detect vehicles with speed below a certain threshold,
and miscount vehicles with complex or unusual chassis configurations, or vehicles
with relatively low metal content (e.g. motorcycles).
(c) IDL data supplied to traffic control systems have a very low sample rate.
(d) Not suitable for mounting on metallic bridge decks.
(e) Some radio interference occurs between loops in close proximity with each other.
Two types of magnetic field sensors are used for traffic flow parameter measurement.
The first type, the two-axis flux gate magneto-meter, detects changes in vertical and hor-
izontal components of the Earth s magnetic field produced by a ferrous metal vehicle.
The two-axis flux gate magneto-meter contains a primary winding and two secondary
sense winding on a coil surrounding high permeability soft magnetic material core. The
second type of magnetic field sensor is the magnetic detector, more properly referred to
N N N N N N
W E W E W E W E W E W E
COMPASS S S S S S S
Figure 8:3: Weigh-In-Motion Detector system (Source: FHWA vehicle detection manual)
as an induction or search coil magneto-meter shown in Fig. 8:3. It detects the vehicle
signature by measuring the change in the magnetic lines of flux caused by the change in
field values produced by a moving ferrous metal vehicle. These devices contain a single
coil winding around a permeable magnetic material rod core. However, most magnetic
detectors cannot detect stopped vehicles, since they require a vehicle to be moving or
otherwise changing its signature characteristics with respect to time.
Advantages
(a) More usually mounted in a small hole in road surface and hardwired to the processing
unit.
Suitable for deployment on bridges.
Disadvantages
the dynamic load. Static load is estimated using the measured dynamic load and
calibration parameters. Calibration parameters account for factors, such as vehicle
speed and pavement or suspension dynamics that influence estimates of the static
weight. The accuracy of bending plate WIM systems can be expressed as a function
of the vehicle speed traversed over the plates, assuming the system is installed in a
sound road structure and subject to normal traffic conditions.
Advantages
Bending plate WIM systems is used for traffic data collection as well as for weight
enforcement purposes. The accuracy of these systems is higher than piezoelectric
systems and their cost is lower than load cell systems. Bending plate WIM systems
do not require complete replacement of the sensor.
Disadvantages
Bending plate WIM systems are not as accurate as load cell systems and are con-
siderably more expensive than piezoelectric systems.
(b) Piezoelectric
Piezoelectric WIM systems contain one or more piezoelectric sensors that detect a
change in voltage caused by pressure exerted on the sensor by an axle and thereby
measure the axle s weight. As a vehicle passes over the piezoelectric sensor, the
system records the sensor output voltage and calculates the dynamic load. With
bending plate systems, the dynamic load provides an estimate of static load when
the WIM system is properly calibrated.
The typical piezoelectric WIM system consists of at least one piezoelectric sensor
and two ILDs. The piezoelectric sensor is placed in the travel lane perpendicular to
the travel direction. The inductive loops are placed upstream and downstream of
the piezoelectric sensor. The upstream loop detects vehicles and alerts the system
to an approaching vehicle. The downstream loop provides data to determine vehicle
speed and axle spacing based on the time it takes the vehicle to traverse the dis-
tance between the loops. Fig. 8:4 shows a full-lane width piezoelectric WIM system
installation. In this example, two piezoelectric sensors are utilized on either side of
the downstream loop.
Advantages
Cabinet
Traffic flow
directions
er
uld
sho
ad Inductive WIM strip,
Ro loops (2) full−length, PVC conduit
2 places below ground
Figure 8:4: WIM installation with full-length piezoelectric sensors Source: FHWA vehicle de-
tection manual
Typical piezoelectric WIM systems are among the least expensive systems in use
today in terms of initial capital costs and life cycle maintenance costs. Piezoelectric
WIM systems can be used at higher speed ranges (16 to 112 kmph) than other WIM
systems. Piezoelectric WIM systems can be used to monitor up to four lanes.
Disadvantages
Typical piezoelectric systems are less accurate than load cell and bending plate WIM
systems. Piezoelectric sensors for WIM systems must be replaced at least once every
3 years.
Non-Intrusive Technologies
Non-intrusive technologies include video data collection, passive or active infrared detectors,
microwave radar detectors, ultrasonic detectors, passive acoustic detectors, laser detectors and
aerial photography. All these technologies represent emergent fields that are expanding rapidly
with continuing advances in signal processing. At present time such technologies are used to
provide supplemental information for selected locations or for specific applications (e.g., queue
detection at traffic signals). Most non-intrusive systems are operationally and somewhat visu-
ally similar, consisting of small electronics unit mounted in a weatherproof housing placed in
various locations, as shown in Fig. 8:5.
The first type of non-invasive detectors are roadside mast-mounted. The detector possesses
a field-of-regard covering an oblique area upstream or downstream of the unit. There are also
multiple zones of detection defined within the overall field of regard, or the overall zone of
detection same as the field of regard, depending on the specific detector type and technology.
2 2
3
1
Obscuration problems occur when high-sided vehicles screens lower vehicles from the detector
or the field-of-view being too large, leading to detection of vehicles outside the desired lane.
The second type of non-invasive detectors are mounted on gantries or bridge undersides, with
field of regard directly below, or at a slight oblique to the unit. Finally, some units, such as
open-path pollutant monitors are mounted road side at ground level, firing a beam across the
road. Such units are subject to side-by-side masking and hence most suitable for only single
lane, unidirectional flows.
1. Video image detection (VID) The traffic parameters are collected by frame-by-frame
analysis of video images captured by roadside cameras. The following parameters are
collected: Depending on the processing methodology almost all traffic parameters are
captured from video analysis. Simple video systems often collect flow volume and occu-
pancy. More complex systems allow the extraction of further parameters.
Advantages
Possibility to capture all desired traffic information, including some parameters that are
not readily obtainable using other types of detectors Possibility of a permanent visual
record of the traffic flow that reviewed and analyzed by a human operator.
Disadvantages
VID systems are susceptible to obscure issues, as with other non-intrusive detectors.
Performance of VID systems might be degraded in bad weather or low light conditions.
2. Infrared Sensors The sensors are mounted overhead to view approaching or departing
traffic or traffic from a side-looking configuration. Infrared sensors are used for signal
Receiving aperture
ET (1 − E)Tsky
(Emissive term) (Reflective term)
Tsky
θ
Road surface with emissivity and Vehicle with emissivity and
surface temperature surface temperature
ER and TR EV and TV
Figure 8:6: Emission and reflection of energy by vehicle and road surface. (Source: FHWA
vehicle detection manual)
control; volume, speed, and class measurement, as well as detecting pedestrians in cross-
walks. With infrared sensors, the word detector takes on another meaning, namely the
light-sensitive element that converts the reflected or emitted energy into electrical signals.
Real-time signal processing is used to analyze the received signals for the presence of a
vehicle.
Advantages
i. Relatively long wavelength of light used in PIR systems makes them less sus-
ceptible to weather effects.
Disadvantages
i. Accuracy of speed information is poor with low resolution sensors. Vehicle length
determination is highly problematic for the same reason.
(b) Active Infrared (AIR)/Laser Low power LED or laser diode fires a pulsed or con-
tinuous beam down to road surface as shown in Fig. 8:7. Time for reflection to
return is measured. Presence of a vehicle lowers the time of reflection. High scan-
ning rates provides a detailed profile for classification determination. Use of Doppler
frequency shift from moving object allows for very accurate speed determination.
The AIR system collected following parameters flow volume, speed, classification,
Scanning beams
Figure 8:7: Laser radar beam geometry. (Source: FHWA vehicle detection manual)
Advantages
i. Very accurate flow, speed and classifications possible.
ii. Laser systems work in day and night conditions.
Disadvantages
i. Active near-IR sensors adversely affected by weather conditions.
ii. Laser systems impeded by haze or smoke.
iii. Some problems with tracking small vehicles reported.
iv. Relatively high costs compared to other units. Precise, but limited zone of
detection require additional units over other systems.
3. Microwave - Doppler and Radar Low energy microwave radiation (2.5 to 24 GHz)
is transmitted into the detection zone. Objects within the zone reflect a portion of the
radiation back to a receiver. Doppler units use the frequency shift of the return to cal-
culate speed as shown in Fig. 8:8. It cant detect the stationary objects. The microwave
system collected following parameters.
Advantages
Disadvantages
4. Pulsed and Active Ultrasonic Ultrasonic sensors transmit pressure waves of sound
energy at a frequency between 25 and 50 KHz. Pulse waveforms measure distances to
the road surface and vehicle surface by detecting the portion of the transmitted energy
that is reflected towards the sensor from an area defined by the transmitters beam width.
When a distance other than that to the background road surface is measured, the sen-
sor interprets that measurement as the presence of a vehicle as shown in Fig. 8:9. The
received ultrasonic energy is converted into electrical energy that is analyzed by signal
processing electronics that is either collocated with the transducer or placed in a roadside
controller. Vehicles flow and vehicular speed can be calculated by recording the time at
which the vehicle crosses each beam.
Advantages
Disadvantages
00000
11111
11111
00000
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00
11
11
00
00
11
00
11
Advantages
Disadvantages
The principle of FCD is to collect real-time traffic data by locating the vehicle via mobile
phones or GPS over the entire road network as shown in Fig. 8:11. It represents that all vehi-
cles are equipped with mobile phone or GPS which will act as a sensor for the road network.
Data such as car location, speed and direction of travel are sent anonymously to a central pro-
cessing centre. After collecting and extracting, useful information such as status of traffic and
alternative routes it can be redistributed to the drivers on the road. FCD is an alternative or
rather complement source of high quality data to existing technologies. They will help improve
safety, efficiency and reliability of the transportation system. They are becoming crucial in the
development of ITS.
GPS-based FCD
GPS is becoming more and more useful and inexpensive; few cars had been equipped with GPS
system and were made to pass a certain point in the network. The vehicle location precision
was found to be relatively high, typically less than 30m. Generally, traffic data obtained from
private vehicles or trucks are more suitable for motorways and rural areas.
Currently, GPS probe data are widely used as a source of real-time information by many
service providers but it suffers from a limited number of vehicles equipped and high equipment
costs compared to floating cellular data.
GPS
Satellites
Differential
Correction Station
Transmisson
Tower
tag is an object that can be applied to or incorporated into a product, animal, or person for the
purpose of identification and tracking using radio waves. Some tags can be read from several
meters away and beyond the line of sight of the reader.
1. An antenna or coil
An RFID tag is comprised of a microchip to collect information and an antenna that transmits
this data wireless to a reader. At its most basic, the chip will contain a serialized identifier,
or license plate number, that uniquely identifies that item. Typically, processed data would
be used to provide revised scheduling and arrival time information to the general public, via
variable information signs. Transponder systems are also used with Selective Vehicle Detection
(SVD) systems which are designed to allow priority at traffic signals or cordon points for public
transport or emergency service vehicles.
2. Inventory Management
3. Work-in-Process
5. Parking Management
Advantages
2. RFID tags can be read automatically when a tagged product comes past or near a reader.
Disadvantages
1. Reader collision occurs when the signals from two or more readers overlap.
3. Tag collision occurs when many tags are present in a small are
Travel time data using active test vehicles in combination with varying levels of instrumenta-
tion: manual (clipboard and stopwatch), an electronic distance measuring instrument (DMI), or
a global positioning system (GPS) receiver. It involves the use of data collection vehicle within
which an observer records cumulative travel time at predefined checkpoints along a travel route.
Then this information converted to travel time, speed, and delay for each segment along the
survey route. There are several different methods for performing this type of data collection,
depending upon the instrumentation used in the vehicle. These vehicles are instrumented and
then sent into the field for travel time data collection, they are sometimes referred to as “active”
test vehicles.
Advantages
1. Advanced test vehicle techniques (e.g., DMI or GPS use) result in detailed data.
Travel times by matching vehicle license plates between consecutive checkpoints with varying
levels of instrumentation: tape recorders, video cameras, portable computers, or automatic
license plate character recognition.
Advantages
1. Travel times from a large sample of motorists, very simple technique.
3. Accuracy of license plate reading is an issue for manual and portable computer
Travel times using ITS components and passive probe vehicles in the traffic stream equipped
with signpost-based transponders, automatic vehicle identification (AVI) transponders, ground-
based radio navigation, cellular phones, or GPS receivers.
Some vehicles are equipped with dynamic route guidance (DRG) device which act as roving
traffic detectors, a non-infrastructure based traffic monitoring system. Such vehicles, which are
participating in the traffic flow and capable of determining experienced traffic conditions and
transmitting these to a traffic center, are called probe vehicles. To determine its position and
to register experienced traffic conditions, a probe vehicle is equipped with on-board electronics,
such as a location and a communication device. By means of the location device, the probe
vehicle keeps track of its own geographic position.
Through the communication device, the probe vehicle transmits its traffic experiences via a
mobile communication link to a traffic center. For instance, each probe can transmit traffic
messages once every time interval containing its location and its speed at the instant of trans-
mission. In this traffic center the traffic data received from probe vehicles is gathered, and
combined with data from the other monitoring sources, and processed into relevant traffic in-
formation. It is very useful for Advanced Traveler Information system (ATIS).
Advantages
5. No disruption of traffic
Disadvantages
Central Computer
Signalpost
Transmitter
Vehicle Location
Unit Radio Signal I.D, Bus I.D,
Antenna Odometer Reading
Signpost−Bus Communication Link Time/Date Stamp
Radio
Transmitter
Figure 8:12: Signpost-Based AVL Communication Processes, Source: Travel Time Detection
Hand Book
Central Computer
Toll Plaza, Sign Bridge, Overpass, or Gantry
Tag I.D. #,
Time Stamp Antenna
Date Stamp, Transceiver
Antenna I.D. Reader
Unit AVI tag
Leased Phone Lines #
I.D.
Tag
Reader
Unit
Antenna Spacing
Varies, Typically
Tag I.D. # 2−5 km
Coaxial Cable,
Radio Wave, or
Microwave
Figure 8:13: AVI Vehicle-to-Roadside Communication Process, Source: Travel Time Detection
Hand Book
2. Automatic Vehicle Identification (AVI) - Probe vehicles are equipped with electronic
tags. These tags communicate with roadside transceivers to identify unique vehicles shown
in Fig. 8:13 and collect travel times between transceivers.
Vehicle I.D.
Time Stamp
Vehicle I.D.
Time Stamp
Vehicle I.D.
Time Stamp
Ground−Based
Radio Tower
Figure 8:14: Ground-Based Radio Navigation Communication Process, Source: Travel Time
Detection Hand Book
4. Cellular Geo-location - This experimental technology can collect travel time data by
discretely tracking cellular telephone call transmissions. Cellular telephones are also useful
to collect travel time data. Two techniques have been applied using cellular technology:
cellular telephone reporting and cellular geolocating.
Cellular Geo-location
The cellular geolocating methodology discreetly tracks cellular telephone calls to collect
travel time data and monitor freeway conditions. This technique utilizes an existing cel-
lular telephone network, vehicle locating devices, and a central control facility to collect
travel time data. All vehicles equipped with cellular telephones are potential probe vehi-
cles. The system automatically detects cellular telephone call initiations and locates the
Advantages
Disadvantages
Numerical Example
1. If the vehicle 10% time occupied by loop M and 32% time occupied by loop N, the distance
between two loops are 4.22 m find the spot speed of the vehicle. Also find the length of
the vehicle if time occupancy for M - loop is 0.26sec and 0.32 for N-loop?
Solution: Length is 4.22 m and occupancy times are 0.32 and 0.1.Therefore,the spot
speed(v)is given by:
ldist
v = ,
t2 − t1
= (4.22)/(0.32 − 0.1) = 19.18 m/sec.
For length calculation, the speed is 19.18 m/sec and occupancy times are 0.26 and 0.32.
Speed(ot2 + ot1 )
Lvehicle = ,
2
19.18(0.26 + 0.32)
= = 5.56 m.
2
2. The average length of vehicle is 4.25 m and the length of loop detector zone is 1.85 m.
The time occupancy in the loop is 32 percentages, find the spot speed of the vehicle?
Solution: The average vehicle length is 4.25 and detector zone length is 1.85 m and
Solution: The number of vehicle N is 1500 vehicles; observation period is T= 120 sec.
The lane occupancy O is 0.65 and average length is 6.55, so g is (40.9/6.55).The space
mean speed(s) is given by:
N
s = ,
T ×O×g
1500 × 6.55
=
120 × 0.65 × (40.9)
= 3.08 m/sec.
8.4 Summary
ITS include sensor, communication, and traffic control technologies. Intelligence requires infor-
mation, and information requires data, which is generated by surveillance. Vehicle detection
and surveillance technologies are an integral part of ITS, since they gather all or part of the
data that is used in ITS. A detailed introduction and importance of ITS and different types
of data involved have been discussed in this chapter. Technology regarding the data collection
techniques on conventional and non conventional methods has been presented in the following
chapter.
A detailed different technology system, their principles, advantages, disadvantages and type of
data collected by each system have been discussed in this chapter. Application part of travel
time by probe vehicle and vehicle signature by some technologies has been presented.
Detailed travel time estimation by different techniques has been discussed in this chapter. Also
travel time estimation by vehicle technology and emerging techniques such as vehicle signature
have also been discussed in this chapter.
Each detector technology and particular device has its own limitations and individual capa-
bility. The successful application of detector technologies largely depends on proper device
selection. Many factors impact detector selection, such as data type, data accuracy, ease of
installation, cost and reliability. Vehicle technologies are well advanced compared to the in-situ
technology detectors for travel time. A non- Intrusive technology is very effective compared
to the Intrusive technologies. Pneumatic road tube sensors are more suitable for small sample
and short duration period but it cant detect two wheelers. ILDs are flexible to satisfy different
variety of applications, but installation requires pavement disturb. Magnetic sensors provide
traffic measurements more accurate and more informative than loop detector measurements,
but it cant detect the stopped vehicle.
8.5 References
1. Texas Transportation Institute, Texas A and M University System. Travel Time Data
Collection Handbook,Report FHWA-PL-98-035, 1998.
4. B Coifman. Length based vehicle classification on freeways from single loop Detectors. al
University Transportation Center Final Report, 2009.
6. S Ding. Freeway Travel Time Estimation using Limited Loop Data. Master Thesis, The
University of Akron, 2008.
9. L Guillaume. Road Traffic Data: Collection Methods and Applications. JRC Technical
note 47967, 2008.
10. U Leeds. Collection Methods for Additional Data, IMAGINE project no. 503549. Insti-
tute for Transport Studies, University of Leeds, United Kingdom, 2006.
11. P T Martin, Y Feng, and X Wang. Detector Technology Evaluation. Department of Civil
and Environmental Engineering, Utah Traffic Lab, 2003.
13. N Nihan, X Zhang, and Y Wang. Improved System for Collecting Real-Time Truck Data
from Dual Loop Detectors. Transportation Northwest, 2005.
14. S G Ritchie S Park and O Cheol. Field Investigation of Advanced Vehicle Re-identification
Techniques and Detector. California PATH Research Report, 2002.
15. A Parsekar. Blind Deconvolution of Vehicle Inductive Signatures for Travel Time Estima-
tion. Master thesis, Department of Computer Science, University of Minnesota Duluth,
Duluth, Minnesota -55812, 2004.
16. C Ulberg. Vehicle occupancy forecasting, Technical Report. Washington State De-
partment of Transportation Technical, Graduate School of Public Affairs University of
Washington Seattle, Washington 98105, 1994.
17. J Xia and M Chen. Freeway Travel Time Forecasting Under Incident. Final Report,
Southeastern Transportation Center, Department of Civil Engineering, University of Ken-
tucky, Lexington, KY 40506, 2007.
18. B Young and M Saito. Automated Delay Estimation at Signalized Intersections. Research
Division, 2011.
19. Y Zhirui. Speed estimation using single loop detector outputs. Some studies, Ph.D thesis,
Department of CIVIL Engineering, Texas A and M University, 2007.
Chapter 9
Intrusive Technologies
9.1 Introduction
Typical examples of intrusive technologies, their sensor types and installation locations are
shown in Fig. 9:1. The first types of units (Fig. 9:1, Type 1) are passive magnetic or magneto-
meter sensors that are either permanently mounted within holes in the road, or affixed to the
road surface in some fashion. The unit communicates to a nearby base station processing unit
using either wires buried in the road, or wireless communications. The sensor has a circular or
elliptically offset zone of detection (i.e., the blue area).
The second types of units (Fig. 9:1, Type 2) use pneumatic tubes that are stretched across
the carriageway and affixed at the kerb side at both ends. Such systems are only be deployed
on a temporary basis, due to the fragile nature of tubes, which are easily damaged or torn up
by heavy or fast moving vehicles.
The third type (Fig. 9:1, Type 3) are inductive detector loops (IDL), consisting of coated
wire coils buried in grooves cut in the road surface, sealed over with bituminous filler. A ca-
ble buried with the loop sends data to a roadside processing unit. The zone of detection for
inductive loop sensors depends on the cut shape of the loop slots. The zones depending on
the overall sensitivity of system not correspond precisely to the slot dimensions. IDLs are a
cheap and mature technology. They are installed on both major roads and within urban areas,
forming the backbone detector network for most traffic control systems.
The fourth type of intrusive system is Weigh-In-Motion (WIM) shown in Fig. 9:2, detectors
that consist of a piezoelectric sensor (e.g. ‘bending-plate’ or fiber-optic) system laid in a chan-
nel across the road. These systems are relatively rare and are used in specific locations for
enforcement or access control. They are usually coupled with other systems, either intrusive or
2
3
1
1
Figure 9:1: Typical intrusive detector configurations, Source: IMAGINE- Collection Methods
for Additional Data
Signal sent
to processor
gaps, intersection stop delay, stop sign delay, and saturation flow rate, spot speed as a func-
tion of vehicle class, and travel time when the counter is utilized in conjunction with a vehicle
transmission sensor.
Advantages
1. Cheap and self-contained, the easiest to deploy of all intrusive systems, recognized tech-
nology with acceptable accuracy for strategic traffic modeling purposes, hence very widely
used.
2. Axle-based classification appears attractive, given sub-vehicle categories are partially axle
based.
Disadvantages
2. Tube installations are not durable, the life of tubes are less than one month only.
3. The tube detectors are not suitable for high flow and high speed roads.
4. Units should not be positioned where there is the possibility of vehicles parking on the
tube.
Advantages
1. It is a very cheap technology. Almost every dynamic traffic control system in this world
uses IDL data.
Disadvantages
Roadway centerline
Pullbox
Curb line
Conduit−to−curb run
Splice in pullbox
1. Loops are damaged by utility and street maintenance activities or penetration of water.
2. IDLs with low sensitivity fail to detect vehicles with speed below a certain threshold,
and miscount vehicles with complex or unusual chassis configurations, or vehicles with
relatively low metal content (e.g. motorcycles).
3. IDL data supplied to traffic control systems have a very low sample rate.
5. Some radio interference occurs between loops in close proximity with each other.
lloop ldist
T = t2 T = t1
a few distance apart as shown in Fig. 9:4. With such a design, when one of them detects a
vehicle, timer is automatically started in the dual-loop system and runs until the same vehicle
is detected by other loop.Thus, in addition to outputs of vehicle count and occupancy data,
individual vehicle speeds can be trapped through the dividend of the distance between those
two single loops ldist by the elapsed time. Speed trap is defined as the measurement of the
time that a vehicle requires to travel between two detection points. Spot speed is measured by
following Eqn. 9.1.
ldist
Speed = (9.1)
t2 t1
where,
ldist = Distance between two loops in meters
t1 = Vehicle entry time at first loop in sec
t2 = Vehicle entry time at second loop in sec
Dual-loop detectors can also be used to measure vehicle lengths with extra data extracted from
controllers records. The length of vehicle is measured by following Eqn. 9.2:
Speed|ot2 + 0t1 |
Lvehicle = (9.2)
2
where,
Lvehicle = Length of vehicle in meters.
oti = on-time for loop detector i; Speed in m/sec
Example-1
If the vehicle entering the freeway in loop M at time 8:32:22:00 am and leaving loop N at
time 8:32:22:15 am, the distance between two loops will be 3.66 m. Find the spot speed of the
vehicle. Also find the length of the vehicle if time occupancy for M - loop is 0.25sec and 0.29
for N - loop.
lv ld
Single Loop
Vehicle Detector
Single Loop
Detector
Vehicle
Solution:
Step 1 Spot Speed calculated from the equation 1, where given that the distance between
two loops are 3.66m and entry, exit times are 8:32:22:00 and 8:32:22:15 substitute in Eqn. 9.1.
SpotSpeed = (3.66)/(15 − 0)/100 = 24.4 m/sec.
Step 2 The vehicle length can obtained by the spot speed of the vehicle, so substitute the
occupancy times at exit and entry in the Eqn. 9.2.
(52.7/3.6)|0.25 + 0.29|
Lvehicle = = 3.95 m. (9.3)
2
vehicle length, occupancy, and traffic volume.For the given number of vehicle and duration of
the observed data the specimen speed can find by following Eqn. 9.5 is shown below.
N
s= (9.5)
T ×O×g
where,
S = Space mean speed in m/sec
N = Number of vehicles in the observed interval
T = Observation interval in sec
O = occupancy time
g = speed correction factor; (based upon assumed vehicle length, detector configuration, and
traffic conditions) Most of the algorithms followed as (40.9/6.55) for average vehicle length
6.55m.
Example-2
The length of vehicle is 4 m and the length of loop detector zone is 1.83 m. The time occupancy
in the loop is 0.3 sec, find the spot speed of the vehicle?
Solution:
From the given data the average vehicle length is 4 m and the length of loop detector zone is
1.833 m, the time occupancy in loop is 0.3 sec substitute in Eqn. 9.1.
EV L
spotspeed =
to
4 + 1.83
s = = 19.4 m/sec.
0.3
Example-3
In freeway 2500 vehicles are observed during 300 sec interval. The loop occupancy is 75 per-
centages and the average length of vehicle observed as 6.55 m, find the space mean speed on
the freeway section?
Solution
Given data is number of vehicle is 2500, duration is 300 sec, loop occupancy is 75 percent-
age, the average length of vehicle is 6.55 so speed correction factor is 40.99/6.55 substitute in
Eqn. 9.5.
N
specimenspeed =
T ×O×g
2500 × 6.55
s =
300 × 0.75 × 40.9
= 6.405 Kmph
A series of vehicle signature acquired by the Inductive Loop Detectors located at upstream
and downstream of a freeway and different distance measures to find the re identification accu-
racy level. Double-axle trucks produce a double picked vehicle signature when the resolution
of detector is adequate. Thus, it can be easily used for vehicle-type identification purposes.
−50
−100
−150
−200
−250
−300
0 10 20 30 40 50 60 70 80 90
Time (ms)
Two types of magnetic field sensors are used for traffic flow parameter measurement. The
first type, the two-axis flux-gate magneto-meter, detects changes in vertical and horizontal
components of the Earth s magnetic field produced by a ferrous metal vehicle. The two-axis
flux-gate magneto-meter contains a primary winding and two secondary sense winding on a
coil surrounding high permeability soft magnetic material core. The second type of magnetic
field sensor is the magnetic detector, more properly referred to as an induction or search coil
magneto-meter shown in Fig. 9:7. It detects the vehicle signature by measuring the change in
the magnetic lines of flux caused by the change in field values produced by a moving ferrous
metal vehicle. These devices contain a single coil winding around a permeable magnetic ma-
terial rod core. However, most magnetic detectors cannot detect stopped vehicles, since they
require a vehicle to be moving or otherwise changing its signature characteristics with respect
to time.
Advantages
1. More usually mounted in a small hole in road surface and hardwired to the processing
unit.
Suitable for deployment on bridges.
Disadvantages
N N N N N N
W E W E W E W E W E W E
COMPASS S S S S S S
Figure 9:7: Weigh-In-Motion Detector system (Source: FHWA vehicle detection manual)
Advantages
Bending plate WIM systems is used for traffic data collection as well as for weight enforcement
purposes. The accuracy of these systems is higher than piezoelectric systems and their cost is
lower than load cell systems. Bending plate WIM systems do not require complete replacement
of the sensor.
Disadvantages
Bending plate WIM systems are not as accurate as load cell systems and are considerably more
expensive than piezoelectric systems.
9.5.2 Piezoelectric
Piezoelectric WIM systems contain one or more piezoelectric sensors that detect a change in
voltage caused by pressure exerted on the sensor by an axle and thereby measure the axle s
weight. As a vehicle passes over the piezoelectric sensor, the system records the sensor output
voltage and calculates the dynamic load. With bending plate systems, the dynamic load pro-
vides an estimate of static load when the WIM system is properly calibrated.
The typical piezoelectric WIM system consists of at least one piezoelectric sensor and two
ILDs. The piezoelectric sensor is placed in the travel lane perpendicular to the travel direction.
The inductive loops are placed upstream and downstream of the piezoelectric sensor. The up-
stream loop detects vehicles and alerts the system to an approaching vehicle. The downstream
loop provides data to determine vehicle speed and axle spacing based on the time it takes the
vehicle to traverse the distance between the loops. Fig. 9:8 shows a full-lane width piezoelectric
WIM system installation. In this example, two piezoelectric sensors are utilized on either side
of the downstream loop.
Advantages
Typical piezoelectric WIM systems are among the least expensive systems in use today in terms
of initial capital costs and life cycle maintenance costs. Piezoelectric WIM systems can be used
at higher speed ranges (16 to 112 kmph) than other WIM systems. Piezoelectric WIM systems
can be used to monitor up to four lanes.
Disadvantages
Typical piezoelectric systems are less accurate than load cell and bending plate WIM systems.
Piezoelectric sensors for WIM systems must be replaced at least once every 3 years.
Problems:
1. If the vehicle 10% time occupied by loop M and 32% time occupied by loop N, the distance
between two loops are 4.22 m find the spot speed of the vehicle. Also find the length of
the vehicle if time occupancy for M - loop is 0.26sec and 0.32 for N-loop.
Cabinet
Traffic flow
directions
er
uld
sho
d Inductive WIM strip,
a
Ro loops (2) full−length, PVC conduit
2 places below ground
Figure 9:8: WIM installation with full-length piezoelectric sensors Source: FHWA vehicle de-
tection manual
Solution: Length is 4.22 m and occupancy times are 0.32 and 0.1.The speed is given by:
ldist
Speed =
t2 − t1
= (4.22)/(0.32 − 0.1) = 19.18 m/sec.
For length calculation, the speed is 19.18 m/sec and occupancy times are 0.26 and 0.32.
Speed(ot2 + ot1 )
Lvehicle =
2
19.18(0.26 + 0.32)
= = 5.56 m.
2
2. The average length of vehicle is 4.25 m and the length of loop detector zone is 1.85 m.
The time occupancy in the loop is 32 percentages, find the spot speed of the vehicle?
Solution: The average vehicle length is 4.25 and detector zone length is 1.85 m and
t0 is 0.32.the spot speed(s) is given by:
EV L
s =
to
4.25 + 1.85
= = 19.06m/sec
0.32
3. In freeway 1500 vehicles are observed during 120 sec interval. The lane occupancy is 65
percentage and the average length of vehicle observed as 6.55 m. Find the space mean
speed on the freeway section?
Solution: The number of vehicle N is 1500 vehicles; observation period is T= 120 sec.
The lane occupancy O is 0.65 and average length is 6.55, so g is (40.9/6.55) substitute
N
s =
T ×O×g
1500 × 6.55
=
120 × 0.65 × (40.9)
= 3.08 m/sec
9.6 Summary
Each detector technology and particular device has its own limitations and individual capability.
The successful application of detector technologies largely depends on proper device selection.
Many factors impact detector selection, such as data type, data accuracy, ease of installation,
cost and reliability. ILDs are flexible to satisfy different variety of applications, but installation
requires pavement disturb.
9.7 References
1. Texas Transportation Institute, Texas A and M University System. Travel Time Data
Collection Handbook,Report FHWA-PL-98-035, 1998.
3. Final Report of Evaluation of Freeway Travel Time Estimates. Castle Rock Consultants
Inc, Portland State University, 2019.
5. B Coifman. Length based vehicle classification on freeways from single loop Detectors. al
University Transportation Center Final Report, 2009.
7. S Ding. Freeway Travel Time Estimation using Limited Loop Data. Master Thesis, The
University of Akron, 2008.
10. L Guillaume. Road Traffic Data: Collection Methods and Applications. JRC Technical
note 47967, 2008.
11. U Leeds. Collection Methods for Additional Data, IMAGINE project no. 503549. Insti-
tute for Transport Studies, University of Leeds, United Kingdom, 2006.
12. P T Martin, Y Feng, and X Wang. Detector Technology Evaluation. Department of Civil
and Environmental Engineering, Utah Traffic Lab, 2003.
14. N Nihan, X Zhang, and Y Wang. Improved System for Collecting Real-Time Truck Data
from Dual Loop Detectors. Transportation Northwest, 2005.
15. S G Ritchie S Park and O Cheol. Field Investigation of Advanced Vehicle Re-identification
Techniques and Detector. California PATH Research Report, 2002.
16. A Parsekar. Blind Deconvolution of Vehicle Inductive Signatures for Travel Time Estima-
tion. Master thesis, Department of Computer Science, University of Minnesota Duluth,
Duluth, Minnesota -55812, 2004.
17. C Ulberg. Vehicle occupancy forecasting, Technical Report. Washington State De-
partment of Transportation Technical, Graduate School of Public Affairs University of
Washington Seattle, Washington 98105, 1994.
18. J Xia and M Chen. Freeway Travel Time Forecasting Under Incident. Final Report,
Southeastern Transportation Center, Department of Civil Engineering, University of Ken-
tucky, Lexington, KY 40506, 2007.
19. B Young and M Saito. Automated Delay Estimation at Signalized Intersections. Research
Division, 2011.
20. Y Zhirui. Speed estimation using single loop detector outputs. Some studies, Ph.D thesis,
Department of CIVIL Engineering, Texas A and M University, 2007.
Chapter 10
Non-Intrusive Technologies
10.1 Introduction
Non-intrusive technologies include video data collection, passive or active infrared detectors,
microwave radar detectors, ultrasonic detectors, passive acoustic detectors, laser detectors and
aerial photography. All these technologies represent emergent fields that are expanding rapidly
with continuing advances in signal processing. At present time such technologies are used to
provide supplemental information for selected locations or for specific applications (e.g., queue
detection at traffic signals). Most non-intrusive systems are operationally and somewhat visu-
ally similar, consisting of small electronics unit mounted in a weatherproof housing placed in
various locations, as shown in Fig. 10:1.
The first type of non-invasive detectors are roadside mast-mounted. The detector possesses
a field-of-regard covering an oblique area upstream or downstream of the unit. There are also
multiple zones of detection defined within the overall field of regard, or the overall zone of
detection same as the field of regard, depending on the specific detector type and technology.
Obscuration problems occur when high-sided vehicles screens lower vehicles from the detector
or the field-of-view being too large, leading to detection of vehicles outside the desired lane.
The second type of non-invasive detectors are mounted on gantries or bridge undersides, with
field of regard directly below, or at a slight oblique to the unit. Finally, some units, such as
open-path pollutant monitors are mounted road side at ground level, firing a beam across the
road. Such units are subject to side-by-side masking and hence most suitable for only single
lane, unidirectional flows.
2 2
3
1
Advantages
Possibility to capture all desired traffic information, including some parameters that are not
readily obtainable using other types of detectors Possibility of a permanent visual record of the
traffic flow that reviewed and analyzed by a human operator.
Disadvantages
VID systems are susceptible to obscure issues, as with other non-intrusive detectors. Perfor-
mance of VID systems might be degraded in bad weather or low light conditions.
2. Principles of Operation
Video image processor systems detect vehicles by analyzing the imagery from a traffic
scene to determine changes between successive frames. VIP system typically consists of
one or more cameras, a microprocessor-based computer for digitizing and processing the
imagery, and software for interpreting the images and converting them into traffic flow
data.
The algorithms are designed to remove gray level variations in the image background
caused by weather conditions, shadows, and daytime or night time artifacts and retain
objects identified as automobiles, trucks, motorcycles, and bicycles. Traffic flow param-
eters are calculated by analyzing successive video frames. Color imagery can also be
exploited to obtain traffic flow data. However, somewhat reduced dynamic range and
sensitivity have so far inhibited this approach. Traffic flow parameters are calculated by
analyzing successive video frames. Color imagery can also be exploited to obtain traffic
flow data.
Three different types of VIP systems are available; they are tripline, closed-loop tracking,
and data association tracking. Fig. 10:2 shows tripline systems which operate by allowing
the user to define a limited number of detection zones in the field of view of the video
camera. When a vehicle crosses one of these zones, it is identified by noting changes in the
pixels caused by the vehicle relative to roadway in the absence of a vehicle. Surface-based
and grid-based analyses are utilized to detect vehicles in tripline VIPs. Tripline systems
estimate vehicle speed by measuring the time it takes for an identified vehicle to travel a
detection zone of known length. The speed is found as the length divided by the travel
time.
Closed-loop tracking systems are an extension of the tripline approach that permits ve-
hicle detection along larger roadway sections. The closed-loop systems track vehicles
continuously through the field of view of camera. Multiple detections of the vehicle along
a track are used to validate the detection. These tracking systems provide additional
traffic flow data such as lane-to-lane vehicle movements. These have the potential to
transmit information to roadside displays and radios to alert drivers to erratic behavior
that can lead to an incident. Data association tracking systems identify and track a
particular vehicle or groups of vehicles as they pass through the field of view of camera.
The computer identifies vehicles by searching for unique connected areas of pixels. These
areas are then tracked frame-to-frame to produce tracking data for the selected vehicle
or vehicle groups.
3. System Design
06
DETECTION
ZONE
02
02
05
02
02
04
System design consist of following four stages, construction of background image, detec-
tion of frame features, matching of detected frame features and refining matched vehicle
features. Creating a background image (an image representing the scene without mov-
ing vehicles) using a computer is a difficult task. The reason is that a computer, unlike
humans, is unable to distinguish background and vehicles by considering a single image.
The number of frames improves the quality of background images, it increases the time
consumed in creating them. This is caused by the large number of mathematical instruc-
tions required to construct a background image.
In the second stage it analyzes each frame in the sequence and detects features that
correspond to moving vehicles in the scene. Depending on the method used, several types
of features can be highlighted to represent moving vehicles. In the second stage apply
background subtraction on each frame to remove the static background of the scene. The
resulting image consists of blobs (collections of pixels with non-zero values) corresponding
to moving vehicles. These blobs are enhanced by processing further and detected as the
main feature. Several attributes about the blobs are recorded in memory for processing
in the coming stages.
Also, there are false blobs, not corresponding to any moving object. Such blobs are
present because of excessive noise in the image or poor quality of the background image.
Such features need not be processed further for estimating traffic flow. Therefore, these
features are identified from the input features and discarded. Now, the remaining features
can be considered as vehicle features. In third stage by matching the features detected in
Receiving aperture
ET (1 − E)Tsky
(Emissive term) (Reflective term)
Tsky
θ
Road surface with emissivity and Vehicle with emissivity and
surface temperature surface temperature
ER and TR EV and TV
Figure 10:3: Emission and reflection of energy by vehicle and road surface. (Source: FHWA
vehicle detection manual)
previous frames with those from the current frame, vehicles can be tracked. In the final
stage matched vehicle features can be refined to correct features in the frames. However,
this is a complex task, as most of the information in the image has been lost after labeling.
Therefore, it is necessary to extract information from original frames to perform this task.
All these system design process are done by different algorithms.
Advantages
(a) Relatively long wavelength of light used in PIR systems makes them less susceptible
to weather effects.
Disadvantages
(a) Accuracy of speed information is poor with low resolution sensors. Vehicle length
determination is highly problematic for the same reason.
Advantages
Disadvantages
Scanning beams
Figure 10:4: Laser radar beam geometry. (Source: FHWA vehicle detection manual)
Microwave
Radar
Antenna
Advantages
Disadvantages
00000
11111
11111
00000
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00
11
11
00
00
11
00
11
Advantages
1. Highly accurate.
Disadvantages
2. Pulsed units with low sampling rate miscount or misclassify fast moving vehicles.
of signal yield to speed information and possibly engine type classification. It collected flow,
speed, occupancy, possibly classification.
Advantages
Disadvantages
10.7 Summary
A non- Intrusive technology is very effective compared to the Intrusive technologies.
10.8 References
1. Texas Transportation Institute, Texas A and M University System. Travel Time Data
Collection Handbook,Report FHWA-PL-98-035, 1998.
3. Final Report of Evaluation of Freeway Travel Time Estimates. Castle Rock Consultants
Inc, Portland State University, 2019.
5. B Coifman. Length based vehicle classification on freeways from single loop Detectors. al
University Transportation Center Final Report, 2009.
7. S Ding. Freeway Travel Time Estimation using Limited Loop Data. Master Thesis, The
University of Akron, 2008.
10. L Guillaume. Road Traffic Data: Collection Methods and Applications. JRC Technical
note 47967, 2008.
11. U Leeds. Collection Methods for Additional Data, IMAGINE project no. 503549. Insti-
tute for Transport Studies, University of Leeds, United Kingdom, 2006.
12. P T Martin, Y Feng, and X Wang. Detector Technology Evaluation. Department of Civil
and Environmental Engineering, Utah Traffic Lab, 2003.
14. N Nihan, X Zhang, and Y Wang. Improved System for Collecting Real-Time Truck Data
from Dual Loop Detectors. Transportation Northwest, 2005.
15. S G Ritchie S Park and O Cheol. Field Investigation of Advanced Vehicle Re-identification
Techniques and Detector. California PATH Research Report, 2002.
16. A Parsekar. Blind Deconvolution of Vehicle Inductive Signatures for Travel Time Estima-
tion. Master thesis, Department of Computer Science, University of Minnesota Duluth,
Duluth, Minnesota -55812, 2004.
17. C Ulberg. Vehicle occupancy forecasting, Technical Report. Washington State De-
partment of Transportation Technical, Graduate School of Public Affairs University of
Washington Seattle, Washington 98105, 1994.
18. J Xia and M Chen. Freeway Travel Time Forecasting Under Incident. Final Report,
Southeastern Transportation Center, Department of Civil Engineering, University of Ken-
tucky, Lexington, KY 40506, 2007.
19. B Young and M Saito. Automated Delay Estimation at Signalized Intersections. Research
Division, 2011.
20. Y Zhirui. Speed estimation using single loop detector outputs. Some studies, Ph.D thesis,
Department of CIVIL Engineering, Texas A and M University, 2007.
Chapter 11
11.1 Introduction
Travel time can be defined as the period of time to transverse a route between any two points
of interest. It is a fundamental measure in transportation. Travel time is also one of the most
readily understood and communicated measure indices used by a wide variety of users, includ-
ing transportation engineers, planners, and consumers. Travel time data is useful for a wide
range of transportation analyses including congestion management, transportation planning,
and traveler information. Congestion management systems commonly use travel time-based
performance measures to evaluate and monitor traffic congestion. In addition, some metropoli-
tan areas provide real-time travel time prediction as part of their advanced traveler information
systems (ATIS). Travel time data can be obtained through a number of methods. Some of the
methods involve direct measures of travel times along with test vehicles, license plate match-
ing technique, and ITS probe vehicles. Additionally, various sensors (e.g. inductance loop
detectors, acoustic sensors) in ITS deployment collect a large amount of traffic data every day,
especially in metropolitan areas. Such data can be used for travel time estimation for extensive
applications when direct measurements of travel times are not available [19].
Travel time, or the time required to traverse a route between any two points of interest,
is a fundamental measure in transportation. Travel time is a simple concept understood and
communicated by a wide variety of applications for transportation engineers and planners.
Several data collection techniques can be used to collect travel times. These techniques are
designed to collect travel times and average speeds on designated roadway segments or links.
Following are the different techniques available for the travel time data collection.
Advantages
• Advanced test vehicle techniques (e.g., DMI or GPS use) result in detailed data.
Disadvantages
• Sources of possible error from either human or electric sources that require adequate
quality control,
Advantages
Disadvantages
• Travel time data limited to locations where observers or video cameras can be positioned;
• Accuracy of license plate reading is an issue for manual and portable computer
Some vehicles are equipped with dynamic route guidance (DRG) device which act as roving
traffic detectors, a non-infrastructure based traffic monitoring system. Such vehicles, which are
participating in the traffic flow and capable of determining experienced traffic conditions and
transmitting these to a traffic center, are called probe vehicles. To determine its position and
to register experienced traffic conditions, a probe vehicle is equipped with on-board electronics,
such as a location and a communication device. By means of the location device, the probe
vehicle keeps track of its own geographic position [16].
Through the communication device, the probe vehicle transmits its traffic experiences via a
mobile communication link to a traffic center. For instance, each probe can transmit traffic
messages once every time interval containing its location and its speed at the instant of trans-
mission. In this traffic center the traffic data received from probe vehicles is gathered, and
combined with data from the other monitoring sources, and processed into relevant traffic in-
formation. It is very useful for Advanced Traveler Information system (ATIS).
Advantages
• No disruption of traffic
Central Computer
Signalpost
Transmitter
Vehicle Location
Unit Radio Signal I.D, Bus I.D,
Antenna Odometer Reading
Signpost−Bus Communication Link Time/Date Stamp
Radio
Transmitter
Figure 11:1: Signpost-Based AVL Communication Processes, Source: Travel Time Detection
Hand Book, [16]
Disadvantages
2. Automatic Vehicle Identification (AVI) - Probe vehicles are equipped with electronic
tags. These tags communicate with roadside transceivers to identify unique vehicles shown
in Fig. 11:2 and collect travel times between transceivers [16].
Central Computer
Toll Plaza, Sign Bridge, Overpass, or Gantry
Tag I.D. #,
Time Stamp Antenna
Date Stamp, Transceiver
Antenna I.D. Reader
Unit AVI tag
Leased Phone Lines #
.D.
Tag I
Reader
Unit
Antenna Spacing
Varies, Typically
Tag I.D. # 2−5 km
Coaxial Cable,
Radio Wave, or
Microwave
Figure 11:2: AVI Vehicle-to-Roadside Communication Process, Source: Travel Time Detection
Hand Book, [16]
Central Computer
Vehicle Location Vehicle I.D.
Request Time Stamp
Vehicle I.D.
Time Stamp
Vehicle I.D.
Time Stamp
Vehicle I.D.
Time Stamp
Ground−Based
Radio Tower
Figure 11:3: Ground-Based Radio Navigation Communication Process, Source: Travel Time
Detection Hand Book, [16]
Advantages
Disadvantages
• Low accuracy
• Privacy issues
• Infrastructure dependent
volume
Spotspeed = (11.1)
laneoccupancy × g
where,
g = speed correction factor (based upon assumed vehicle length, detector configuration, and
traffic conditions).
LinkLengthinkm sec
T raveltime = km
× 3600 (11.2)
Spotspeedin hr hr
Vehicle signature matching had been investigated using a number of different point detection
devices, mostly with inductance loop detectors. Several algorithms are available to capture
vehicle signatures from a loop detector frequency detuning curve. Different types and classes of
vehicles provide different types of signatures. The unique features of a vehicle signature are then
compared to signatures within a given time frame at a downstream location. The signature is
matched when a large number of feature correlations have been found within vehicle signatures
at the downstream location. The vehicle signature matching technique does not match every
vehicle signature captured, but potentially match a large enough percentage as to be significant
[16].
11.7 Summary
Detailed travel time estimation by different techniques has been discussed in this chapter. Also
travel time estimation by vehicle technology and emerging techniques such as vehicle signature
have also been discussed in this chapter.
11.8 References
1. Texas Transportation Institute, Texas A and M University System. Travel Time Data
Collection Handbook,Report FHWA-PL-98-035, 1998.
3. Final Report of Evaluation of Freeway Travel Time Estimates. Castle Rock Consultants
Inc, Portland State University, 2019.
5. B Coifman. Length based vehicle classification on freeways from single loop Detectors. al
University Transportation Center Final Report, 2009.
7. S Ding. Freeway Travel Time Estimation using Limited Loop Data. Master Thesis, The
University of Akron, 2008.
10. L Guillaume. Road Traffic Data: Collection Methods and Applications. JRC Technical
note 47967, 2008.
11. U Leeds. Collection Methods for Additional Data, IMAGINE project no. 503549. Insti-
tute for Transport Studies, University of Leeds, United Kingdom, 2006.
12. P T Martin, Y Feng, and X Wang. Detector Technology Evaluation. Department of Civil
and Environmental Engineering, Utah Traffic Lab, 2003.
14. N Nihan, X Zhang, and Y Wang. Improved System for Collecting Real-Time Truck Data
from Dual Loop Detectors. Transportation Northwest, 2005.
15. S G Ritchie S Park and O Cheol. Field Investigation of Advanced Vehicle Re-identification
Techniques and Detector. California PATH Research Report, 2002.
16. A Parsekar. Blind Deconvolution of Vehicle Inductive Signatures for Travel Time Estima-
tion. Master thesis, Department of Computer Science, University of Minnesota Duluth,
Duluth, Minnesota -55812, 2004.
17. C Ulberg. Vehicle occupancy forecasting, Technical Report. Washington State De-
partment of Transportation Technical, Graduate School of Public Affairs University of
Washington Seattle, Washington 98105, 1994.
18. J Xia and M Chen. Freeway Travel Time Forecasting Under Incident. Final Report,
Southeastern Transportation Center, Department of Civil Engineering, University of Ken-
tucky, Lexington, KY 40506, 2007.
19. B Young and M Saito. Automated Delay Estimation at Signalized Intersections. Research
Division, 2011.
20. Y Zhirui. Speed estimation using single loop detector outputs. Some studies, Ph.D thesis,
Department of CIVIL Engineering, Texas A and M University, 2007.
Chapter 12
12.1 Introduction
Modelling arrival of vehicle at section of road is an important step in traffic flow modelling.
It has important application in traffic flow simulation where vehicles are to be generated how
vehicles arrive at a section. The vehicle arrival is obviously a random process. This is evident
if one observe how vehicles are arriving at a cross section. Some times several vehicles come
together, while at other times, they come sparsely. Hence, vehicle arrival at a section need to be
characterized statistically. Vehicle arrivals can be modelled in two inter-related ways; namely
modelling what is the time interval between the successive arrival of vehicles or modelling how
many vehicle arrive in a given interval of time. In the former approach, the random variables
the time denoting interval between successive arrival of vehicle can be any positive real values
and hence some suitable continuous distribution can be used to model the vehicle arrival. In the
later approach, the random variables represent the number of vehicles arrived in a given interval
of time and hence takes some integer values. Here in this approach, a discrete distribution can
be used to model the process. This chapter presents how some continuous distributions can be
used to model the vehicle arrival process.
Occupancy Time
111111111111
000000000000
00000
11111
000000000000
111111111111
00000
11111
000000000000
111111111111
00000
11111
000000000000
111111111111
00000
11111
000000000000
111111111111
00000
11111
000000000000
111111111111
00000
11111
000000000000
111111111111
00000
11111 Time gap
1111 000000
0000
000000000000
111111111111 111111
000000000000
111111111111
000000000000
111111111111
000000000000
111111111111
Observation
000000000000
111111111111
Distance
1 point
0 t 00
1100
000000000000
1111111111111100
11 00 110011t
000000000000t
111111111111
1 2 3 t4
000000000000
111111111111
000000000000
111111111111
000000000000
111111111111
000000000000
111111111111
000000000000
111111111111
000000000000
111111111111
000000000000
111111111111
000000000000
111111111111
000000000000
111111111111
000000000000
111111111111
000000000000
111111111111
000000000000
111111111111
Time
arrivals is defined as headway. This is shown as a time-distance diagram in figure 12:1. In fact
the headway consist of two components, the occupancy time which is the duration required for
the vehicle to pass the observation point and the time gap between the rear of the lead vehicle
and front of the following vehicle. Hence, the headways h1 = t2 − t1 , h2 = t3 − t2 , . . . It
may be noted that the headways h1 , h2 , . . . will not be constant, but follows some random
distribution. Further, under various traffic states, different distribution may best explain the
arrival pattern. A brief discussion of the various traffic states and suitable distributions are
discussed next.
(a) Headway follow a random process as there is no interaction between the arrival of
two vehicles.
(b) The arrival of one vehicle is independent of the arrival of other vehicle.
(c) The minimum headway is governed by the safety criteria.
3. Intermediate flow
(a) Some vehicle travel independently and some vehicle has interaction with other vehi-
cles.
(b) More difficult to analyze, however, has more application in the field.
(c) Pearson Type III Distribution can be used which is a very general case of negative
exponential distribution.
where t is the random variable. This means that the total probability defined by the probability
density function is one. Second:
Z b
p[a ≤ t ≤ b] = f (t) dt (12.2)
a
This gives an expression for the probability that the random variable t takes a value with in
an interval, which is essentially the area under the probability density function curve. The
probability density function of negative exponential distribution is given as:
λ = 1.5
λ=1
f(t)
λ = 0.5
Figure 12:2: Shape of the Negative exponential distribution for various values of λ
where λ is a parameter that determines the shape of the distribution often called as the shape
parameter. The shape of the negative exponential distribution for various values of λ (0.5, 1,
1.5) is shown in figure 12:2. The probability that the random variable t is greater than or equal
to zero can be derived as follow,
Z ∞
p(t ≥ 0) = λ e−λt dt (12.4)
0
Z ∞
= λ e−λt dt
0−λt ∞
e
= λ
−λ 0
∞
= −e−λt 0
= −e−λ∞ + e−λ0
= 0+1=1
The probability that the random variable t is greater than a specific value h is given as
p(t ≥ h)
t
h
f (t)
p(t ≥ h + δh)
t
h+δ h
f (t)
p(h ≤ t ≤ h + δh)
t
h h+δ h
Unlike many other distributions, one of the key advantages of the negative exponential dis-
tribution is the existence of a closed form solution to the probability density function as seen
above. The probability that the random variable t lies between an interval is given as:
This is illustrated in figure 12:3. The negative exponential distribution is closely related to
the Poisson distribution which is a discrete distribution. The probability density function of
Poisson distribution is given as:
λx e−λ
p(x) = (12.7)
x!
where, p(x) is the probability of x events (vehicle arrivals) in some time interval (t), and λ is
the expected (mean) arrival rate in that interval. If the mean flow rate is q vehicles per hour,
q
then λ = 3600 vehicles per second. Now, the probability that zero vehicle arrive in an interval
t, denoted as p(0), will be same as the probability that the headway (inter arrival time) greater
than or equal to t. Therefore,
λ0 e−λ
p(x = 0) =
0!
= e−λ
= p(h ≥ t)
t
= e−λ
Here, λ is defined as average number of vehicles arriving in time t. If the flow rate is q vehicles
per hour, then,
q× t t
λ= = (12.8)
3600 µ
Since mean flow rate is inverse of mean headway, an alternate way of representing the probability
density function of negative exponential distribution is given as
1 −t
f (t) = eµ (12.9)
µ
where µ = λ1 or λ = µ1 . Here, µ is the mean headway in seconds which is again the inverse
of flow rate. Using equation 12.6 and equation 12.5 the probability that headway between
any interval and flow rate can be computed. The next example illustrates how a negative
exponential distribution can be fitted to an observed headway frequency distribution.
Numerical Example
An observation from 2434 samples is given table below. Mean headway and the standard
deviation observed is 3.5 and 2.6 seconds respectively. Fit a negative exponential distribution.
Solution: The solution is shown in Table 12:2. The headway range and the observed proba-
bility (or proportion) is given in column (2), (3) and (4). The observed frequency for the first
interval (0 to 1) can be computed as the product of observed frequency pi and the number of
observation (N). That is, fio = pi × N = 0.012 × 2434 = 29.21 and is shown in column (5).
The probability that the headway greater than t = 0 is computed as p(t ≥ 0) = e−0 = 1 (refer
equation 12.5) and is given in column (6). These steps are repeated for the second interval,
that is fio = 0.178 × 2434 = 433.25, and p(t ≥ 1) = e−1 = 0.751. Now, the probability of
headway lies between 0 and 1 for the first interval is given by the probability that headway
greater than zero from the first interval minus probability that headway greater than one from
second interval. That is pi (0 ≤ t ≤ 1) = pi (t > 0) − pi (t > 1) = 1.00 − 0.751 = 0.249 and
is given in column (7). Now the computed frequency fic is pi × N = 0.249 × 2434 = 604.904
and is given in column (8). This procedure is repeated for all the subsequent items. It may be
noted that probability of headway > 9.0 is computed by 1-probability of headway less than 9.0
= 1 − (0.249 + 0.187 + . . . ) = 0.076.
f(t)
−α 0 −α
where µ is the mean of the headway and σ is the standard deviation of the headways. The
shape of the probability density function is shown in figure 12:4. The probability that the time
headway (t) less than a given time headway (h) is given by
Z h
p(t ≤ h) = f (t) dt (12.11)
−∞
and the value of this is shown as the area under the curve in figure 12:5 (a) and the probability
of time headway (t) less than a given time headway (h + δh) is given by
Z h+δh
p(t ≤ h + δh) = f (t) dt (12.12)
−∞
This is shown as the area under the curve in figure 12:5 (b). Hence, the probability that the
time headway lies in an interval, say h and h + δh is given by
This is illustrated as the area under the curve in figure 12:5 (c). Although the probability
for headway for an interval can be computed easily using equation 12.13, there is no closed
form solution to the equation 12.11. Eventhough it is possible to solve the above equation
by numerical integration, the computations are time consuming for regular applications. One
way to overcome this difficulty is to use the standard normal distribution table which gives
the solution to the equation 12.11 for a standard normal distribution. A standard normal
distribution is normal distribution of a random variable whose mean is zero and standard
deviation is one. The probability for any random variable, having a mean (µ) and standard
deviation (σ) can be computed by normalizing that random variable with respect to its mean
p(t ≤ h)
t
h
f (t)
p(t ≤ h + δh)
t
h+δ h
f (t)
p(h ≤ t ≤ h + δh)
t
h h+δ h
Figure 12:5: Illustration of the expression for probability that the random variable lies in an
interval for normal distribution
and standard deviation and then use the standard normal distribution table. This is based on
the concept of normalizing any normal distribution based on the assumption that if t follows
normal distribution with mean µ and standard deviation σ, then (t − µ)/σ follows a standard
normal distribution having zero mean and unit standard deviation. The normalization steps
shown below.
h−µ t−µ (h + δh) − µ
p[h ≤ t ≤ (h + δh)] = p ≤ ≤ (12.14)
σ σ σ
(h + δh) − µ h−µ
= p t≤ −p t≤
σ σ
The first and second term in this equation be obtained from standard normal distribution table.
The following example illustrates this procedure.
Numerical Example
If the mean and standard deviation of certain observed set of headways is 2.25 and 0.875
respectively, then compute the probability that the headway lies in an interval of 1.5 to 2.0
seconds.
f(t)
3σ 2σ σ µ σ 2σ t
Solution: The probability that headway lies between 1.5 and 2.0 can be obtained using
equation 12.14, given that µ = 2.25 and σ = 0.85 as:
Note that the p(t ≤ −0.29) and p(t ≤ −0.80) are obtained from the standard normal distri-
bution tables. Since the normal distribution is defined from −α to +α unlike an exponential
distribution which is defined only for positive number, it is possible that normal distribution
may generate negative headways. A practical way of avoiding this is to shift the distribution
by some value so that it will mostly generate realistic headways. The concept is illustrated in
figure 12:6. Suppose α is the minimum possible headway and if we set α = µ − σ than about
60% of headway will be greater than α. Alternatively, if we set α = µ − 2σ, than about 90%
of the headway will be greater than α. Further, if we set α = µ − 3σ, than about 99% of the
headway will be greater than α. To generalize,
α = µ − nσ
where n is 1, 2, 3, etc and higher the value of n, then is better the precision. From this equation,
we can compute the value of σ to be used in normal distribution calculation when the random
variable cannot be negative as:
µ−α
σ = (12.15)
n
Numerical Example
Given that observed mean headway is 3.5 seconds and standard distribution is 2.6 seconds, then
compute the probability that the headway lies between 0 and 0.5. Assume that the minimum
expected headway is 0.5 seconds.
Solution: First, compute the standard deviation to be used in calculation using equation 12.15,
given that µ = 3.5, σ = 2.6, and α = 0.5. Then:
µ−α 3.5 − 0.5
σ= = = 1.5 (12.16)
2 2
Second, compute the probability that headway less than zero.
0 − 3.5
p(t < 0) ≈ p t ≤
1.5
= p(t ≤ −2.33) = 0.01
The value 0.01 is obtained from standard normal distribution table. Similarly, compute the
probability that headway less than 0.5 as
0.5 − 3.5
p(t ≤ 0.5) ≈ p t ≤
1.5
= p(t < −2)
= 0.023
The value 0.23 is obtained from the standard normal distribution table. Hence, the probability
that headway lies between 0 and 0.5 is obtained using equation 12.14 as p(0 ≤ t ≤ 0.5)=0.023 −
0.010 = 0.023.
Numerical Example
An observation from 2434 samples is given table below. Mean headway observed was 3.5 seconds
and the standard deviation observed was 2.6 seconds. Fit a normal distribution, if we assume
minimum expected headway is 0.5.
Solutions The given headway range and the observed probability is given in column (2), (3)
and (4). The observed frequency for the first interval (0 to 1) can be computed as the product of
observed frequency pi and the number of observation (N) i.e. poi = pi ×N = 0.012×2434 = 29.21
as shown in column (5). Compute the standard deviation to be used in calculation, given that
µ = 3.5, σ = 2.6, and α = 0.5 as:
µ−α 3.5 − 0.5
σ = = = 1.5
2 2
Dr. Tom V. Mathew, IIT Bombay 12.11 February 19, 2014
Transportation Systems Engineering 12. Vehicle Arrival Models : Headway
The value 0.01 is obtained for standard normal distribution table is shown in column (6).
Similarly, compute the probability that headway less than 1.0 as:
1.0 − 3.5
p(t ≤ 1) ≈ p t ≤
1.5
= p(t < −2)
= 0.048
The value 0.048 is obtained from the standard normal distribution table is shown in column (6).
Hence, the probability that headway between 0 and 1 is obtained using equation 12.14 as
p(0 ≤ t ≤ 1)=0.048 − 0.010 = 0.038 and is shown in column (7). Now the computed frequency
Fic is p(t < h < t + 1) × N = 0.038 × 2434 = 92.431 and is given in column (8). This procedure
is repeated for all the subsequent items. It may be noted that probability of headway > 9.0 is
computed by one minus probability of headway less than 9.0 = 1−(0.038+0.111+. . . ) = 0.010.
f (t) = λ
Γ(K)
[λ(t − α)]K−1 e−λ(t−α) , K, α ∈ R (12.17)
where λ is a parameter which is a function of µ, K and α, and determine the shape of the
distribution. The term µ is the mean of the observed headways, K is a user specified parameter
greater than 0 and is called as a shift parameter. The Γ() is the gamma function and given as
It may also be noted that Pearson Type III is a general case of Gamma, Erlang and Negative
Exponential distribution as shown in below:
f (t) = λ
Γ(K)
[λ(t − α)]K−1 e−λ(t−α) K, α ∈ R Pearson
= λ
Γ(K)
[λt]K−1 e−λt if α = 0 Gamma
= λ
(K−1)!
[λt]K−1 e−λt if K ∈ I Erlang
= λe −λt
if K = 1 Neg. Exp.
The expression for the probability that the random headway (t) is greater than a given headway
(h), p(t ≥ h), is given as:
Z ∞
p(t ≥ h) = f (t) dt (12.19)
h
and hence, the probability that the headway between h and h + δh is given as
Z ∞ Z ∞
p(h ≤ t ≤ (h + δh)) = f (t)dt − f (t) dt (12.21)
h (h+δh)
It may be noted that closed form solution to equation 12.19 and equation 12.20 is not available.
Numerical integration is also difficult due to computational requirement. Using table as in the
case of Normal Distribution is difficult, since the table will be different for each K. A common
way of solving this is by using the numerical approximation to equation 12.21. The solution
to equation 12.21 is essentially the area under the curve defined by the probability density
function between h and h + δh. If we assume that line joining f (h) and f (h + δh) is linear,
which is a reasonable assumption if δh is small, than the are under the curve can be found out
by the following approximate expression:
f (h) + f (h + δh)
p(h ≤ t ≤ (h + δh)) ≈ × δh (12.22)
2
1. Input required: the mean (µ) and the standard deviation (σ) of the headways.
2. Set the minimum expected headway (α). Say, for example, 0.5. It means that the
p(t < 0.5) ≈ 0.
3. Compute the shape factor using the mean (µ) the standard deviation (σ) and the mini-
mum expected headway (α)
µ−α
K=
σ
p(t ≤ h) f (h)
b
t
h
f (t)
p(t ≤ h + δh)
f (h + δh)
b
t
h+δ h
f (t) h
f (h)+f (h+δh)
i
p(h ≤ t ≤ h + δh) ≈ 2 × δh
b
b
t
h h+δ h
Figure 12:7: Illustration of the expression for probability that the random variable lies in an
interval for Person Type III distribution
Although the closed form solution of Γ(K) is available, it is difficult to compute. Hence,
it can be obtained from gamma table. For, example:
Note that the value of Γ(1.785) is obtained from gamma table for Γ(x) which is given for
1 ≤ x ≤ 2.
6. Using equation 12.17 solve for f (h) by setting t = h where h is the lower value of the
range and f (h+δh) by setting t = h+δh where (h+δh) is the upper value of the headway
range. Compute the probability that headway lies between the interval of h and h + δh
using equation 12.22.
The Gamma function can be evaluated by the following approximate expression also:
r
x −x 2π 1 1
Gamma(x) = x e 1+ + + ... (12.24)
x 12 x 288x2
Numerical Example
An observation from 2434 samples is given table below. Mean headway observed was 3.5 seconds
and the standard deviation 2.6 seconds. Fit a Person Type III Distribution.
Solutions Given that mean headway (µ) is 3.5 and the standard deviation (σ) is 2.6. As-
suming the expected minimum headway (α) is 0.5, K can be computed as
µ−α 3.5 − 0.5
K = = = 1.15
σ 2.6
and flow rate term λ as
K 1.15
λ = = = 0.3896
µ−α 3.5 − 0.5
Now, since K = 1.15 which is between 1 and 2, Γ(K) can be obtained directly from the
gamma table as Γ(K) = 0.93304. Here, the probability density function for this example can
be expressed as
0.3846
f (t) = × [ 0.3846 × (t − 0.5) ]1.15−1 × e−0.3846 (t−0.5)
0.93304
The given headway range and the observed probability is given in column (2), (3) and (4). The
observed frequency (fio ) for the first interval (0 to 1) can be computed as the product of observed
proportion poi and the number of observations (N). That is, fio = poi ×N = 0.012×2434 = 29.21
as shown in column (5). The probability density function value for the lower limit of the first
interval (h=0) is shown in column (6) and computed as:
0.3846
f (0) = [ 0.3846 × (0 − 0.5)]1.15−1 × e−0.3846 (0−0.5) ≈ 0.
0.93304
Note that since t−α (0−0.5) is negative and K −1 (1.15−1) is a fraction, the above expression
cannot be evaluated and hence approximated to zero (corresponding to t=0.5). Similarly, the
probability density function value for the lower limit of the second interval (h=1) is shown in
column 6 and computed as:
0.3846
f (1) = [0.3846(1 − 0.5)]1.15−1 × e−0.3846(1−0.5) = 0.264
0.93304
Now, for the first interval, the probability
for headway between 0 and 1 is computed by equa-
c f (0)+(f (1)
tion ?? as pi (0 ≤ t ≤ 1) = 2
× (1 − 0) = (0 + 0.0264)/2 × 1 = 0.132 and is
given in column (7). Now the computed frequency fic is pci × N = 0.132 × 2434 = 321.1 and
is given in column (8). This procedure is repeated for all the subsequent items. It may be
noted that probability of headway > 9 is computed by 1-probability of headway less than 9
= 1 − (0.132 + 0.238 + . . . ) = 0.044. The comparison of the three distribution for the above
data is plotted in Figure 12:8.
u
t u
t Observed
u
t d
l l
d Exponential
0.3 d
l b sr sr sr Normal
d
l srb t
u sr
0.2 t
u b b Pearson Type III
b sr d
l bl t sr
0.1 d bu
d
l bl d
l
d
t
u sbl
sru
t d
r
t
u sbl
d
t
u
r sbl
d
t
ru sbu
t
r
1 2 3 4 5 6 7 8 9
12.6 Conclusion
This chapter covers how the vehicle arrival can be modelled using various distributions. The
negative exponential distribution is used when the traffic is low and is most simplest of the
distributions in terms of computation effort. The normal distribution on the other hand is
used for highly congested traffic and its evaluation require standard normal distribution tables.
The Pearson Type III distribution is a most general kind of distribution and can be used
intermediate or normal traffic conditions.
12.7 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
2. Adolf D. May. Fundamentals of Traffic Flow. Prentice - Hall, Inc. Englewood Cliff New
Jersey 07632, second edition, 1990.
Chapter 13
13.1 Introduction
As already noted in the previous chapter that vehicle arrivals can be modelled in two inter-
related ways; namely modelling how many vehicle arrive in a given interval of time, or modelling
what is the time interval between the successive arrival of vehicles. Having discussed in detail
the former approach in the previous chapter, the first part of this chapter discuss how a discrete
distribution can be used to model the vehicle arrival. Traditionally, Poisson distribution is used
to model the random process, the number of vehicles arriving a given time period. The second
part will discuss methodologies to generate random vehicle arrivals, be it the generation of
random headways or random number of vehicles in a given duration. The third part will
elaborate various ways of evaluating the performance of a distribution.
h1 h2 h3 h4 h5 h6 h7 h8 h9 h10
Time
t1 t2 t3 t4
continuous distribution that best fit the observed headways (or inter-arrival time) can be used in
modelling. However, since these process are inter-related, the distributions that describe these
relations should also be inter-related for better explanation of the phenomenon. Interestingly,
there exist distributions that meet the above requirements. First, we will see the distribution
to model the number of vehicles arrived in a given duration of time. Poisson distribution is
commonly used to describe such a random process. The probability density function of the
Poisson distribution is given as:
µx e−µ
p(x) = (13.1)
x!
where p(x) is the probability for x events will occur in the time interval, and µ is the expected
rate of occurrence of that event in that interval. Some special cases of this distribution is given
below.
p(0) = e−µ
µe−µ
p(1) = = µ p(0)
1
µ2 e−µ µ
p(2) = = p(1)
2! 2
µ
∴ p(n) = p(n − 1).
n
Since the events are discrete, the probability that certain number of vehicles (n) arriving in an
interval can be computed as:
X
n
p(x ≤ n) = p(i), i ∈ I.
i=0
Similarly, the probability that the number of vehicles arriving in the interval is exactly in a
range (between a and b, both inclusive and a < b) is given as:
X
b
p(a ≤ x ≤ b) = p(i), i ∈ I.
i=a
Numerical Example
The hourly flow rate in a road section is 120 vph. Use Poisson distribution to model this vehicle
arrival.
Table 13:1: Probability values of vehicle arrivals computed using Poisson distribution
n p(n) p(x ≤ n) F (n)
0 0.135 0.135 8.120
1 0.271 0.406 16.240
2 0.271 0.677 16.240
3 0.180 0.857 10.827
4 0.090 0.947 5.413
5 0.036 0.983 2.165
6 0.012 0.995 0.722
7 0.003 0.999 0.206
8 0.001 1.000 0.052
9 0.000 1.000 0.011
10 0.000 1.000 0.011
Similarly, the probability of one vehicles arriving in one minute p(1) is given by,
µx e−µ 2.e−2
p(1) = = = 0.271.
x! 1!
Now, the probability that number of vehicles arriving is less than or equal to zero is given as
Similarly, probability that the number of vehicles arriving is less than or equal to 1 is given as:
Again, the probability that the number of vehicles arriving is between 2 to 4 is given as:
Now, if the p(0) = 0.135, then the number of intervals in an hour where there is no vehicle
arriving is
The above calculations can be repeated for all the cases as tabulated in Table 13:1. The shape
of this distribution can be seen from Figure 13:2 and the corresponding cumulative distribution
is shown in Figure 13:3.
p(n)
0.3 t
u tu
0.2 ut
t
u
0.1 ut
ut
0
ut ut ut ut tu n
0 1 2 3 4 5 6 7 8 9 10
Figure 13:2: Probability values of vehicle arrivals computed using Poisson distribution
P
p(n)
1.0 ut ut ut ut tu tu
ut
0.9
ut
0.8
0.7 t
u
0.6
0.5
0.4 t
u
0.3
0.2
t
u
0.1
0 n
0 1 2 3 4 5 6 7 8 9 10
Figure 13:3: Cumulative probability values of vehicle arrivals computed using Poisson distri-
bution
Numerical Example
Generate vehicles for ten minutes if the flow rate is 120 vph.
Solution The first two steps of this problem is same as the example problem solved earlier and
the resulted from the table is used. For the first interval, the random number (X) generated is
0.201 which is greater than p(0) but less than p(1). Hence, the number of vehicles generated in
this interval is one (ni = 1). Similarly, for the subsequent intervals. It can also be computed that
at the end of 10th interval (one minute), total 23 vehicle are generated. Note: This amounts
to 2.3 vehicles per minute which is higher than given flow rate. However, this discrepancy is
because of the small number of intervals conducted. If this is continued for one hour, then this
average will be about 1.78 and if continued for then this average will be close to 2.02.
t = f −1 (X)
t = −µ × log(X)
where, X is a random number between 0 and 1, µ is the mean headway, and the resultant
headways generated (t) will follow exponential distribution.
Numerical Example
Simulate the headways for 10 vehicles if the flow rate is 120 vph.
Solution Since the given flow rate is 120 vph, then the mean headway (µ) is 30 seconds.
Generate a random number between 0 and 1 and let this be 0.62. Hence, by the above equation,
t = 30 × (− log(0.62)) = 14.57. Similarly, headways can be generated. The table below given
the generation of 15 vehicles and it takes little over 10 minutes. In other words, the table below
gives the vehicles generated for 10 minutes. Note: The mean headway obtained from this 15
headways is about 43 seconds; much higher than the given value of 30 seconds. Of, course this
is due to the lower sample size. For example, if the generation is continued to 100 vehicles,
then the mean would be about 35 seconds, and if continued till 1000 vehicles, then the mean
would be about 30.8 seconds.
fic = pci × N.
c Σfic × ( 2hi2+δh )
µ = ,
N
where hi is the lower limit of the ith interval, and δh is the interval range. The standard
deviation σ c can be obtained by
c 2 c
Σ(hmi − µ ) fi
σc = .
N
If the distribution fit closely, then the mean and the standard deviation of the observed and
fitted data will match. However, it is possible, that two sample can have similar mean and
standard deviation, but, may differ widely in the individual interval. Hence, this can be con-
sidered as a quick test for the comparison purposes. For better comparison, Chi-square test
which gives a better description of the suitability of the distribution may be used.
i=1
fic
where fio is the observed frequency, fic is the computed (theoretical) frequency of the ith interval,
and n is the number of intervals. Obviously, a X 2 value close to zero implies a good fit of the
data, while, high X 2 value indicate poor fit. For an objective comparison Chi-square tables are
used. A chi-square table gives X 2 values for various degree of freedom. The degree of freedom
(DOF) is given as
DOF = n − 1 − p
where n is the number of intervals, and p is the number of parameter defining the distribution.
Since negative exponential distribution is defined by mean headway alone, the value of p is one,
where as Pearson and Normal distribution has the value of p as two, since they are defined by µ
and σ. Chi-square value is obtained from various significant levels. For example, a significance
level of 0.05 implies that the likelihood that the observed frequencies following the theoretical
distribution is is 5%. In other words, one could say with 95% confidence that the observed data
follows the theoretical distribution under testing.
Numerical Example
Solution: The given headway range and the observed probability is given in column (2),
(3) and (4). The observed frequency for the first interval (0 to 1) can be computed as the
product of observed probability pi and the number of observation (N) i.e. fio = poi × N =
0.012 × 2434 = 29.21 as shown in column (5). Now the computed frequency for the first
interval (0 to 1) is the product of computed probability and the number of observation (N) i.e.
fic = pci × N = 0.249 × 2434 = 441.21 as shown in column (7). The χ2 value can be computed as
(29.21−441.21)2
441.21
= 384.73. Similarly, all the rows are computed and the total χ2 value is obtained
as 1825.52. A chi-square table gives X 2 values for various degree of freedom. The degree of
freedom (DOF) is given as: DOF = n − 1 − p = 10 − 1 − 1 = 8, where n is the number of
intervals (10), and p is the number of parameter (1 because it is exponential distribution). Now
at a significance level of 0.05 and DOF 8, from the table, XT2 = 15.5. Since χ2T < χ2C hence
reject that the observed frequency follows exponential distribution.
13.6 Conclusion
The chapter covers three aspects: modeling vehicle arrival using Poisson distribution, generation
of random variates following certain distribution, and evaluation of distributions. Specific
evaluation include comparing the mean and standard deviation at macro level and using chi-
square test which is essentially a micro-level comparison.
13.7 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
2. Adolf D. May. Fundamentals of Traffic Flow. Prentice - Hall, Inc. Englewood Cliff New
Jersey 07632, second edition, 1990.
Chapter 14
14.1 Overview
Longitudinal spacing of vehicles are of particular importance from the points of view of safety,
capacity and level of service. The longitudinal space occupied by a vehicle depend on the
physical dimensions of the vehicles as well as the gaps between vehicles. For measuring this
longitudinal space, two microscopic measures are used- distance headway and distance gap.
Distance headway is defined as the distance from a selected point (usually front bumper) on
the lead vehicle to the corresponding point on the following vehicles. Hence, it includes the
length of the lead vehicle and the gap length between the lead and the following vehicles.
14.2.1 Notation
Before going in to the details, various notations used in car-following models are discussed here
with the help of figure 14:1. The leader vehicle is denoted as n and the following vehicle as
(n+1). Two characteristics at an instant t are of importance; location and speed. Location and
speed of the lead vehicle at time instant t are represented by xtn and vnt respectively. Similarly,
t
the location and speed of the follower are denoted by xtn+1 and vn+1 respectively. The following
vehicle is assumed to accelerate at time t + ∆T and not at t, where ∆T is the interval of time
required for a driver to react to a changing situation. The gap between the leader and the
follower vehicle is therefore xtn − xtn+1 .
Direction of traffic
vn+1 vn
n+1 n
Follower Leader
xn
yn+1 xn − xn+1
1. Agreement with field data; the simulation models developed based on General motors’
car following models shows good correlation to the field data.
In car following models, the motion of individual vehicle is governed by an equation, which
is analogous to the Newton’s Laws of motion. In Newtonian mechanics, acceleration can be
regarded as the response of the particle to stimulus it receives in the form of force which includes
both the external force as well as those arising from the interaction with all other particles in
the system. This model is the widely used and will be discussed in detail later.
where τ1 is called as sensitivity coefficient. In short, the driving strategy of nth vehicle is that,
it tries to maintain a safe speed which in turn depends on the relative position, rather than
relative speed.
for the nth vehicle (n=1, 2, ...). Each driver can respond to the surrounding traffic conditions
only by accelerating or decelerating the vehicle. As mentioned earlier, different theories on car-
following have arisen because of the difference in views regarding the nature of the stimulus.
The stimulus may be composed of the speed of the vehicle, relative speeds, distance headway
etc, and hence, it is not a single variable, but a function and can be represented as,
where fsti is the stimulus function that depends on the speed of the current vehicle, relative
position and speed with the front vehicle.
and vnt are the velocities, the gap required is given by,
vnt − vn+1
t
= τ.atn+1
1
atn+1 = [vnt − vn+1
t
]
τ
General Motors has proposed various forms of sensitivity coefficient term resulting in five gen-
erations of models. The most general model has the form,
t
)m t
t αl,m (vn+1 t
an+1 = vn − vn+1 (14.6)
(xtn − xtn+1 )l
where l is a distance headway exponent and can take values from +4 to -1, m is a speed exponent
and can take values from -2 to +2, and α is a sensitivity coefficient. These parameters are to
be calibrated using field data. This equation is the core of traffic simulation models.
In computer, implementation of the simulation models, three things need to be remembered:
1. A driver will react to the change in speed of the front vehicle after a time gap called the
reaction time during which the follower perceives the change in speed and react to it.
2. The vehicle position, speed and acceleration will be updated at certain time intervals
depending on the accuracy required. Lower the time interval, higher the accuracy.
3. Vehicle position and speed is governed by Newton’s laws of motion, and the acceleration
is governed by the car following model.
Therefore, the governing equations of a traffic flow can be developed as below. Let ∆T is
the reaction time, and ∆t is the updation time, the governing equations can be written as,
The equation 14.7 is a simulation version of the Newton’s simple law of motion v = u + at and
equation 14.8 is the simulation version of the Newton’s another equation s = ut + 21 at2 . The
acceleration of the follower vehicle depends upon the relative velocity of the leader and the
follower vehicle, sensitivity coefficient and the gap between the vehicles.
Numerical Example
Let a leader vehicle is moving with zero acceleration for two seconds from time zero. Then he
accelerates by 1 m/s2 for 2 seconds, then decelerates by 1m/s2 for 2 seconds. The initial speed
is 16 m/s and initial location is 28 m from datum. A vehicle is following this vehicle with initial
speed 16 m/s, and position zero. Simulate the behavior of the following vehicle using General
Motors’ Car following model (acceleration, speed and position) for 7.5 seconds. Assume the
parameters l=1, m=0 , sensitivity coefficient (αl,m ) = 13, reaction time as 1 second and scan
interval as 0.5 seconds.
Solution The first column shows the time in seconds. Column 2, 3, and 4 shows the accel-
eration, velocity and distance of the leader vehicle. Column 5,6, and 7 shows the acceleration,
velocity and distance of the follower vehicle. Column 8 gives the difference in velocities between
the leader and follower vehicle denoted as dv. Column 9 gives the difference in displacement
between the leader and follower vehicle denoted as dx. Note that the values are assumed to be
the state at the beginning of that time interval. At time t=0, leader vehicle has a velocity of
16 m/s and located at a distance of 28 m from a datum. The follower vehicle is also having the
same velocity of 16 m/s and located at the datum. Since the velocity is same for both, dv =
0. At time t = 0, the leader vehicle is having acceleration zero, and hence has the same speed.
The location of the leader vehicle can be found out from equation as, x = 28+16×0.5 = 36
m. Similarly, the follower vehicle is not accelerating and is maintaining the same speed. The
location of the follower vehicle is, x = 0+16×0.5 = 8 m. Therefore, dx = 36-8 =28m. These
steps are repeated till t = 1.5 seconds. At time t = 2 seconds, leader vehicle accelerates at the
rate of 1 m/s2 and continues to accelerate for 2 seconds. After that it decelerates for a period
Velocity
17
16
15
0 5 10 15 20 25 30
Time(seconds)
0.5
−0.5
−1
−1.5 30
0 5 10 15 20 25
Time(seconds)
of two seconds. At t= 2.5 seconds, velocity of leader vehicle changes to 16.5 m/s. Thus dv
becomes 0.5 m/s at 2.5 seconds. dx also changes since the position of leader changes. Since the
reaction time is 1 second, the follower will react to the leader’s change in acceleration at 2.0
seconds only after 3 seconds. Therefore, at t=3.5 seconds, the follower responds to the leaders
change in acceleration given by equation i.e., a = 13×0.5
28.23
= 0.23 m/s2 . That is the current ac-
celeration of the follower vehicle depends on dv and reaction time ∆ of 1 second. The follower
will change the speed at the next time interval. i.e., at time t = 4 seconds. The speed of the
follower vehicle at t = 4 seconds is given by equation as v= 16+0.231×0.5 = 16.12 The location
of the follower vehicle at t = 4 seconds is given by equation as x = 56+16×0.5+ 12 ×0.231×0.52
= 64.03 These steps are followed for all the cells of the table.
The earliest car-following models considered the difference in speeds between the leader and
the follower as the stimulus. It was assumed that every driver tends to move with the same
where l is a distance headway exponent and can take values from +4 to -1, m is a speed exponent
and can take values from -2 to +2, and α is a sensitivity coefficient. These parameters are to
be calibrated using field data.
14.4 Summary
Microscopic traffic flow modeling focuses on the minute aspects of traffic stream like vehicle to
vehicle interaction and individual vehicle behavior. They help to analyze very small changes
in the traffic stream over time and space. Car following model is one such model where in the
stimulus-response concept is employed. Optimal models and simulation models were briefly
discussed.
14.5 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
Chapter 15
15.1 Overview
The transfer of a vehicle from one lane to next adjacent lane is defined as lane change. Lane
changing has a significant impact on traffic flow. Lane changing models are therefore an im-
portant component in microscopic traffic simulators, which are increasingly the tool of choice
for a wide range of traffic-related applications at the operational level. Modeling the behaviour
of a vehicle within its present lane is relatively straightforward, as the only considerations of
any importance are the speed and location of the preceding vehicle. Lane changing, however,
is more complex, because the decision to change lanes depends on a number of objectives, and
at times these may conflict. Gap acceptance models are used to model the execution of lane-
changes. The available gaps are compared to the smallest acceptable gap (critical gap) and a
lane-change is executed if the available gaps are greater. Gaps may be defined either in terms
of time gap or free space.
Change direction
Gap
acceptance
MLC MLC
Driving Driving
conditions conditions
not
satisfactory satisfactory
other current
lanes lanes
Mandatory Lane Change (MLC): Mandatory lane change (MLC) occurs when a driver
must change lane to follow a specified path Suppose if a driver wants to make a right turn at
the next intersection the he changes to the right most lane which is referred as Mandatory Lane
change.
Discretionary Lane Change (DLC): Discretionary lane change (DLC) occurs when a
driver changes to a lane perceived to offer better traffic conditions, he attempts to achieve
desired speed, avoid following trucks, avoid merging traffic, etc. Suppose if a driver perceives
better driving conditions in the adjacent lane then he makes a Discretionary Lane change.
must be completed, the number of lanes to cross to reach a lane connected to the next link,
delay (time elapsed since the MLC conditions apply), and whether the subject vehicle is a
heavy vehicle (bus, truck, etc..,). Drivers are likely to respond to the MLC situations earlier if
it involves crossing several lanes. A longer delay makes a driver more anxious and increases the
likelihood of responding to the MLC situations. And finally, due to lower maneuverability and
larger gap length requirement of heavy vehicles as compared to their non heavy counterparts,
they have a higher likelihood of responding to the MLC conditions.
Lane 2
Lane 1
to force in to the target lane and compel the lag vehicle to slow down.
3. Gap acceptance
Lane changing process is explained using the example which is shown in Figure 15:3. The
subject vehicle in lane 2 makes a decision to consider a lane change and then it selects a target
lane which may be either lane 1 or lane 3. Then it checks for the feasibility of lane change.
Now this subject vehicle accepts the gap in the target lane to make a lane change.
where, Vn (t + T ) is the maximum safe speed for vehicle n with respect to the preceding vehicle
at time (t+T), Vn (t) is the velocity nth vehicle, Vn−1 (t) is the velocity n-1th vehicle, bn (< 0) is
the most severe braking the driver is prepared to undertake, T is the time between consecutive
calculations of speed and position, b is an estimate of bn−1 employed by the driver of vehicle n,
and Dx (t) is the distance between front of subject vehicle and rear of leading vehicle at t. The
driver is assumed to decide to change lane if Dx is more than the existing space gap between
the subject vehicle and preceding vehicle in current lane.
critical gap for driver n at time t is assumed to have the following relation.
where, Gg,cr g
n (t) is the critical gap measure for gap G perceived by driver n at time step t, Xn (t)
is the explanatory variable used to characterize mean Gg,cr
n (t), εn is the random term follows
log normal distribution, and αg is the parameter of driver specific random term vn . Assuming
total clear gap + vehicle length
X lag gap lead gap Y
lag vehicle
lead vehicle
subject
X front vehicle Y
εgn (t) ≈ N(0, σε2g ) the conditional probability of acceptance of a gap p(g) considering that the
probability of lead gap acceptance (p(lead)) and lag gap (p(lag)) acceptance as two independent
events is probability that the lead and lag gaps are accepted. That is:
Numerical Example
For the given state of traffic predict if the subject vehicle in the figure 5 would initiate a
lane change.if yes what is the feasibility and probability of lane change. Given is the mid-
block section of 2 lane highway with no other blocks in either of the lane. Neglect lateral
acceleration. Consider update time 1 sec. Maximum deceleration driver ready to apply is -2
m/s2 and maximum acceleration feasible is -2.2 m/s2 Assume that lane change take 1 second.
Given: σ lead =2, σ lead = 3 ,Glead =40m, Glag =50m ,β lead = β lag = 1 ,Xnlead = Xnlag = 0.8,
Vnlead = Vnlag = 0.7 , αlead =αlag = 1.2
Y
X
50 m 40m
lag vehicle
lead vehicle
18 m/s
20.83 m/s
N N−1
30 m
Subject
Solution Step 1. Decision to change the lane: In the case of discretionary lane change,
the decision to change the lane is taken by the driver when he finds higher utility in any other
lane. Here, we consider higher speed or desired speed as higher utility. Let the desired speed
be 25 m/s2 . Considering the subject vehicle as vehicle n and the vehicle preceding it in the
current lane as vehicle n-1, we calculate the minimum distance required by the subject vehicle
to attain the desired speed in a time T
The Dx in this problem is 155 m, which means that the subject vehicle requires at least 155 m
to reach his desired speed. But the gap available is 30 m. So decision is to change the lane or
trigger DLC.
Step 2. Check for the feasibility of lane change: A lane change is said to be
feasible if the subject vehicle is able to maintain maximum safe speed with respect to the
preceding vehicle in the target line. In order to find the maximum safe speed possible for the
subject vehicle to avoid collision we consider the subject vehicle as N and preceding vehicle in
the target lane as N-1. Then we substitute the values in the second equation. Vn (t + T ) =
−2 × 1 + [−22 + 22(40) − 19.4 + 182 /2.5]1/2 = 17.6m/s And the deceleration required = (17.6-
19.4)/1 = -1.79 m/s2 Since -1.79 m/s2 less than -2.2 m/s2 the lane change feasible to avoid
50 m 40 m
lag vehicle lead vehicle
18m/s
N−1
20.83 m/s
30 m
subject
collision with the lead vehicle in the target lane. Now we have to check if the lag vehicle
in the target line would be able to avoid the collision with the subject vehicle after the lane
change. For this we take lag vehicle as N th vehicle and subject vehicle as N − 1th vehicle Here,
X
Y
50 m 40 m
19.4 m lead vehicle
Lag vehicle 20.83 m
N N−1
20.83 m/s 18 m/s
30 m
X Y
DIRECTION OF TRAFFIC FLOW
Dx = 50 + 19.4 − 20.83 = 48.5m as the lag vehicle and subject vehicle would have moved some
distance during the lane change duration of 1 second. These distances are 20.83 m and 19.4
m respectively. Vn (t + T ) = −2x1 + [−22 + 22(48.5) − 20.83 + 19.42 /2.5]1/2 = 19.38m/s The
deceleration required to be applied by the lag vehicle in the target lane to avoid collision with
the subject vehicle = (19.38 − 20.83)/1 = −1.44m/s2 . Since -1.44 m/s2 ¡ -2.2 m/s2 the lane
change feasible to avoid collision of the lag vehicle in the target lane.
Step 3. Check for the gap acceptance of lane change in the given state of
traffic: Here we find that the lag gap that was available is 50 m and the lead gap is 40
This means that a given driver would opt for a lane change in the the given condition with a
probability of 0.635.
Numerical Example
In a two lane, one way stream of 1000 vph with 360 vehicles in Lane A and the remaining
vehicles in lane B. 8% of the vehicles in lane A have gaps less than 1 sec and 18% of the
vehicles in lane A have gaps less than 2 sec. Compute the time during which vehicles in Lane
B may not change to Lane A in 1 hour. Assume driver requires one second ahead and behind
in making a lane change.
Solution Total acceptable time for lane change in an hour = 3600 - total rejected headway
- total clearance time. Given that 0 to 1 second Gaps is 8% of 360 = 29 and 1 to 2 second
Gaps is (18-8) % of 360 = 36. Total = 65 Gaps. Time spent in Gaps 0 to 1 second = 29 x
.5 = 14.5 sec, and Time spent in Gaps 1 to 2 second = 36 x 1.5 = 54.0 sec. As 65 Gaps are
rejected, Acceptable Gaps are (360-65) = 295 Gaps. In this 295 Gaps clearance time = 295
x 2 = 590 sec. Time lost in rejected gap = 14.5+54=68.5. Therefore, Total time left in one
g g g g g
R A R A A
hour to accept Gap=(3600 - 590 - 68.5) = 2941 sec. Vehicle can change lane in (2941/3600) =
81.7% of the Total time. Vehicle is prevented from changing lane in 18.3% of the time.
Numerical Example
In a two lane, one way stream of 1000 vph with 360 vehicles in Lane A and the remaining
vehicles in lane B. 8% of the vehicles in lane A have gaps less than 1 sec and 18% of the
vehicles in lane A have gaps less than 2 sec. Compute the average waiting for the driver to
make a lane change. Assume driver velocity in lane B = 40 kmph and stream velocity = 50
kmph. Solution: The average length of headways and portions of head ways of insufficient
length for a lane change, which may be considered as general blockages moving in the stream.
Division of this Blockage length by the relative speed determines potential total delay time of
the blockade. Finally since a delayed vehicle is as likely to be at the head as at the tail of
such a blockade at the moment of desired lane change, the total delay must be divided by 2 for
average delay time.
1 BL
Average delay = ×
2 Vr
T ∗Vs
BL =
N
where T = 3600 × 18.3% = 658.8, Vs = 50 kmph, N = acceptable gaps. So 0 to 2 second Gaps
= 18 % of 360 = 65. Therefore N = 360-65 = 295. BL = 658.8×50 295
= 111.6. In the above figure
the vertical lines are the center line of the cars and gr , ga represents the acceptable and rejected
gaps respectively.
1 BL
Average delay = ×
2 Vr
1 111.6
Average delay = × = 5.58sec
2 (50 − 40)
15.7 Summary
Lane changing is an important component of microscopic traffic simulation model, and has
significant impact on the results of analysis that uses these tools. In recent years, interest in
the development of lane changing models and their implementation in traffic simulators have
increased dramatically. There is a lot of scope for the improvement of these lane change models
like integrating acceleration behavior, impact of the buses, bus stops, traffic signals and queues
that form due to lane change maneuver.
15.8 References
1. K I Ahmed. Modeling drivers’ acceleration and lane changing behaviors. PhD thesis,
Department of Civil and Environmental Engineering, MIT, 1999.
2. C F Choudhury. Modeling driving decisions with Latent plans. PhD thesis, Department
of Civil and Environmental Engineering, MIT, 2007.
3. D R Drew. Traffic flow theory and control. McGraw-Hill Book Company, New York,
1968. IITB–.
5. Theodore M Matson, Wilbure S smith, and Fredric W Hurd. Traffic engineering, 1955.
Chapter 16
16.1 Overview
The complexity of traffic stream behaviour and the difficulties in performing experiments with
real world traffic make computer simulation an important analysis tool in traffic engineering.
The physical propagation of traffic flows can be specifically described using traffic flow models.
By making use of different traffic simulation models, one can simulate large scale real-world
situations in great detail. Depending on the level of detailing, traffic flow models are classified
into macroscopic, mesoscopic and microscopic models. Macroscopic models view the traffic flow
as a whole whereas microscopic ones gives attention to individual vehicles and their interactions
while the mesoscopic models fall in between these two. This chapter gives an overview of the
basic concepts behind simulation models and elaboration about the microscopic approach for
modelling traffic.
A microscopic model of traffic flow attempts to analyze the flow of traffic by modelling
driver-driver and driver-road interactions within a traffic stream which respectively analyses
the interaction between a driver and another driver on road and of a single driver on the
different features of a road. Many studies and researches were carried out on driver’s behavior
in different situations like a case when he meets a static obstacle or when he meets a dynamic
obstacle. Among these, the pioneer development of car following theories paved the way for
the researchers to model the behaviour of a vehicle following another vehicle in the 1950s and
1960s.
components or entities whose interactions are complex in nature. Specifically, simulation models
are mathematical/logical representations of real-world systems, which take the form of software
executed on a digital computer in an experimental fashion. The most important advantage is
that these models are by no means exhaustive.
3. When there is a need of an animated view of flow of vehicles to study their behaviour.
It is important to note that simulation can only be used as an auxiliary tool for evaluation and
extension of results provided by other conceptual or mathematical formulations or models.
16.2.2 Applications
Traffic simulations models can meet a wide range of requirements:
5. Training personnel
6. Safety Analysis
16.2.3 Classifications
Traffic simulation models can be classified based on different criteria. Figure 16:1 shows various
types of classification. In a broader sense, they can be categorized into continuous and discrete
ones according to how the elements describing a system change their states. The latter is again
classified into two.
• Discrete time based models
Deterministic Stochastic
Macroscopic Microscopic
Mesoscopic
Continuous Discrete
The first, divides time into fixed small intervals and within each interval the simulation model
computes the activities which change the states of selected system elements. For some specific
applications, considerable savings in computational time can be achieved by the use of event
based models where scanning is performed based on some abrupt changes in the state of the
system (events). However the discrete time models could be a better choice where the model
objectives require more realistic and detailed descriptions.
According to the level of detailing, simulation models can be classified into macroscopic,
mesoscopic and microscopic models. A macroscopic model describes entities and their activities
and interactions at a low level of detail. Traffic stream is represented in an aggregate measure
in terms of characteristics like speed, flow and density. A mesoscopic model generally repre-
sents most entities at a high level of detail but describes their activities and interactions at a
much lower level of detail. A microscopic model describes both the system entities and their
interactions at a high level of detail. Car following models and lane changing models are some
significant examples. The choice of a particular type of model depends on the nature of the
problem of interest.
Depending on the type of processes represented by the model, there are deterministic and
stochastic models. Models without the use of any random variables or in other words, all entity
interactions are defined by exact mathematical/logical relationships are called deterministic
models. Stochastic models have processes which include probability functions.
3. Model development
4. Model calibration
5. Model verification
6. Model validation
7. Documentation
The most significant steps among the above are described with the help of stating the procedure
for developing a microscopic model.
1. Vehicle generation
3. Analysis
The flow diagram of a microscopic traffic simulation model is given in Figure 16.2. The basic
structure of a model includes various component models like car following models like car
following models, lane changing models etc. which come under the vehicle position updation
part. In this chapter, the vehicle generation stage is explained in detail. The vehicles can
be generated either according to the distributions of vehicular headways or vehicular arrivals.
Headways generally follow one of the following distributions.
The generation of vehicles using negative exponential distribution is demonstrated here. The
probability distribution function is given as follows.
f (x) = λe−λx (16.1)
From the above equation, the expression for exponential variate headway X can be derived as:
X = µ(− loge R) (16.2)
where, µ is the mean headway, R is the random number between 0 and 1 Random number
Start
Input and
Initialization
Headway generation
for first vehicle
Is
currenttime= Yes
multiple of scan
interval
No Vehicle position
updation
Is
Time step
updation currenttime= No
cumulative
headway
Yes
vehicle generation and
next headway generation
No Is
Simulation time
over?
Yes
End
generation is an essential part in any stochastic simulation model, especially in vehicle genera-
tion module. Numerous methods in terms of computer programs have been devised to generate
random numbers which appear to be random. This is the reason why some call them pseudo-
random numbers. Therefore headways can be generated using the above expression by giving
a random number and the mean headway as the input variables.
In a similar way, the vehicular arrival pattern can be modeled using Poisson’s distribution.
The probability mass function is given as:
λx e−λ
p(x) = (16.3)
x!
where, p(x) is the probability of x vehicle arrivals in an interval t, λ is the mean arrival rate of
vehicles If the probability of no vehicle in the interval t is given as p(0), then this probability
is same as the probability that the headway greater than or equal to t.
Numerical example
Given flow rate is 900 veh/hr. Simulate the vehicle arrivals for 1 min using negative exponential
distribution.
1
Solution Step 1: Calculate the mean headway µ = (900/3600) = 4sec. Step 2: Generate the
random numbers between 0 and 1. Step 3: Calculate the headways and then estimate the
cumulative headways. The calculations are given in Table 16:1
X = µ(−loge R)
Numerical example
The hourly flow rate in a road section is 900 veh/hr. Use Poisson distribution to model this
vehicle arrival for 10 min.
Solution Step 1: Calculate the no. of vehicles arriving per min. λ = 900/60 = 15 veh/min.
Step 2: Calculate the probability of 0, 1, 2, ... vehicles per minute using Poisson distribution
formula. Also calculate the cumulative probability as shown below.
λx e−λ
p(x) =
x!
Step 3: Generate random numbers from 0 to 1. Using the calculated cumulative probability
values, estimate the no. of vehicles arriving in that interval as shown in Table below. Here
the total number of vehicles arrived in 10 min is 143 which is almost same as the vehicle arrival
rate obtained using negative exponential distribution.
n p(x=n) p(x¡=n)
0 0.000 0
1 0.000 0.000
2 0.000 0.000
3 0.000 0.000
4 0.001 0.001
5 0.002 0.003
6 0.005 0.008
7 0.010 0.018
8 0.019 0.037
9 0.032 0.070
10 0.049 0.118
11 0.066 0.185
12 0.083 0.268
13 0.096 0.363
14 0.102 0.466
15 0.102 0.568
16 0.096 0.664
17 0.085 0.749
18 0.071 0.819
19 0.056 0.875
20 0.042 0.917
t (min) R n
1 0.231 11
2 0.162 10
3 0.909 19
4 0.871 18
5 0.307 12
6 0.008 6
7 0.654 15
8 0.775 17
9 0.632 15
10 0.901 20
143
Numerical example
The parameters obtained in GM car-following model simulation are given in Table below. Field
observed values of acceleration of follower is also given. Calibrate the model by finding the value
of α. Assume l=1 and m=0. Use optimization method to solve the problem.
α × dv
acal
i =
dx
Step 3: Therefore the objective function can be expressed as:
Step 4: Since the above function is convex, differentiating and then equating to zero will give
the solution (as stationary point is the global minimum). Differentiating with respect to and
equating to zero,
dz
=0
dα
Then, value of α is obtained as 9.74.
3. Mean error
1
ME = Σi=1 N(xi − yi ) (16.6)
N
4. Mean normalized error
1 xi − yi
MNE = Σi=1 N( ) (16.7)
N yi
where, xi is the ith measured or simulated value, yi is the ith observed value
The above error measures are useful when applied separately to measurements at each
location instead of to all measurements jointly. They indicate the existence of systematic bias
in terms of under or over prediction by the simulation model. Taking into account that the series
of measurements and simulated values can be collected at regular time intervals, it becomes
obvious that they can be interpreted as time series and, therefore, used to determine how close
the simulated and the observed values are. Thus it can be determined that how similar both
time series are. On the other hand, the use of aggregated values to validate a simulation seems
contradictory if one takes into account that it is dynamic in nature, and thus time dependent.
Theil defined a set of indices aimed at this goal and these indices have been widely used for that
purpose. The first index is Theil’s indicator, U (also called Theil’s inequality coefficient), which
provides a normalized measure of the relative error that reduces the impact of large errors:
q
1
Σ N(xi − yi )2
N i=1
U=q q (16.8)
1 2 + 1 2
N
Σi=1 N(xi ) N
Σi=1 N(y i )
The global index U is bounded, 0 ≤ U ≤ 1, with U = 0 for a perfect fit and xi = yi for i = 1 to
N, between observed and simulated values. For U ≤ 0.2, the simulated series can be accepted
as replicating the observed series acceptably well. The closer the values are to 0, the better will
be the model. For values greater than 0.2, the simulated series is rejected.
Numerical example
The observed and simulated values obtained using Model 1 and Model 2 are given in Table
below.
1. Comment on the performance of both the models based on the following error measures
- RMSE, RMSNE, ME and MNE.
Simulated values, x
Observed values, y Model 1 Model 2
0.23 0.2 0.27
0.46 0.39 0.5
0.67 0.71 0.65
0.82 0.83 0.84
Model 1
(x − y) ( x−y
y
) (x − y)2 ( x−y
y
)2
-0.030 -0.130 0.0009 0.0170
-0.070 -0.152 0.0049 0.0232
0.040 0.060 0.0016 0.0036
0.010 0.012 0.0001 0.0001
ǫ = -0.050 ǫ = -0.211 ǫ = 0.0075 ǫ = 0.0439
ME = 0.013 MNE = 0.053 RMSE = 0.043 RMSNE = 0.105
Solution
1. Using the formulas given below (Equations 16.4, 16.5, 16.6, 16.7), all the four errors can
be calculated. Here N = 4.
r
1
RMSE = Σi=1 N(xi − yyi)2
N
r
1 xi − yi 2
RMSNE = Σi=1 N( )
N yi
1
ME = Σi=1 N(xi − yi )
N
1 xi − yi
MNE = Σi=1 N( )
N yi
Tabulations required are given below. Comparing Model 1 and Model 2 in terms of
RMSE and RMSNE, Model 2 is better. But with respect to ME and MNE, Model 1 is
better.
Model 2
(x − y) ( x−y
y
) (x − y)2 ( x−y
y
)2
0.040 0.174 0.0016 0.0302
0.040 0.087 0.0016 0.0076
-0.020 -0.030 0.0004 0.0009
0.020 0.024 0.0004 0.0006
ǫ = 0.080 ǫ = 0.255 ǫ= 0.0040 ǫ = 0.0393
ME = 0.020 MNE = 0.064 RMSE = 0.032 RMSNE = 0.099
x2
Model 1 Model 2 y2
0.04 0.0729 0.0529
0.1521 0.25 0.2116
0.5041 0.4225 0.4489
0.6889 0.7056 0.6724
ǫ = 1.3851 ǫ = 1.451 ǫ = 1.3858
2. Theil’s indicator q
1
Σ N(xi
N i=1
− y i )2
U=q q
1 1
Σ N(xi )2
N i=1
+ Σ N(yi )2
N i=1
The additional tabulations required are as follows: The value of Theil’s indicator is ob-
tained as: For Model 1, U = 0.037 which is ≤ 0.2, and For Model 2, U = 0.027 which is
≤ 0.2. Therefore both models are acceptable.
5. Identify the causes of failure if any and repair the model accordingly
The methodological scheme for validation is shown in the following Figure 16:3.
System Data
Collection
Data Filtering
Analysis and
Completion
System Data
Model input to
Simulator
Simulation Model
Are
Accept Significantly
Yes Close? No
1. Execute the model to replicate existing real-world conditions and compare its results with
observed behaviour. This ”face validation” can be done to identify model or implemen-
tation deficiencies.
2. Perform ”sensitivity” tests on the study network by varying key variables and observing
model responses in a carefully designed succession of model executions.
3. Plot these results. A review will probably uncover the perceived anomalies
Statistical analysis of the simulation results are also conducted to present point estimates of
effectiveness and to form the confidence intervals. Through these processes, one can establish
that which simulation system is the best among the different alternatives.
16.5 Conclusion
It can be observed from the study that using different microscopic simulation models, large scale
real-world situations can be simulated in great detail. New applications of traffic simulation
can contribute significantly to various programs in ITS. Calibration and validation are the
major challenges to be tackled. It is expected that further exploration would open up better
opportunities for better utilization and further development of these models.
16.6 References
1. J Barcelo. Fundamentals of Traffic Simulation. Springer, 2010.
Chapter 17
Contents
17.1 Introduction
If one looks into traffic flow from a very long distance, the flow of fairly heavy traffic appears
like a stream of a fluid. Therefore, a macroscopic theory of traffic can be developed with the
help of hydrodynamic theory of fluids by considering traffic as an effectively one-dimensional
compressible fluid. The behaviour of individual vehicle is ignored and one is concerned only
with the behaviour of sizable aggregate of vehicles. The earliest traffic flow models began by
writing the balance equation to address vehicle number conservation on a road. In fact, all
traffic flow models and theories must satisfy the law of conservation of the number of vehicles
on the road.
• The traffic flow is conserved, or in other words vehicles are not created or destroyed. The
continuity or conservation equation can be applied.
• There is one to one relationship between speed and density as well as flow and density.
The difficulty with this assumption is that although intuitively correct, in some cases this can
lead to negative speed and density. Further, for a given density there exists many speed values
are actually measured. These assumptions are valid only at equilibrium condition, that is, when
the speed is a function of density. However, equilibrium can be rarely observed in practice and
therefore hard to get Speed-density relationship. These are some of the limitations of continuous
modelling. The advantages of the continuous modelling are:
• Better than input output models because flow and density are set as a function of time
and distance.
• Solving the continuity equation (or flow conservation equation) and the state equation
(speed-density and flow-density) are basic traffic flow equations (q = k.v). By using the
equation that define q, k, and v at any location x and time t, we can evaluate the system
using measures of effectiveness such as delays, travel time etc.
17.2.2 Formulation
Assuming that the vehicles are flowing from left to right, the continuity equation can be written
as
∂k(x, t) ∂q(x, t)
+ =0 (17.1)
∂t ∂x
where x denotes the spatial coordinate in the direction of traffic flow, t is the time, k is the
density and q denotes the flow. However, one cannot get two unknowns, namely k(x, t) by
and q(x, t) by solving one equation. One possible solution is to write two equations from two
regimes of the flow, say before and after a bottleneck. In this system the flow rate before and
after will be same, or
k1 v1 = k2 v2 (17.2)
From this the shock wave velocity can be derived as
q2 − q1
v(to )p = (17.3)
k2 − k1
This is normally referred to as Stock’s shock wave formula. An alternate possibility which
Lighthill and Whitham adopted in their landmark study is to assume that the flow rate q is
determined primarily by the local density k, so that flow q can be treated as a function of only
density k. Therefore the number of unknown variables will be reduced to one. Essentially this
assumption states that k(x,t) and q (x,t) are not independent of each other. Therefore the
continuity equation takes the form
q(k2 ) − q(k1 )
vs = (17.7)
k2 − k1
where q(k2 ) and q(k1 ) are the flow rates corresponding to the upstream density k2 and down-
stream density k1 of the shock wave. Unlike Stock’s shock wave formula there is only one
variable here.
N1 N2
q1 q2
∆x
(1) (2)
N1 N2
q1 = , q2 =
∆t ∆t
N2 − N1 −∆N
∆q = q2 − q1 = =
∆t ∆t
Note that q2 < q1 and therefore ∆q is negative. Therefore,
∆N = −∆q.∆t (17.8)
N1 − N2 +∆N
∆k = k2 − k1 = = ,
∆x ∆x
Therefore
∆N = ∆k∆x
From the above two equations:
∆k ∆x + ∆q ∆t = 0
Dividing by ∆t ∆x
∆k ∆q
+ =0
∆t ∆x
Assuming continuous medium (ie., taking limits) limt→0
∂q ∂k
+ =0
∂x ∂t
Dr. Tom V. Mathew, IIT Bombay 17.5 February 19, 2014
Transportation Systems Engineering 17. Traffic Flow Modeling Analogies
∂q ∂k
+ = 0, becomes
∂x ∂t
∂f (k) ∂k
+ = 0
∂k ∂t
∂k ∂(k.v)
+ = 0
∂t ∂x
∂k ∂[k.f (k)]
+ = 0, v = f (k)
∂t ∂x
Therefore,
where f (k) could be any function relating density and speed. Eg: Assuming the Greenshield’s
linear model:
vf
v = vf − k
kj
df (k) vf −vf
Therefore, f (k) + k = vf − k + k
dk kj kj
vf
= vf − 2 k
kj
Therefore,
∂k ∂k vf
+ vf − 2 k = 0 (17.9)
∂t ∂x kj
The equation 17.9 is first order quasi-linear, hyperbolic, partial differential equation (a special
kind of wave equation).
x0 x
dk df
At the solution, dt
= 0, k is constant along the curve, f (k) + k. dk is constant along the curve.
That is,
dx
x(t) = x0 + t
dt
dt
= x0 + f (k) + k. t
dk
Dr. Tom V. Mathew, IIT Bombay 17.7 February 19, 2014
Transportation Systems Engineering 17. Traffic Flow Modeling Analogies
Note that the solution is to construct some curve e so that: (a) kt +c(k).kx is the total derivative
of k along the curve (ie., directional derivative) and (b) slope of the curve dx
dt
= c(k). We know
k(x, t). Therefore directional derivative k(x, t) along t
dk(x, t) ∂k dx ∂k
= + .
dt ∂t dt ∂x
∂k df ∂k
= + f (k) + k.
∂t dk ∂x
= 0
dk
ie., = 0
dt
df
That is k is constant along the curve e or dx dt
= f (k) + k dk is constant along curve e. Therefore
e must be straight line.
df
x(t) = x0 + f (k) + k. t
dk
If k(x, 0) = k0 is initial condition
" #
df
x(t) = x0 + f (k0 ) + k0 . t
dk k=k0
This function is plotted below along with a fundamental q-k diagram.
17.3.3 Inference
1. Density k is constant along characteristic lines
2. Characteristic lines are straight lines emanating from the boundaries of x − t plane
ie., Characteristic curve has the slope equal to the tangent of the flow density curve.
4. When two Characteristic lines intersect (ie., 2 k values at a given x,t) shock waves are
generated; and characteristic line terminate.
6. Speed of the Shock wave is ratio of the time storage rate to space storage rate; that is:
qd − qu
vw = .
kd − kv
A q = kv = k(vf − kf k)
v
wave velocity
dq vf ∼ jdx
dk = vf − 2 k k = dtj
k
k = 0 kB kA kj
x uw = dx ∼ dq
dt = dx
Shockwave
B
Characteristic lines
Vehicle trajectories
17.4 Conclusion
The advantages of the continuous modelling is that it gives good insight into the understanding
of the behaviour of traffic. It can also be applied to platoon movement, signal control, etc.
Finally, it also paves the way for the development of higher order models. However, it also
has some serious limitations. The first one is the difficulty in getting solutions for realistic
problems(initial boundary conditions). Second, the q − k and u − k relationship are complex.
It may also cause unrealistic abrupt changes in the system. Finally acceleration-deceleration
characteristics are not directly modelled in the system.
17.5 References
[1] D Chowdhury, L Santen, and A Schadschneider. Statistical physics of vehicular traffic
and some related systems. Physics Report 329, 2000. 199-329.
Chapter 18
18.1 Introduction
Models are necessary to simulate the real world scenario to some extent, or in some cases,
they can even provide the exact scenario. Characteristics of traffic changes with time, place,
human behavior etc. The models in traffic engineering are necessary to predict the behavior
of traffic in proper planning and design of the road network. The models can be microscopic
and macroscopic. In the present chapter, a macroscopic model has been discussed known as
cell transmission model which tries to simulate the traffic behavior.
In the classical methods to explain macroscopic behaviour of traffic, like hydrodynamic
theory, differential equations need to be solved to predict traffic evolution. However in situations
of sudden high density variations, like bottle-necking, the hydrodynamic model calls for a shock
wave (an ad-hoc). Hence these equations are essentially piecewise continuous which are difficult
to solve. Cell transmission models are developed as a discrete analogue of these differential
equations in the form of difference equations which are easy to solve and also take care of high
density changes.
In this lecture note the hydrodynamic model and cell transmission model and their equiv-
alence is discussed. The cell transmission model is explained in two parts, first with only a
source and a sink, and then it is extended to a network. In the first part, the concepts of
basic flow advancement equations of CTM and a generalized form of CTM are presented. In
addition, the phenomenon of instability is also discussed. In the second segment, the network
representation and topologies are established, after which the model is discussed in terms of a
linear program formulation for merging and diverging.
where, ni (t) is the number of vehicles in cell i at time t. However, equation 18.1 is not reasonable
when flow exceeds the capacity. Hence a more robust set of flow advancement equations are
presented in a later section.
where, ni−1 (t): is the number of vehicles in cell i − 1 at time t, Qi (t): is the capacity flow into
i for time interval t, Ni (t) - ni (t): is the amount of empty space in cell i at time t.
t + 1 ni(t + 1)
This represents change in flow over space equal to change in occupancy over time. Rearranging
terms of equation 18.7 we can arrive at equation 18.3, which is the same as the basic flow
advancement equation of the cell transmission model.
vkj/2
qmax
-v
ka kb
kj
1 1
v +w
qmax
−w
ka kb Density
A small modification is made in the above equation to avoid the error caused due to numerical
spreading. Equation 18.7 is rewritten as
where, α = 1 if ni−1 (t) ≤ Qi (t), and α = w/v if ni−1 (t) > Qi (t).
Solution The main purpose of cell transmission model is to simulate the real traffic conditions
for a defined stretch of road. The speed and cell length is kept constant and also the cell lengths
in cell transmission model. The solution has been divided into 4 steps as follows:
Step 1: Determination of cell length and number of cells Given clock tick, t =
30sec = 1/120th of an hour. So, cell length = distance travelled by vehicle in one clock tick
= v × t = 50 × (1/120) ≈ 5/12 km. Road stretch given = 1.25 km. Therefore, no of cells =
1.25/(5/12) = 3 cells
Step 2: Determination of constants (N & Q) N = maximum number of vehicles that
can be at time t in cell i, = cell length x jam density, = 180 x (5/12) = 75 vehicles, Q =
maximum number of vehicles that can flow into cell I from time t to t+1, = 3000 x (1/120) =
25 vehicles. Now, to simulate the traffic conditions for some time interval, our main aim is to
find the occupancies of the 3 cells (as calculated above) with the progression of clock tick. This
is easily showed by creating a table. First of all, the initial values in the tables are filled up.
Step 3: Determination of cell capacity in terms of number of vehicles for various
traffic flows. For 20% of the maximum = 600 × (1/120) vehicles. For 80% of the maximum =
2400 × (1/120) vehicles.
Step 4: Initialization of the table The table has been prepared with source cell as a
large capacity value and a gate is there which connects and regulates the flow of vehicles from
source to cell 1 as per the capacity of the cell for a particular interval. The cell constants (Q
and N) for the 3 cells are shown in the table. Note that the sink can accommodate maximum
number of vehicles whichever the cell 3 generates. Q3 is the capacity in terms of number of
vehicles of cell 3 . The value from H5 to H7 (i.e 5) corresponds to the 2min time interval with 4
clock ticks when the lane was blocked so the capacity reduced to 20% of the maximum (i.e. 600
× (1/120) vehicles). After the 2 min time interval is passed vehicles flows with full capacity
in cell 3. So the value is 25 (i.e 3000 × (1/120) vehicles).
Step 5: Computation of Occupancies Simulation need not be started in any specific
t=1 20 20 20
20 5
t=2 35
t=1 20 20 20
20 20
t=2 20
order, it can be started from any cell in the row corresponding to the current clock tick. Now,
consider cell circled (cell 2 at time 2) in the final table. Its entry depends on the cells marked
with rectangles. By flow conservation law: Occupancy = Storage + Inflow - Outflow. Note
that the Storage is the occupancy of the same cell from the preceding clock tick. Also outflow
of one cell is equal to the inflow of the just succeeding cell. Here, Storage = 20. For inflow use
equation 18.3 Inflow= min [20,min(25,25),(75-20)]= 20. Outflow= min [20,min(25,5),(75-20)]=
5. Occupancy= 20+20-5=35. Now, For cell 1 at time 2, Inflow= min [20,min(25,25),(75-20)]=
20, Outflow= min [20,min(25,25),(75-20)]= 20, Occupancy= 20+20-20=20. Now, For cell 3 at
time 2, Inflow= min [20, min (25,5),(75-20)]= 5. Outflow= 20 (:.sink cell takes all the vehicles
in previous cell) Occupancy= 20+5-20=5. Similarly, rest of the entries can be filled and the
final result is shown in Table below. From the table it can be seen that the occupancy i.e. the
number of vehicles on cell 1 and 2 increases and then decreases simulating the effect of lane
blockage in cell 3 on cell 1 and cell 2. The lane blockage lasts 2 minutes in this problem, after
that there is no congestion taken into account. So as the time passes by, the occupancy in cell
1 and cell 2 also gets reduced.
t=1 20 20 20
5 20
t=2 5
|Λ−1(j)| = 0 |Λ(j)| = 1
Solution This problem is same as the earlier problem, only change being the clock tick.
This problem has been solved in Excel. The simulation is done for this smaller clock tick; the
results are shown in Fig. 18:3 One can clearly observe the pattern in which the cells are getting
updated. After the decrease in capacity on last one-third segment queuing is slowly building up
and the backward wave can be appreciated through the first arrow. The second arrow shows
the dissipation of queue and one can see that queue builds up at a faster than it dissipates.
This simple illustration shows how CTM mimics the traffic conditions.
clock tick 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15
1 4 4 4 4 4 4 4 4 4 6 4 4 4 4 4
2 4 4 4 4 4 4 4 4 4 7 1 4 4 4 4
3 4 4 4 4 4 4 4 4 4 10 1 1 4 4 4
4 4 4 4 4 4 4 4 4 5 13 1 1 1 4 4
5 4 4 4 4 4 4 4 4 6 14 1 1 1 1 4
6 4 4 4 4 4 4 4 4 9 14 1 1 1 1 1
7 4 4 4 4 4 4 4 4 12 14 1 1 1 1 1
8 4 4 4 4 4 4 4 4 14 14 1 1 1 1 1
9 4 4 4 4 4 4 4 5 14 14 1 1 1 1 1
10 4 4 4 4 4 4 4 8 14 14 1 1 1 1 1
11 4 4 4 4 4 4 6 11 14 14 1 1 1 1 1
12 4 4 4 4 4 4 7 14 14 14 1 1 1 1 1
13 4 4 4 4 4 4 10 14 14 14 1 1 1 1 1
14 4 4 4 4 4 5 13 14 14 14 1 1 1 1 1
15 4 4 4 4 4 6 14 14 14 14 1 1 1 1 1
16 4 4 4 4 4 9 14 14 14 14 1 1 1 1 1
17 4 4 4 4 4 12 14 14 14 14 1 1 1 1 1
18 4 4 4 4 5 14 14 14 14 14 1 1 1 1 1
19 4 4 4 4 8 14 14 14 14 14 1 1 1 1 1
20 4 4 4 4 11 14 14 14 14 14 1 1 1 1 1
21 4 4 4 6 14 14 14 14 14 14 1 1 1 1 1
22 4 4 4 7 14 14 14 14 14 10 5 1 1 1 1
23 4 4 4 10 14 14 14 14 10 10 5 5 1 1 1
24 4 4 4 13 14 14 14 10 10 10 5 5 5 1 1
25 4 4 8 14 14 14 10 10 10 10 5 5 5 5 1
26 4 4 9 14 14 10 10 10 10 10 5 5 5 5 5
27 4 4 12 14 10 10 10 10 10 10 5 5 5 5 5
28 4 8 14 10 10 10 10 10 10 10 5 5 5 5 5
29 4 7 10 4 10 10 10 10 10 10 5 5 5 5 5
30 4 4 10 4 10 10 10 10 10 10 5 5 5 5 5
31 4 4 10 4 10 10 10 10 10 10 5 5 5 5 5
32 4 4 10 4 10 10 10 10 10 10 5 5 5 5 5
33 4 4 10 4 10 10 10 10 10 10 5 5 5 5 5
34 4 4 9 4 10 10 10 10 10 10 5 5 5 5 5
|Λ−1(j)|=1 |Λ(j)| = 0
Cell j
|Λ−1(j)| = 1 |Λ(j)| = 1
Cell j
Cell j
k
k
B_{k}
k
E_{k}
yk (t) = min(nBk (t), min[QBk (t), QEk (t)], δEk [NEk(t) − nEk(t)]) (18.9)
where, δ = w/v. yk (t) is the inflow to cell Ek in the time interval (t,t + 1). Defining the
maximum flows that can be sent and received by the cell i in the interval between t to t + 1 as
SI (t) = min(QI, nI), and RI (t) = min(QI , δI , [NI − nI ]). Therefore, yk (t) can be written in a
more compact form as: yk (t) = min(SBk , REk ). This means that the flow on link k should be
the maximum that can be sent by its upstream cell unless prevented to do so by its end cell. If
blocked in this manner, the flow is the maximum allowed by the end cell. From equations one
can see that a simplification is done by splitting yk (t) in to SBk and REk terms. ’S’ represents
sending capacity and ’R’ represents receiving capacity. During time periods when SBk < REk
the flow on link k is dictated by upstream traffic conditions-as would be predicted from the
forward moving characteristics of the Hydrodynamic model. Conversely, when SBk > REk , flow
is dictated by downstream conditions and backward moving characteristics.
yk (t) ≤ SBk ; yck (t) ≤ SCk yk (t) + yck (t) ≤ REk (18.10)
Bk
k
Ek
ck
Ck
where, SI (t) = (QI , nI ), and RI (t) = (QI , δI, [NI − nI ]). A number of combinations of yk (t) +
yck (t) are possible satisfying the above said constraints. Similarly for diverging a number of
possible outflows to different links is possible satisfying corresponding constraints, hence this
calls for an optimization problem. Ziliaskopoulos (2000), has given this LP formulations for
both merging and diverging, this has been discussed later
– NETCELL
– NETVIEW(a graphical post-processor)
• This is a free software and can be downloaded from the link below http://www.ce.berkeley.edu/ da-
ganzo/software and data.htm
18.6 Conclusion
18.6.1 Summary
• CTM is a discrete approximation of hydrodynamic model. System evolution is based on
difference equations.
• Lesser the time per clock tick lesser are the size of cells and more accurate results would
be obtained. But a compromise is needed between accuracy and computational effort.
Largest possible cell size which would sufficiently give the details needed must be chosen.
• CTM has many applications in DTA, NDP, traffic operations, emergency evacuations etc.
• CTM has been used in developing a system optimal signal optimization formulation.
18.6.3 Limitations
• CTM is for a ”typical vehicle” in network traffic, work is needed for the multi-modal
representation of traffic.
• Cell length cannot be varied. For this the methods like Modified Cell Transmission Model
is to be used.
18.7 References
1. C D Alexandru. A stochastic mesoscopic cell transmission model for operational analy-
sis of large-scale transportation networks. A dissertation submitted to Louisiana State
University, 2006.
4. C F Daganzo. The cell transmission model. Part II: Network Traffic. Transportation
Research B, 29(2):79-93, 1995.
Chapter 19
19.1 Introduction
A majority of the metro cities in India are facing the problem of traffic congestion, delays,
which have further resulted in pollution. The delays are caused mainly due to the isolated
functioning of the traffic signals at closely located intersections. For better regulation of traffic
flow at these intersections, the traffic signals need to be coordinated or linked. For the linking
of signals, the vehicle movement characteristics from upstream signal to downstream signal
need to be considered and simulated. Traffic Progression Models model the vehicle movement
characteristics and help in the linking of signals. First, the concept of platoon, platoon variables
is discussed and then platoon ratio is defined which is required for determination of arrival type.
Then, the phenomenon of platoon dispersion and platoon dispersion model is introduced for
understanding dispersion behavior of the vehicles. Finally, one of the platoon dispersion models
i.e., Roberson’s platoon dispersion model is discussed, which estimates the vehicle arrivals at
downstream locations based on an upstream departure profile.
1 2 3 4 n 1 m
IA
LP h1 h2
• Platoon Speed (Vp): It is the average speed of all the vehicles within a platoon.
• Inter-Arrival (IA): It is the headway between the last vehicle of the preceding platoon
and the first vehicle of the following platoon.
Various values of platoon headway and inter-arrival between consecutive platoons can be used
to determine appropriate critical headway for platoon identification and detection. Once the
critical headway is determined, platoon size and platoon speed can be detected to calculate
the signal timing adjustment to accommodate the approaching vehicle platoon. It is of great
importance to select a proper value of the critical headway since a small change in the critical
headway will generate tremendous changes in the resultant platoon characteristics. Use of a
large critical headway will result in a large average platoon size and require a large detection
area in order to detect large vehicle platoons. Consequently, a large detection area leads to
an increase of detector installation and maintenance costs. On the other hand, use of a small
critical headway will result in a small average platoon size, but may not provide sufficient
vehicle platoon information. Therefore, it is desired to find an appropriate critical headway so
that sufficient platoon information can be obtained within a proper detection area. Research
has shown that headways are rarely less than 0.5 seconds or over 10 seconds at different traffic
volumes. Many investigations have been done on finding the effects of critical headways of
1.2, 1.5, 2.1 and 2.7 seconds on platoon behaviour and these investigations have shown that a
critical headway of 2.1 seconds corresponding to a traffic volume of 1500 vehicles per hour per
lane (vphpl) can be taken for data collection.
4
0m
2
0m 0
200 m 4
200 m
300 m 2
0
2 18 34 50 66 82
4
2 300 m
0
2 18 34 50 66 82
vehicle interactions (lane changing and merging) and other interferences (parking, pedestrians,
etc.,). This phenomenon is called as Platoon Dispersion.
Dispersion has been found to be a function of the travel time from a signal to a downstream
signal (or other downstream location) and the length of the platoon. The longer the travel
time between signals, the greater the dispersion. This is intuitively logical since the longer
the travel time, the more time (opportunity) there is for different drivers to deviate from the
average travel time. A simple case of Platoon Dispersion is as shown in Fig. 19:3. From the
figure, it can be observed that, initially the peak of the platoon is high and the length of the
platoon is comparatively small, but as the platoon progresses downstream, the peak of the
platoon decreases and the length increases.
Various traffic engineering software like TRANSYT (Traffic Network Study Tool) and
SCOOT (Split Cycle Offset Optimization Technique) have employed the phenomenon of Pla-
toon Dispersion for the prediction of Arrival Types. A flow profile obtained from TRANSYT-7F
is as shown in the Fig. 19:4. From this figure also, it can be observed that, initially the peak
of the platoon is high and the length of the platoon is small, but as the platoon progresses
downstream, the peak of the platoon decreases and the length increases.
1600
1400
1200
Flowrate 1000
800
600
400 2000
1000
200 500
100
0 50
0 10 20 30 40 50 60 70 80 90
Time
q2
q2*F t+i
q3
q#*F t+2i
q4
t+ki
flows from other intersections. Note that the Robertson’s platoon dispersion equation means
that the traffic flow qtd , which arrives during a given time step at the downstream end of a link,
is a weighted combination of the arrival pattern at the downstream end of the link during the
d
previous time step qt−n and the departure pattern from the upstream traffic signal T seconds
ago qt−T .
Fig. 19:5 gives the graphical representation of the model. It clearly shows that predicated
flow rate at any time step is a linear combination of the original platoon flow rate in the
corresponding time step (with a lag time of t) and the flow rate of the predicted platoon in the
step immediately preceding it. Since the dispersion model gives the downstream flow at a given
time interval, the model needs to be applied recursively to predict the flow. Seddon developed
a numerical procedure for platoon dispersion. He rewrote Robertson’s equation as,
X
∞
qtd = Fn (1 − Fn )i−T ∗ qt−i+T (19.4)
i=T
This equation demonstrates that the downstream traffic flow computed using the Robertson’s
platoon dispersion model follows a shifted geometric series, which estimates the contribution of
an upstream flow in the (t−i)th interval to the downstream flow in the tth interval. A successful
application of Robertson’s platoon dispersion model relies on the appropriate calibration of the
model parameters. Research has shown that the travel-time factor (βn ) is dependent on the
platoon dispersion factor (αn ). Using the basic properties of the geometric distribution of
Equation 19:5, the following equations have been derived for calibrating the parameters of the
Robertson platoon dispersion model.
1 1 − βn
βn = OR αn = (19.5)
1 + αn βn
Equation 19.5 demonstrates that the value of the travel time factor (β) is dependent on the
value of the platoon dispersion factor (α) and thus a value of 0.8 as assumed by Robertson
results in inconsistencies in the formulation. Further, the model requires calibration of only
one of them and the other factors can be obtained subsequently.
√
2Ta + n − n2 + 4σ 2
βn = (19.6)
2Ta
where, σ is the standard deviation of link travel times and Ta is the average travel time between
upstream and downstream intersections. Equation demonstrates that travel time factor can be
obtained knowing the average travel time, time step for modeling and standard deviation of
the travel time on the road stretch.
√
n2 + 4σ 2 − n
Fn = n (19.7)
2σ 2
Equation 19.7 further permits the calculation of the smoothing factor directly from the standard
deviation of the link travel time and time step of modeling. Thus, both βn and Fn can be
mathematically determined as long as the average link travel time, time step for modeling and
its standard deviation are given.
Numerical Example 1
In a case study, the average travel time for a particular stretch was found out to be 22.8 seconds,
standard deviation is 5.951 and model time step duration is 10 sec. Find out the Robertson’s
model parameters and also the flow at downstream at different time steps where the upstream
flows are as given as: q10 sec = 20, q20 sec = 10, q30 sec = 15, q40 sec = 18, q50 sec = 14, q60 sec = 12.
Solution Given, The model time step duration n=10sec, average travel time (Ta )=22.8sec,
standard deviation (σ)=5.951. From equations above.
√
2Ta + n − n2 + 4σ 2
βn =
2Ta
√
2 ∗ 22.8 + 10 − 102 + 4 ∗ 5.9512
=
2 ∗ 22.8
= 0.878
1 − βn
αn =
βn
1 − 0.878
=
0.878
= 0.139
√
n2 + 4σ 2 − n
Fn = n
√ 2σ
2
102 + 4 ∗ 5.9512 − 10
= 10
2 ∗ 5.9512
= 0.783
Upstream Flows: Since the modelling time step duration is given as n=10 sec, the given
upstream flows can be written as follows:
q10 sec = q1
q20 sec = q2
q30 sec = q3
Downstream Flows: On the downstream, at 10 sec the flow will be zero since the modelling
step duration is 10 sec. Hence the downstream flows can be written as follows.
d
q20 sec = q1d
d
q30 sec = q2d
d
q40 sec = q3d
Similarly, downstream flows can be written till 80 sec. Note that since n=10 sec, T is taken in
units of n. The minimum travel time (T) is given as
The total upstream vehicles in 60 sec is 89. And total downstream vehicles in 80 sec is 89. That
is, all 89 vehicles coming from upstream in 6 intervals took 7 intervals to pass the downstream.
Numerical Example 2
In a case study, the average travel time from the upstream point to 1st downward point (point
in between upstream and downstream) was found out to be 22.8 seconds and from upstream
point to downward point (end point) was found out to be 32.8 seconds , standard deviation
is 5.951 and model time step duration is 10 sec. Find out the Robertson’s model parameters
and also the flow at downstream at different time steps where the upstream flows are as given
below. q10 sec = 20, q20 sec = 10, q30 sec = 15, q40 sec = 18, q50 sec = 14, q60 sec = 12.
Solution This problem is similar to the earlier problem. Only there are 2 downstream points
given in this. For the first downstream point, upstream values of flow given in the problem
will be used, whereas for the 2nd downstream point, the flow from the 1st downstream point
is to be used. Hence at 1st downstream point, flow in the first interval is zero and at the 2n d
downstream value, flow is zero for first 2 intervals. The calculations have been done in excel
and the following shows the results.
Four graphs are plotted below. The first graph shows the upstream profile, the second shows
the downstream profile at in between point, the third shows the downstream profile at the end
point. The last graph shows the comparison of all the three.
19.4 Conclusion
Initially, the concept of platoon and platoon variables was discussed. The platoon variables are
required for the determination of critical headway which further helps in platoon identification.
Then, the platoon ratio was defined which helps us in identifying the arrival type. Later,
25
20 Upstream
15 traffic
Downstream
10 traffic in between
5 Downstream
traffic at end point
0
0 20 40 60 80 100 120 140
platoon dispersion model was discussed which model the departure profile of the downstream
vehicles based on the upstream departure profile. Finally, Robertson’s platoon dispersion model
is discussed with the help of numerical examples. The Robertson’s platoon dispersion model
estimates the downstream volume at different time intervals which can be used for the linking
of the signals and optimization of signal timings.
19.5 References
1. Highway Capacity Manual. Transportation Research Board. National Research Council,
Washington, D.C., 2000.
2. Y Jiang, L Shou, and E Daniel. A Platoon-based Traffic Signal Timing Algorithm for
Major-Minor Intersection Types. Transportation Research Part B 40, 2006.
3. A Manar and K G Baass. Traffic Flow Theory and Traffic flow simulation models.
Transportation Research Record: 1566, 1996.
4. F Qiao, H Yang, and W Lam. Intelligent simulation and prediction of traffic flow disper-
sion. Transportation Research Part B: Methodological, 35(9), 2001.
6. R H Showers. Investigation and Enhancement of models that describe the flow of traffic
on arterial streets. A Ph.D. Thesis submitted to the University of Florida,4,73,97, 2002.
7. W Wey. Model formulation and solution algorithm of traffic signal control in an urban
network. Computers, Environment and Urban Systems, 24, 2000.
Chapter 20
20.1 Introduction
In the field of traffic flow modelling, microscopic simulation involves the detailed models that
describe the behaviour of individual vehicles so it is always a time consuming and a complex
process. So, approximately a decade ago new microscopic models have been developed and
they are based on Cellular Automata programming. The main advantage was an efficient and
fast performance when used in computer simulations, due to their rather low accuracy on a
microscopic scale. These so-called traffic cellular automata (TCA) are dynamical systems that
are discrete in nature, in the sense that time advances with discrete steps and space is coarse-
grained (e.g., the road is discretised into cells of 7.5m wide, each cell being empty or containing
a vehicle).
A Cellular Automata is an n-dimensional array of simple cells where each cell may be in
any one of k-states. At each tick of the clock a cell will change its state based on the states of
the cells in a local neighborhood. Typically, the rule for updating the state does not change
over time, and is applied to the whole grid simultaneously. Due to its simplicity the CA rules
are used to solve the complex behaviour. Through the use of powerful computers, these models
can encapsulate the complexity of the real world traffic behavior and produces clear physical
patterns that are similar to those we see in everyday life. One more advantage of cellular
automata models is their efficiency in showing the clear transition from the moving traffic to
jamming traffic. CA models have the distinction of being able to capture micro-level dynamics
and relate these to macro level traffic flow behavior.
i−1 i i+1
The term physical environment indicates the physical platform on which CA is computed. It
normally consists of discrete lattice of cells with rectangular, hexagonal etc shown in Fig. 20:1.
All these cells are equal in size. They can be finite or infinite in size and its dimensionality can
be 1 (a linear string of cells called an elementary cellular automaton or ECA).
Every cell can be in a particular state where typically an integer can determine the number of
distinct states a cell can be in, eg (binary state). Generally, the cell is assigned with an integer
value or a null value based upon its state. The states of cells collectively are called as “Global
configuration”. This convention clearly indicates that states are local and refer to cells, while
a configuration is global and refers to the whole lattice.
The future state of a cell is mainly dependent on its state of its neighbourhood cell, so neighbour-
hood cell determines the evolution of the cell. So generally, the lattices vary as one-dimensional
and two-dimensional. In one dimensional lattice, the present cell and the two adjacent cells
forms its neighbourhoods ( shown in Fig. 20:2), whereas in the context of two dimensional
lattice there are four adjacent cells which acts as the neighbourhoods. Therefore, it is clear
that as the dimensionality increases the no of adjacent cells also increases.
This rule (also called function) acts upon a cell and its direct neighbourhood, such that the
cell’s state changes from one discrete time step to another (i.e., the system’s iterations). The
CA evolves in time and space as the rule is subsequently applied to all the cells in parallel.
Typically, the same rule is used for all the cells (if the converse is true, then the term hybrid
CA is used). When there are no stochastic components present in this rule, we call the model
a deterministic CA, as opposed to a stochastic (also called probabilistic) CA.
this update procedure, e.g., a random sequential update. It is assumed that a driver does not
react to events between consecutive time steps. For single-lane traffic, we assume that vehicles
act as anisotropic particles, i.e., they only respond to frontal stimuli. So typically, the car-
following part of a rule set only considers the direct frontal neighbourhood of the vehicle to
which the rules are applied.
The radius of this neighbourhood should be taken large enough such that vehicles are able
to drive collision-free. In most cases, this radius is equal to the maximum speed a vehicle can
achieve, expressed in cells per time step. From a microscopic point of view, the process of a
vehicle following its predecessor is typically expressed using a stimulus-response relation. This
response is the speed or the acceleration of a vehicle in TCA models. A vehicle’s stimulus is
mainly composed of its speed and the distance to its leader, with the response directly being a
new (adjusted) speed of the vehicle.
where k ′ , v ′, q ′ are the values of density, speed, flow in the units of CA, and k, q, v are the real
world values of density, flow and speed.
The length of our cell is 7.5 m and if our stretch of road is 1000m (i.e., 1 km ) then the
no of cells in CA turns out to be 1000/7.5 =133.333 cells. So, for a single cell model if the
density turns out to be “one unit” (i.e., one vehicle per cell) then in the real world its density
(Kj) is 1*1000/7.5 = 133vehicles/km as per the equation. 20.1. The speed increment of the
vehicles is the ratio of distance and time. In our case the distance is the length of one cell and
time interval is one unit (sec) so the speed in km/hr is 7.5*3600/1000 =27km/hr as per the
equation. 20.3.
The first three columns are the neighborhood and the rightmost column is the state of the
center cell that results from applying the transition function on the neighborhood.
The name for this rule, Rule 184, is the Wolfram code describing the state in the Fig. 20:3:
the bottom row of the figure, 10111000, when viewed as a binary number, is equal to the
decimal number 184. All 8 possible configurations for the local neighbourhood are sorted in
descending order, expressing the local transition rule (i, t) as explained by Fig. 20:3.
1 0 1 1 1 0 0 0
1 ∗ 27 + 0 ∗ 26 + 1 ∗ 25 + 1 ∗ 24 + 1 ∗ 23 + 0 ∗ 22 + 0 ∗ 21 + 0 ∗ 20
128 + 0 + 32 + 16 + 8 + 0 + 0 + 0 = 184
Figure 20:3: New state of each cell as a function of the previous state
This step reflects the general tendency of the drivers to drive as fast as possible without crossing
the maximum speed limit. If the present speed is smaller than the desired maximum speed, the
vehicle is accelerated. The desired speed vmax can be assumed to be distributed by a statistical
distribution function where the values of vmax are only allowed to be 1, 2,..., 5 cell/∆t.
Step 2: Rule for deceleration
This step ensures that the driver doest collide with any vehicle ahead of him so that deceleration
is applied to those vehicles which may collide. If the present speed is larger than the gap in the
front, set v = gap. This rule avoids rear end collisions between vehicles. Note that here a very
unrealistic braking rule allowing for arbitrarily large decelerations is involved. This rule forces
minimum time headway of ∆t s.
2 1 1 0
This step of randomization takes into account the different behavioral patterns of the individual
drivers, especially, overreaction while slowing down and nondeterministic acceleration where
overreaction while slowing down will be mostly responsible for the formation of traffic jams.
This rule introduces a random element into the model. This randomness models the uncer-
tainties of driver behavior, such as acceleration noise, inability to hold a fixed distance to the
vehicle ahead. Fluctuations in maximal speed, and assign different acceleration values to differ-
ent vehicles. If present velocity of a vehicle is greater than zero then the velocity of the vehicle
reduces by a single unit with a probability Pbrake. This rule has no theoretical background
and is introduced quite heuristically.
Step 4: Vehicle updation
xn −→ xn + vn (20.8)
After the above three steps the position of vehicles are updated according to their respective
velocities. Even changing the precise order of the steps of the update rules stated above would
change the properties of the model.
Numerical Example
Assume a single lane stretch road divided into 8 cells and vehicles are present in the first, third,
sixth, seventh cells with 2, 1, 1, 0 as their velocities respectively. Apply the rules of cellular
automata.
Solution Apply the CA rules (equation. 20.5 - 20.8) in a sequential way as per the require-
ments of acceleration, deceleration, randomization and vehicle updation. The rules are applied
step wise as shown below.
3 2 2 1
1 2 0 1
Here the velocity of the present vehicle is 2 where the maximum velocity is 5 so the vehicle gets
accelerated and acquires the new velocity based upon the min of the (present velocity (2) +1,
or the maximum velocity).
• First vehicle: (2 < 5) so min(2 + 1, 5) = 3. Similarly applying the same rule for the rest
of the vehicles the velocities acquired are as follows.
In this step the vehicle decelerates if it doest find enough gap ahead of it in its lane. The new
velocity of the first vehicle is 3 where as the gap ahead of it 2 so it needs to decelerate by an
amount of gap minus one i.e., (2-1)=1.
0 2 0 1
0 2 0 1
This step is generally a randomly applied rule for a particular number of vehicles in a set of
total n vehicles. This number depends upon the probability ratio p that the user defines. But
in our case as we are working with a limited number of vehicles so we cannot use the probability
function so for the simplicity of the rule we shall apply this rule ( additional deceleration) to all
the those vehicles which undergo deceleration stage. So in our case the first vehicle undergoes
randomization stage and acquires a new velocity of 0.
xn −→ xn + vn
The velocity of the first vehicle after undergoing the three rules has been reduced from two to
zero, so the position of the vehicle is not changed in the next time step.
• First vehicle : Xn = 1 + 0 = 1
Similarly applying the rule to the rest of the vehicles in the same way will obtained the
following results as below.
• Third vehicle : Xn = 6 + 0 = 6
The figure below gives the reader a clear overview if all the four stages at a glance.
Actual 2 1 1 0
position
Acceleration 3 2 2 1
stage
1 2 0 1
Deceleration
stage
0 2 0 1
Randomization
Vehicle 0 2 0 1
updation
20.2.8 Limitations
• Every model has some limitations and as such this cellular automata for single lane traffic
has also some limitations which are stated below.
• A single lane model doesn’t suit the realistic traffic where it has vehicle types of different
velocities. So here in single lane model if such vehicles are entertained the result is the
platooning effect and the average velocity of the stream becomes the velocity of slow
moving velocity.
• So, two lane models are introduced to meet the requirement and four more additional
rules are included for the exchange of vehicles between the lanes.
first sub-step the exchange of vehicles in the two lanes, take place according to the new rule
set. Vehicles are moved only sideways. They do not advance in one go. However, in reality
this does not happen and this is step is also not seen. This step has a meaning when it is
coordinated with the second step. In the second step, the independent single-lane updates on
both lanes according to the single lane update rules.
All lane-changing rules consist of two parts: Trigger criterion (“Do I want to change the lane”)
and Safety criterion (“Is it safe if I change the lane”). Once if both the criteria are fulfilled,
the vehicle will change the lane.
In a two lane model proposed by Rickert, a vehicle changes its lane with a probability p,
provided there is not enough gap in the current lane in front of the vehicle, if the gap in the
front of the vehicle in the target lane is adequate, if it is possible without collision and finally
when the lane changing activity doesn’t block someone else’s way. The above sentences are
formulated in form of rules from equations. 20.9 to 20.11
• The vehicle does not find enough gap in its current lane ahead of it.
• No collision takes place (i.e.,The cell where the vehicle is intending to change should be
empty)
1 1 2 1
1 1
2 2 3 2
2 2
Rules 9 and 10 are called the trigger criterion and the rule 11 is called the safety criterion.
These rules are applicable for both left to right and right to left lane changes and it changes
the lane with probability.
Numerical Example
Assume a two-lane road divided into nine cells in each of its lane. In first lane vehicles are
present in first (1), third (1), fourth (2), eight (1) cells and in second lane vehicles are present
in fifth (1) and sixth (1) cells. The numbers in the brackets indicate the present velocities of
the respective velocities. Apply the lane changing rules and determine which vehicles fulfilled
the lane changing requirements.
Solution Initially the solution starts with the acceleration stage of the vehicles, where the
vehicles are applied with the acceleration rule (equation. 20.5). In the acceleration stage, a
single unit increase in every vehicle, which possesses a velocity less than the maximum velocity.
So stage of the vehicles after the acceleration are shown in the Fig. 20:5. Lane changing is
required for L1 (1), L1 (2), L2 (1) where “L1 (1)” indicates number in the subscript as its lane
number and the superscript as it vehicle number in respective lanes.
Rule 1: ∆Xpp (n) < V (n) + 1 The first vehicle has a velocity two and the gap ahead of it in
its current lane is 2 so according to the rule (velocity +1 > gap). Therefore, the vehicle satisfied
the rule so that it can change the lane. L1 (1) = (2 < 2 + 1) . . . satisfied. Similarly checking
for all the other vehicles. L1 (2) = (1 < 2 + 1) . . . satisfied, L2 (1) = (1 < 2 + 1) . . . satisfied.
The term gap is generally referred in two different ways, where it is explained as the distance
between bumper to bumper of the vehicles. The other way to state, the term gap is the number
of empty cells in front of a vehicle”. Here in the present discussion it is taken as the earlier one
but anyways it depends on the reader of choosing it where a slight modification (i.e., addition
of ± 1on the other side of the equations).
Rule 2 : (∆Xof (n) > V (n) + 1 ) (as per the rule 10) The velocity of the first vehicle is
two and the gap in the target lane ahead of it is four so the rule ( gap ( target lane ) > velocity
+ one ) is satisfied for the first vehicle. L1 (1) = (4 > 2 + 1) . . . satisfied. Similarly checking
for other vehicles also will obtain the following results. L1 (2) = (2 6> 2 + 1) . . . rejected, and
L2 (1) = (34 6> 2 + 1) . . . rejected.
Rule 3: No collision of vehicles is observed as per the pattern given.
Rule 4: (∆Xob (n) > Vmax ) (as per the rule 11)
The maximum velocity of any vehicle is given as four and the gap behind the first vehicle
in the target lane is five which is greater than the maximum velocity so the vehicle satisfied
the rule and subjected to lane change. L1 (1) = (5 > 4). Therefore the first vehicle in the first
lane satisfied all the four rules.
20.3.2 Limitations
In real world traffic the vehicles dont have unique velocities but it was an assumption in the
model. So the vehicles are further divided into two types of different Vmax , namely Vf max , Vsmax ,
corresponding to fast vehicles and a slow vehicles. Introduction of “symmetric two lane model”
for inhomogeneous traffic.
20.4 Extensions
20.4.1 Types of updates
There are two types
Sequential update : This updating procedure considers each cell in the lattice one at a
time. If all cells are considered consecutively, two updating directions are possible, left-to-right
and right-to-left. There is also a third possibility, called random sequential update. Under this
scheme and with N particles in the lattice, each time step is divided in N smaller sub steps.
v
3 2 1
2 1 2
t
2 0 2
t
At each of these sub steps, a random cell (or vehicle) is chosen and the CA rules are applied
to it.
Parallel update: This type of update is the classic update procedure generally used in all
the models. For a parallel update, all cells in the system are updated in one and the same time
step. Compared to a sequential updating procedure, this one is computationally more efficient
(note that it is equivalent to a left-to-right sequential update).
α 1 2 1 β
δ γ
CA−184 (vMax = 1)
1 STCA (vMax = 1, p = 0.1)
TASEP (vMax = 5)
TASEP (vMax = 1)
0.8
0.6
0.4
0.2
0
0 0.2 0.4 0.6 0.8 1
Global density [vehicles/cell]
exclusion’ refers to the fact that a cell in the lattice can only be empty, or occupied by one
particle.
When moving through the lattice, particles move one cell to the left with probability, and
one cell to the right with probability γ. When γ = δ, the process is called the symmetric simple
exclusion process (SSEP); if γ = δ then it is called the asymmetric simple exclusion process
(ASEP). Finally, if we set γ = 0 and δ = 1, the system is called the totally asymmetric simple
exclusion process (TASEP). If we consider the TASEP as a TCA model, then all vehicles move
with Vmax = 1 cell/time step to their direct right-neighbouring cell, on the condition that this
cell is empty. The process is shown in the below Fig. 20:8.
20.4.4 Comparisons
The above Fig. 20:9 gives a differentiation between four types of models and interestingly it is
observed that the TASEP with Vmax = 1 has a trend of the Greenshield model and following a
linearity in the speed-density relation. The same trend is also observed in the below Fig. 20:10
flow density curve.
20.5 References
1. Sven Maerivoet and Bart De Moor. Cellular automata models of road traffic, 2005.
2. K Nagel and M Schreckenberg. A cellular automaton model for freeway traffic. France,
1992.
3. M Rickert, K Nagel, M Schreckenberg, and A Latour. Two lane traffic simulations using
cellular automata. 1996.
6. Christopher Stone and Larry Bull. Solving the Density Classification Task Using Cellular
Automaton 184 with Memory. Complex Systems Publications,Inc., 2009.
Chapter 21
21.1 Introduction
Often it is required to ascertain how much a transport facility can accommodate. Such in-
formation is useful in the design of traffic facility. Capacity analysis helps in answering the
question. It is a quantitative assessment of the ability of a traffic facility to handle vehicles or
people for which it is designed.
A related question is, what is the performance level of the system at various operating
conditions. Or in other words, how good is the operation of the traffic facility. Level of Service
analysis tries to answer this question which is essentially a qualitative analysis. Capacities and
Level of Services are therefore closely related analysis of a traffic facility.
21.2 Concepts
21.2.1 Capacity
Capacity of a transport facility is defined as the maximum number of vehicles, passengers, or
the like, per unit time which can be accommodated under given conditions with a reasonable
expectation of occurrence. The Highway Capacity Manual(2010) defines the capacity as the
maximum howdy rate at which persons or vehicles can be reasonably expected to traverse a
point or a uniform segment of a lane or roadway during a given time period, under prevailing
roadway, traffic and control conditions. Several observations can be made from the above defi-
nition. Although capacity is the maximum howdy rate, in many situations the break 15 minute
flow rate is expressed as the capacity. The above definition also contains the term “reasonably
expected” to account for the variation in traffic and driving habit at various location. However,
it can be termed as a probabilistic measure. Further, analytical derivations are possible for
getting the maximum flow rate, seldom it is achieved in the field. However, capacity measures
are often empirically derived. Capacity is usually defined for a point or a uniform segment
where operating conditions do not vary.
The capacity measure depends on these operating conditions. The first is the traffic condi-
tions and the factors that influence the capacity includes vehicle composition, turning, move-
ments, etc. The second factor is the roadway conditions and it includes geometrical character-
istics such as lane width, shoulder width, horizontal alignment, vertical alignment. The third
factor is the control conditions such as the traffic signal timings, round-about characteristics.
It is also to be noted that the above capacity definition holds good for a point or at a section
of the road having uniform control conditions. Another aspect of the above capacity definition
is the expression that the maximum flow rate which accounts for the worst 15 minutes traffic
within the peak hour traffic. Lastly the term reasonable expectancy indicates that the capac-
ity measure is probabilistic and not an analytically derived deterministic value. The capacity
measure is probabilistic, for it accounts for the unexplainable variation in traffic and diverse
driving characteristics.
have delay/speed as the MoE. Interrupted facilities include un-signalized intersection, signalized
intersection, and arterials or corridors. They have respectively control delay, total delay and
average travel speed as the measure of effectiveness. Other facilities may include pedestrian
pathways, bicycle tracks, bus-transit system, rail-transit system and air-transportation system.
Each of them have facility specific measure of effectiveness.
21.3 Illustrations
For a typical freeway mid block section the capacity and LOS can be defined for an ideal section.
An ideal section has uninterrupted flow from both sides and has only passenger cars and the
drivers are regular travelers who are familiar with the facility. The lane width is 3.65m wide
with proper shoulder and 1.8m lateral clearance is available from the edge of the pavement.
The free flow speed of 115kmph is achievable on the multi-lane and 100kmph on the two-lane
highway.
21.3.1 Capacity
Such a facility is considered as an ideal facility and for such facilities the following values can
be taken as capacity.
1. A capacity of 2000 vehicle per hour per lane for a speed of 115kmph
2. A capacity of 1900 vehicles per hour per lane for a speed of 80kmph
Note that the above values are not analytical or experimentally derived, but, statistically de-
rived from the observed field values from large number of such sections. Needly to say that it
is possible to have a flow higher than this capacity measure, but not necessary.
Operating Speed
A
B
C
D
E
F
1.0
V/C Ratio
21.4 Conclusion
In this lecture the concepts of capacity and LOS is presented. Capacity is a quantitative
measure, whereas LOS is a qualitative measure. Capacity defined for various traffic facilities
considering the traffic, geometric and control condition and obtained from field observation.
LOS on the other side is assigning quality levels of traffic based on performance measure like
speed, density, etc. Together, the concepts gave planner a valuable tool in designing and
evaluating various traffic facilities.
21.5 References
1. James H Banks. Introduction to transportation engineering. Tata Mc-Graw Hill, 2004.
Chapter 22
Urban Streets
22.1 Introduction
Cities and traffic have developed hand-in-hand since the earliest large human settlements and
forcing inhabitants to congregate in large urban areas and in turn enforcing need of urban
transportation. To develop efficient street transportation, to serve effectively various land use
in an urban area, and ensure community development, it is desirable to establish a network of
streets divided into systems, each system serving a particular function or particular purpose.
Accordingly, a community should develop an ultimate street-classification in which each system
has a specific transportation service function to perform. There are several operational perfor-
mance measures and level of services (LOS) which have to be taken into account to evaluate
the system of streets. Increasing population of urban areas due to shifting of people from rural
to urban areas and thus certainly increasing vehicular population on urban streets, have caused
problems of congestion in urban areas. Road traffic congestion poses a challenge for all large
and growing urban areas. This document provides a summary of urban street with respect
to their classification, related operational performance measures and level of services (LOS)
involved in each class of urban street and it also provides strategies necessary for any effective
congestion management policy to curb the congestion.
• Functional based
• Design based
Arterials
Mobility
Collectors
Figure 22:1: Relationship of functionally classified systems in service traffic mobility and land
access
3. Collector street
4. Local roads
General idea of various streets as per their mobility and land use is shown in the Fig. 22:1.
Arterial streets are basically meant to carry longer and through traffic. Function of arterial
is to provide access to commercial and residential land uses. A downtown street not only
carries through traffic but also turning traffics and it resembles arterials. As shown in Fig. ??
mobility of principal arterials is high but land access is very low. Major arterial serves as
principal network for through traffic flow. This should be connected with principal traffic
generations, important rural highways entering the city. It should be well coordinated with
existing and proposed expressway system for good distribution and circulation of through traffic
and continuity of routes should be maintained. In every urban environment there exists a
system of streets and highways which can be identified as unusually significant to the area
in which it lies in terms of the nature and composition of travel it serves. In smaller urban
areas (population under 50,000) these facilities may be very limited in number and extent and
their importance may be primarily derived from the service provided to travel passing through
the area. In larger urban areas their importance also derives from service to rural oriented
traffic, but equally or even more important, from service for major movements within these
urbanized areas. The principal arterial system should carry the major portion of trips entering
and leaving the urban area, as well as the majority of through movements desiring to bypass
the central city. In addition, significant intra-area travels, such as between central business
districts and outlying residential areas between major inner city communities or between major
suburban centers should be served by this system. Frequently the principal arterial system will
carry important intra urban as well as intercity bus routes. Finally, this system in small urban
and urbanized areas should provide continuity for all rural arterials which intercept the urban
boundary.
Minor arterials
The minor arterial street system should interconnect with and augment the urban principal
arterial system and provide service to trips of moderate length at a somewhat lower level of
travel mobility than principal arterials. This system also distributes travel to geographic areas
smaller than those identified with the higher system. The minor arterial street system includes
all arterials not classified as a principal and contains facilities that place more emphasis on
land access than the higher system, and offer a lower level of traffic mobility. Such facilities
may carry local bus routes and provide intra-community continuity, but ideally should not
penetrate identifiable neighborhoods. This system should include urban connections to rural
collector roads where such connections have not been classified as urban principal arterials.
The spacing of minor arterial streets may vary from half to one km in the central business
City
Town
Village
Arterials
Collector
Streets
Local
Streets
Legend
Arterial street Collector street
Commercial Public
district to 4 to 5 km in the suburban fringes, but should normally be not more than 2 km in
fully developed areas.
Collector streets
This system of streets includes all distributer and collector streets. Function of this system
is serving between major arterials and local streets to connect adjacent neighborhood areas
placed approximately at half miles intervals to accommodate local through traffic movements
and interconnect local streets with the major arterial street system. Unlike arterials their
operation is not always dominated by traffic signals.
Local Street
Local streets are primarily meant for direct access to residential commercial, industrial or other
abutting property. All through traffics should be discouraged on local streets. Land access is
very high but mobility is very low for local streets.
1. High speed
2. Suburban
3. Intermediate
4. Urban
These are the streets with very low driveway or access point density. These are provided with
separate right turn lanes and; no parking is permitted on street. Streets may be multilane
divided or undivided or two lane facility with shoulders. Signals are infrequent and spaced at
long distances. Road side development is very low. A speed limit on these roads is 75 to 90
kmph.
Sub-urban streets
They represent urban streets with moderate driveway/access point density. Like sub-urban
streets they also have some separate or continuous right turn lane and some portions where
parking is permitted. These roads possess comparatively higher roadside development than
that on sub-urban streets. It has about two to six signals per Km. and speed limit on these
roads is 50 to 60 Kmph.
Urban streets
They represent urban streets with high driveway/access point density. These are usually pro-
vided with road side parking. It has highest road side development density among all above
stated four classes. Signal density is about four to eight per Km. Speed limit is 40 to 55 Kmph.
Table 22:3: Range and typical values of FFS for different arterial classes
Free flow Arterial Class
speed (kmph) I II III IV
Speed range 90 to 70 70 to 55 55 to 50 55 to 40
Typical value 80 65 55 45
The above flow chart shows the steps to determine LOS in a schematic form. Further in this
section we are going to discuss these seven steps in detail.
D = 1.3 d (22.1)
where, D = intersection approach delay (sec/veh), and d = intersection stopped delay (sec/veh).
Delay at intersection approach is of special interest because it is a Measure of Effectiveness
(MOE) used to quantify LOS. To determine intersection approach (or control) delay it is nec-
essary to calculate stopped delay which is discussed below.
Stopped Delays
1. Maximum extent of queue length on intersection approach during the study period must
be observed in advance (observer must be able to count all stopped vehicles in the longest
possible queue).
2. Count intervals are set at 10, 15, or 20 seconds stopped vehicles within the queuing area
observed and recorded at each interval.
Numerical example
In an intersection the following data was observed for stopping times for vehicles as tabulated
in table 4. Calculate intersection approach delay for the given data set. Total exiting vehicles:
100.
Solution: Total of stopped-vehicle counts (density counts) for study sample is: 33+34+31+24=122
veh. Each of the vehicle interval is 15 seconds. Aggregate delay for the 10 minutes study period
is, 122× 15 sec=1830 veh-sec. Average stopped delay per vehicle for study period of 10 minutes
is, 1830/100 =18.3 sec per vehicle. That is, d=18.3 sec per vehicle. We use this in the first
equation. So, intersection approach (or control) delay D
Table 22:5: Urban Street LOS by Class and Average Travel Speed
LOS Average Travel Speed (km/h)
I II III IV
A > 72 > 59 > 50 > 41
B > 56 > 46 > 39 > 32
C > 40 > 33 > 28 > 23
D > 32 > 26 > 22 > 18
E > 26 > 21 > 17 > 14
F > 26 < 21 < 17 < 14
where, vavg = arterial or segmental average travel speed (Kmph), L = arterial or segmental
length (Km), Tr = total of the running time per kilometer on all segments in the arterial or
section (seconds), D = total of the approach delay at all intersections within the defined arterial
(seconds). It is the actual speed in consideration with the additional effect of control and all
stop delays. It is the measure by which LOS is defined.
Numerical example
Consider an arterial which has free flow speed of 65 kmph and average running time of vehicles
is 145 sec/km determine LOS for this arterial.
Solution: From Table 22:5 we can find LOS of an arterial. As free flow speed is 65 kmph
by using table 3 we can classify this as Arterial Class II, Now we should know average travel
speed, to find out LOS. Delay is determined in problem 1. Hence D=23.79sec/veh.
3600L 3600 × 1
vavg = = = 21.32 km/hr
Tr × L + D 145 + 23.79
As average travel speed is 21.32 kmph we can have LOS as ’E’ from Table 22:5.
1. Signal based
2. Non-signal based
1. Metering plans
Metering plans
It is the congestion management policy for street congestion to limit the volumes arriving at
critical locations. It uses some control strategies within the congestion networks by storing
vehicles at links defined to be part of system under control. It should be noted that metering
concept does not explicitly minimize delays and stops but manages queue formation. There are
three types of metering strategies,
1. Internal metering: It is the management policy which makes use of control strategies
within the congested network by influencing the distribution of vehicles arriving at and
departing from critical locations as shown in Fig. 22:4 Limit the upstream or downstream
blockage by limiting the turn in flows as shown in Fig. 22:5. It deals with upstream
control by creating moving storage situation on upstream link. It manages congestion by
limiting turn-in flows from cross streets and preserving arterials for their through flow by
metering from face of back up from outside as shown in Fig. 22:6
2. External metering: Control of major access points shown in Fig. 22:7 (e.g. river crossing,
downtown surrounded by water from three sides, a system that receives limited no. of
arterials etc.) so as to limit inflow rates. It is conceptually convenient because the storage
of problem vehicles belongs to somebody else outside the system. But while metering it
should be noted that metering should not be upto such extent that other areas.
3. Release metering: It uses policy of controlling the release of vehicles from the places
where vehicles are stored such as parking, garages etc. they are stored off-street so as to
reduce their spill-back potential. This type of metering can be used in shopping centers,
mega center, etc. by lowering the discharge rates of vehicles.
If on any intersection higher cycle time is provided then it will certainly create problems like
increase in queue length and platoon length discharged and it will lead to increase in blockage
critical intersection
undersaturated
internally metered
of intersection, with substantial adverse impact on system capacity. This is particularly when
short link lengths are involved. Length of downstream space should be greater than queue
length to store the vehicles. Note that a critical lane flow of Vi nominally discharges Vi*C/3600
vehicles in a cycle. If each vehicle requires D meters of storage space, the downstream link would
be
Vi C
D≤L (22.3)
3600
Vi C
where, 3600 = no. of vehicles per cycle, D= storage space required for each vehicle, L= available
downstream space in m. (This may be set by some lower value to keep the queue away from
the discharging intersection, or to allow for turn-ins.) Equation may be re-arranged as,
L 3600
C≤ (22.4)
D Vi
Note that Vi in this case is the discharge volume per downstream lane, which may differ from
the demand volume, particularly at the fringes of the system being considered. Note that only
rather high flows (maximum f > 800 veh per hour per lane (vphpl)) and short blocks will create
very severe limits on the cycle length. However, these are just the situations of at most interest
for extreme congestion situations. An illustrative example to show the requirement of shorter
cycle length is given below.
Numerical example
Flow on an critical lane is 300 veh/h, cycle time is 80 seconds, suppose storage space required
per lane vehicle is 6m as an average and space available on downstream is 30 m, find whether
the space is sufficient and comment on the result and suggest some remedy if required.
2. Reversible lanes
4. Lane marking
On suburban and urban arterials dedication of a central lanes shown in Fig. 22:8 for turns in
either direction is provided. This also allows for storage and vehicles to make their maneuvers
in two distinct steps. Leaving the arterial and entering it is separated into two distinct
steps. Vehicles leaving (Fig. 22:9) the arterial do not have to block a moving lane while waiting
for a gap in the opposing flow. Entering vehicles (Fig. 22:10) do not have to wait for a gap
simultaneously in both directions. The Figure 22:8 shown above is the road sign for two way left
turn lane which indicates that the center lane is provided exclusively for two way left turning
traffic.
Reversible lane
Reversible lanes shown in Figure 8 have great advantage of matching lane availability to the
peak demand. Lanes are reversible means can be split into various combinations for different
2 way sign
2
Vehicle
1
Vehicle
Reversible lane
Figure 22:11: Lane marking and associated signal /signs for reversible lane
times of day to match the demand. E.g. eight lanes can be split into 6:2 or 5:3 and so forth
if required to match up for the demand. It should be noted that some jurisdictions have
combined two-way lanes and reversible lanes on same arterial ’because combination of peak-
period congestion and increased road side development’. The concerns with reversible lanes
and relates to the misuse and lanes by the driver (particularly the unfamiliar driver), despite
the signalization over the lanes.
HOV lanes
High occupancy vehicle (HOV) lanes are designed to help move more people through congested
areas. HOV lanes offer users a faster, more reliable commute, while also easing congestion in
regular lanes - by moving more people in fewer vehicles. HOV lanes on provincial highways are
reserved for any of the following passenger vehicles carrying at least two people (often referred
to as 2+):
1. Car
3. Minivan
4. Motorcycle
5. Taxi or limousine
In addition, vehicles with a special green licence plate (plug-in hybrid electric or battery electric
vehicle) A bus of any type can use an HOV lane, even without passengers. This helps buses
keep to their schedules and provide reliable, efficient service. Emergency vehicles are permitted
to use the HOV lanes at all times.
Congestion can be managed by prohibiting the kerb parking. Kerb parking means on street
parallel parking. If such parking is avoided it implies oblique and right angled parking is also
prohibited and hence provides more space for traffic flow so congestion is minimized.
Lane marking
Longitudinal lane markings such solid white lines and broken white lines restricts overtak-
ing maneuver of vehicles which encourages mix through traffic flow unobstructed resulting in
reducing the congestion.
Equity offsets
This topic can be read in reference to congestion management by signal based remedies. Offset
on an arterial are usually set to move vehicles smoothly along the arterial, as is logical. Equity
offset allows the congested arterial to have its green at upstream intersection until the vehicle
just begin to move , then switch the signal, so that these vehicles flush out the intersection,
but no new vehicles continue to enter.
Imbalanced split
This topic can be referred under signal based congestion management remedies. It is the pro-
cedure of allocating the ’available green’ in proportion to the relative demands. It is sometimes
desirable to split green as per demand of various routes to meet peak hour demands of respective
routes.
HOV Lanes
This topic can be referred as non signal based remedies On provincial highways HOV lanes are
developed by adding a new inside (leftmost) lane to existing corridors. Where the HOV lane
begins, signs on the left side of the highway inform carpools and buses to move left into the
new lane. An overhead sign indicates the beginning of the HOV lane. In some locations, where
a highway on-ramp used to end, the on-ramp lane has been extended as the new HOV lane.
In this situation, motorists not permitted to use the HOV lane have to exit that lane before
the start of the HOV lane designation. Overhead signs at 1 kilometre and again at 500 metres
before the start of the HOV lane designation advise drivers to exit the lane. Overhead signing
and closely spaced white broken lines and diamond symbol pavement markings indicate the
beginning of the HOV lane (Figure 22:12).
111111111111111
000000000000000
000000000000000
111111111111111
22.5 Conclusion
It can be understood that urban streets are integral part of transportation system. Urban
streets plays vital role in development of country. These are classified on their function, design
for various considerations taking into account. Performance measures are to be worked out
to determine LOS. Congestion is a huge problem which can be curbed by some preventive
measures and design strategies. Signalized remedies are more efficient than any other measures
of street congestion management. Non signalized remedies can be used to manage congestion
by providing more space in terms of extra lanes.
22.6 References
1. Highway Capacity Manual. Transportation Research Board. National Research Council,
Washington, D.C., 2000.
Chapter 23
Multilane Highways
23.1 Introduction
Increasing traffic flow has forced engineers to increase the number of lanes of highways in order
to provide good manoeuvring facilities to the users. The main objectives of this lecture is to
analyze LOS which is very important factor for a traffic engineer because it describes the traffic
operational conditions within a traffic stream. Also we are going to study the characteristics
and capacity for multilane highways. Free-flow speed is an important parameter that is being
used extensively for capacity and level-of- service analysis of various types of highway facilities.
• Multilane highways
11111111
00000000
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
Table 23:1: Free flow speed and capacity for Multilane highway
a lane or roadway during a specified time period under given roadway, traffic, environmental,
and control conditions; usually expressed as vehicles per hour, passenger cars per hour, or
persons per hour. There are two types of capacity, possible capacity and practical capacity.
Possible capacity is defined as the maximum number of vehicles that can pass a point in one
hour under prevailing roadway and traffic condition. Practical capacity on the other hand is
the maximum number that can pass the point without unreasonable delay restriction to the
average driver’s freedom to pass other vehicles. Procedure for computing practical capacity for
the uninterrupted flow condition is as follows:
1. Select an operating speed which is acceptable for the class of highways the terrain and
the driver.
3. Determine the reduction factor for conditions which reduce capacity (such as width of
road, alignment, sight distance, heavy vehicle adjustment factor).
Basically any two of the following three performance characteristics can describe the LOS for a
multilane highway. Each of these measures can indicate how well the highway accommodates
the traffic demand since speed does not vary over a wide range of flows, it is not a good indicator
of service quality. Density which is a measure of proximity of other vehicles in the traffic stream
and is directly perceived by drivers and does not vary with all flow levels and therefore density
is the most important performance measure for estimating LOS. Based on the quantitative
parameter, the LOS of a facility can be divided into six qualitative categories, designated as
LOS A,B,C,D,E,F The definition of each level of service, is given below:
110
100
Speed (km/hr)
90
80
70
60
50
40
30
20
10
0
0 400 800 1200 1600 2000 2400
Flow (pc/h/ln)
50
Density (pc/h/ln)
45
40
35
30
25
20
Free flow speed = 70 km/hr
15
Free flow speed = 80 km/hr
10
1
Free flow speed = 90 km/hr
5 Free flow speed = 100 km/hr
0
0 400 800 1200 1600 2000 2400
Flow (pc/h/ln)
100
90 km/h
90
80 km/h
80
70 km/h
70
LOS A B C D
E
60
ln
m/
/ln
c/k
/km
50
7p
/ln
/ln
/ln
pc
m
y=
m
/km
16
/k
/k
40
pc
sit
pc
pc
28
22
n
11
De
30
20
10
0
400 800 1200 1600 2000 2400
Figure 23:11: Speed-flow curves with LOS criteria for multilane highways
Speed (km/hr)
100
90
80
70
60
50 Density = 7 pc/km/ln
40 Density = 11 pc/km/ln
30 Density = 16 pc/km/ln
20 Density = 22 pc/km/ln
Density = 25 pc/km/ln
10
0
0 400 800 1200 1600 2000 2400
Flow (pc/h/ln)
Figure 23:12: Flowchart showing step by step procedure to find density and LOS
5. A divided highway.
where, F F S is the estimated FFS (km/h), BF F S= base FFS (km/h), fLW = adjustment for
lane width, from Table 3 (km/h), fLC = adjustment for lateral clearance, from Table 4 (km/h),
Table 23:2: Level of Service criteria for a typical free flow speed of 100 kmph proposed in HCM
2000
fM = adjustment for median type, from Table 5 (km/h), and fA = adjustment for access points,
from Table 6 (km/h). FFS on multilane highways under base conditions is approximately 11
km/h higher than the speed limit for 65 and 70 km/h speed limits, and it is 8 km/h higher for
80 and 90 km/h speed limits. BFFS is approximately equal to 62.4 km/h ( i.e decrease in 1.6
km/h) when the 85 th percentile speed is 64 km/h, and it is 91.2 km/h ( i.e decrease in 4.8
km/h) when the 85 th percentile speed is 96 km/h and the in between speed values is found
out by interpolation. According to Table 3, the adjustment in km/h increase as the lane width
decreases from a base lane width of 3.6 m. No data exist for lane widths less than 3.0m.
The adjustment for lateral clearance (TLC ) is given as:
where, TLC = Total lateral clearance (m), LCL = Lateral clearance (m), from the right edge of
the travel lanes to roadside obstructions (if greater than 1.8 m, use 1.8 m), and LCR = Lateral
clearance (m), from the left edge of the travel lanes to obstructions in the roadway median
(if the lateral clearance is greater than 1.8 m, use 1.8 m). Once the total lateral clearance is
computed, the adjustment factor is obtained from Table 4. For undivided highways, there is
no adjustment for the right-side lateral clearance as this is already accounted for in the median
type. Therefore, in order to use Table 5 for undivided highways, the lateral clearance on the
left edge is always 1.8 m, as it for roadways with TWRTLs. The access-point density, which
is use in Table 6, for a divided roadway is found by dividing the total number of access points
Table 23:5: Adjustment to free flow speed for median type(Source: HCM, 2000)
Table 23:6: Adjustment to free flow speed for Access-point density(Source: HCM, 2000)
(intersections and driveways) on the right side of the roadway in the direction of travel being
studied by the length of the segment in kilometers. The adjustment factor for access-point
density is given in Table 6. Thus the free flow speed can be computed using equation 1 and
applying all the adjustment factors.
been determined, the adjustment factors for heavy vehicles are applied as follows:
1
fHV = (23.4)
(1 + PT (ET − 1) + PR (ER − 1)
where, ET and ER are the equivalents for trucks and buses and for recreational vehicles (RVs),
respectively, PT and PR are the proportion of trucks and buses, and RVs, respectively, in the
traffic stream (expressed as a decimal fraction), fH V is the adjustment factor for heavy vehicles.
Adjustment for the presence of heavy vehicles in traffic stream applies for three types of vehicles:
trucks, buses and recreational vehicles (RVs). Trucks cover a wide range of vehicles, from lightly
loaded vans and panel trucks to the most heavily loaded coal, timber, and gravel haulers. An
individual truck’s operational characteristics vary based on the weight of its load and its engine
performance. RVs also include a broad range: campers, self-propelled and towed; motor homes;
and passenger cars or small trucks towing a variety of recreational equipment, such as boats,
snowmobiles, and motorcycle trailers. There is no evidence to indicate any distinct differences
between buses and trucks on multilane highways, and thus the total population is combined.
1. Define a segment on the highway as appropriate. The following conditions help to define
the segmenting of the highway,
In general, the minimum length of study section should be 760 m, and the limits should
be no closer than 0.4 km from a signalized intersection.
3. Locate the point on the horizontal axis corresponding to the appropriate flow rate (vp)
in pc/hr/ln and draw a vertical line.
4. Read up the FFS curve identified in step 2 and determine the average travel speed at the
point of intersection.
5. Determine the level of service on the basis of density region in which this point is located.
Density of flow can be computed as
vp
D= (23.5)
S
where, D is the density (pc/km/ln), vp is the flow rate (pc/h/ln), and S is the aver-
age passenger-car travel speed (km/h). The level of service can also be determined by
comparing the computed density with the density ranges shown in table given by HCM.
To use the procedures for a design, a forecast of future traffic volumes has to be made
and the general geometric and traffic control conditions, such as speed limits, must be
estimated. With these data and a threshold level of service, an estimate of the number
of lanes required for each direction of travel can be determined.
Numerical example 1
A segment of undivided four-lane highway on level terrain has field-measured FFS 74.0-km/h,
lane width 3.4-m, peak-hour volume 1,900-veh/h, 13 percent trucks and buses, 2 percent RVs,
and 0.90 PHF. What is the peak-hour LOS, speed, and density for the level terrain portion of
the highway?
1. Data given: Level terrain, field measured FFS = 74 km/h, lane width is 3.4 m, peak-
hour volume = 1900 veh/h, percent trucks and buses pt = 0.13, percent RVs PR = 0.02,
and PHF=0.90.
2. Determination of flow rate(Vp): LOS can be calculated by knowing flow rate and
free flow speed. Flow rate (Vp) is calculated from the equation
V
Vp =
(P HF × N × f HV × f p)
Since fHV is unknown it is calculated from the equation
1
fHV =
(1 + P T (ET − 1) + P R(ER − 1)
where, ET and ER are passenger-car equivalents for trucks and buses and for recreational
vehicles (RVs) respectively PT and PR are proportion of trucks and buses, and RVs,
respectively, in the traffic stream (expressed as a decimal fraction)
1
fHV =
1 + 0.13(1.5 − 1) + 0.02(1.2 − 1)
= 0.935.
3. Determination of free flow speed(S): In this example the free flow speed (FFS)
measured at the field is given and hence no need to compute free flow speed by indirect
method. Therefore, F F S = S = 74.0km/h.
Numerical example 2
A segment of an east-west five-lane highway with two travel lanes in each direction separated
by a two-way left-turn lane (TWLTL) on a level terrain has- 83.0-km/h 85th-percentile speed
,3.6-m lane width, 1,500-veh/h peak-hour volume, 6 % trucks and buses, 8 access points/km
(WB), 6 access points/km (EB), 0.90 PHF, 3.6-m and greater lateral clearance for westbound
and eastbound. What is the LOS of the highway on level terrain during the peak hour?
2. Determination of flow rate(VP): LOS can be calculated by knowing flow rate and
free flow speed. Flow rate (Vp) is calculated from the equation
V
Vp =
(P HF × N × f HV × f p)
where, Vp = 15-min passenger-car equivalent flow rate (pc/h/ln), V = hourly volume
(veh/h), PHF = peak-hour factor, N = number of lanes, fHV = heavy-vehicle adjustment
factor, and fp = driver population factor Since fHV is unknown it is calculated from the
equation
1
fHV =
(1 + P T (ET − 1) + P R(ER − 1)
where, ET and ER = passenger-car equivalents for trucks and buses and for recreational
vehicles (RVs), respectively PT and PR = proportion of trucks and buses, and RVs,
respectively, in the traffic stream (expressed as a decimal fraction) Assume no RVs, since
none is indicated.
1
fHV =
1 + 0.06(1.5 − 1) + 0
= 0.970.
1500
Vp =
(0.90 × 2 × 0.970 × 1)
= 858 pc/h/lane
4. Determination of LOS: LOS determined from the speed-flow diagram. LOS = C (for
EB) LOS = C (for WB)
Numerical example 3
Solution
2. Determination of flow rate(VP): LOS can be calculated by knowing flow rate and
free flow speed.
For upgrade: Flow rate is calculated from the equation
V
Vp=
(P HF × N × f HV × f p)
where, ET and ER = passenger-car equivalents for trucks and buses and for recreational
vehicles (RVs), respectively PT and PR = proportion of trucks and buses, and RVs,
respectively, in the traffic stream (expressed as a decimal fraction) Assume no RVs, since
none is indicated.
1
fHV =
1 + 0.13(1.5 − 1) + 0.02(3 − 1)
= 0.905.
1900
Vp =
(0.90 × 2 × 0.905 ∗ 1)
= 1166 pc/h/ln
For downgrade:
1
fHV =
1 + 0.13(1.5 − 1) + 0.02(1.2 − 1)
= 0.935
1900
Vp =
(0.90 × 2 × 0.935 × 1)
= 1128 pc/h/ln
F F S = BF F S − fLW − fLC − fA − fM
= 77 − 0 − 0.6 − 8.0 − 2.6
= 65.8 km/h
For downgrade: BFFS is approximately equal to 62.4 km/h when the 85 th percentile
speed is 64 km/h, and it is 91.2 km/h when the 85 th percentile speed is 96 km/h and the
in between speed values is found out by interpolation. Hence for 86 km/hr 85th percentile
speed from interpolation we get, BFFS= 82.0 km/h Now, Compute the free-flow speed
F F S = BF F S − fLW − fLC − fA − fM
= 82 − 0 − 0.6 − 8.0 − 2.6
= 71 km/h
4. Determination of LOS LOS determined from the speed-flow diagram. LOS = D (for
upgrade) LOS = D (for downgrade)
23.6 Conclusion
This chapter helps to determine the level of service and capacity for a given road segment. In
the first part we studied highways in general there classification and characteristics which gives
the overall idea of multilane highways. Then we studied determination of capacity for multilane
highway which is again a very important parameter used to determine the level of service, then
we studied the concept of level of service and procedure to determine level of service. Also by
using its applications, number of lanes required (N), and flow rate achievable (vp), Performance
measures related to density (D) and speed (S) can also be determined.
23.7 References
1. R Asworth. Highway Engineering. Heinemann Education books limited, London, 1966.
2. Nicholas J Garber and Lester A Hoel. Traffic and Highway Engineering. Cengage
Learning, 2009.
5. P Y TSENG and F B LIN. Journal of the eastern asia society for transportation studies,
2005.
Chapter 24
Freeway Operations
24.1 Introduction
A freeway is defined as a divided highway with full control of access and two lanes for the
exclusive use of traffic in each direction. Freeways were originally intended to serve longer trips
of generally regional and interurban character. Traffic on freeways differs from that on city
streets and rural roads in that it moves at higher speeds (depending on traffic conditions, design
standards, etc.), more smoothly, and at much larger rates of flow. Speed limits are generally
higher on freeways, and are occasionally non-existent. Because higher speeds reduce decision
time, freeways are usually equipped with a larger number of guide signs than other roads, and
the signs themselves are physically larger. Guide signs are often mounted on overpasses or
overhead gantries so that drivers can see where each lane goes. Access to freeways is typically
provided only at grade-separated interchanges, though lower-standard right-in/right-out access
can be used for direct connections to side roads. This chapter basically describes the capacity
and level of service. Later weaving phenomenon in has been described.
Not to scale
5. The advantage of grade-separated interchanges is that freeway drivers can almost always
maintain their speed at junctions since they do not need to yield to vehicles crossing
perpendicular to mainline traffic.
2. Ramp junction
3. Weaving areas
The base conditions under which the full capacity of a basic freeway segment is achieved are
good weather, good visibility, and no incidents or accidents. For the analysis procedures in this
chapter, these base conditions are assumed to exist. A set of base conditions for basic freeway
segments has been established. These conditions serve as a starting point for the
2. Clearance of 1.8 m between the edge of the travel lanes and the nearest obstructions or
objects at the roadside and in the median,
5. Level terrain,
2. Level grade,
7. No pedestrians
the maximum sustained 15-min flow rate, expressed in passenger cars per hour per
lane, that can be accommodated by a uniform freeway segment under prevailing
traffic and roadway conditions in one direction of flow.
Capacity analysis is based on freeway segments with uniform traffic and roadway conditions.
If any of the prevailing conditions change significantly, the capacity of the segment and its
operating conditions change as well. Therefore, each uniform segment should be analysed
separately.
Roadway conditions include geometric and other elements. In some cases, these influence the
capacity of a road; in others, they can affect a performance measure such as speed, but not the
capacity or maximum flow rate of the facility. Roadway factors include the following:
1. Number of lanes, Number of lanes decided for basic freeway is five or more than five but
if number of lanes is less than five then capacity of freeway is reduced.
2. Lane widths, If the lane width is less than the specified lane width for basic freeway
segment, i.e 3.6m then capacity is reduced because traffic flow tends to be restricted.
3. Shoulder widths and lateral clearances, shoulder width and lateral clearance influences
the capacity of freeway. When lane widths are less than 3.65 m, drivers are forced to
travel closer to one another laterally than they would normally desire. Drivers tend
to compensate for this by reducing their travel speed. The effect of restricted lateral
clearance is similar. When objects are located too close to the edge of the median and
roadside lanes, drivers in these lanes will shy away from them, positioning themselves
further from the lane edge hence capacity is reduced.
4. Design speed, freeway is designed for free flow speed around 120 km per hour ,if some
vehicle is moving less than the design speed then capacity of freeway.
5. Grades: Effect of grade depends on both the length and slope of the grade.Traffic opera-
tions significantly affected when grades of 3% or more are longer than one quarter miles
and when grades are less than 3% and longer than mile.The effect of heavy vehicles on
such grades is much greater.
Traffic conditions
Traffic conditions that influence capacities and service levels include vehicle type and lane or
directional distribution.
Vehicle type The entry of heavy vehicles - that is, vehicles other than passenger cars (a
category that includes small trucks and vans) - into the traffic stream affects the number of
vehicles that can be served. Heavy vehicles are vehicles that have more than four tires touching
the pavement. Trucks, buses, and recreational vehicles (RVs) are the three groups of heavy
vehicles.
1. They are larger than passenger cars and occupy more roadway space; and
2. They have poorer operating capabilities than passenger cars, particularly with respect to
acceleration, deceleration, and the ability to maintain speed on upgrades.
Directional and Lane Distribution In addition to the distribution of vehicle types, two
other traffic characteristics affect capacity and level of service: directional distribution and lane
distribution. Each direction of the facility usually is designed to accommodate the peak flow
rate in the peak direction. Typically, morning peak traffic occurs in one direction and evening
peak traffic occurs in the opposite direction. Lane distribution also is a factor on multi lane
facilities. Typically, the shoulder lane carries less traffic than other lanes.
Control conditions
For interrupted-flow facilities, the control of the time for movement of specific traffic flows
is critical to capacity and level of service. The most critical type of control is the traffic
signal. The type of control in use, signal phasing, allocation of green time, cycle length,
and the relationship with adjacent control measures affect operations. Stop signs and yield
signs also affect capacity, but in a less deterministic way. A Impact of control conditions
traffic signal designates times when each movement is permitted; however, a stop sign at a
two-way stop-controlled intersection only designates the right-of-way to the major street. The
capacity of minor approaches depends on traffic conditions on the major street. An all-way stop
control forces drivers to stop and enter the intersection in rotation. Capacity and operational
characteristics can vary widely, depending on the traffic demands on the various approaches.
qualitatively measures both the operating conditions within a traffic system and
how these conditions are perceived by drivers and passengers.
These operational conditions within a traffic stream are generally described in terms of service
measures as speed and travel time, freedom to maneuver, traffic interruptions, and comfort
and convenience. The three measures of speed, density and flow are interrelated. If values
of two are known, the third can be computed. Six LOS are defined for each type of facility
that has analysis procedures available. Letters designate each level, from A to F, with LOS A
representing the best operating conditions and LOS F the worst. Each level of service represents
a range of operating conditions and the driver’s perception of those conditions. Safety is not
included in the measures that establish service levels.
1. LOS A describes free-flow operations. Free-flow speeds prevail. Vehicles are almost
completely unimpeded in their ability to maneuver within the traffic stream. The effects
of incidents or point breakdowns are easily absorbed at this level.
2. LOS B represents reasonably free flow, and free-flow speeds are maintained. The ability
to maneuver within the traffic stream is only slightly restricted, and the general level of
physical and psychological comfort provided to drivers is still high. The effects of minor
incidents and point breakdowns are still easily absorbed.
3. LOS C provides for flow with speeds at or near the FFS of the freeway. Freedom to
maneuver within the traffic stream is noticeably restricted, and lane changes require
more care and vigilance on the part of the driver. Minor incidents may still be absorbed,
but the local deterioration in service will be substantial. Queues may be expected to form
behind any significant blockage.
4. LOS D is the level at which speeds begin to decline slightly with increasing flows and
density begins to increase somewhat more quickly. Freedom to maneuver within the
traffic stream is more noticeably limited, and the driver experiences reduced physical and
psychological comfort levels. Even minor incidents can be expected to create queuing,
because the traffic stream has little space to absorb disruptions.
5. LOS E describes operation at capacity. Operations at this level are volatile, because there
are virtually no usable gaps in the traffic stream. Vehicles are closely spaced leaving
little room to maneuver within the traffic stream at speeds that still exceed 80 km/h.
Any disruption of the traffic stream, such as vehicles entering from a ramp or a vehicle
changing lanes, can establish a disruption wave that propagates throughout the upstream
traffic flow. At capacity, the traffic stream has no ability to dissipate even the most
minor disruption, and any incident can be expected to produce a serious breakdown with
extensive queuing. Maneuverability within the traffic stream is extremely limited, and
the level of physical and psychological comfort afforded the driver is poor.
6. LOS F describes breakdowns in vehicular flow. Such conditions generally exist within
queues forming behind breakdown points. Breakdowns occur for a number of reasons:
(a) Traffic incidents can cause a temporary reduction in the capacity of a short segment,
so that the number of vehicles arriving at the point is greater than the number of
vehicles that can move through it.
(b) Points of recurring congestion, such as merge or weaving segments and lane drops,
experience very high demand in which the number of vehicles arriving is greater than
the number of vehicles discharged.
In all cases, breakdown occurs when the ratio of existing demand to actual capacity
forecast demand to estimated capacity exceeds 1.00. The figures 24:2-24:7 given below
gives a better idea of the LOS classification done on the basis of density of the traffic
stream.
service is density. The three measures of speed, density, and flow or volume are interrelated. If
values for two of these measures are known, the third can be computed.
24.5.1 Methodology
Level of service of an existing freeway is determined considering it as a stretch of basic freeway
segment. It means that we have to take all the base conditions decided for basic freeway
segment as a standard or initial input. The following steps are followed to determine the level
of service of a freeway.
1. The very first step of methodology is to collect all the input data like geometric data,
measured FFS or BFFS, volume.
2. volume adjustment: The hourly volume is converted into flow rate of passenger cars i.e
pc/hr/ln.
3. Computation of FFS: If BFFS is the input, then for getting the value of FFS ,we have
to adjust the BFFS for the lane width,number of lanes,interchange density and lateral
clearance.
4. computation of S(average passenger car speed): S is calculated from the FFS. If FFS is
measured directly in field, then FFS can be taken as S.
6. Density is determined from the flow rate and speed taken from the speed-flow curve.
V
Vp = (24.1)
P HF × N × fHV × fP
where, V = hourly volume, P HF = peak hour factor (0.80-0.95), N = no. of lanes, fHV =
heavy vehicle adjustment factor, fP = driver population factor
Peak hour factor (PHF) The peak-hour factor (PHF) represents the variation in traffic
flow within an hour. Observations of traffic flow consistently indicate that the flow rates found
in the peak 15-min period within an hour are not sustained throughout the entire hour.
V
P HF = (24.2)
V15×4
Where, V = hourly volume in veh/hr for hour of analysis, V1 5 = Maximum 15-min flow rate
within peak hour, 4 = number of 15-min period per hour.
On freeways, typical PHFs range from 0.80 to 0.95. Lower PHFs are characteristic of rural
freeways or off-peak conditions. Higher factors are typical of urban and suburban peak-hour
conditions. Field data should be used, if possible, to develop PHFs representative of local
conditions.
Heavy vehicle adjustment factor (fHV ) Freeway traffic volumes that include a mix of
vehicle types must be adjusted to an equivalent flow rate expressed in passenger cars per hour
per lane. This adjustment is made using the factor fHV . Once the values of ET and ER are
found, the adjustment factor, fHV , is determined by using equation given below -
where, ET , ER = passenger car equivalents for truck buses and recreational vehicles (RV’s)
in traffic stream respectively, PT , PR = proportion of truck/buses and recreational vehicles in
traffic stream. Adjustments for heavy vehicles in the traffic stream apply for three vehicle types:
trucks, buses, and RVs. There is no evidence to indicate distinct differences in performance
between trucks and buses on freeways, and therefore trucks and buses are treated identically.
The factor fHV is found using a two-step process. First, the passenger-car equivalent for
each truck/bus and RV is found for the traffic and roadway conditions under study. These
equivalence values, ET and ER , represent the number of passenger cars that would use the same
amount of freeway capacity as one truck/bus or RV, respectively, under prevailing roadway and
traffic conditions. Second, using the values of ET and ER and the proportion of each type of
vehicle in the traffic stream (PT and PR ), the adjustment factor fHV is computed.
Driver population factor: Under base conditions, the traffic stream is assumed to consist of
regular weekday drivers and commuters.Such drivers have a high familiarity with the roadway
and generally maneuver and respond to the maneuvers of other drivers in a safe and predictable
fashion. But weekend drivers or recreational drivers are a problem. Such drivers can cause a
significant reduction in roadway capacity relative to the base condition of having only familiar
drivers. To account for the composition of the driver population, the fp adjustment factor is
used and its recommended range is 0.85 1.00.
S = FFS (24.4)
The average of all passenger-car speeds measured in the field under low- to moderate- volume
conditions can be used directly as the FFS of the freeway segment.
Concept of free flow speed (FFS) Free flow speed can be defined as:
the mean speed of passenger cars that can be accommodated under low to moder-
ate flow rates on a uniform freeway segment under prevailing roadway and traffic
conditions.
FFS is the mean speed of passenger cars measured during low to moderate flows (up to
1,300 pc/h/ln). For a specific segment of freeway, speeds are virtually constant in this range of
Table 24:1: Adjustment for Lane Width (reduction in free-flow speed for various widths of lane
Lane Width (m) fLW (km/h)
3.6 0.0
3.5 1.0
3.4 2.1
3.3 3.1
3.2 5.6
3.1 8.1
3.0 10.6
flow rates. Two methods can be used to determine the FFS of a basic freeway segment: field
measurement and estimation with guidelines provided in this section. The field-measurement
procedure is provided for users who prefer to gather these data directly. If field measurement of
FFS is not possible, FFS can be estimated indirectly on the measurement is not possible basis of
the physical characteristics of the freeway segment being studied. The physical characteristics
include lane width, number of lanes, right-shoulder lateral clearance, and interchange density.
Equation given below is used to estimate the free-flow speed of a basic freeway segment:
where, F F S = free flow speed (km/h), BF F S = base free flow speed (km/h), fLW = adjustment
for lane width (km/h), fLC = adjustment for right shoulder clearance (km/h),fN = adjustment
for no. of lanes (km/h), fID = adjustment for interchange density (km/h) Estimation of FFS
for an existing or future freeway segment is accomplished adjusting a base free-flow speed
downward to reflect the influence of four factors: lane width, lateral clearance, number of
lanes, and interchange density. Thus, the analyst is required to select an appropriate BFFS as
a starting point.
Adjustment for Lane Width The base condition for lane width is 3.6 m or greater. When
the average lane width across all lanes is less than 3.6 m, the base free-flow speed (e.g., 120
km/h) is reduced. Adjustments to reflect the effect of narrower average lane width are given
in Table 24:1.
Adjustment for Lateral Clearance Base lateral clearance is 1.8 m or greater on the right
side and 0.6 m or greater on the median or left side, measured from the edge of the paved
shoulder to the nearest edge of the travelled lane. When the right-shoulder lateral clearance
Table 24:2: Adjustment for Lateral Clearance (reduction in free-flow speed for various values
of lateral clearance)
Right Shoulder fLC (km/h)
Lateral Lanes in One Direction
Clearance (m) 2 3 4 ≥5
≥1.8 0.0 0.0 0.0 0.0
1.5 1.0 0.7 0.3 0.2
1.2 1.9 1.3 0.7 0.4
0.9 2.9 1.9 1.0 0.6
0.6 3.9 2.6 1.3 0.8
0.3 4.8 3.2 1.6 1.1
0.0 5.8 3.9 1.9 1.3
Table 24:3: Adjustment for number of lanes (reduction in free-flow speed for number of lanes
in one direction)
Number of Lanes fN (km/h)
≥5 0.0
4 2.4
3 4.8
2 7.3
is less than 1.8 m, the BFFS is reduced. Adjustments to reflect the effect of narrower right-
shoulder lateral clearance are given in Table 24:2.
Adjustment for Number of Lanes Freeway segments with five or more lanes (in one
direction) are considered as having base conditions with respect to number of lanes. When
fewer lanes are present, the BFFS is reduced. Table 24:3 provides adjustments to reflect the
effect of number of lanes on BFFS. In determining number of lanes, only mainline lanes, both
basic and auxiliary, should be considered.
Adjustment for Interchange Density The base interchange density is 0.3 interchanges
per kilometer, or 3.3-km interchange spacing. Base free-flow speed is reduced when interchange
density becomes greater. Adjustments to reflect the effect of interchange density are provided in
Table 24:4. Interchange density is determined over a 10-km segment of freeway (5 km upstream
Table 24:4: Adjustment for Interchange Density (Reduction in Free-Flow Speed for various
values of interchange density)
Interchanges per km fID (km/h)
≤ 0.3 0.0
0.4 1.1
0.5 2.1
0.6 3.9
0.7 5.0
0.8 6.0
0.9 8.1
1.0 9.2
1.1 10.2
1.2 12.1
Numerical example 1
Consider an existing four lane freeway in rural area, having very restricted geometry with
rolling terrain. Peak hour volume is 2000 veh/h with 5% trucks. The traffic is commuter type
with peak hour factor 0.92 and interchange density as 0.6 interchanges per kilometer. Freeway
consists of two lanes in each direction of 3.3 m width with lateral clearance of 0.6 m. Find the
LOS of freeway during peak hour.
Solution Assumptions: Assume 0 percent buses and RVs since none are indicated. Assume
BFFS of 120 km/h for rural areas. Since the freeway is in a rural area assume that the number
of lanes does not affect free-flow speed. Assume fp = 1.00 for commuter traffic. We can get the
corresponding values of adjustment factors from the tables as - fLW =3.1, fLC =3.9, fID =3.9
and fN =0.
Step 2 Convert volume (veh/h) to flow rate (pc/h/ln) using equation as given below
V
Vp =
P HF × N × fHV × fP
2000
=
0.92 × 2 × 0.930 × 1.00
= 1, 169 pc/h/ln
Step 3 Compute free-flow speed from equation 24.6 as given below and putting the respective
values of adjustment factors we get F F S as
Step 5 Find Level of service, for the calculated value of density we can get the level of service
from the LOS table. i.e for D = 10.7 pc/km/ln we get LOS = B
Numerical example 2
A new suburban freeway is designed in the level terrain. Peak hour volume is 4,000 veh/h and
the flow consists of 15% trucks and 3% recreational vehicles (RV’s). The traffic is commuter
type with peak hour factor 0.85 and interchange density as 0.9 interchanges per kilometer. Lane
width is proposed to be 3.6 m with lateral clearance of 1.8 m. How many lanes are needed to
provide LOS C during the peak hour?
Solution Assumptions: Assume BF F S of 120 km/h. Since the freeway is being designed in
a suburban area assume that the number of lanes affects free-flow speed. For commuter traffic
we can take fp = 1.00. We can get the corresponding values of adjustment factors from the
tables as - fLW = 0, fLC = 0, fID = 8.1 and fN = 4.8.
Step 2 Convert volume (veh/h) to flow rate (pc/h/ln) using equation 24.2. Consider a four
lane option, for four lane N = 2, keeping value of fHV and N in equation 24.2 we get Vp as:
V
Vp =
P HF × N × fHV × fP
4000
=
0.85 × 2 × 0.925 × 1.00
= 2, 544 pc/h/ln.
Four lane option is not acceptable as 2544 pc/h/ln exceeds capacity of 2400 pc/h/ln. Here
2400 pc/h/ln is the capacity of a single lane under standard conditions.
Step 5 Compute FFS for a six-lane freeway from equation 24.6 and putting the respective
values of adjustment factors we get F F S as:
Step 7 Check the LOS, for the calculated value of density we can get the level of service
from the LOS table; i.e for D = 15.8 pc/km/ln we get LOS = C. Hence number of lanes to be
provided to satisfy LOS C during peak hour = 6.
B D
turbulence in excess of that normally present on basic freeway segments. The turbulence
presents special operational problems and design requirements. Fig. 24:8 shows the simple
weaving segment formed by a single merge point followed by a single diverge point. Multiple
weaving segments may be formed where one merge is followed by two diverge points or where
two merge points are followed by one diverge point.
The identifying characteristic of a Type A weaving segment is that all weaving vehicles must
make one lane change to complete their maneuver successfully. All of these lane changes occur
across a lane line that connects from the entrance gore area directly to the exit gore area. Such
a line is referred to as a crown line. Type A weaving segments are the only such segments to
have a crown line.
The most common form of Type A weaving segment is shown in Fig. 24:9. The segment is
formed by a one-lane on-ramp followed by a one-lane off-ramp, with the two connected by a
continuous auxiliary lane. The lane line between the auxiliary lane and the right-hand freeway
lane is the crown line for the weaving segment. All on-ramp vehicles entering the freeway must
A C
B D
B D
make a lane change from the auxiliary lane to the shoulder lane of the freeway. All freeway
vehicles exiting at the off-ramp must make a lane change from the shoulder lane of the freeway
to the auxiliary lane. This type of configuration is also referred to as a ramp-weave. Fig. 24:10
illustrates a major weaving segment that also has a crown line. A major weaving segment is
formed when three or four of the entry and exit legs have multiple lanes. As in the case of a
ramp-weave, all weaving vehicles, regardless of the direction of the weave, must execute one
lane change across the crown line of the segment.
Type B weaving segments are shown in Figs. 24:11 to 24:13. All Type B weaving segments
fall into the general category of major weaving segments in that such segments always have
at least three entry and exit legs with multiple lanes (except for some collector distributor
configurations). It is the lane changing required of weaving vehicles that characterizes for the
Type B configuration:
1. One weaving movement can be made without making any lane changes, and
Figs. 24:11 to 24:13 show two Type B weaving segments. In both cases, Lane balance defined
Movement B-C (entry on the right, departure on the left) may be made without executing any
lane changes, whereas Movement A-D (entry on the left, departure on the right) requires only
one lane change. Essentially, there is a continuous lane that allows for entry on the right and
departure on the left.
B
D
B D
In Fig. 24:11 this is accomplished by providing a diverging lane at the exit gore. From this
lane, a vehicle may proceed down either exit leg without executing a lane change. This type
of design is also referred to as lane balanced, that is, the number of lanes leaving the diverge
is one more than the number of lanes approaching it. In Fig. 24:12 the same lane-changing
scenario is provided by having a lane from Leg A merge with a lane from Leg B at the entrance
gore. This is slightly less efficient than providing lane balance at the exit gore but produces
similar numbers of lane changes by weaving vehicles. The configuration shown in Fig. 24:13
is unique, having both a merge of two lanes at the entrance gore and lane balance at the exit
gore. In this case, both weaving movements can take place without making a lane change. Such
configurations are most often found on collector-distributor roadways as part of an interchange.
A C
D
B
Figure 24:13: Major Weave with Merge at Entry Gore and Lane Balance at Exit Gore
B D
A D
Type C weaving segments are similar to those of Type B in that one or more through lanes
are provided for one of the weaving movements. The distinguishing characteristic of a Type C
weaving segment is that the other weaving movement requires a minimum of two lane changes
for successful completion of a weaving maneuver. Thus, a Type C weaving segment is charac-
terized by the following:
1. One weaving movement may be made without making a lane change, and
Figs. 24:14 to 24:15 shows two types of Type C weaving segments. In Fig. 24:14 Movement
B-C does not require a lane change, whereas Movement A-D requires two lane changes. This
type of segment is formed when there is neither merging of lanes at the entrance gore nor lane
balance at the exit gore, and no crown line exists. Although such a segment is relatively efficient
for weaving movements in the direction of the freeway flow, it cannot efficiently handle large
weaving flows in the other direction.
Fig. 24:15 shows a two-sided weaving segment. It is formed when a right-hand on-ramp is
followed by a left-hand off-ramp, or vice versa. In such cases, the through freeway flow operates
functionally as a weaving flow. Ramp-to-ramp vehicles must cross all lanes of the freeway to
execute their desired maneuver. Freeway lanes are, in effect, through weaving lanes, and ramp-
to-ramp vehicles must make multiple lane changes as they cross from one side of the freeway
to the other.
24.7 Conclusion
Freeways are most efficient type of highway. Level of service (LOS) is a quality measure
describing operational conditions within a traffic stream of freeways. Prevailing roadway, traffic
and control conditions define capacity; these conditions should be reasonably uniform for any
section of freeway analysed. Freeway management system works for smooth operations of
freeway.
24.8 References
1. Traffic operations, traffic signal systems and freeway operations, 1995.
2. Freeway operations, 2019. Highway Research Board, bulletin 324; 1962 ; pageno. 46-73.
6. Roess P Roger and Jose M Ulerio. Level of Service Analysis of Freeway Weaving Segments.
Transportation Research Record:2130, 2009.
Chapter 25
Ramp Metering
25.1 Introduction
Ramp metering can be defined as a method by which traffic seeking to gain access to a busy
highway is controlled at the access point via traffic signals. This control aims at maximize the
capacity of the highway and prevent traffic flow breakdown and the onset of congestion. Ramp
metering is the use of traffic signals to control the flow of traffic entering a freeway facility.
Ramp metering, when properly applied, is a valuable tool for efficient traffic management on
freeways and freeway networks.
25.1.1 Objectives
The objectives of ramp metering includes:
1. Controlling the number of vehicles that are allowed to enter the freeway,
Figure 25:1 given below is a typical example of ramp metering. The signal placed at the ramp,
controls the traffic flow which can enter the freeway through merge lane. Vehicle detectors are
also shown at the downstream end of the freeway.
25.1.2 Benefits
Ramp metering has many positive benefits in freeway management with in measurable param-
eters such as reduced delay, reduced travel time, reduced accident risk and increased operating
speed. The typical advantages are:
Direction of travel
1. Improved System Operation: Ramp metering essentially aims to control the access to
a freeway to reduce congestion, freeway delay and ultimately overall delay. Although
several ramp metering strategies are available with individual pros and cons, overall,
ramp metering helps to break up platoons of vehicles from entering a freeway and causing
turbulence, reduces delay due to random access and defers if not eliminates the onset of
congestion.
2. Improved Safety: Ramp areas are accident prone areas due to unmanaged merging and
diverging. Ramp metering makes merging and diverging operation to a freeway smooth
and controlled, reducing the risk of accidents arising out of sudden driver decisions. Ran-
dom entry of platoons is also prevented which decreases the risk of accidents at merge or
diverge areas.
3. Reduced vehicle operating expense and emission: Ramp metering essentially reduces the
number of stops and delays for the freeway as well as the ramps. This in turn reduces
the fuel consumption and emission for a vehicle.
1. The length of green plus yellow indications is set to ensure sufficient time for one vehicle
to cross the stop line. The length of red interval should be sufficient to ensure that the
following vehicle completely stops before proceeding.
2. A typical cycle length is taken as, the smallest possible cycle is 4 seconds with 1 second
green, 1 second yellow, and 2 seconds red. This produces a meter capacity of 900 VPH.
3. A more reasonable cycle is around 4.5 seconds, obtained by increasing the red time to 2.5
seconds. This increase in red would result in a lower meter capacity of 800 VPH.
1. Three or more cars can be allowed; however, this will sacrifice the third objective(breaking
up large platoons).
2. Furthermore, contrary to what one might think, bulk metering does not produce a drastic
increase in capacity over a single-lane one car per green operation. This is because this
strategy requires longer green and yellow times as ramp speed increases, resulting in a
longer cycle length. Consequently, there are fewer cycles in one hour.
3. Two cars per green strategy requires cycle lengths between 6 and 6.5 seconds and results
in metering capacity of 1100 to 1200 VPH. This analysis illustrates that bulk metering
does not double capacity and this finding should be noted.
1. In this strategy, the controller displays the green-yellow-red cycle for each lane.
2. Synchronized cycles are used such that the green indications never occur simultaneously
in both lanes.
Good
90
80
Dual lane,
70 single entry
Fair
1 car/green
60
50 2 cars/green
40
30
3 cars/green
Fail
20
10
0
800 900 1000 1100 1200 1300 1400 1500 1600 1700 1800
Figure 25:2: Comparison of metering quality of different approaches with Ramp demand volume
3. The green indications are timed to allow a constant headway between vehicles from both
lanes. Dual-lane metering can provide metering capacity of 1600 to 1700 VPH.
4. In addition, dual-lane ramps provide more storage space for queued vehicles.
at the entrance ramp. The determination of minimum ramp length to provide safe, efficient,
and desirable operation requires careful consideration of several elements described below:
1. Sufficient room must be provided for a stopped vehicle at the meter to accelerate and
attain safe merge speeds.
2. Sufficient space must be provided to store the resulting cyclic queue of vehicles without
blocking an upstream signalized intersection.
3. Sufficient room must be provided for vehicles discharged from the upstream signal to
safely stop behind the queue of vehicles being metered.
Provision for the distances mentioned is an integral part of ramp design. Figure 25:3 illustrates
the requirements for the different types of distances explained above.
200
Dual lane
Bulk metering
150 Single lane
100
50
0
0 300 600 900 1200 1500
Figure 25:4: Variation of distance to meter with Ramp demand volume for different strategies
of Ramp metering
In this equation, L (in meters) is the required single-lane storage distance on the ramp when
the expected peak-hour ramp demand volume is V vph and a, b are constants. This figure
shows the requirements for three metering strategies:
1. Single-lane with single vehicle release per cycle.
200
100
0
60 70 80 90 100
Figure 25:5: Acceleration length v/s merge speed for different strategies of Ramp metering
for various classes of vehicles as they accelerate from a stop to speed for various ramp grades.
Figure 25:5, given below provides similar acceleration distances needed to attain various freeway
merging speeds based on AASHTO design criteria. Table 25:1 provides the acceleration length
for different merge speed and with ramps of different grade. The desired distances to merge
increases with increasing freeway merge speed and the same ramp grade.
V
F
{ V12
{ }
D S
VR 12
R R } VFO
450 m
1. The flow entering lanes 1 and 2 of the freeway upstream of merge area or diverge area is
first determined.
2. The capacity of the freeway, ramp and merge and diverge areas are determined and
checked with limiting values to determine the chance of occurrence of congestion.
3. The density in the ramp influence area is then found out and depending on the value f
this variable, the level of service is determined.
From design point of view analysis of merge area and diverge area are treated separately but
follows the same basic principle already explained.
1. Total freeway flow approaching merge area (VF ) (pc/h): The total approach flow is the
most important influencing factor for the flow remaining in lanes 1 and 2 of the freeway.
2. Total Ramp Flow (VR ): This is the total flow on the ramp which ultimately enters the
freeway to merge with existing flow.
3. Total length of acceleration lane: A longer acceleration lane reduces the turbulence and
hence the density in the influence area of the ramp. The flow in the lanes 1 and 2 thus
are higher.
4. Free- flow speed of ramp at point of merge area: Higher the free flow speed of ramp
vehicles, vehicles on freeway tend to move away from merging flow to avoid high speed
turbulence.
HCM 2000 provides model for predicting V12 at on-ramps as given below:
V12 = VF × PF M (25.3)
where V12 is the flow rate in lane 1 and 2 of freeway entering ramp influence area (pc/h), VF
is the total freeway flow approaching merge area, and PF M is the Proportion of approaching
freeway flow remaining in lanes 1 and 2 immediately upstream of merge. For four lanes freeway
(2 lanes in each direction) PF M = 1.00
1. The total departing freeway flow, given as V = vF + vR , is greater than the capacity of
the down steam freeway segment, and hence the LOS is F and queuing is expected on
the freeway.
2. Flow entering the ramp influence area exceeds its capacity but total departing freeway
flow is within capacity. This may result in in local high densities and queuing is not
expected on the freeway.
DR = a + b VR + c V12 + d LA (25.5)
where, DR is the density of merge influence area (pc/km/ln), VR is the on-ramp peak 15-min
flow rate (pc/h), LA is the length of acceleration lane (m), V12 is the flow rate entering ramp
influence area (pc/h), and a, b, c, and d are constants.
Numerical example
Consider a single lane on-ramp to a six-lane freeway. The length of the acceleration lane is 150
m. What is the LOS during the peak hour for the first on-ramp? Given that the peak hour
factor is 0.95, the heavy vehicle adjustment factor is 0.976, the driver adjustment factor is 1.0
and proportion of approaching freeway flow remaining is 55.5%? The freeway volume is 3000
veh/hr and the on-ramp volume is 1800 veh/hr.
Solution
1. Convert volume to flow rate: Convert volume in (veh/hr) to flow rate (pc/hr) using
Vi
vi =
P HF × Fhv × Fp
where, vi is the flow rate in pc/hr for direction i, Vi is the hourly volume in veh/hr for
direction i, PHF is the peak hour factor, and Fhv is the adjustment factor for heavy
vehicles, and Fp is the adjustment factor for driver population.
V12 = VF × PF M
= 3236 × 0.555 = 1796 pc/hr.
DR = a + b VR + c V12 + d LA
= 3.402 + 0.00456 VR + 0.0048 V12 − 0.01278 LA
= 3.402 + 0.00456 × 1941 + 0.0048 × 1796 − 0.01278 × 150
= 18.96 pc/km/ln.
4. Compute LOS For DR =18.96 pc/km/ln, the LOS = D from the LOS table above.
1. First, approaching flow V12 is measured for a point immediately upstream of the deceler-
ation lane.
2. Second, V12 includes VR at the diverge area. V12 is the flow rate entering ramp influence
area (pc/h), and vR is the Off-ramp demand flow rate (pc/h).
The general model given by HCM 2000 treats V12 as the sum of the off-ramp flow plus a
proportion of the through freeway flow.
V
F
{ V12
{ } VR12
D S
R R } V
FO
450 m
V
R
where, V12 is the flow rate in lanes 1 and 2 of freeway upstream of diverge area in (pc/hr),
VF is the freeway demand flow rate immediately upstream of diverge in (pc/h), and PF D is
the proportion of through freeway flow remaining in lanes 1 and 2 immediately upstream of
diverge. For four lanes freeway (2 lanes in each direction) PF D is 1.00.
1. Total flow that can depart from the diverge: this is limited by the capacity of the lanes
in the freeway prior to approach of the diverge.
2. The capacities of the departing freeway leg or legs or ramp or both. This is the most
important of the three as generally diverge areas fail due to failure of one or more exit
legs..
3. V12 (approaching flow) prior to deceleration lane: this flow also includes the off-ramp flow
and must be checked against capacity.
where, DR is the density of diverge influence area (pc/km/ln), V12 is the flow rate entering ramp
influence area (pc/h), LD is the length of deceleration lane(m), and a, b & c are constants.
This equation is applicable only for under saturated conditions of flow. The density calculation
DR S R
150 m 225 m 90 m
is not done when either of the three capacities mentioned earlier are exceeded. In such cases,
the LOS is assigned as F.
Numerical example
Consider an off-ramp (Single-lane) pair, 225 meters apart, from a six lane freeway. The length
of the first deceleration lane is 150m and that of the second deceleration lane is 90 m. What is
the LOS during the peak hour for the first off-ramp given that the peak hour factor is 0.95, the
heavy vehicle adjustment factor is 0.93, the driver adjustment factor is 1.0 and the proportion
of through freeway flow remaining is 61.7%? The freeway volume is 4500 veh/hr and the first
off-ramp volume is 300 veh/hr.
Solution
1. Convert volume to flow rate: Convert volume in veh/hr to flow rate in pc/hr as
follows:
Vi
vi =
(P HF × Fhv × Fp )
VF = 5093 pc/hr (Fhv = 0.930, Fp = 1.0)
VR = 340 pc/hr (Fhv = 0.930, Fp = 1.0)
V12 = VR + (VF − VR ) × P F D
= 340 + (5093 − 340) × (0.617)
= 3273 pc/hr
1. It is the simplest and least expensive form of ramp metering for construction and instal-
lation.
2. It is also the most rigid approach because it cannot make adjustments for real-time
conditions including non-recurring congestion (i.e., congestion that occurs as a result of
weather, collisions, etc.).
3. Th system being pre-timed, it is best used to address conditions that are predictable from
day-today.
4. If there is no mainline or ramp detection, agencies must regularly collect data by al-
ternative means in order to analyze traffic conditions on the freeway and determine the
appropriate metering rates.
5. The metering operation will require frequent observation so that rates can be adjusted to
meet traffic conditions which is a drawback.
1. This system uses freeway loop detectors or other surveillance systems to calculate or select
ramp metering rates based on current freeway conditions.
2. It is generally considered to be five to ten percent better than those of pre-timed metering.
Local ramp metering is employed when only the conditions local to the ramp (as compared
with other ramps) are used to provide the metering rates. The salient features are:
1. Local traffic responsive metering approaches base metering rates on freeway conditions
near the metered ramp.
2. This is used where the traffic congestion at a location can be reduced by the metering of
a single ramp.
4. Unlike pre-timed systems, local systems require surveillance of the freeway using traffic
detectors.
5. Although, more capital costs are required to implement traffic responsive systems, they
more easily adapt to changing conditions and can provide better results than their pre-
timed counterparts.
1. This is used when there are multiple bottlenecks or locations of recurring congestion along
a freeway.
2. This type of ramp metering is used to optimize traffic flow along a metered stretch of
roadway, rather than at a specific point on the freeway (as is the case of local traffic
responsive systems).
3. Like local traffic responsive systems, system-wide traffic responsive systems require data
from ramp detectors and local freeway detectors.
4. In addition to these components, system-wide traffic responsive systems are unique in the
fact that data is also needed from downstream detectors and/or upstream detectors at
multiple locations, potentially from cross-street signal controllers, and from the central
computer.
5. System-wide traffic responsive systems have the most complex hardware configuration
compared to the other metering approaches discussed so far (i.e., pre-timed and local
traffic responsive).
25.8 Summary
In this chapter we discussed ramp metering, different strategies of ramp metering, procedure
to find out the level of service of on and off ramps, different kind of metering systems. From
the analysis that we have done in this chapter we can say that the Ramp metering can result
into increased freeway speed, decreased travel time, increase in freeway capacity, reduction in
accidents and congestion, improved fuel economy and efficient use of capacity.
25.9 References
1. Ismail Chabini and Amedeo R Odoni. Transportation Flow Systems. MIT, 2019.
2. A Chaudhary and J Messer. Report on design criteria for ramp metering. Texas
Transportation Institute, Texas, 2000.
Chapter 26
Corridor Analysis
26.1 Introduction
Transport problems are very critical one to be solved frequently, sequentially and economically
for all sectors of one nation. Even though these solutions are mandatory, they are continuous
and expensive so needs to be planned systematically. These all requirements will lead us to
Transportation System Planning. Transportation System Planning is a tool that attempts to
provide feasible and systematic method for solving transport problems of the society. Trans-
portation system planning starts from the problem of the society which is the difference of users
desire to the existing condition of the system. Afterwards following its stages it will attempt
to meet its goals and objectives. While in the process so many analyses are required to be
done from them the one is done to know the performance of the existing system. This can be
expressed as either individual component performance or the whole system performance. Doing
this is dependent on the type of transportation system. Among them multi modal multi facility
system is the one which requires aggregate performance measurement for all components which
constitutes. According to our study area we can choose from the two methods of performance
measurement alternatives which are Corridor analysis and Area wide analysis.
26.2 Terminologies
The terminologies used in the corridor analysis is provided below.
Segment
Point
Freeway
Arterials
2. Segment: Segments are stretches of a facility in which the traffic demand and capacity
conditions are relatively constant.
3. Point: Points are locations at the beginning and end of each segment, at which traffic
enters, leaves, or crosses the facility.
4. Facility: is a structure built or road design modification to increase the efficiency of the
two main road way services (accessibility and Mobility).
2. Rural highway: A road with only one lane in each direction and traffic signals spaced
no closer than 3.0 km. mostly recognized by its low flow condition.
3. Urban Street: With traffic signals spaced no farther than 3.0 km apart. Since in
Urban areas most activities are fond of Transportation, are characterized by its high
flow condition and high traffic movements due the complex interaction between vehicles
accidents are also high in urban areas. To avoid this and other conflicts Traffic control is
required especially in urban areas.
26.2.3 Transit
Transits are a means of transporting massive either passenger or freight on a separated route.
These modes of transportations are a key to every city especially in urban areas. The most
common types of Transits include:
1. Bus transit is a term applied to a variety of public transportation systems using buses
to provide faster, more efficient service than an ordinary bus line. Often this is achieved
by making improvements to existing infrastructure, vehicles and scheduling. Bus rapid
transit also called Bus way and/or Quality bus.
2. Street car is a means of public transport which requires their own rail to flow through the
system these rails can be built embedded in roadways. Streetcar (also called Tram) is a
passenger rail vehicle which runs on tracks along public urban streets and also sometimes
on separate rights of way.
3. Rail transit is a form of urban rail public transportation that generally has a lower
capacity and lower speed than heavy rail and metro systems, but higher capacity and
higher speed than traditional street-running tram systems.
Step 1. Select the entry gate segment with the highest priority and the highest v/c ratio.
Step 4. If demand > capacity or queue > 0, then calculate new queue by using eqn. 26.1.
where, i is the current analysis period, i − 1 is the previous analysis period, queuei−1 is
the queue remaining from the preceding analysis period.
Step 5. Reduce downstream segment demand by the amount that the demand exceeds
the capacity. Propagate this reduction to all connecting downstream segments in pro-
portion to the ratio of each downstream segment demand to all segments exiting from
the subject segment. Continue the process downstream until the reduction is less than 5
percent of capacity.
Step 6. Add the excess demand - the amount by which the demand exceeds the capacity
- to the next time period demand for the subject segment.
Step 7. Apply the increment to the next time period. Repeat Steps 3 through 6 until
the processes for all the time periods are finished.
Step 8. Go to next gate tree with unanalyzed segments in current rank. Repeat Steps 2
through 7 until all segments of current rank have been analyzed.
Step 9. Apply the increment to current Rank (the new one). Go to the segment with
the highest v/c ratio among those of the new rank. Repeat Steps 2 through 8 until all
segments are analyzed.
T T2
Di = × Di−1 + [V − c] × (26.3)
2 2
where, Di is the total delay due to excess demand (veh-hr) for direction, segment, and time
period; T is the duration of time sub-period (hr); Di−1 is the queue left over at end of previous
time period (veh); V is the demand rate for current time period (veh/hr); and c is the capacity
of segment in subject direction (veh/hr). These the above steps are repeated for any additional
time periods to be analyzed. For example, if the peak period lasts for 4 hours, it might
be divided into four 1hr periods (or 16 quarter hr periods), with each time period analyzed
in sequence. The first and the last analysis periods must be uncongested for all delay to
be included in the performance measures. Once all time periods have been analyzed, the
performance measures are computed.
26.4.1 Intensity
The possible performance measures for the intensity of congestion on the highway subsystems
(freeway, two-lane highway, and arterial) in the corridor are computed from one or more of the
following: person-hours of travel, person-hours of delay, mean trip speed, and mean trip delay.
If average vehicle occupancy (AVO) data are not available, then the performance measures are
computed in terms of vehicle-hours rather than person-hours.
2. The mean trip time is computed by dividing the total person hours of travel by the
number of person trips.
t = 60 × P HT /P (26.5)
where, t is the mean trip time (min/person), P HT is the person-hours of travel, and P
is the total number of person trips.
3. The mean trip speed is computed by dividing the total number of person-kilometers by
the total person-hours of travel as in eqn. 26.6 below:
P kmT Σd,l,h [V × L]
S= = AV O × (26.6)
P HT P HT
where, S is the mean corridor trip speed (km/h), P kmT is the person-kilometers of travel,
PHT is the person-hours of travel, AV O is the average vehicle occupancy, V is the vehicle
demand in the given Direction on a Segment and Period (veh), and L is the length of
segment (km).
4. The mean trip delay is computed by subtracting the PHT under free-flow conditions from
the PHT under congested conditions and dividing the result by the number of person-
trips. The person-hours of travel under free-flow conditions is computed like PHT for
congested conditions, but using free-flow traversal times and zero queuing delay. It can
be determined using eqn. 26.7 given below:
(P HT − P HTf )
d = 3600 × (26.7)
P
where, d is the mean trip delay (s/person), P HT is the person-hours of travel, P HTf is
the person-hours of travel under free-flow conditions, and P is the total number of person
trips.
26.4.2 Duration
Performance measurements of duration can be computed from the number of hours of congestion
observed on any segment. The duration of congestion is the sum of the length of each analysis
sub-periods for which the demand exceeds capacity. The duration of congestion (i.e., over-
saturation) for any link is computed using Eqn. 26.8 as:-
Hi = Ni × T (26.8)
where, Hi is the duration of congestion for Link i(h), Ni is the number of analysis sub-periods
for which v/c > 1.00 on Link i, and T is the duration of analysis sub-periods (h). The maximum
duration on any link indicates the amount of time before congestion is completely cleared from
the corridor.
26.4.3 Extent
Performance measures of the extent of congestion can be computed from the sum of the length
of queuing on each segment. One can also identify segments in which the queue overflows the
storage capacity; this is particularly useful for ramp metering analyses. To compute the queue
length, an assumption must be made about the average density of vehicles in a queue. Default
values are suggested in Table. 26:1 To compute queue length, Eqn. 26.9 is used.
T × [v − c]
QL = (26.9)
N × ds
where, QL is the queue length (km) for the given Direction, of Segment, for Time Sub-period;
v is the segment demand (veh/h); c is the segment capacity (veh/h); N is the number of lanes;
ds is the storage density (veh/km/ln); and T is the duration of analysis period (h). Note that if
v < c, then QL = 0, and if QL > L, then the queue overflows the storage capacity. The queue
lengths for all segments then can be added up to obtain the length of queuing in kilometers in
the subsystem during the analysis period. The number of segments in which the queue exceeds
the storage capacity also might be reported. This statistics is particularly useful for identifying
queue overflows that result from ramp metering.
26.4.4 Variability
Variability is a sensitivity measure. The variability or sensitivity of the results can be deter-
mined by substituting higher and lower demand estimates. For example assuming 110 percent
of the original demand estimates for all segments and repeating the calculations.
26.4.5 Accessibility
Accessibility can be measured in terms of the number of trip destinations reachable within a
selected travel time for a designated set of origin locations such as a residential zone. The
8 7
Arterials
1 6
2 4
3 5
results for each origin zone are tabulated and reported as X percent of the homes in the study
area can reach Y percent of the jobs within Z minutes.
Numerical example
For the given Urban street system geometry and Data inputs determine the performance mea-
surement using Corridor analysis. Given that:
2. Peak Hour Demand data all Volumes are in (veh/hr) is given in Table. 26:2.
3. Capacities, Lengths, Free flow speeds and average flow speeds for each link input data is
also given in Table. 26:3.
Solution:
1. Step 1. Because we have Traffic count data we should convert it as link data. This can
be done by allocating the flow and adding the volume as per its logical direction (Table
4 col (3)). The flow allocation overview is as shown below. In Fig. 26:3
8 7
Th
Rt NB
Lt SB
Th EB
Rt NB
Lt SB
1375
1318
Lt
Lt
1101
Th
1259
EB
4
Th
Rt
22
2
Rt
1 6
Rt
WB
22
1216
Rt
Th
WB
Rt SB
Th WB
Lt NB
Th
999
1008
Rt SB
Th WB
Lt NB
Lt
1141
Lt
Th Th
Lt Rt Lt Rt
Use 999 Lt WB
Lt WB Th SB
NB Th SB
Rt EB NB Rt EB
2. Step 2. Calculate V/C ratio demand by capacity for each link which is as shown below
in Table. 5 col (5).
3. Step 3. For V/C > 1 find the Queued vehicles simply the difference of demand to
capacity.
4. Step 4. Adjust the demand downstream till it reaches 10% of the volume before doing
further check up. Until all V/C ratios are below 1.
5. Step 5. Determination of person hour delay (PHD), person hours travel (PHT), person
kilometer hour travel (PkmT).
Note that in Table. 5
7. Step 7. Actual VHT (col(8))= Qd +(col (3) × col (4))/col (6), where, Qd is the queue
delay in our case zero.
10. Step 10. Travel Delay (PHD) (col(11))= Actual PHT (col(10)) - Free PHT (col(9))
P kmT = AV O × ΣV × L
where, V is adjusted volume, L is length of the Link, and ΣV L is col(12) last cell in
Table. 26:5.
P HT = ΣactualP HT
= 396.8pers.hr
60 × P HT
t = = 1.43min/pers
AV O × ΣV
P kmT
S = = AV O × (Σd,l,h [V × L])/P HT
P HT
= 39.6km/hr
(P HT − P HTf )
d = 3600 ×
P
= 24.9sec/pers.
26.5 Summary
Corridor Analysis is the method of combining Point, Segment and Facility analysis to estimate
the overall performance of multi-modal corridor. Mostly the performance measures of any
corridor are determined by calculating its capacity, the travel time and queue delay in the
given section. Since this tool is required for multi facility and multi-modal transportation
system mostly it covers Highway subsystems (Freeways, Rural highways and urban streets)
and Transit.
26.6 References
1. Urban transportation planning model update - phase ii, 1981. Task F- Development of
Corridor Analysis Procedures.
2. Highway Capacity manual part V Draft Working Paper 385-9. University of Florida
Transportation Research Center and T-Concepts Corp, Proposed 2010 Highway Capacity
manual part V Draft Working Paper 385-9, 2007., 2010.
Chapter 27
27.1 Overview
Intersection is an area shared by two or more roads. This area is designated for the vehicles
to turn to different directions to reach their desired destinations. Its main function is to
guide vehicles to their respective directions. Traffic intersections are complex locations on any
highway. This is because vehicles moving in different direction wan to occupy same space at the
same time. In addition, the pedestrians also seek same space for crossing. Drivers have to make
split second decision at an intersection by considering his route, intersection geometry, speed
and direction of other vehicles etc. A small error in judgment can cause severe accidents. It also
causes delay and it depends on type, geometry, and type of control. Overall traffic flow depends
on the performance of the intersections. It also affects the capacity of the road. Therefore,
both from the accident perspective and the capacity perspective, the study of intersections very
important for the traffic engineers especially in the case of urban scenario.
4 Merging
P P
4 Diverging
P 8 Pedestrian
P P
Total = 32 Conflicts
P P
that has to be adopted depends on the traffic volume, road geometry, cost involved, importance
of the road etc.
1. No control If the traffic coming to an intersection is low, then by applying the basic
rules of the road like driver on the left side of the road must yield and that through
movements will have priority than turning movements. The driver is expected to obey
these basic rules of the road.
2. Traffic signs: With the help of warning signs, guide signs etc. it is able to provide
some level of control at an intersection. Give way control, two-way stop control, and
all-way stop control are some examples. The GIVE WAY control requires the driver in
the minor road to slow down to a minimum speed and allow the vehicle on the major
road to proceed. Two way stop control requires the vehicle drivers on the minor streets
should see that the conflicts are avoided. Finally an all-way stop control is usually used
when it is difficult to differentiate between the major and minor roads in an intersection.
In such a case, STOP sign is placed on all the approaches to the intersection and the
driver on all the approaches are required to stop the vehicle. The vehicle at the right
side will get priority over the left approach. The traffic control at ’at-grade’ intersection
may be uncontrolled in cases of low traffic. Here the road users are required to obey the
basic rules of the road. Passive control like traffic signs, road markings etc. are used to
complement the intersection control.
3. Traffic signs plus marking: In addition to the traffic signs, road markings also comple-
ment the traffic control at intersections. Some of the examples include stop line marking,
yield lines, arrow marking etc.
2. Traffic rotaries: It is a form of intersection control in which the traffic is made to flow
along one direction around a traffic island. The essential principle of this control is to
convert all the severe conflicts like through and right turn conflicts into milder conflicts
like merging, weaving and diverging. It is a form of ‘at-grade’ intersection laid out for the
movement of traffic such that no through conflicts are there. Free-left turn is permitted
where as through traffic and right-turn traffic is forced to move around the central island
in a clock-wise direction in an orderly manner. Merging, weaving and diverging operations
reduces the conflicting movements at the rotary.
1. Traffic signals: Control using traffic signal is based on time sharing approach. At a
given time, with the help of appropriate signals, certain traffic movements are restricted
where as certain other movements are permitted to pass through the intersection. Two or
more phases may be provided depending upon the traffic conditions of the intersection.
When the vehicles traversing the intersection is very large, then the control is done with
the help of signals. The phases provided for the signal may be two or more. If more than
two phases are provided, then it is called multi-phase signal.
The signals can operate in several modes. Most common are fixed time signals and vehicle
actuated signals. In fixed time signals, the cycle time, phases and interval of each signal
is fixed. Each cycle of the signal will be exactly like another. But they cannot cater
to the needs of the fluctuating traffic. On the other hand, vehicle actuated signals can
respond to dynamic traffic situations. Vehicle detectors will be placed on the streets
approaching the intersection and the detector will sense the presence of the vehicle and
pass the information to a controller. The controller then sets the cycle time and adjusts
the phase lengths according to the prevailing traffic conditions.
2. Grade separated intersections: The intersections are of two types. They are at-grade
intersections and grade-separated intersections. In at-grade intersections, all roadways
join or cross at the same vertical level. Grade separated intersections allows the traffic to
cross at different vertical levels. Sometimes the topography itself may be helpful in con-
structing such intersections. Otherwise, the initial construction cost required will be very
high. Therefore, they are usually constructed on high speed facilities like expressways,
freeways etc. These type of intersection increases the road capacity because vehicles can
flow with high speed and accident potential is also reduced due to vertical separation of
traffic.
1111111111
0000000000 11111
00000 11111111111
00000000000
00000000000
11111111111
0000000000
1111111111 00000
11111
00000
11111 00000000000
11111111111
0000000000
1111111111 00000
11111 00000000000
11111111111
0000000000
1111111111 00000
11111
111
000
000
111
000
111
000
111
000
111
000
111
000
111
000
111
000
111
000
111
000
111
111111
000000 1111111111
0000000000
1111111111
0000000000 000000
111111
000000
111111 0000000000
1111111111
0000000000
1111111111 000000
111111 0000000000
1111111111
0000000000
1111111111
0000000000
1111111111 000000
111111
000000
111111
111
000
000
111
000
111
000
111
000
111
000
111
000
111
000
111
000
111
000
111
000
111
available in the carriageway. If no channelizing is provided the driver will have less tendency to
reduce the speed while entering the intersection from the carriageway. The presence of traffic
islands, markings etc. forces the driver to reduce the speed and becomes more cautious while
maneuvering the intersection. A channelizing island also serves as a refuge for pedestrians and
makes pedestrian crossing safer. Channelization of traffic through a three-legged intersection
(refer figure 27:2) and a four-legged intersection (refer figure 27:3) is shown in the figure.
27.5 Summary
Traffic intersections are problem spots on any highway, which contribute to a large share of
accidents. For safe operation, these locations should be kept under some level of control de-
pending upon the traffic quantity and behavior. Based on this, intersections and interchanges
are constructed, the different types of which were discussed in the chapter.
27.6 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
Chapter 28
Traffic Signs
28.1 Overview
Traffic control device is the medium used for communicating between traffic engineer and road
users. Unlike other modes of transportation, there is no control on the drivers using the road.
Here traffic control devices comes to the help of the traffic engineer. The major types of
traffic control devices used are- traffic signs, road markings , traffic signals and parking control.
This chapter discusses traffic control signs. Different types of traffic signs are regulatory signs,
warning signs and informatory signs.
28.2 Requirements
The requirements of traffic control devices are listed below:
1. The control device should fulfill a need : Each device must have a specific purpose
for the safe and efficient operation of traffic flow. The superfluous devices should not be
used.
2. It should command attention from the road users: This affects the design of signs.
For commanding attention, proper visibility should be there. Also the sign should be
distinctive and clear. The sign should be placed in such a way that the driver requires no
extra effort to see the sign.
4. Road users must respect the signs: Respect is commanded only when the drivers are
conditioned to expect that all devices carry meaningful and important messages. Overuse,
misuse and confusing messages of devices tends the drivers to ignore them.
5. The control device should provide adequate time for proper response from the
road users: This is again related to the design aspect of traffic control devices. The sign
boards should be placed at a distance such that the driver could see it and gets sufficient
time to respond to the situation. For example, the STOP sign which is always placed
at the stop line of the intersection should be visible for at least one safe stopping sight
distance away from the stop line.
2. Shape : It is the second element discerned by the driver next to the color of the device.
The categories of shapes normally used are circular, triangular, rectangular, and diamond
shape. Two exceptional shapes used in traffic signs are octagonal shape for STOP sign
and use of inverted triangle for GIVE WAY (YIELD) sign. Diamond shape signs are not
generally used in India.
3. Legend : This is the last element of a device that the drive comprehends. This is an
important aspect in the case of traffic signs. For the easy understanding by the driver,
the legend should be short, simple and specific so that it does not divert the attention of
the driver. Symbols are normally used as legends so that even a person unable to read
the language will be able to understand that. There is no need of it in the case of traffic
signals and road markings.
is recommended so that the drivers get accustomed to the different types of markings and
can instantly recognize them.
1. Regulatory signs: These signs require the driver to obey the signs for the safety of
other road users.
2. Warning signs:These signs are for the safety of oneself who is driving and advice the
drivers to obey these signs.
3. Informative signs: These signs provide information to the driver about the facilities
available ahead, and the route and distance to reach the specific destinations
In addition special type of traffic sign namely work zone signs are also available. These type
of signs are used to give warning to the road users when some construction work is going on
the road. They are placed only for short duration and will be removed soon after the work is
over and when the road is brought back to its normal condition. The first three signs will be
discussed in detail below.
1. Right of way series: These include two unique signs that assign the right of way to
the selected approaches of an intersection. They are the STOP sign and GIVE WAY sign
For example, when one minor road and major road meets at an intersection, preference
should be given to the vehicles passing through the major road. Hence the give way sign
board will be placed on the minor road to inform the driver on the minor road that he
should give way for the vehicles on the major road. In case two major roads are meeting,
then the traffic engineer decides based on the traffic on which approach the sign board
has to be placed. Stop sign is another example of regulatory signs that comes in right of
way series which requires the driver to stop the vehicle at the stop line.
2. Speed series: Number of speed signs may be used to limit the speed of the vehicle on
the road. They include typical speed limit signs, truck speed, minimum speed signs etc.
Speed limit signs are placed to limit the speed of the vehicle to a particular speed for
many reasons. Separate truck speed limits are applied on high speed roadways where
heavy commercial vehicles must be limited to slower speeds than passenger cars for safety
reasons. Minimum speed limits are applied on high speed roads like expressways, freeways
etc. where safety is again a predominant reason. Very slow vehicles may present hazard
to themselves and other vehicles also.
3. Movement series: They contain a number of signs that affect specific vehicle maneuvers.
These include turn signs, alignment signs, exclusion signs, one way signs etc. Turn signs
include turn prohibitions and lane use control signs. Lane use signs make use of arrows
to specify the movements which all vehicles in the lane must take. Turn signs are used to
safely accommodate turns in unsignalized intersections.
4. Parking series: They include parking signs which indicate not only parking prohibitions
or restrictions, but also indicate places where parking is permitted, the type of vehicle to
be parked, duration for parking etc.
5. Pedestrian series: They include both legend and symbol signs. These signs are meant
for the safety of pedestrians and include signs indicating pedestrian only roads, pedestrian
crossing sites etc.
6. Miscellaneous: Wide variety of signs that are included in this category are: a ”KEEP
OF MEDIAN” sign, signs indicating road closures, signs restricting vehicles carrying
hazardous cargo or substances, signs indicating vehicle weight limitations etc.
Some examples of the regulatory signs are shown in figure 28:1. They include a stop sign, give
way sign, signs for no entry, sign indicating prohibition for right turn, vehicle width limit sign,
speed limit sign etc.
1
0
0
1
1
0
0
1
2 M
0
1
0
1
50
Figure 28:1: Examples of regulatory signs ( stop sign, give way sign, signs for no entry, sign
indicating prohibition for right turn, vehicle width limit sign, speed limit sign)
111
000
000
111
000
111
000
111
Figure 28:2: Examples of cautionary signs ( right hand curve sign board, signs for narrow road,
sign indicating railway track ahead)
this type of signs is that the legend will be black in color with a white background. The shape
used is upward triangular or diamond shape with red borders. Some of the examples for this
type of signs are given in fig 28:2 and includes right hand curve sign board, signs for narrow
road, sign indicating railway track ahead etc.
Figure 28:3: Examples of informative signs (route markers, destination signs, mile posts, service
center information etc)
are sometimes marked to the right side of the destination. They are, in general, rectangular
with the long dimension in the horizontal direction. They are color coded as white letters with
green background.
Mile posts are provided to inform the driver about the progress along a route to reach his
destination. Service guide signs give information to the driver regarding various services such
as food, fuel, medical assistance etc. They are written with white letters on blue background.
Information on historic, recreational and other cultural area is given on white letters with brown
background. In the figure 28:3 we can see some examples for informative signs which include
route markers, destination signs, mile posts, service center information etc..
28.5 Summary
Traffic signs are means for exercising control on or passing information to the road users. They
may be regulatory, warning, or informative. Among the design aspects of the signs, the size,
shape, color and location matters. Some of the signs along with examples were discussed in this
chapter. A few web sites discussing on traffic signs are given below: www.aptransport.org/html/signs.htm,
www.indiacar.com/infobank/Traffic-signs.htm.
28.6 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
Chapter 29
Road Markings
29.1 Overview
The essential purpose of road markings is to guide and control traffic on a highway. They
supplement the function of traffic signs. The markings serve as a psychological barrier and
signify the delineation of traffic path and its lateral clearance from traffic hazards for the safe
movement of traffic. Hence they are very important to ensure the safe, smooth and harmonious
flow of traffic. Various types of road markings like longitudinal markings, transverse markings,
object markings and special markings to warn the driver about the hazardous locations in the
road etc. will be discussed in detail in this chapter.
29.2 Classification
The road markings are defined as lines, patterns, words or other devices, except signs, set
into applied or attached to the carriageway or kerbs or to objects within or adjacent to the
carriageway, for controlling, warning, guiding and informing the users. The road markings
are classified as longitudinal markings, transverse markings, object markings, word messages,
marking for parking, marking at hazardous locations etc.
150
3m 4.5 m
double solid. Broken lines are permissive in character and allows crossing with discretion, if
traffic situation permits. Solid lines are restrictive in character and does not allow crossing
except for entry or exit from a side road or premises or to avoid a stationary obstruction.
Double solid lines indicate severity in restrictions and should not be crossed except in case
of emergency. There can also be a combination of solid and broken lines. In such a case, a
solid line may be crossed with discretion, if the broken line of the combination is nearer to the
direction of travel. Vehicles from the opposite directions are not permitted to cross the line.
Different types of longitudinal markings are center line, traffic lanes, no passing zone, warning
lines, border or edge lines, bus lane markings, cycle lane markings.
1.5m 3m
3m 4.5 m
Figure 29:2: Center line and lane marking for a four lane road
1.5m 3m
100
100
100 mm
1.5m 3m
150 mm
Figure 29:4: Center barrier line marking for four lane road
100
1.5m 3.0 m
150
Figure 29:5: Lane marking for a four lane road with solid barrier line
1.5m 3.0 m
100
150
3.0 m 4.5 m
Figure 29:6: Traffic lane marking for a four lane road with broken center line
traffic lane lines are normally single broken lines of 100 mm width. Some examples are shown
in figure 29:5 and figure 29:6.
e
in
erl
rri
Ba
300
200
STOP
150
1.2 m
1.2 m
0.55 m
0.5m
3.5m
3.5m
0.4m
1.25m
0.2m
0.4m
0.3m 0.3m
The legends should be as brief as possible and shall not consist of more than three words for
any message. Word messages require more and important time to read and comprehend than
other road markings. Therefore, only few and important ones are usually adopted. Some of
the examples of word messages are STOP, SLOW, SCHOOL, RIGHT TUN ONLY etc. The
character of a road message is also elongated so that driver looking at the road surface at a low
angle can also read them easily. The dimensioning of a typical alphabet is shown in figure 29:14.
29.6.1 Parking
The marking of the parking space limits on urban roads promotes more efficient use of the
parking spaces and tends to prevent encroachment on places like bus stops, fire hydrant zones
etc. where parking is undesirable. Such parking space limitations should be indicated with
markings that are solid white lines 100 mm wide. Words TAXI, CARS, SCOOTERS etc. may
also be written if the parking area is specific for any particular type of vehicle. To indicate
parking restriction, kerb or carriage way marking of continuous yellow line 100 mm wide covering
the top of kerb or carriageway close to it may be used.
260
1250
78
L
L
L
Road markings showing the width transition in the carriageway should be of 100 mm width.
Converging lines shall be 150 mm wide and shall have a taper length of not less than twenty
times the off-set distance. Typical carriageway markings showing transition from wider to
narrower sections and vice-versa is shown in figure 29:15. In the figure, the driver is warned
about the position of the pier through proper road markings.
29.7 Summary
Road markings are aids to control traffic by exercising psychological control over the road
users. They are made use of in delineating the carriage way as well as marking obstructions, to
ensure safe driving. They also assist safe pedestrian crossing. Longitudinal markings which are
provided along the length of the road and its various classifications were discussed. Transverse
markings are provided along the width of the road. Road markings also contain word messages,
but since it is time consuming to understand compared to other markings there are only very few
of them. Markings are also used to warn the driver about the hazardous locations ahead. Thus
road markings ensure smooth flow of traffic providing safety also to the road users. The following
web link give further insight in to the road markings: mutcd.fhwa.dot.gov/pdfs/200311/pdf-
index.htm.
29.8 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
Chapter 30
Uncontrolled Intersection
30.1 Introduction
Uncontrolled intersections are the traffic junctions where there is no explicit traffic control mea-
sures are adopted. The important aspects that will be covered in this chapter are: the concept
of two-way stop controlled intersection, all-way stop controlled intersection, gap acceptance,
critical gap, follow-up time, potential capacity, and delay determination. These concepts are
primarily adopted from Highway Capacity Manual.
ority over the other. The minor road will usually be controlled by some form of sing
marking, such as stop or yield sign; thus ensuring that priority vehicles travailing on the
main street will incur virtually no delay.
2. Space sharing intersection: Are intended to permit fully equally priority and to permit
continuous movement for all intersecting vehicle flows; example would be rotaries and
other weaving areas.
3. Time Sharing Intersection: Are those at which alternative flows are given the right
of way at different point in time. This type of intersection is controlled by traffic signal
or by police officer.
4. Uncontrolled intersection: are the most common type of intersection usually occurs
where the intersecting roads are relatively equal importance and found in areas where
there is not much traffic shown in Fig. 30:1.
At uncontrolled intersection the arrival rate and individuals drivers generally determine the
manner of operation, while the resulting performance characteristics are derived from joint
consideration of flow conditions and driver judgment and behavior patterns. In simplest terms,
an intersection, one flow of traffic seeks gaps in the opposing flow of traffic.
At priority intersections, since one flow is given priority over the right of way it is clear
that the secondary or minor flow is usually the one seeking gaps. By contrast at uncontrolled
intersection, each flow must seek gaps in the other opposing flow. When flows are very light,
which is the case on most urban and rural roads large gaps exist in the flows and thus few
situation arise when vehicles arrive at uncontrolled intersection less than 10 second apart or at
interval close enough to cause conflicts. However when vehicles arrive at uncontrolled intersec-
tion only a few second apart potential conflicts exist and driver must judge their relative time
relationships and adjusts accordingly.
Generally one or both vehicles most adjust their speeds i.e. delayed somewhat with the
closer vehicle most often taking the right of way; in a sense, of course, the earlier arriving
vehicle has priority and in this instance when two vehicles arrive simultaneous, the rule of
the road usually indicate priority for the driver on the right. The possibility of judgmental in
these, informal priority situation for uncontrolled intersection is obvious. At an Uncontrolled
intersection: Service discipline is typically controlled by signs (stop or yield signs) using two
rules two way stop controlled intersection (TWSC) and all way stop controlled intersection
(AWSC).
STOP
STOP
STOP
STOP
At TWSC intersections, the stop-controlled approaches are referred to as the minor street
approaches; the intersection approaches that are not controlled by stop signs are referred to as
the major street approaches. A three-leg intersection is considered to be a standard type of
11
12 10
STOP
16
6 5
5
4 4
13 13 14
1 14
2 2
3 3
15 15
STOP STOP
78 9
7 9
Rank Traffic stream Rank Traffic stream
1 2, 3, 5, 6, 15, 16 1 2, 3, 5, 15
2 1, 4, 13, 14, 9, 12 2 4, 13, 14, 9
3 8, 11 3 7
4 7, 10
Figure 30:3: Traffic flow stream in two way stop controlled intersection
TWSC intersection if the single minor street approach is controlled by a stop sign. Three-leg
intersections where two of the three approaches are controlled by stop signs are a special form
of uncontrolled intersection control.
TWSC intersections assign the right-of-way among conflicting traffic streams according to the
following hierarchy:
1. The major street through and right-turning movements are the highest-priority move-
ments at a TWSC intersection. This movements shown Fig. 30:3 are 2, 3, 5, 6, 15 and
16.
2. Vehicles turning left from the major street onto the minor street yield only to conflicting
major street through and right-turning vehicles. All other conflicting movements yield to
these major street left-turning movements. The movements on this rank are 1, 4, 13, 14,
9 and 12.
3. Minor Street through vehicles yield to all conflicting major street through, right-turning,
and left-turning movements. The movements on this rank are 8 and 11.
4. Minor Street left-turning vehicles yield to all conflicting major street through, right-
turning, and left-turning vehicles and to all conflicting minor street through and right-
turning vehicles. The movements on this rank are 7 and 10.
A
STOP STOP
STOP STOP
AWSC intersections require every vehicle to stop at the intersection before proceeding. Since
each driver must stop, the judgment as to whether to proceed into the intersection is a function
of traffic conditions on the other approaches. If no traffic is present on the other approaches, a
driver can proceed immediately after the stop is made. If there is traffic on one or more of the
other approaches, a driver proceeds only after determining that there are no vehicles currently
in the intersection and that it is the drivers turn to proceed.
2. Gap acceptance: The process by which a minor stream vehicle accepts an available gap
to maneuver.
3. Critical gap: The minimum major-stream headway during which a minor-street vehicle
can make a maneuver.
4. Lag: Time interval between the arrival of a yielding vehicle and the passage of the next
priority stream vehicle (Forward waiting time).
5. Headway: The time interval between the arrivals of two successive vehicles. Headway
differs from gap because it is measured from the front bumper of the front vehicle to the
front bumper of the next vehicle.
6. Minimum Headway: The minimum gap maintained by a vehicle in the major traffic
stream.
7. Follow-up time: Time between the departure of one vehicle from the minor street and
the departure of the next vehicle using the same gap under a condition of continuous
queuing.
10. Capacity: The maximum hourly rate at which persons or vehicles can reasonably be
expected to traverse a point or uniform section of a lane or a roadway during a given time
period under prevailing roadway, traffic, and control conditions.
where, tcx is the critical gap for movement “x”, tcb is the base critical gap from Table. 30:1 tcHV
is the adjustment factor for heavy vehicles PHV is the proportion of heavy vehicles tcG is the
adjustment factor for grade G is the percent grade divided by 100, tcT is the adjustment factor
for each part of a two-stage gap acceptance process, and t3LT is the critical gap adjustment
factor for intersection geometry.
tf x = tf b + tf HV PHV (30.2)
where, tf x is the follow-up time for minor movement x tf b is the base follow-up time from table
1 tf HV is the adjustment factor for heavy vehicles, and PHV is the proportion of heavy vehicles
for minor movement.
Vehicle/Pedestrian Conflicts
Vehicle/Vehicle Conflicts
1. Major street left turns seek gaps through the opposing through movement, the op-
posing right turn movement and pedestrians crossing the far side of the minor street.
2. Minor street right turns seek to merge in to the right most lane of the major street,
which contains through and right turning vehicles. Each right turn from the minor street
must also cross the two pedestrians path shown.
3. Through movements from the minor street must cross all major street vehicular and
pedestrians flows.
4. Minor street left turns must deal not only with all major street traffic flow but with
two pedestrians flows and the opposing minor street through and right turn movements.
5
4
13 14
2
3
15
STOP
7 9
Figure 30:6: Three legged intersection conflicts volume determination for movement 7
Through this movements the conflict volume (Vcx ) for the given movement x is can be computed.
As an example the formula of conflict volume for movement 7 for three legged intersection shown
in Fig. 30:6 computed as:
for movement x (veh/h), tcx is the critical gap for minor movement x, and tf x is the follow-up
time movement x.
where, Cmx is the movement capacity in vph, Cpx is the potential capacity movement x in
vph, Pvi is the probability that impeding vehicular movement i is not blocking the subject
flow; (also referred to as the vehicular impedance factor for movement i, Ppi is the probability
that impeding pedestrian movement j is not blocking the subject flow; also referred to us the
pedestrian impedance factor for the movement j.
where, vi is the demand flow for impeding movement i, and Cmi is the movement capacity for
impeding movement i vph. Pedestrian impedance factors are computed as:
Vj (W/Sp )
Ppj = 1 − (30.7)
3600
where, ppj is the pedestrian impedance factor for impeding pedestrian movement j, vj is the
pedestrian flow rate, impeding movement j in peds/hr, w is the lane width in m, and Sp is the
pedestrian walking speed in m/s.
where, CSH is the shared lane capacity in veh/hr, Vy is the flow rate, movement y sharing lane
with other minor street flow, and Cmy is the movement capacity of movement y sharing lane
with other minor street.
where, dx is the average control delay per vehicle for movement x in s/veh, Cmx is the capacity
of movement or shared lane x in veh/hr, T is the analysis period h (15 min=0.25 h), and Vx is
the demand flow rate, movement or shared lane x in veh/hr.
4
12
75)7)
STOP 400(5)
15(13) 200(2)
7 20(4)
30(3)
30(15) (9)
Pedestrians Movement
9
Vehicle Movement
of the TWSC intersection, LOS of the minor-street left turn operates at level of service C
approaches to B.
Numerical example
For a three legged intersection given in figure 30:7 determine the control delay and level of
service for movement 7. The total volume of both pedestrian and vehicular traffic at each
movement is given in the figure itself. Following data is also given:
Solution:
1. Compute the critical gap and follow up time:
(a) Critical gap tcx = tcb + tcHV P HV + tcG GtcT tLT . From table. 30:1 and table. 30:2 we
have tcb = 7.1 s , tcG = 0.2, tcT = 0.0, tLT = 0.0. Then tcx at movement 7 computed
as: tc7 = 7.1 + 1.0 × 0.1+0.2 × 0.0 - 0.0 - 0.0 = 6.50 sec
(b) To compute the Follow up time: From table. 30:1 and table. 30:2 we have tf b = 3.5
s , tf HV = 0.9. Then tf x at movement 7 computed as: tf x = tf b + tf HV PHV tf 7 =
3.5 + 0.9 × 0.1 = 3.59 sec.
4. Determine the impudence effect of the movement capacity for movement 7: From the
given figure movement 7 is impeded by vehicular movement 4 and 1 and pedestrian 13
and 15.
(c) Once the pedestrian and vehicular impedance is determined, the moment capacity
is computed as:
6. Determine the level of service: From the computed delay (18.213 se) in step 5 the level
of service is LOS C obtained from HCM table.
30.6 Conclusion
This chapter focuses on theoretical analysis of capacity at uncontrolled intersections. First the
gap acceptance theory and follow time was described; including conflict volume determination
through the hierarchy of priorities for two ways stop controlled intersection. Second, after
determining the potential capacity using the computed value and then prepare an adjustment
for this capacity. Finally, computation of the delay to determine the level of service (LOS) of
the given intersection is also described.
30.7 References
1. Highway Capacity Manual. Transportation Research Board. National Research Council,
Washington, D.C., 2000.
3. William R McShane, Roger P Roesss, and Elena S Prassas. Traffic Engineering. Prentice-
Hall, Inc, Upper Saddle River, New Jesery, 1998.
Chapter 31
Channelization
31.1 Introduction
One of the most effective and efficient methods of controlling the traffic on a highway is the
adoption of high intersection geometric design standards. Channelization is an integral part
of at grade intersections and is used to separate turning movements from through movements
where this is considered advisable and hence helps reduce the intensity and frequency of loss
of life and property due to accidents to a large extent. Proper Channelization increases capac-
ity, improves safety, provides maximum convenience, and instils driver confidence. Improper
Channelization has the opposite effect and may be worse than none at all. Over Channelization
should be avoided because it could create confusion and worsen operations.
2. Conflict - It is defined as the demand for the same highway space by two or more users
of the highway. Conflicts are classified into mainly three types:
or
L eg
Min
Angle of Intersection
Major Leg
intersection. Fig. 31:1 shows the angle made between the center lines of the major and
minor legs.
4. Refuge Areas - The area which is used to give refuge to the pedestrians crossing a
street (the open area between two medians) is known as a refuge area.
31.3 Objectives
The use of Channelization is often creative and innovative, providing for vehicle path separation
and distinct and thus in general making traffic flow safer, smoother, simpler and efficient. The
main objectives of Channelization can be summarized as follows:
1. Separation of maneuver areas: The drivers should be presented with only one decision
at a time to reduce confusion and the influence of operations caused due to the overlapping
of maneuver areas.
2. Reduce excessively large paved areas: The spread of the paved area can be consider-
ably reduced by the construction of raised islands and medians where these are considered
safe and necessary.
4
3 6
2
5
5. Control of speed: Channelization is also used for supporting stop or speed regulations
by removing differentials in speed for merging, diverging, weaving and crossing by using
the bending and funneling techniques.
8. Provide space for traffic control devices: To provide space for traffic control devices
when the ideal location for the same is within the intersection area.
Consider for example the T-intersection shown in Figs. 31:2, 31:3, and 31:4. In Fig. 31:2,
the intersection has no special Channelization for helping drivers in avoiding conflicts between
movements. In Fig. 31:3, a passing lane for through vehicles in the eastbound direction and a
westbound right-turn lane has been added, which helps in separating the turning traffic from
the through ones. In Fig. 31:4, the use of lanes is further clarified due to the addition of
channelizing islands.
1
4 6
2 3
5
00
11
11
00
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11 1111
0000
0000
1111 00
11 0000
1111
1111
0000 00
11 0000
1111
0000
1111 00
11 0000
1111
0000 11
1111 00 0000
1111
0000
1111 0000
1111
0000
1111
0000
1111 0000
1111
0000
1111 0000
1111
0000
1111
11111111111111111111
00000000000000000000
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111
1. Reduction of the Area of Conflict: The impact area is decreased when Channelization
is provided, and hence the probability of conflicts is also reduced. The figure below further
clarifies the statement. Fig. 31:5 shows the conflict area in a Y-intersection without
Channelization and Fig. 31:6 shows the reduced conflict area in the same intersection
after providing medians.
2. Merging traffic streams at small angles: Merging at small angles permits the flow
of traffic streams with minimum speed differentials. Hence, the gap acceptance time is
1111111111
0000000000
0000000000000
1111111111111
0000000000000
1111111111111
111111111
000000000
0000000000000
1111111111111
000000000
111111111
0000000000000
1111111111111
000000000
111111111
0000000000000
1111111111111
000000000
111111111
0000000000000
1111111111111
000000000
111111111
11111111
00000000
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
000000000000000000000 11111111
111111111111111111111 00000000
00000000
11111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000
111111111111111111111
000000000000000000000 111111111
111111111111111111111 000000000
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111 A
000000000
111111111
also small in such cases. The merging of roadways should be done as shown below in
Fig. 31:7.
3. Reduction of the speed of incoming traffic by bending its path: The speed
of vehicles entering into the intersection can be reduced by bending the path to the
intersection approach. However as far as possible the path of the major traffic stream
should not be bent. The above technique is shown below in Fig. 31:8.
6m
4m
111111111
000000000
000000000
111111111
3.5m 000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
3.5m 6m
4m
000000000000000000
111111111111111111
111111111111111111
000000000000000000 000000000000000000
111111111111111111
111111111111111111
000000000000000000
000000000000000000
111111111111111111 000000000000000000
111111111111111111
000000000000000000
111111111111111111
000000000000000000
111111111111111111 000000000000000000
111111111111111111
000000000000000000
111111111111111111
000000000000000000
111111111111111111
000000000000000000
111111111111111111 000000000000000000
111111111111111111
000000000000000000
111111111111111111
ONE WAY
11111
00000
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
111111111
000000000
000000000
111111111 1111111111111111
0000000000000000 1111
0000
000000000
111111111
000000000
111111111
000000000
111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111 0000
1111
islands. Fig. 31:11 shows how prohibited turns can be discouraged by proper shaping and
placement of islands.
two opposing lanes and the space on the separator (median) is used either for planting
some trees and/or for providing space for traffic signs etc. Fig. 31:13 shows a typical wide
raised median on a freeway. A median varying between 1.2 m and 30 m in width may
be employed. The higher values of width are adopted on freeways, where sufficient space
is available for the construction of these. In addition, a well-landscaped wide median
will also provide aesthetic benefits to the surrounding neighborhood. A wide median, if
attractively landscaped, is often the most aesthetically pleasing separation method.
4. Flush Channelization
In this type of Channelization, a variety of treatments, including raising them above
the pavement just slightly (2 to 5 cm); the application of pavement markings and other
types of contrasting surfaces etc are possible. These may also be unpaved where they are
0
Flash Median
11’
Travel lane
5’
Bike lane 8.5’
Parking
formed by the pavement edges of existing roadways. In areas where snow plowing may be
necessary, flush islands are the preferred design. Fig. 31:17 below shows how flush islands
can also be used for achieving channelizing objectives. The area seen flushed with the
road surface in Fig. 31:17 is the flush island.
11111
00000
00000
11111 111
000
00000
11111 000
111
00000
11111
00000
11111 000
111
00000
11111 000
111
00000
11111 000
111
000
111
00
11
11
00
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
11111111111111111111
00000000000000000000
00000000000000000000
11111111111111111111 1111111111
0000000000
0000000000
1111111111
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111 0000000000
1111111111
00000000000000000000
11111111111111111111 0000000000
1111111111
0000000000
1111111111
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111 0000000000
1111111111
1. Channelizing Islands - These are designed to control and direct traffic movement,
usually turning. Channelizing islands are are shown in Fig. 31:18.
2. Divisional Islands - These are designed to divide opposing or same direction traffic
streams, usually through movements. Fig. 31:19 shows the placing of divisional islands
in a roadway.
3. Refuge islands - Pedestrian islands are provided to serve as safety zones for the aid
and protection of persons on foot. If a divisional island is located in an urban area where
pedestrians are present, portions of each island can be considered a refuge island. Refuge
islands are shown below I Fig. 31:20. The design aspects of the traffic islands are dealt
in detail in the following sections.
2. Determination of shape and size of islands: The shape of the island and its size
in an intersection depends on the geometry and space availability at the same. A proper
shape and size of the island (in case of raised islands) must be selected so that it is able
to both channelized the traffic and not pose any type of hazard.
3. Location relative to adjacent traffic lanes: The islands must be offset from the
roadway by some distance to remove the risk of a vehicle dashing against the same. The
width of offset is maximum at the entry of the island and decreases gradually as one
moves towards the end of it.
3. Maintenance needs
The raised islands and flush Channelization are dealt with in details in the following sections.
Flush Channelization
2. In constrained locations, i.e. the locations where vehicle path definition is desired but
space for raised islands not available.
4. In areas where frequent removal of snowfall is required, i.e. in places of high snow fall.
Raised Islands
The locations where the construction of raised islands assumes importance are:
2. Also, the primary/secondary function is locating traffic signals or other fixed objects.
5. The raised islands are also particularly important at intersections with unusual geometry
i.e. skewed intersections.
A comparison between the usefulness and the operating conditions of the two types of Chan-
nelization is presented in Table. 31:1.
1. Shape and size: Islands are generally either narrow and elongated or triangular in
shape, are normally situated in areas of the roadway outside the planned vehicle paths,
and are shaped and dimensioned as component parts of the street or intersection layout.
The actual size differs as governed by site conditions, but the following minimum size
requirements should be met to insure that the island will be large enough to command
attention.
2. Traffic lanes or turning roadways should appear natural and convenient to their intended
users.
4. The islands should be large enough to be effective. Small islands do not serve as chan-
nelizing devices and pose maintenance problems.
Oe Of
R3
Direction of
Direction of Traffic
Traffic
Oa
Od R1
R2
Ob
Oe
Direction of Traffic
5. These should not be introduced at locations with restricted sight distance or middle of
sharp horizontal curves due to sight distance considerations.
Table. 31:2 gives the recommended minimum and desired area values of the traffic islands in
typical urban and rural intersections.
31.6.5 Guidelines for providing offset to the traffic islands from the
road edge
The orientation of islands near intersections is dictated by the alignment of the intersecting
roadways and their associated travel paths. Proper island design must minimize the potential
for vehicle impacts and reduce their severity. This is most often accomplished by offsetting the
approach ends of islands from the edge of travel lane them, tapering them inward. Another
technique that is the use of rounded approach noses that may also be sloped downward on
their approach ends. The general design dimensions of corner islands for roadways in shown
in Fig. 31:21. Another design consideration for islands is their surface finishing. Islands may
be paved or landscaped. Though paved islands are easier to maintain, yet they are typically
not as aesthetically pleasing. The use of colors that have contrast with the pavement surface is
Single
Radius
Figure 31:22: Various types of curves used for a turning roadway , (a)Simple Radius
desirable because they allow the island to be more clearly seen by drivers. Normally concrete
islands are paired with asphalt roadways and vice versa. Brick paver are also used in areas
where aesthetics are important. Other concerns include the need to provide adequate slope to
the surface of the island to facilitate drainage and to keep the island free of sight obstructions
and collision. Thus, all landscaping features should be kept below the clear vision envelop and
should not incorporate other fixed hazards.
The combination of a simple radius flanked by tapers can often fit the pavement edge more
closely to the design motor vehicle than a simple radius (with no tapers). Figs. 31:22, 31:23
and 31:24 shows the various types of curves that can be used for a roadway. The closer fit
can be important for large design motor vehicles where effective pavement width is small (due
either to narrow pavement or need to avoid any encroachment), or where turning speeds greater
than the design speed are desired. Table. 31:3 and Table. 31:4 summarizes design elements
for curve/taper combinations that permit various design motor vehicles to turn, without any
encroachment, from a single approach lane into a single departure lane (Note: W should be
Offset
Taper
Single
Radius
Taper
Figure 31:23: Various types of curves used for a turning roadway, (b)Radius and Taper
Island
Larger
Radius
Smaller
Radius
Larger
Radius
Figure 31:24: Various types of curves used for a turning roadway, (c)Turning Roadway
determined using the turning path of the design vehicle) The width of the roadway can be
found out from Table. 31:5 given below.
1. The approach noses should be offset 0.6 to 1.8 m from through lanes to minimize accidental
impacts.
2. Shape should be based on design turning paths and island function. (Generally parabolic
or circular arcs are used)
3. The length of median before the intersection is related to approach speed (normally 3 sec
driving time to intersection). It is also affected by available widths, taper designs and
local constraints.
4. The width of the medians should serve its primary intended function.
5. The median should always be provided well past crest vertical curves.
Fig. 31:25 shows the general design elements of medians provided just at the approach to a
intersection. The required median widths for performing their intended functions are provided
Table 31:5: Width of roadway required for negotiating the turn for different classes of vehicles
(W)
Radius on One-Lane One Way One-Lane One Way Two way operation
inner edge Operation (No Operation (Having Either One way or Two
of provision of passing a provision of passing a way (Same Type of vehicle
pavement stalled vehicle) in meter stalled vehicle) in meter in both lanes) in meter
in meter P SU WB-50 P SU WB-50 P SU WB-50
15 3.9 5.4 7.8 6 8.7 13.2 7.8 10.5 15
22.5 3.9 5.1 6.6 5.7 8.1 10.8 7.5 9.9 12.6
30 3.9 4.8 6.3 5.7 7.5 10.2 7.5 9.3 12
45 3.6 4.8 5.7 5.4 7.2 8.7 7.2 9 10.5
60 3.6 4.8 5.1 5.4 6.9 8.1 7.2 8.7 9.9
90 3.6 4.5 5.1 5.4 6.6 7.5 7.2 8.4 9.3
by AASHTO and are shown in Table. 31:6 below. These widths are empirical and can be
applied at an intersection with reasonable efficiency.
Departure Taper
Bay
Approach Taper
Taper
Storage
Deceleration Length
Length
lane shoulders can be reduced to 0.6 m wide on rural sections and 0 m wide on sections with
curb and gutter. The length of auxiliary lanes consists of five components:
1. Approach Taper
2. Deceleration Length
3. Bay Taper
5. Departure Taper.
A typical auxiliary lane with the components are shown in Fig. 31:26 below. These are discussed
in detail in the following section.
1. Approach Taper- The length of the approach taper varies with operating speeds. Guide-
lines for determining lengths are: (i) For speeds 70 kmph and over: L = 0.6W S, and (ii)
For speeds under 70 kmph: L = W S 2 /100 where, L is the length of entering taper in m,
W is the width to be tapered in m, and S is the operating Speed in kmph.
2. Deceleration Length- The deceleration length is that required for a comfortable stop
of a vehicle from a speed that is typical of the average running speed on the facility.
The Bay Taper can be considered part of the deceleration length. AASHTO has again
given a table for calculating the decelerating length value from the design speed value
(Table. 31:7).
3. Bay Taper - This is a straight line taper with ratios varying from 5:1 to 10:1. Higher
speed facilities should generally have longer tapers. Empirically, the minimum and max-
imum values of bay taper are taken as 18m and 36m respectively.
4. Storage Length - The storage length should be sufficiently long to store the number of
vehicles likely to accumulate during the average daily peak period.
5. Departure Taper - The departure taper is normally taken equal in length to that of
the approach taper and should begin opposite the beginning of the Bay Taper.
Lane
R1
−M
(Normal)
l
ro
nt
Co
R
Lane
Lane
b
R1
M
R1
R2
R1
R2
R1
Co
ntr
R ol
Lane
intersection L
Bay Taper
Bay Taper
are illustrated in Figs. 31:27 and 31:28. The designer should evaluate each intersection to
determine the best median opening shape that will accommodate the design vehicle.
2. In the next step several island configurations are considered and compared. Then a choice
is made between curbed, raised islands and flush Channelization or pavement markings.
3. Next it must be checked that the design is compatible to handle turning movements of
large vehicles. Also, it should be such that the vehicles are guided in normal wheel paths,
so that the island does not create an obstruction in the roadway.
4. Signing and marking are redesigned to guide drivers and avoid confusion.
5. The final plan includes details of civil and electrical engineering features (like drainage
facilities, curbs, lighting, signals etc.) required for the project completion.
f
111111111
000000000
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
e
1111111111111111111
0000000000000000000
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000000000000000
1111111111111111111111111111111 11111111
00000000
1111111111111111111111111111111
0000000000000000000000000000000 00000000
11111111
0000000000000000000000000000000
1111111111111111111111111111111 00000000
11111111
111111111
000000000
000000000
111111111
000000000
111111111
d
000000000
111111111
NOT RECOMMENDED WITHOUT
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111 SIGNAL CONTROL
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111
O c
1
0
0
1
0
1
0
1
0
1
0
1
0
1
0
1
j
111111111
000000000
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
000000000000
111111111111
000000000
111111111
g
000000000000
111111111111 111111111111111
000000000000000
111111111111
000000000000
000000000000
111111111111 000000000000000
111111111111111
000000000000
111111111111 000000000000000
111111111111111
000000000000000
111111111111111 h
−D−
11111111111111111
00000000000000000
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000
11111
00000000000000000
11111111111111111
00000
11111
00000000000000000
11111111111111111
00000
11111
00000000000000000
11111111111111111
00000
11111
00000000000000000
11111111111111111
00000
11111
00000000000000000
11111111111111111
00000000000000
11111111111111 00000
11111
00000000000000000
11111111111111111
00000000000000
11111111111111 00000
11111
00000000000000000
11111111111111111
00000
11111
c
00000000000000
11111111111111
o 11111111111111 00000 b
11111
00000000000000
11111111111111
00000000000000 00000
11111
00000000000000
11111111111111 00000
11111
0000000000000000000
1111111111111111111
00000000000000
11111111111111 00000
11111
0000000000000000000
1111111111111111111
00000000000000
11111111111111 00000
11111
0000000000000000000
1111111111111111111
00000
11111
00000000000000
11111111111111
0000000000000000000
1111111111111111111
00000000000000
11111111111111 00000
11111
0000000000000000000
1111111111111111111
00000000000000
11111111111111 00000
11111
0000000000000000000
1111111111111111111
00000
11111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
0000000000000000000
1111111111111111111
1111
0000
0000
1111
0000
1111
11111111
00000000 0000
1111
00000000
11111111 0000
1111
00000000
11111111 0000
1111
00000000
11111111
00000000
11111111 0000
1111
00000000
11111111 0000
1111
00000000
11111111 0000
1111
00000000
11111111 0000
1111
00000000
11111111 0000
1111
0000
1111
0000
1111
11111
00000
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
11111111
00000000
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
111111
000000
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000000000111111
111111111111
000000000000
111111111111 000000
000000
111111
000000
111111
000000
111111
000000000000111111
111111111111 000000
000000
111111
000000000000111111
111111111111 000000
000000000000 111111
111111111111 000000
000000000000 111111
111111111111 000000
000000
111111
000000000000
111111111111 000000
111111
000000000000 111111
111111111111
000000000000 000000
111111111111
000000000000 111111
111111111111 000000
000000000000 111111
111111111111 000000
000000
111111
000000000000
111111111111
000000000000
111111111111 000000
111111
000
111
000000000000
111111111111 000000
111111
000
111
000000000000
111111111111 000000
111111
000
111
000000000000
111111111111 000000
111111
000
111
000000000000
111111111111 000000
111111
000
111
000000000000
111111111111d 000000
111111
000000
111111
000
111
000000000000
111111111111 000000
111111
000
111
000000000000
111111111111 000000
111111
000
111
0000000000000000
11111111111111110000000000000
1111111111111
0000000000000000
11111111111111110000000000000
1111111111111
0000000000000000
11111111111111110000000000000
1111111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111 000000000
111111111
0000000000000
1111111111111
000000000
111111111
0000000000000
1111111111111
00000000000000001111111111111
1111111111111111
0000000000000000
1111111111111111 000000000
111111111
0000000000000
000000000
111111111
0000000000000
1111111111111
000000000
111111111
0000000000000
1111111111111
000000000
111111111
0000000000000
1111111111111
000000000
111111111
0000000000000
1111111111111
000000000
111111111
11111
00000
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111g
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
0000
1111
00000
11111
0000
1111
00000
11111
0000
1111
00000
11111
0000
1111
00000
11111
0000
1111
00000
11111
000000
111111 0000
1111
00000
11111
0000
1111
11111100000
11111
00000011111
0000
1111
000000
11111100000
0000
1111
00000
11111
00000011111
111111 0000
1111
00000
000000
111111
000000
111111 0000
1111
e 000000000000000000000000000
111111111111111111111111111
000000
111111
000000000000000000000000000
111111111111111111111111111 0000
1111
000000000000000000000000000 1111
111111111111111111111111111 0000
000000000000000000000000000
111111111111111111111111111
000000000000000000000000000
111111111111111111111111111 h
000000000000000000000000000
111111111111111111111111111
000000000000000000000000000
111111111111111111111111111 00000000
11111111
00000000
11111111
00000000
11111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111
0000000000000000
1111111111111111
00
11
11
00
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
0000
1111 00
11
0000
1111 00
11
00
11
0000
1111
0000
1111
00000000000000000000000000000000000
11111111111111111111111111111111111
0000
1111
11111111111111111111111111111111111
00000000000000000000000000000000000
00000000000000000000000000000000000
11111111111111111111111111111111111
00000000000000000000000000000000000
11111111111111111111111111111111111
00000000000000000000000000000000000
11111111111111111111111111111111111
00000000000000000000000000000000000
11111111111111111111111111111111111
00000000000000000000000000000000000
11111111111111111111111111111111111 11111111
00000000
00000000
11111111
00000000000000000000000000000000000
11111111111111111111111111111111111
00000000000000000000000000000000000
11111111111111111111111111111111111 00000000
11111111
00000000
11111111
00000000
11111111
0000000000000
1111111111111 00000000
11111111
0000000000000
1111111111111
0000000000000
1111111111111 00000000
11111111
00000000
11111111
111111
000000
000000
111111 00000000000000000
11111111111111111
000000
111111 00000000000000000
11111111111111111 11111111111111111
00000000000000000
000000
111111 00000000000000000
11111111111111111
00000000000000000
11111111111111111 00000000000000000
11111111111111111
00
11 000000000000000000
111111111111111111
111111111111111
000000000000000 00000000000000000
11111111111111111
00
11
00 1
11 0 000000000000000000
111111111111111111
000000000000000
111111111111111
00
11 1
0 000000000000000000
111111111111111111
000000000000000
111111111111111
00 1
11 0 000000000000000000
111111111111111111
000000000000000
111111111111111
000000000000000000
111111111111111111
0
1 000000000000000
111111111111111
000000000000000000
111111111111111111
000000000000000
111111111111111
0
1
0
1 000000000000000000
111111111111111111
000000000000000
111111111111111
0
1 000000000000000000
111111111111111111
000000000000000
111111111111111
0
1 000000000000000000
111111111111111111
000000000000000
111111111111111
000000000000000000
111111111111111111
0
1 000000000000000
111111111111111
000000000000000000
111111111111111111
000000000000000
111111111111111
0
1
0
1 000000000000000000
111111111111111111
000000000000000
111111111111111
0
1 000000000000000000
111111111111111111
000000000000000
111111111111111
0
1 000000000000000000
111111111111111111
000000000000000
111111111111111
000000000000000000
111111111111111111
0
1 000000000000000
111111111111111
000000000000000000
111111111111111111
000000000000000
111111111111111
0
1
0
1 000000000000000000
111111111111111111
000000000000000
111111111111111
0
1 000000000000000000
111111111111111111
000000000000000
111111111111111
0
1 000000000000000000
111111111111111111
000000000000000
111111111111111
000000000000000000
111111111111111111
0
1 000000000000000
111111111111111
000000000000000000
111111111111111111
000000000000000
111111111111111
0
1
0
1 000000000000000000
111111111111111111
0
1 000000000000000000
111111111111111111
0
1 000000000000000000
111111111111111111
000000000000000000
111111111111111111
0
1
1
0
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
00000000000
11111111111
11111111111
00000000000
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000
11111
00000
11111 000000
111111
000000
111111 111111
000000
00000
11111 000000
111111 000000 00000000000000000000
111111 11111111111111111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
0000000000
1111111111
1111111111
0000000000
0000000000
1111111111
0000000000
1111111111
0000000000
1111111111
0000000000
1111111111
0000000000
1111111111
0000000000
1111111111
0000000000
1111111111
0000000000
1111111111
0000000000
1111111111
0000000000
1111111111
0000000000
1111111111
00
11 0000000000
1111111111
00000000000000000
11111111111111111
00
11
00000000000000000
11111111111111111
00
11
00000000000000000
11111111111111111
00
11
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00
11
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00
11
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00
11
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
1111111111
0000000000 00000000000000000
11111111111111111
00000000000000000
11111111111111111
0000000000
1111111111 00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00000000000000000
11111111111111111
00
11
00
11
00
11
00
11
00
11
L
B A
Single Rear
Wheel for
P Vehicle
F_A
wb_2 wb_1
Double Rear Axle WB
Single Rear Axle WB R_1 U
Table 31:11: Design vehicle Dimensions and Turning Properties for 90o turns
Vehicle WB Minimum Turn
Designation L(m) (m) A(m) B(m) W(m) U(m) U** (m) FA RT
(m) (m) (m)
BUS 12.1 7.5 2 2.5 2.6 2.6 4.98 1.25 13
Passenger Car (P) 5.8 3.4 0.9 15 2.1 1.8 2.61 0.6 7.5
first two and 5.5 to 30 meters for the last type of vehicles which are outside the scope of this
discussion. The list of templates for bus and passenger cars is shown in the Table. 31:12. The
templates for the Passenger Car (P) and Bus are as shown in Fig. 31:43, 31:44 below.
30 o
60
1.8’
Passenger Car("P")
90o
120 o
150
o
180o
Figure 31:43: Design Template for Passenger Car (P)
Numerical example 1
Provide Channelization for an intersection having EW as the major road. The major and minor
roads intersect at right angles. The design vehicle is WB-50 (R=25m) and design speed is 45
kmph. The intersection is unsignalized. EW road has 2 lanes in each direction and NS has
1 lane for each direction. Take lane width =3.6 m. Provide bullet nose median ends. Also
provide channelizing island for free right for WS bound traffic.
Solution : The approach taper for auxiliary lane is equal to 3.6 × 45 × 45/100 = 73 m. The
deceleration Taper is taken as 40 m. Considering a 1:10 taper, the Bay Taper is found out
to be 18 m. Let the storage length = 30 m (say). Now from Table. 31:9, it is found that for
bullet nose median end, Median Opening = 30 m. The dimensions of all the components of
the auxiliary lane are shown in Fig. 31:45. The width required for the WB- 50 semi-trailer
unit is found to be about 6.5 m. Additional 0.5 m is provided on the outer side and 0.3 m is
provided on the inner side away from the edge of the island. For the turning roadway for the
W-S direction, the single offset method is used. At 0.3 + 0.5 + 6.5 = 7.3 m from the island
edge, a circle of radius 25 m is laid out. Then two tapers of slope 1:15 is laid out on either side
of the arc to join with the straight edge on either side. Thus the Channelization is provided for
the W-S approach. Similar method can be used for designing the Channelization schemes of
the other directions as well. The Channelization for the W-S approach is shown in Fig. 31:46.
30 o
o
Bus 60
90o
120 o
150
o
180o
73 m
18 m 30 m
73 m
40 m
Figure 31:45: Dimensions of components of the auxiliary lane for the intersection
73 m
1:15
R=25m
1:15
Figure 31:46: Channelization for the W-S direction with traffic island
WYE INTERSECTION
Numerical example 2
Following the principles of Channelization suggest suitable island schemes for the following
intersections (considering both high relative speed and low relative speed) (Figs. 31:47, 31:48)
Solution
31.11 Summary
This chapter presents one of the simple and cost effective way of intersection control, namely
the Channelization. This is normally adopted for low and medium volume roads. The chapter
contains the design principles, traffic islands, and median.
31.12 References
1. Transportation research board channelization-the design of highway intersections at grade,
1962.
11111111
00000000 000000000
111111111
000000000
111111111
00000000
11111111 000000000
111111111
00000000
11111111
00000000
11111111 000000000
111111111
00000000
11111111 000000000
111111111
000000000
111111111
00000000
11111111
00000000
11111111 000000000
111111111
00000000
11111111 000000000
111111111
000000000
111111111
00000000
11111111
00000000
11111111 000000000
111111111
00000000
11111111 000000
111111000000000
111111111
000000000
111111111
00000000
11111111 111111
000000
00000000 111111
11111111 000000000
111111111
00000000 000000
11111111 000000
111111000000000
111111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
000000
111111
0000
1111
1111
0000
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
111111111
000000000
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
000000000
111111111
000000000
111111111
000000000
111111111 000000000
111111111
00111111111
000000000 11
111111111
000000000
000000000
111111111 00111111111
11000000000
000000000
111111111
111111111 00
11
000000000 11
00000000000
111111111
000000000 11
111111111
000000000
111111111 00000000000
111111111
00111111111
000000000 11
111111111
000000000
00111111111
11000000000
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
00
11
111111111
000000000 11111111
00000000
000000000
111111111
000000000
111111111 00000000
11111111
000000000
111111111 00000000
11111111
000000000
111111111 00000000
11111111
00000000
11111111
000000000
111111111 00000000
11111111
000000000
111111111
000000000
111111111 00000000
11111111
000000000
111111111 00000000
11111111
000000000
111111111 00000000
11111111
00000000
11111111
000000000
111111111 00000000
11111111
000000000
111111111 00000000
11111111
1111
0000
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
MA
JO
00000000000
11111111111
00000000000
11111111111
11111111
00000000 00000000000
11111111111
00000000000
11111111111
R
00000000
11111111
00000000
11111111 00000000000
11111111111
00000000
11111111 00000000000
11111111111
00000000000
11111111111
00000000
11111111
00000000
11111111 00000000000
11111111111
00000000
11111111 00000000000
11111111111
00000000
11111111 00000000000
11111111111
11111111 00000000000
11111111111
00000000 11111
00000000000
11111111111
00000000
11111111 00000
00000000000
11111111111
00000000 11111
11111111 00000
00000000000
11111111111
00000
11111
00000000
11111111
11111111 00000000000
11111111111
00000000 11111
00000
11111111 00000000000
11111111111
00000000 11111
00000
00000000000
11111111111
00000000
11111111
00000000
11111111 00000000000
11111111111
00000000
11111111 00000000000
11111111111
00000000000
11111111111
00000000
11111111 00000000000
11111111111
00000000
11111111 00000000000
11111111111
00000000000
11111111111
0000000
1111111
00000000000
11111111111
0000000
1111111
00000000000
11111111111
0000000
1111111
00000000000
11111111111
0000000
1111111
00000000000
11111111111
0000000
1111111
00000000000
11111111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000000000
1111111111111
0000000
1111111
0000000000000
1111111111111
0000000
1111111
0000000000000
1111111111111
0000000
1111111
0000000000000
1111111111111
0000000
1111111
0000000000000
1111111111111
0000000000000
1111111111111 00000000
11111111
0000000000000
1111111111111 00000000
11111111
0000000000000
1111111111111
0000000000000
1111111111111 00000000
11111111
0000000000000
1111111111111 00000000
11111111
00000000
11111111
0000000000000
1111111111111
00000
11111
0000000000000
1111111111111 00000000
11111111
00000
11111
0000000000000
1111111111111 00000000
11111111
00000
11111
0000000000000
1111111111111 00000000
11111111
0000011111111
1111100000000
0000000000000
1111111111111
0000011111111
1111100000000
11111111
0000000000000
1111111111111
0000000000000
1111111111111 00000000
0000000000000
1111111111111 00000000
11111111
0000000000000
1111111111111 00000000
11111111
0000000000000
1111111111111 00000000
11111111
00000000
11111111
0000000000000
1111111111111 00000000
11111111
FL
0000000000000
1111111111111 00000000
11111111
0000000000000
1111111111111 00000000
11111111
0000000000000
1111111111111
OW
0000000000000
1111111111111
0000000000000
1111111111111
0000000000000
1111111111111
0000000000000
1111111111111
0000000000000
1111111111111
111111
000000 000000
111111
000000
111111
000000
111111 000000
111111
000000
111111 000000
111111
000000
111111 000000
111111
000000
111111 000000
111111
000000
111111
000000
111111 000000
111111
000000
111111
000000
111111 000000
111111
000000
111111 000000
111111
000000
111111 000000
111111
000000
111111
000000
111111
000000
1111110000000111111
0000001111111
000000
1111110000000111111
1111111
0000000
1111111
000000
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000000
1111111
0000001111111
111111000000011111
00000
000000
111111
000000
111111 00000
11111
00000
11111
000000
111111 00000
11111
000000
111111
000000
111111 00000
11111
00000
11111
000000
111111
000000
111111 00000
11111
00000
11111
000000
111111 00000
11111
000000
111111
000000
111111 00000
11111
00000
11111
000000
111111
000000
111111 00000
11111
00000
11111
W
O
FL
11111111
00000000
00000000
11111111
00000000
11111111
00000000
11111111
00000000
11111111
0000000
1111111 00000000
11111111
0000000
1111111
0000000
1111111 00000000
11111111
0000000
1111111 00000000
11111111
0000000
1111111 00000000
11111111
0000 11111111
1111
0000000 1111
1111111 00000000
00000000
11111111
0000000
1111111 0000
0000 11111111
00000000
0000000 1111
1111111 0000 11111111
00000000
0000000 1111
1111111 00000000
11111111
0000000
1111111
0000000
1111111 00000000
11111111
0000000
1111111 00000000
11111111
0000000
1111111
0000000000
1111111111
0000000
1111111
0
1 0000000000
1111111111
0000000
1111111
0
1 0000000000
1111111111
0000000
1111111
0 1111111111
1 0000000000
0000000
1111111
0
1
0 1111111111
0000000000
0000000
1111111
1 0000000000 0
1111111111
0000000
1111111
0
1 0000000000 1
0 1111111111
1 0
1
0 1111111111
1 0000000000
0000000000 1
1111111111 0
1
0
0
1
0 1111111111
1 0000000000 0
1
0000000000
1111111111
0 1111111111
1 0
1
0000000
1111111
0000000000 0
1
0000000
1111111
0000000000
1111111111 0
0000000
1111111
0000000000
1111111111 1
0000000
1111111
0000000000
1111111111 0
1
0
1
0000000
1111111
0000000000
1111111111 0
1
0000000
1111111
0000000000
1111111111
0000000
1111111
00000000
11111111 0000000
1111111
00000000
11111111
00000000
11111111 0000000
1111111
00000000
11111111 0000000
1111111
00000000 1111
11111111 00000000000
1111111
00000000 1111
11111111 0000
0000
11110000000
1111111
0000000
1111111
00000000
11111111
00000000
11111111 0000
11110000000
1111111
00000000
11111111 0000000
1111111
0000000
1111111
00000000
11111111 0000000
1111111
00000000
11111111 0000000
1111111
00000000
11111111
00000000
11111111 0000000
1111111
00000000
11111111
00000000
11111111
00000000
11111111
R
JO
A
M
3. 2011.
4. Channelization, 2011.
8. Streetsblog, 2011.
12. S K Khanna C E G Justo. Highway Engineering. Nem Chand and Bros, Roorkee, 2001.
16. S Wolfgang, Homburger, and James H Kell. Fundamentals of Traffic Engineering 12th
Edition. San Francisco, 1997.
Chapter 32
Traffic Rotaries
32.1 Overview
Rotary intersections or round abouts are special form of at-grade intersections laid out for the
movement of traffic in one direction around a central traffic island. Essentially all the major
conflicts at an intersection namely the collision between through and right-turn movements are
converted into milder conflicts namely merging and diverging. The vehicles entering the rotary
are gently forced to move in a clockwise direction in orderly fashion. They then weave out of
the rotary to the desired direction. The benefits, design principles, capacity of rotary etc. will
be discussed in this chapter.
32.2 General
32.2.1 Advantages and disadvantages
The key advantages of a rotary intersection are listed below:
1. Traffic flow is regulated to only one direction of movement, thus eliminating severe con-
flicts between crossing movements.
2. All the vehicles entering the rotary are gently forced to reduce the speed and continue to
move at slower speed. Thus, none of the vehicles need to be stopped,unlike in a signalized
intersection.
3. Because of lower speed of negotiation and elimination of severe conflicts, accidents and
their severity are much less in rotaries.
4. Rotaries are self governing and do not need practically any control by police or traffic
signals.
5. They are ideally suited for moderate traffic, especially with irregular geometry, or inter-
sections with more than three or four approaches.
Although rotaries offer some distinct advantages, there are few specific limitations for rotaries
which are listed below.
1. All the vehicles are forced to slow down and negotiate the intersection. Therefore, the
cumulative delay will be much higher than channelized intersection.
2. Even when there is relatively low traffic, the vehicles are forced to reduce their speed.
3. Rotaries require large area of relatively flat land making them costly at urban areas.
4. The vehicles do not usually stop at a rotary. They accelerate and exit the rotary at
relatively high speed. Therefore, they are not suitable when there is high pedestrian
movements.
1. Rotaries are suitable when the traffic entering from all the four approaches are relatively
equal.
2. A total volume of about 3000 vehicles per hour can be considered as the upper limiting
case and a volume of 500 vehicles per hour is the lower limit.
3. A rotary is very beneficial when the proportion of the right-turn traffic is very high;
typically if it is more than 30 percent.
4. Rotaries are suitable when there are more than four approaches or if there is no separate
lanes available for right-turn traffic. Rotaries are ideally suited if the intersection geometry
is complex.
1111
0000
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
0000
1111
111111111111111
000000000000000
000000000000000
111111111111111
000000000000000
111111111111111
000000000000000
111111111111111
000000000000000
111111111111111
11111111
00000000 000000000000000
111111111111111 11111111
00000000
00000000
11111111
00000000
11111111 000000000000000
111111111111111 00000000
11111111
00000000
11111111 000000000000000
111111111111111 00000000
11111111
00000000
11111111 000000000000000
111111111111111
000000000000000
111111111111111 00000000
11111111
000000000000000
111111111111111 00000000
11111111
000000000000000
111111111111111
000000000000000
111111111111111
000000000000000
111111111111111
000000000000000
111111111111111
11111
00000
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
00000
11111
1. Diverging: It is a traffic operation when the vehicles moving in one direction is separated
into different streams according to their destinations.
3. Weaving: Weaving is the combined movement of both merging and diverging movements
in the same direction.
These movements are shown in figure 32:1. It can be observed that movements from each
direction split into three; left, straight, and right turn.
th
the central
ng
island Rentry = 20 − 25m
le
entry
g
weaving Rexit = Rentry × 1.5to2
n
radius
vi
width
ea
circulation RCentralIsland = Rentry × 1.3
w
entry width
width
huge cost of construction. The normal practice is to keep the design speed as 30 and 40 kmph
for urban and rural areas respectively.
b c
c b
a a
is given as,
e1 + e2
wweaving = + 3.5m (32.1)
2
where e1 is the width of the carriageway at the entry and e2 is the carriageway width at exit.
Weaving length determines how smoothly the traffic can merge and diverge. It is decided
based on many factors such as weaving width, proportion of weaving traffic to the non-weaving
traffic etc. This can be best achieved by making the ratio of weaving length to the weaving
width very high. A ratio of 4 is the minimum value suggested by IRC. Very large weaving
length is also dangerous, as it may encourage over-speeding.
32.4 Capacity
The capacity of rotary is determined by the capacity of each weaving section. Transportation
road research lab (TRL) proposed the following empirical formula to find the capacity of the
weaving section.
280w[1 + we ][1 − 3p ]
Qw = (32.2)
1 + wl
where e is the average entry and exit width, i.e, (e1 +e
2
2)
, w is the weaving width, l is the length
of weaving, and p is the proportion of weaving traffic to the non-weaving traffic. Figure 32:3
shows four types of movements at a weaving section, a and d are the non-weaving traffic and b
and c are the weaving traffic. Therefore,
b+c
p= (32.3)
a+b+c+d
This capacity formula is valid only if the following conditions are satisfied.
1433
1140
2. The ratio of average width of the carriage way at entry and exit to the weaving width is
in the range of 0.4 to 1.
3. The ratio of weaving width to weaving length of the roundabout is in between 0.12 and
0.4.
4. The proportion of weaving traffic to non-weaving traffic in the rotary is in the range of
0.4 and 1.
Numerical example
The width of a carriage way approaching an intersection is given as 15 m. The entry and exit
width at the rotary is 10 m. The traffic approaching the intersection from the four sides is
shown in the figure 32:4 below. Find the capacity of the rotary using the given data.
Solution
• The traffic from the four approaches negotiating through the roundabout is illustrated in
figure 32:5.
600 650
400 + + 408
350 375
505 505
+ +
510 370 510 370
W E
600 375
500 +375 500 +600
350 510
+ +
650 250
420 370
• The proportion of weaving traffic to the non-weaving traffic in all the four approaches is
found out first.
• The weaving traffic movements in the East-South direction is shown in figure 32:6. Then
using equation,
510+650+500+600
pES = 510+650+500+600+250+375 = 2260
2885
=0.783
505+510+350+600 1965
pW N = 505+510+350+600+400+370 = 2735 =0.718
650+375+505+370 1900
pN E = 650+375+505+370+510+408 = 2818 =0.674
350+370+500+375 1595
pSW = 350+370+500+375+420+600 = 2615 =0.6099
• Thus the proportion of weaving traffic to non-weaving traffic is highest in the East-South
direction.
• Therefore, the capacity of the rotary will be capacity of this weaving section. From
equation,
10
280 × 13.5[1 + 13.5 ][1 − 0.783
3
]
QES = 13.5 = 2161.164veh/hr. (32.4)
1 + 54
510+650
c
b
c b
500+600
a 250 a
32.5 Summary
Traffic rotaries reduce the complexity of crossing traffic by forcing them into weaving operations.
The shape and size of the rotary are determined by the traffic volume and share of turning
movements. Capacity assessment of a rotary is done by analyzing the section having the greatest
proportion of weaving traffic. The analysis is done by using the formula given by TRL.
32.6 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
Chapter 33
33.1 Overview
An intersection is the area shared by the joining or crossing of two or more roads. Since the
main function of an intersection is to enable the road user to make a route choice, it is a point
of decision. Hence the problems that are encountered by the motorist while passing through an
intersection must be recognized and the design should be in such a way that the driving task
is as simple as possible.
Intersection is also a point of large number of major conflicts, besides a point of decision.
These conflicts may be due to the crossing maneuvers of vehicles moving in different directions.
Good intersection design results from a minimization of the magnitude and characteristics of
the conflicts and a simplification of driver route selection process.
facilities, physical requirements of the topography, adjoining land use, type of controls, right-
of-way and direction of movements.
The ultimate objective of grade separated intersections is to eliminate all grade crossing
conflicts and to accommodate other intersecting maneuvers by merging, diverging and weaving
at low relative speed. The relative speed of the conflicting vehicle streams is an important
factor affecting the significance of a conflict. The benefit of providing for low relative speed is
twofold. First, events unfold more slowly allowing more judgement time and second, in case of
an impact the total relative energy to be absorbed are less and hence, the damage is less. In
addition, when relative speed is low, the average motorist will accept a smaller time gap space
between successive vehicles to complete his move. This condition increases roadway capacity.
1. Underpass
2. Overpass
3. Trumpet Interchange
4. Diamond Interchange
5. Cloverleaf Interchange
7. Directional Interchange
8. Bridged Rotary
Underpass
Overpass
An overpass also known as a flyover, is a bridge, road, railway or similar structure that crosses
over another road or railway. A pedestrian overpass allows pedestrians safe crossing over busy
roads without impacting traffic. And Railway overpasses are used to replace at-grade crossing
as a safer alternative. Overpasses allows for unobstructed rail traffic flow from mixing with
vehicular and pedestrian traffic. Stack interchanges are made up of many overpasses.
Trumpet Interchange
Trumpet interchanges have been used where one highway terminates at another highway. These
involve at least one loop ramp connecting traffic either entering or leaving the terminating
expressway with the far lanes of the continuous highway. These interchanges are useful for
highways as well as toll roads, as they concentrate all entering and exiting traffic into a single
stretch of roadway, where toll booths can be installed. Trumpets are suitable at the locations
where the side road exists on only one side of the freeway, and traffic is relatively low. Each
entrance and exit consists of acceleration or deceleration lanes at each end. It requires only one
bridge and is the most traditional way of grade separating a three way junction. The principal
advantages are low construction cost and are useful for highways as well as toll roads. But
the limitations in employing trumpet interchanges are it leaves a redundant patch of the land
within the loop, Disorienting to navigate for those driving in the direction that uses the loop.
Moreover scaling down the interchange often results in a more dangerous suffers congestion
from articulated lorries that have tipped over.
Diamond Interchange
The diamond Interchange is the simplest form of grade separated intersection between two road-
ways. The conflicts between through and crossing traffic are eliminated by a bridge structure.
This particular intersection has four one way ramps which are essentially parallel to the major
artery. The left turn crossing movement conflicts are considerably reduced by eliminating the
conflict with the traffic in opposite direction. All the remaining left turn conflicts, merging
and diverging maneuver conflicts take place at the terminal point of each ramp. Limitation in
application of this design depends on the operations of these terminals. So, it is suitable for
locations where the volume of left turn traffic is relatively low.
The diamond interchange requires a minimum amount of land and is economical to con-
struct. Also,a diamond interchange generally requires less out-of-the-way travel and vehicle
operating costs are less than those on most other types of interchanges. The single point of exit
from the major roadway eases the problem of signing. This type of interchange requires the
least of right-of-way. With these advantages, the diamonds appear to be the ideal solution to
an intersection problem. But there might be chances of occurrence of conflicts at the locations
where ramps meet the grade separated cross street are to be considered foe high ramp volumes.
Improper design of signal timings at cross streets may result in the inadequacy of capacity for
certain flows.
Cloverleaf Interchange
The full clover interchange eliminates all crossing movement conflicts by the use of weaving
sections. This weaving section is a critical element of cloverleaf design. It replaces a crossing
conflict with a merging, followed some distance farther by a diverging conflict. There are two
points of entry and exit on each through roadway. The first exit is provided before the cross
road structure allows right turn movements. The second exit, immediately after the cross road
structure, allows for left turn movements. A weaving section is created between the exit and
entry points near the structure. Sufficient length and capacity is to be provided to allow for a
smooth merging and diverging operation.
Cloverleaf design requires only one bridge. In this respect, it is the cheapest form providing
for elimination of all crossing maneuvers at grade. Although full cloverleaf interchanges elimi-
nate the undesirable crossing movements of diamond interchanges, they have the disadvantages
of greater travel distances, higher operating costs, difficult merging sections, circuity of travel,
large areas for loops, sight distances to exits at the other side of the bridge, confusion caused by
turning right to go left and large rights-of-way occasioned by the radius requirements necessary
for satisfactory speeds on the ramps.
A variation of the cloverleaf configuration is the cloverleaf with collector-distributor roads.
With the collector-distributor roadway, main roadway operations are much the same as in
diamond interchange. For each direction of travel, there is a single point for exits and a single
point for entrances. Speed change, detailed exit directional signing and the storage and weaving
problems associated with a cloverleaf are transferred to the collector-distributor road, which
can be designed to accommodate greater relative speed differences or encourage smaller ones.
Although this configuration improves the operational characteristics of a cloverleaf interchange,
the disadvantages of greater travel distances and the requirement of extra right-of-way are still
present. The use of a cloverleaf with collector-distributor roads is appropriate at junctions
between a freeway and an expressway where a diamond interchange would not adequately
serve traffic demand.
Major Highway
Cross Street
This is another variation of the cloverleaf configuration. Partial clover leaf or parclo is a
modification that combines some elements of a diamond interchange with one or more loops of a
cloverleaf to eliminate only the more critical turning conflicts. This is the most popular freeway
-to- arterial interchange. Parclo is usually employed when crossing roads on the secondary road
will not produce objectionable amounts of hazard and delay. It provides more acceleration and
deceleration space on the freeway.
Directional Interchange
A Directional interchange provides direct paths for left turns. These interchanges contain ramps
for one or more direct or semi direct left turning movements. Interchanges of two freeways or
interchanges with one or more very heavy turning movements usually warrant direct ramps,
which have higher speeds of operation and higher capacities, compared to loop ramps. Some
designers do not favor entrance of merging traffic in the left lane, which is a characteristic of
most direct-connection bridges. The principal limitations of this type of interchange is higher
cost of construction and requirement relatively large amount of land when compared to the
diamond interchanges and in some cases than cloverleaf interchange. Various combinations of
directional, semi directional and loop ramps may be appropriate for certain conditions. They
are the basic patterns that use the least space, have the fewest or least complex structures,
minimize internal weaving and appropriate for the common terrain and traffic conditions.
An acceleration lane is defined as extra pavement, of constant or variable width, placed parallel
or nearly so, to a merging maneuver area to encourage merging at low relative speed. The
major difference in opinion concerning acceleration design stems from lack of information on
driver performance. Field observations have indicated that drivers desire to follow the direct
path even though extra width or tapered section is provided. The length of acceleration lanes
are determined by two factors: (1) Time required for drivers to accelerate to the speed of the
preferential flow from the speed of entry into the acceleration lane and (2) Maneuvering time
required as a supplement to the sight distance which is provided in advance of the acceler-
ation lane. Taper distances are based upon a lateral transition time of about 1/3 sec/ft of
displacement.
ENTRANCE CURVE L
END OF SPEED
RESTRICTING CURVE
FORM A DESIGN
PREFERENTIAL FLOW
INLET NOSE
Figure 33:1: Different forms of Acceleration lanes
ENTRANCE
ACCELERATION LANE
Wearing length
Shoulder
Convergence
Deceleration Lanes
Deceleration lanes are defined as extra pavement of constant or variable width, placed parallel
or nearly so, to a diverging maneuver area to encourage diverging at low relative speed. The
lengths of deceleration lanes are based on the difference in the speed of traffic of the combined
flow (in advance of the collision area) and the speed at which drivers negotiate the critical
diverging channel curve, as well as the deceleration practices of drivers. These deceleration
lane lengths are based on the assumed performance of passenger vehicles only. Extra allowance
must be made for grades and for trucks with different deceleration characteristics. In the figure
below, Form A design is more economical when large speed differentials are to be overcome.
Form B could be advantageous by contrasting pavement colors and Form C design is more
convenient for drivers when small speed differentials are to be eliminated.
BEGINNING
OF TAPER TAPER FULL WIDTH LANE
L
BEGINNING OF SPEED
RESTRICTING EXIT
CURVE
FORM A
BEGINNING
OF TAPER
L
POINT WHERE VEHICLE IN DIVERGING BEGINNING OF SPEED
FLOW HAS "CLEARED" THE THROUGH RESTRICTING EXIT
TRAFFIC LANE FORM C CURVE
SE
weaving length
Shoulder
Shoulder
270’ 141.38’
line crosses a road, then also grade separators are used. Different types of grade-separators are
flyovers and interchange. Flyovers itself are subdivided into overpass and underpass. When
two roads cross at a point, if the road having major traffic is elevated to a higher grade for
further movement of traffic, then such structures are called overpass. Otherwise, if the major
road is depressed to a lower level to cross another by means of an under bridge or tunnel, it is
called under-pass.
Interchange is a system where traffic between two or more roadways flows at different levels
in the grade separated junctions. Common types of interchange include trumpet interchange,
diamond interchange , and cloverleaf interchange.
3. Clover leaf interchange: It is also a four leg interchange and is used when two highways
of high volume and speed intersect each other with considerable turning movements. The
main advantage of cloverleaf intersection is that it provides complete separation of traffic.
In addition, high speed at intersections can be achieved. However, the disadvantage is
that large area of land is required. Therefore, cloverleaf interchanges are provided mainly
in rural areas. A typical layout of this type of interchange is shown in figure 33:7.
33.4 Summary
Traffic intersections are problem spots on any highway, which contribute to a large share of
accidents. For safe operation, these locations should be kept under some level of control de-
pending upon the traffic quantity and behavior. Based on this, intersections and interchanges
are constructed, the different types of which were discussed in the chapter.
33.5 References
1. A policy on geometric design of rural highways, 2019.
1
0
0
1
1 00
0 11 0
1
1 11
0 00
00
11 11
00 0
1
11
00
0
1 00
11 11
00 00
11
1
0 11
00
1
0 11
00
0
1
11
0000
11 01
1 0
1
11
0000
11 00
1
00
11 0
1
0
1 1
0
01
1 0 01
1
00
01
1 0 1 0
1
0
1 0
1
0
1 11
00
0
1 11
00
0
1 1
0 00
11 11
00
00
11
1 0
0
1 0
0 101 00 1
11 0 01
1 0 0
1 1
4. Theodore M Matson, Wilbure S smith, and Fredric W Hurd. Traffic engineering, 1955.
Chapter 34
34.1 Overview
Traffic signals are one of the most effective and flexible active control of traffic and is widely
used in several cities world wide. The conflicts arising from movements of traffic in different
directions is addressed by time sharing principle. The advantages of traffic signal includes an
orderly movement of traffic, an increased capacity of the intersection and requires only simple
geometric design. However, the disadvantages of the signalized intersection are large stopped
delays, and complexity in the design and implementation. Although the overall delay may be
lesser than a rotary for a high volume, a user may experience relatively high stopped delay.
This chapter discuss various design principles of traffic signal such as phase design, cycle length
design, and green splitting. The concept of saturation flow, capacity, and lost times are also
presented. First, some definitions and notations are given followed by various steps in design
starting from phase design.
• Cycle: A signal cycle is one complete rotation through all of the indications provided.
• Cycle length: Cycle length is the time in seconds that it takes a signal to complete one
full cycle of indications. It indicates the time interval between the starting of of green for
one approach till the next time the green starts. It is denoted by C.
• Interval: Thus it indicates the change from one stage to another. There are two types of
intervals - change interval and clearance interval. Change interval is also called the yellow
time indicates the interval between the green and red signal indications for an approach.
Clearance interval is also called all red and is provided after each yellow interval indicating
a period during which all signal faces show red and is used for clearing off the vehicles in
the intersection.
• Green interval: It is the green indication for a particular movement or set of movements
and is denoted by Gi . This is the actual duration the green light of a traffic signal is turned
on.
• Red interval: It is the red indication for a particular movement or set of movements and
is denoted by Ri . This is the actual duration the red light of a traffic signal is turned on.
• Phase: A phase is the green interval plus the change and clearance intervals that follow
it. Thus, during green interval, non conflicting movements are assigned into each phase.
It allows a set of movements to flow and safely halt the flow before the phase of another
set of movements start.
• Lost time: It indicates the time during which the intersection is not effectively utilized
for any movement. For example, when the signal for an approach turns from red to
green, the driver of the vehicle which is in the front of the queue, will take some time
to perceive the signal (usually called as reaction time) and some time will be lost before
vehicle actually moves and gains speed.
5
8
3
7 4
6
6
3
4 5
7 1
Phase 1 ( P1) Phase 1 ( P2)
the flow pattern may cause considerable confusion to the drivers. To illustrate various phase
plan options, consider a four legged intersection with through traffic and right turns. Left turn
is ignored. See Figure 34:1. The first issue is to decide how many phases are required. It is
possible to have two, three, four or even more number of phases.
3 4
7
P1 P2
7
2
5 6
P3 P4
1
adopted.
3
4 7
P1 P2
1
8
5 6
P3 P4
7
3 5
P1 6 4
P2
2 8
P3 P4
7 1
1 2 3 N
Figure 34:6: Group of vehicles at a signalized intersection waiting for green signal
Headway
e1
h1 e2 e3
h h
Vehicles in queue
as the saturation headway, and is denoted as h. This is the headway that can be achieved by a
stable moving platoon of vehicles passing through a green indication. If every vehicles require
h seconds of green time, and if the signal were always green, then s vehicles per hour would
pass the intersection. Therefore,
3600
s= (34.1)
h
where s is the saturation flow rate in vehicles per hour of green time per lane, h is the saturation
headway in seconds. As noted earlier, the headway will be more than h particularly for the
first few vehicles. The difference between the actual headway and h for the ith vehicle and is
denoted as ei shown in figure 34:7. These differences for the first few vehicles can be added to
get start up lost time, l1 which is given by,
n
X
l1 = ei (34.2)
i=1
The green time required to clear N vehicles can be found out as,
T = l1 + h.N (34.3)
where T is the time required to clear N vehicles through signal, l1 is the start-up lost time, and
h is the saturation headway in seconds.
gi = Gi + Yi − tL (34.4)
Numerical example
Let the cycle time of an intersection is 60 seconds, the green time for a phase is 27 seconds,
and the corresponding yellow time is 4 seconds. If the saturation headway is 2.4 seconds per
vehicle, the start-up lost time is 2 seconds per phase, and the clearance lost time is 1 second
per phase, find the capacity of the movement per lane?
Solution Total lost time, tL = 2+1 = 3 seconds. From equation 34.4 effective green time, gi
= 27+4-3 = 28 seconds. From equation 34.1 saturation flow rate, si = 3600
h
= 3600
2.4
= 1500 veh
per hr. Capacity of the given phase can be found out from equation 34.5 as Ci = 1500 × 28
60
=
700 veh per hr per lane.
Let the total number of critical lane volume that can be accommodated per hour is given by Vc ,
then Vc = Thg . Substituting for Tg from equation 34.9 and si from equation 34.1 in the expression
for the the maximum sum of critical lane volumes that can be accommodated within the hour
and by rewriting, the expression for C can be obtained as follows:
Tg
Vc = ,
h
3600 N tL
= 1− ,
h C
N tL
= si 1 − ,
C
N tL
∴ C = .
1 − Vsc
The above equation is based on the assumption that there will be uniform flow of traffic in an
hour. To account for the variation of volume in an hour, a factor called peak hour factor, (PHF)
which is the ratio of hourly volume to the maximum flow rate, is introduced. Another ratio
called v/c ratio indicating the quality of service is also included in the equation. Incorporating
these two factors in the equation for cycle length, the final expression will be,
N tL
C= Vc
(34.6)
1− si ×P HF × vc
Highway capacity manual (HCM) has given an equation for determining the cycle length which
is a slight modification of the above equation. Accordingly, cycle time C is given by,
N L XC
C= P Vci (34.7)
XC − si
V
where N is the number of phases, L is the lost time per phase, scii is the ratio of critical
volume to saturation flow for phase i, XC is the quality factor called critical vc ratio where v is
the volume and c is the capacity.
Numerical example
The traffic flow in an intersection is shown in the figure 34:8. Given start-up lost time is 3
seconds, saturation head way is 2.3 seconds, compute the cycle length for that intersection.
Assume a two-phase signal.
1150
1300
1800
900
1300
1150
Solution
1. If we assign two phases as shown below figure 34:9, then the critical volume for the first
phase which is the maximum of the flows in that phase = 1150 vph. Similarly critical
volume for the second phase = 1800 vph. Therefore, total critical volume for the two
signal phases = 1150+1800 = 2950 vph.
2. Saturation flow rate for the intersection can be found out from the equation as si = 3600
2.3
= 1565.2 vph. This means, that the intersection can handle only 1565.2 vph. However,
the critical volume is 2950 vph . Hence the critical lane volume should be reduced and
one simple option is to split the major traffic into two lanes. So the resulting phase plan
is as shown in figure 34:10.
3. Here we are dividing the lanes in East-West direction into two, the critical volume in the
first phase is 1150 vph and in the second phase it is 900 vph. The total critical volume
for the signal phases is 2050 vph which is again greater than the saturation flow rate and
hence we have to again reduce the critical lane volumes.
1300/2
1300/2
1800/2
1800/2
1150
1800/3
1800/3
1800/3
1150/2 1150/2
Figure 34:11: Third way of providing phases
4. Assigning three lanes in East-West direction, as shown in figure 34:11, the critical volume
in the first phase is 575 vph and that of the second phase is 600 vph, so that the total
critical lane volume = 575+600 = 1175 vph which is lesser than 1565.2 vph.
5. Now the cycle time for the signal phases can be computed from equation 34.6 as:
2×3
C= 1175 = 24 seconds.
1 − 1565.2
where Vci is the critical lane volume and tg is the total effective green time available in a cycle.
This will be cycle time minus the total lost time for all the phases. Therefore,
tg = C − N tL (34.9)
where C is the cycle time in seconds, n is the number of phases, and tL is the lost time per
phase. If lost time is different for different phases, then effective green time can be computed
500
1000
900
600
as follows:
N
X
tg = C − tLi (34.10)
i=1
where tLi is the lost time for phase i, N is the number of phases and C is the cycle time in
seconds. Actual green time can be now found out as,
Gi = gi − yi + tLi (34.11)
where Gi is the actual green time, gi is the effective green time available, yi is the amber time,
and Li is the lost time for phase i.
Numerical example
The phase diagram with flow values of an intersection with two phases is shown in figure 34:12.
The lost time and yellow time for the first phase is 2.5 and 3 seconds respectively. For the
second phase the lost time and yellow time are 3.5 and 4 seconds respectively. If the cycle time
is 120 seconds, find the green time allocated for the two phases.
Solution
1. Critical lane volume for the first phase, VC1 = 1000 vph.
2. Critical lane volume for the second phase, VC2 = 600 vph.
4. Effective green time can be found out from equation 34.9 as Tg =120-(2.5-3.5)= 114 sec-
onds.
1000
5. Green time for the first phase, g1 can be found out from equation 34.8 as g1 = 1600
× 114
= 71.25 seconds.
120
1111111111111111111111111111111111111
0000000000000000000000000000000000000
0000000000000000000000000000000000000
1111111111111111111111111111111111111
0000000000000000001111
1111111111111111110000
1111
0000000000000000
1111111111111111
111111111111111111
0000000000000000000000
0000000000000000
1111111111111111
000000000000000000
1111111111111111110000
1111
0000000000000000
1111111111111111
000000000000000000
111111111111111111
0000000000000000001111
0000
0000000000000000
1111111111111111
71
111111111111111111
000000000000000000
1111111111111111110000
1111
0000
1111 3 46
0000000000000000
1111111111111111
0000000000000000
1111111111111111
0000000000000000001111
1111111111111111110000
0000000000000000
1111111111111111
111111111111111111
000000000000000000
00000
11111
0000000000000000
1111111111111111
0000
1111
000000000000000000
111111111111111111
00000
11111
0000000000000000
1111111111111111
0000
1111
000000000000000000
111111111111111111
00000
11111
0000000000000000
1111111111111111
0000
1111
000000000000000000
111111111111111111
00000
11111
0000000000000000
1111111111111111
0000
1111
74
000000000000000000
111111111111111111
00000
11111
000000000000000000
111111111111111111
00000
11111
000000000000000000
111111111111111111
42
0000000000000000
1111111111111111
0000
1111
0000000000000000
1111111111111111
00000
11111 0000
1111
0000000000000000
1111111111111111
0000
1111
4
600
6. Green time for the second phase, g2 can be found out from equation 34.8 as g2 = 1600
×
114= 42.75 seconds.
7. Actual green time can be found out from equation 34.11. Thus actual green time for the
first phase, G1 = 71.25-3+2.5 = 71 seconds (rounded).
8. Actual green time for the second phase, G2 = 42.75-4+3.5 = 42 seconds (rounded).
34.7 Summary
Traffic signal is an aid to control traffic at intersections where other control measures fail. The
signals operate by providing right of way to a certain set of movements in a cyclic order. The
design procedure discussed in this chapter include phase design, interval design, determination
of cycle time, computation of saturation flow, and green splitting.
34.8 References
1. William R McShane, Roger P Roesss, and Elena S Prassas. Traffic Engineering. Prentice-
Hall, Inc, Upper Saddle River, New Jesery, 1998.
Chapter 35
35.1 Introduction
Signalized intersections are the important points or nodes within a system of highways and
streets. To describe some measure of effectiveness to evaluate a signalized intersection or to
describe the quality of operations is a difficult task. There are a number of measures that have
been used in capacity analysis and simulation, all of which quantify some aspect of experience of
a driver traversing a signalized intersection. The most common measures are average delay per
vehicle, average queue length, and number of stops. Delay is a measure that most directly relates
driver’s experience and it is measure of excess time consumed in traversing the intersection.
Length of queue at any time is a useful measure, and is critical in determining when a given
intersection will begin to impede the discharge from an adjacent upstream intersection. Number
of stops made is an important input parameter, especially in air quality models. Among these
three, delay is the most frequently used measure of effectiveness for signalized intersections for
it is directly perceived by a driver. The estimation of delay is complex due to random arrival of
vehicles, lost time due to stopping of vehicles, over saturated flow conditions etc. This chapter
looks are some important models to estimate delays.
D3
D2
Distance
D1
Time
• Approach delay
• Time-in-queue delay
• Control delay
These delay measures can be quite different, depending on conditions at the signalized inter-
section. Fig 35:1 shows the differences among stopped time, approach and travel time delay for
single vehicle traversing a signalized intersection. The desired path of the vehicle is shown, as
well as the actual progress of the vehicle, which includes a stop at a red signal. Note that the
desired path is the path when vehicles travel with their preferred speed and the actual path is
the path accounting for decreased speed, stops and acceleration and deceleration.
It is found by extending the velocity slope of the approaching vehicle as if no signal existed.
Approach delay is the horizontal (time) difference between the hypothetical extension of the
approaching velocity slope and the departure slope after full acceleration is achieved. Average
approach delay is the average for all vehicles during a specified time period.
11111111111111111111
00000000000000000000
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
Slope =v 00000000
11111111
Slope =s
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00
11 00000000
11111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00
11 00000000
11111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00
11 00000000
11111111
Qt
111111
000000
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00
11 Aggregate delay
00000000000000000000
11111111111111111111
0000000000000
1111111111111 (veh−secs)
00000000000000000000
11111111111111111111
0000000000000
1111111111111
Vi 00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
11111111
00000000
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111
Wi
Time
G R t G
1. The total time that any vehicle (vi ) spends waiting in the queue (Wi ) is given by the
horizontal time-scale difference between the time of arrival and the time of departure.
2. The total number of vehicles queued at any time (qt ) is the vertical vehicle-scale difference
between the number of vehicles that have arrived and the number of vehicles that have
departed
3. The aggregate delay for all vehicles passing through the signal is the area between the
Cummulative vehicles
arrival function
departure function
Time
Cummulative vehicles
capacity function
arrival function
departure function
Time
capacity function
slope = c
arrival function
slope = v
departure function
slope = s
Time
Cummulative Vehicles
11111111111111111111
00000000000000000000
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
1111111 000000
0000000 111111 Slope =s
00000000000000000000
11111111111111111111
0000000000000
1111111111111
Slope =v
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
0000000000000 Aggregate delay
1111111111111
V
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111 (veh−secs)
0000000000000
1111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
0000000000000
1111111111111
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111
00000000000000000000
11111111111111111111
11111111111
00000000000
R=C[1−g/C] tc
G R G Time t
V = v(R + tc ) = s tc (35.3)
Substituting equation 35.2 for R in equation 35.3 and solving for tc and then for V gives,
g
v C 1− + tc = s tc
C g
tc (s − v) = v C 1 −
C
V g
(s − v) = v C 1 −
s C
g vs
V = C 1− (35.4)
C s−v
where TUD is the aggregate delay, in vehicle seconds. To obtain the average delay per vehicle,
the aggregate delay is divided by the number of vehicles processed during the cycle, which is
the arrival rate, v, times the full cycle length, C. Hence,
1h g i2 vs 1
UD = C 1−
2 C s−v vC
g 2
C (1 − C )
= (35.5)
2 (1 − vs )
Another form of the equation uses the capacity, c, rather than the saturation flow rate, s. We
know,
c
s= g (35.6)
C
So, the relation for uniform delay changes to,
C (1 − Cg )2
UD = gv
2 (1 − Cc )
C (1 − Cg )2
= (35.7)
2 (1 − Cg X)
where, UD is the uniform delay (sec/vehicle) C is the cycle length (sec), c is the capacity, v is
the vehicle arrival rate, s is the saturation flow rate or departing rate of vehicles, X is the v/c
ratio or degree of saturation (ratio of the demand flow rate to saturation flow rate), and g/C
is the effective green ratio for the approach.
Numerical Example
Consider the following situation: An intersection approach has an approach flow rate of 1,000 vph,
a saturation flow rate of 2,800 vph, a cycle length of 90 s, and effective green ratio of 0.44 for
the approach. What average delay per vehicle is expected under these conditions?
Solution: First, the capacity and v/c ratio for the intersection approach must be computed.
Given, s=2800 vphg and g/C=0.55. Hence,
c = s × g/C
= 2800 × 0.55 = 1540 vph
v/c = 1000/1540 = 0.65
Since v/c ≤ 1.0 and is a relatively low value, the uniform delay equation 35.5 may be applied
directly. There is hardly any random delay at such a v/c ratio and overflow delay need not be
considered.
C (1 − Cg )2
UD =
2 (1 − vs )
90 (1 − 0.55)2
=
2 (1 − 1000
2800
)
= 14.2.
Therefore, average delay per vehicle is 14.2 sec/veh. Note that this solution assumes that
arrivals at the subject intersection approach are uniform. Random and platooning effects are
not taken into account.
Cummulative vehicles
slope = v
Overflow Delay
slope = c
Time
where, RD is the average random delay per vehicle, s/veh, and X is the degree of saturation (v/c
ratio). Webster found that the above delay formula overestimate delay and hence he proposed
that total delay is the sum of uniform delay and random delay multiplied by a constant for
agreement with field observed values. Accordingly, the total delay is given as:
Cummulative vehicles
Slope = v
vT
Slope = c
cT
T Time
Numerical Example
Consider the following situation: An intersection approach has an approach flow rate of 1,900
vph, a saturation flow rate of 2,800 vphg, a cycle length of 90s, and effective green ratio for the
approach 0.55. What average delay per vehicle is expected under these conditions?
Cummulative vehicles
Slope = v
vT2
Slope = c
vT1
cT2
cT1
T1 T2 Time
Solution: To begin, the capacity and v/c ratio for the intersection approach must be com-
puted. This will determine what model(s) are most appropriate for application in this case:
Given, s=2800 vphg, g/C=0.55, and v =1900 vph.
c = s × g/C
= 2800 × 0.55 = 1540 vph
v/c = 1900/1540 = 1.23.
Since v/c is greater than 1.15 for which the overflow delay model is good so it can be used to
find the delay.
D = UD + OD
C g
UD = 1−
2 C
= 0.5 × 90[1 − 0.55]
= 20.3
T v
OD = −1
2 c
3600
= (1.23 − 1)
2
= 414
D = 20.3 + 414
= 434.3 sec/veh
This is a very large value but represents an average over one full hour period.
Average
Overflow
Delay
Webster’s
random
delay model
Theoretical
overflow delay
model
Numerical Example
Consider the following situation: An intersection approach has an approach flow rate of 1,600
vph, a saturation flow rate of 2,800 vphg, a cycle length of 90s, and a g/C ratio of 0.55. What
average delay per vehicle is expected under these conditions?
Solution: To begin, the capacity and v/c ratio for the intersection approach must be com-
puted. This will determine what model(s) are most appropriate for application in this case:
Given, s =2800 vphg; g/C=0.55; v =1600 vph
c = s × g/C
= 2800 × 0.55 = 1540 vph
v/c = 1600/1540 = 1.039
In this case, the v/c ratio now changes to 1600/1540 = 1.039. This is in the difficult range of
0.85-1.15 for which neither the simple random flow model nor the simple overflow delay model
are accurate. The Akcelik model of Equation will be used. Total delay, however, includes both
uniform delay and overflow delay. The uniform delay component when v/c > 1.0 is given by
equation 35.10
C g
UD = (1 − )
2 C
= 0.5 × 90[1 − 0.55]
= 20.3 sec/veh
Use of Akcelik’s overflow delay model requires that the analysis period be selected or arbitrarily
set. If a one-hour
" r #
cT 12(X − X 0 )
OD = (X − 1) + (X − 1)2 +
4 cT
g = 0.55 × 90 = 49.5 s
s = 2800/3600 = 0.778 v/sg
0.778 × 49.5
X0 = 0.67 + = 0.734
" 600 r #
1540 12(1.039 − 0.734)
OD = (1.039 − 1) + (1.039 − 1)2 +
4 1540
= 39.1 s/veh
The total expected delay in this situation is the sum of the uniform and overflow delay terms
and is computed as: d=20.3+39.1=59.4 s/veh. As v/c > 1.0 in the same problem, what will
happen if we use Webster’s overflow delay model. Uniform delay will be the same, but we have
to find the overflow delay.
T v
OD = ( − 1)
2 c
3600
= (1.039 − 1)
2
= 70.2 sec/veh
As per Akcelik model, overflow delay obtained is 39.1 sec/veh which is very much lesser com-
pared to overflow delay obtained by Webster’s overflow delay model. This is because of the
inconsistency of overflow delay model in the range 0.85-1.15.
d = d1 P F + d2 + d3
c (1 − gc )2
d1 =
2 1 − [min(1, X)( gc )]
r
8klX
d2 = 900T [(X − 1) + (X − 1)2 + ]
cT
(1−P )
P F = ( (1−(g/c) ) ∗ fp additional explanation for PF Where, d = control delay, s/veh, d1 =
uniform delay component, s/veh, PF = progression adjustment factor, d2 = overflow delay
component, s/veh, d3 = delay due to pre-existing queue, s/veh, T = analysis period, h, X =
v/c ratio, C = cycle length, s, k = incremental delay factor for actuated controller settings;
0.50 for all pre-timed controllers, l = upstream filtering/metering adjustment factor; 1.0 for
all individual intersection analyses, c = capacity, veh/h, P = proportion of vehicles arriving
during the green interval and fp = supplemental adjustment factor for platoon arriving during
the green
Numerical problems
Consider the following situation: An intersection approach has an approach flow rate of 1,400
vph, a saturation flow rate of 2,650 vphg, a cycle length of 102 s, and effective green ratio for
the approach 0.55. Assume Progression Adjustment Factor 1.25 and delay due to pre-existing
queue, 12 sec/veh. What control delay sec per vehicle is expected under these conditions?
Solution: Saturation flow rate =2650 vphg , g/C=0.55, Approach flow rate v=1700 vph, Cy-
cle length C=102 sec, delay due to pre-existing queue =12 sec/veh and Progression Adjustment
Factor PF=1.25. The capacity is given as:
g
c = s×
C
= 2650 × 0.55
= 1458 vphv/c
Degree of saturation X= v/c= 1700/1458 =1.16. So the uniform delay is given as:
C (1 − Cg )2
d1 =
2 [1 − min(X, 1)( gc )]
102 (1 − 1.16)2
= = 22.95
2 [1 − min(1.16, 1)(.55)]
Uniform delay =22.95 and the over flow delay is given as:
r
C 8klX
d2 = ∗ (X − 1) + (X − 1)2 +
2 r cT
102 (8 ∗ 5 ∗ 1 ∗ 1.16)
= ∗ (1.16 − 1) + (1.16 − 1)2 + = 16.81
2 1458
Overflow delay, d2=16.81. Hence, the total delay is”
d = d1 P F + d2 + d3
= 22.95 × 1.25 + 16.81 + 8 = 53.5 sec/veh.
35.6 Conclusion
In this chapter measure of effectiveness at signalized intersection are explained in terms of
delay. Different forms of delay like stopped time delay, approach delay, travel delay, time-
in-queue delay and control delay are explained. Types of delay like uniform delay, random
delay and overflow delay are explained and corresponding delay models are also explained
above. Inconsistency between delay models at v/c=1.0 is explained in the above section and
the solution to the inconsistency, delay model proposed by Akcelik is explained. At last HCM
2000 delay model is also explained in this section. From the study, various form of delay
occurring at the intersection is explained through different models, but the delay calculated
using such models may not be accurate as the models are explained on the theoretical basis
only.
35.7 References
1. R Akcelik. The hcm delay formulas for signalized intersection-ite journal, 1991.
Chapter 36
36.1 Overview
Traffic signals are designed to ensure safe and orderly flow of traffic, Protect pedestrians and
vehicles at busy intersections and reduce the severity and frequency of accidents between vehi-
cles entering intersections. Previous chapters discussed some important design principles such
as: (i) Phase Design (ii) Cycle Time Determination (iii) Green Splitting (iv) Performance Eval-
uation This chapter we will discuss some special requirements in the signal design such as: (i)
Pedestrian crossing requirement (ii) Interval design, (iii) Effect of tuning vehicles, and (iv) Lane
utilization.
3
4
P1 P2
Pedestrian crossing
where w is the width of the intersection from stop line to the farthest conflicting traffic, L is
the length of the vehicle (about 6 m), v is the speed of the vehicle, and P is the width of the
intersection from STOP line to the farthest conflicting pedestrian cross-walk.
1. Traffic Volumes
2. Delay: Separate right -turn phasing may be considered if the average delay for all right-
turning vehicles on the approach is at least 35 seconds during that same peak hour.
3. Collision Experience: Separate right -turn phasing may be considered if the critical num-
ber of reportable right -turn collisions has occurred. These are: (i) For one approach to
the intersection, the critical number is five l right -turn collisions in one year, or seven in
two years. (ii) For both approaches to an intersection, the critical number is seven right
-turn collisions in one year, or eleven in two years.
So the right turning vehicles affected saturation flow based on adjusted saturation headway.
Finally actual values of right turning are calculated from right turn adjustment factor. The
Numerical example
If there is 15 percent right turning movement, eRT (through-car equivalent for permitted left
turns) is 3, saturation headway is 2 sec; Find the value of Adjusted Saturation flow.
The adjusted saturation flow is 1386 vph. The result is same from both cases.
Numerical example
Find Critical Volume (Vi) for a Given 4 arm Intersection. Traffic flow Proportion of Left
and Right turn are 10% and 20% respectively (For all approach). Left and Right turn Lane
utilization factors are 0.2 and 0.3 respectively. Use following Phase Plan:
E
W
2300
1985
1245
P4
P2 P3
P1
Lane Distribution
• Through traffic in Left turn Lane = (2300 × 0.7) × 0.2 = 322 veh/hr
• Through traffic in Right turn Lane = (2300 × 0.7) × 0.3 = 483 veh/hr
Lane Distribution
• Through traffic in Left turn Lane = (1985 × 0.7) × 0.2 = 278 veh/hr
• Through traffic in Right turn Lane = (1985 × 0.7) × 0.3 = 417 veh/hr
196 170
367
140
1111
0000 187
400
215 1111
0000
433
220
120 417 233
Numerical example
The traffic flow for a four-legged intersection is as shown in figure 36:1. Given that the lost
time per phase is 2.4 seconds, saturation headway is 2.2 seconds, amber time is 3 seconds per
phase, find the cycle length, green time and performance measure(delay per cycle). Assume
critical v/c ratio as 0.9.
Solution
1. The phase plan is as shown in figure 36:2. Sum of critical lane volumes is the sum of
maximum lane volumes in each phase, ΣVCi = 433+417+233+215 = 1298 vph.
Vc
2. Saturation flow rate, Si from equation= 3600
2.2
= 1637 vph. Si
= 433
1637
417
+ 1637 233
+ 1637 + 1298
1637
=
0.793.
Phase 2
26 23 3 52.5
Phase 3
52 13 3 36.5
Phase 4
68 12 3 21.5
Pedestrian phase
83 4 17.5
104.5
9. The actual green time for phase 1 from equationG1 = 22.88-3+2.4 ≈ 23 seconds.
14. Delay at the intersection in the east-west direction can be found out from equationas
104.5
2
− 23−2.4+3
[1 104.5
]2
dEW = 433 = 42.57sec/cycle.
1 − 1637
15. Delay at the intersection in the west-east direction can be found out from equation,as
104.5
2
[1 − 23−2.4+3
104.5
]2
dW E = 400 = 41.44sec/cycle. (36.3)
1 − 1637
16. Delay at the intersection in the north-south direction can be found out from equation,
104.5
2
[1− 23−2.4+3
104.5
]2
dN S = 367 = 40.36sec/cycle. (36.4)
1 − 1637
17. Delay at the intersection in the south-north direction can be found out from equation,
104.5
2
[1− 23−2.4+3
104.5
]2
dSN = 417 = 42.018sec/cycle. (36.5)
1 − 1637
18. Delay at the intersection in the south-east direction can be found out from equation,
104.5
2
− 13−2.4+3
[1 104.5
]2
dSE = 233 = 46.096sec/cycle. (36.6)
1 − 1637
19. Delay at the intersection in the north-west direction can be found out from equation,
104.5
2
[1− 13−2.4+3
104.5
]2
dN W = 196 = 44.912sec/cycle. (36.7)
1 − 1637
20. Delay at the intersection in the west-south direction can be found out from equation,
104.5
2
[1− 12−2.4+3
104.5
]2
dW S = 215 = 46.52sec/cycle. (36.8)
1 − 1637
21. Delay at the intersection in the east-north direction can be found out from equation,
104.5
2
− 12−2.4+3
[1 104.5
]2
dEN = 187 = 45.62sec/cycle. (36.9)
1 − 1637
36.5 Summary
Green splitting is done by proportioning the green time among various phases according to the
critical volume of the phase. Pedestrian phases are provided by considering the walking speed
and start-up lost time. Like other facilities, signals are also assessed for performance, delay
being th e important parameter used.
36.6 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
2. William R McShane, Roger P Roesss, and Elena S Prassas. Traffic Engineering. Prentice-
Hall, Inc, Upper Saddle River, New Jesery, 1998.
Chapter 37
37.1 Overview
The Highway Capacity Manual defines the capacity as the maximum howdy rate at which
persons or vehicle can be reasonably expected to traverse a point or a uniform segment of
a lane or roadway during a given time period, under prevailing roadway, traffic and control
conditions. Level-of-Service is introduced by HCM to denote the level of quality one can derive
from a local under different operation characteristics and traffic volume.
37.2 Methodology
37.2.1 Scope
This chapter contains a methodology for analyzing the capacity and level of service (LOS) of
signalized intersections. The analysis must consider a wide variety of prevailing conditions,
including the amount and distribution of traffic movements, traffic composition, geometric
characteristics, and details of intersection signalization. The methodology focuses on the de-
termination of LOS for known or projected conditions. The capacity analysis methodology for
signalized intersections is based on known or projected signalization plans.
37.2.2 Limitation
The methodology does not take into account the potential impact of downstream congestion
on intersection operation. Nor does the methodology detect and adjust for the impacts of
turn-pocket overflows on through traffic and intersection operation.
37.2.3 Objective
This method uses wide range of operational configuration along with various phase plans, lane
utilization, and left-turn treatment alternatives.
• Geometric condition
• Traffic condition
• Signalization condition
The primary output of the method is level of service (LOS). This methodology covers a wide
range of operational configurations, including combinations of phase plans, lane utilization, and
left-turn treatment alternatives. The below figure shows the signalized intersection methodol-
ogy.
Input parameters
Geometric
Traffic
Signal
Performance measures
Delay
Progression adjustment
LOS
back of queue
Table 37:1: Input data needs for each analysis of lane group
Condition Parameter
Geometric Area type
Number of lanes, N
Average lane width, W (m)
Grade, G (%)
Existence of exclusive LT or RT lanes
Length of storage bay, LT or RT lane, L s (m)
Parking
Traffic Demand volume by movement, V (veh/h)
Base saturation flow rate, s o (pc/h/ln)
Peak-hour factor, PHF
Percent heavy vehicles, HV (%)
Approach pedestrian flow rate, vped (p/h)
Local buses stopping at intersection, NB (buses/h)
Parking activity, Nm (maneuvers/h)
Arrival type, AT
Proportion of vehicles arriving on green, P
Approach speed, S A (km/h)
Control Cycle length, C (s)
Green time, G (s)
Yellow-plus-all-red change-and-clearance interval
(inter green), Y (s)
Actuated or pre-timed operation
Pedestrian push-button
Minimum pedestrian green, Gp (s)
Phase plan
Analysis period, T (h)
AT Description
1 Dense platoon- 80% arrived at start of red
2 Moderately dense- 40-80% arrived during red
3 Less than 40% (highly dispersed platoon)
4 Moderately dense, 40-80% arrived during green
5 Dense to moderately dense- 80% arrive at start of green
6 Very dense platoons progressing over a no. of closed space I/S
• If v/c exceeds 1.0 during the analysis period, the length of the analysis period should be
extended to cover the period of oversaturation in the same fashion, as long as the average
flow during that period is relatively constant.
where, Gp = minimum green time (s), L = crosswalk length (m), Sp = average speed of
pedestrians (m/s), WE = effective crosswalk width (m), 3.2 = pedestrian start-up time (s), and
Nped = number of pedestrians crossing during an interval (p).
where, S = saturation flow rate for subject lane group, expressed as a total for all lanes in lane
group (veh/h); SO = base saturation flow rate per lane (pc/h/ln); N = number of lanes in lane
group; fw = adjustment factor for lane width; fHV = adjustment factor for heavy vehicles in
traffic stream; fg = adjustment factor for approach grade; fp = adjustment factor for existence
of a parking lane and parking activity adjacent to lane group; fbb = adjustment factor for
blocking effect of local buses that stop within intersection area; fa = adjustment factor for area
type; fLU = adjustment factor for lane utilization; fLT = adjustment factor for left turns in lane
group; fRT = adjustment factor for right turns in lane group; fLpb = pedestrian adjustment
factor for left-turn movements; and fRpb = pedestrian-bicycle adjustment factor for right-turn
movements.
fw = 1 + (w − 3.6)/9 (37.6)
where, % HV = % heavy vehicles for lane group volume, ET = 2.0, % G = % grade on a lane
group approach
moving into and out of parking spaces. Each maneuver (either in or out) is assumed to block
traffic in the lane next to the parking maneuver for an average of 18 s.
where, Vg = unadjusted demand flow rate for lane group (veh/ h), Vg1 = unadjusted demand
flow rate on single lane with highest volume in the lane group and N = no. of lanes in the
group.
Ci = si × (gi/c) (37.12)
where ci = capacity of lane group i (veh/h), si = saturation flow rate for lane group i (veh/h)
and gi/C = effective green ratio for lane group i.
Table 37:2: Relation between arrival type (AT) and platoon ratio
AT Ration Default Rp Progression quality
1 ≤ 0.50 0.333 very poor
2 0.50-0.85 0.667 Unfavorable
3 0.85-1.15 1.000 Random arrivals
4 1.15-1.50 1.333 Favorable
5 1.50-2.00 1.667 Highly favorable
6 2.00 2.000 Exceptional
d = d1 (P F ) + d2 + d3
where, d = control delay per vehicle (s/veh); d1 = uniform control delay assuming uniform
arrivals (s/veh); PF = uniform delay progression adjustment factor, d2 = incremental delay to
account for effect of random arrivals and d3 = initial queue delay, which accounts for delay to
all vehicles in analysis period
(1 − P )fP A
PF = (37.15)
1 − ( Cg )
where, di = delay per vehicle for each movement (s/veh), dA = delay for Approach A (s/veh),
and vA = adjusted flow for Approach A (veh/h).
X X
d1 = dA × vA / vA
Table 37:5: LOS criteria for signalized intersection in term of control delay per vehicle (s/veh)
LOS Delay
A ≤ 10
B 10-20
C 20-35
D 35-55
E 55-80
F >80
approaches or exceeds 90 percent of the capacity for a lane group or an intersection approach.
The following graph shows the sensitivity of the predicted control delay per vehicle to demand
to capacity ratio, g/c, cycle length and length of analysis period. Assumptions are : Cycle
800
700
600
Delay (s/veh)
500
400
300
200
100
37.8 Conclusion
HCM model is very useful for the analysis of signalized intersection as it considers all the
adjustment factors which are to be taken into account while designing for a signalized I/S.
Though,the procedure is lengthy but it is simple in approach and easy to follow.
v/c=1.7
1200
Delay (s/veh)
1000
800
600
400
v/c=1.0
200
0 0
g/C
37.9 References
1. Highway Capacity Manual. Transportation Research Board. National Research Council,
Washington, D.C., 2000.
Chapter 38
38.1 Overview
This chapter covers basic aspects of traffic signal coordination. Signal coordination is done
when they are closely space to enable vehicle in one predominant direction to get continuous
green. This will reduce the delay and travel time in one direction and increases throughput.
The design principles of signal coordination will be presented in this chapter.
1. Benefits
The most complex signal plans require that all signals have the same cycle length. Fig. 38:1
illustrates path (trajectory) that a vehicle takes as time passes. At t = t1 , the first signal turns
second signal
t= $t_{2}$
Signal offset
signal green
yellow
red
First signal
$t_{1}$ Time
green. After some lag, the vehicle starts and moves down the street. It reaches the second
signal at some time t = t2 . Depending on the indication of that signal, it either continues or
stops. The difference between the two green initiation times is referred to as the signal offset, or
simply as the offset. In general, the offset is defined as the difference between green initiation
times, measured in terms of the downstream green initiation relative to the upstream green
initiation.
38.2.2 Benefits
It is common to consider the benefit of a coordination plan in terms of a cost or penalty function;
a weighted combination of stops and delay, and other terms as given here:
The object is to make this dis-benefit as small as possible. The weights A and B are coefficients
to be specified by the engineer or analyst. The values of A and B may be selected so as to reflect
the estimated economic cost of each stop and delay. The amounts by which various timing plans
reduce the cost, can then be used in a cost-benefit analysis to evaluate alternative plans. The
conservation of energy and the preservation of the environment have grown in importance over
the years. Given that the vehicles must travel, fuel conservation and minimum air pollution
are achieved by keeping vehicles moving as smoothly as possible at efficient speeds. This can
be achieved by a good signal-coordination timing plan. Other benefits of signal coordination
include, maintenance of a preferred speed, possibility of sending vehicles through successive
intersections in moving platoons and avoiding stoppage of large number of vehicles.
600
400
200
0 60 120
Time (sec)
• existence of substantial side frictions, including parking, loading, double parking, and
multiple driveways
600
400
200
0 60 120
Time (sec)
be best satisfied. For the objective of minimum delay, it is the offset that will cause minimum
delay. In Fig. 38:2, the ideal offset is 25 sec for that case and that objective. If it is assumed
that the platoon was moving as it went through the upstream intersection then the ideal offset
is given by
L
t(ideal) = (38.2)
S
where: t(ideal) = ideal offset,sec, L = block length, m, S = vehicle speed, mps.
1. The vertical should be scaled so as to accommodate the dimensions of the arterial, and
the horizontal so as to accommodate at least three to four cycle lengths.
2. The beginning intersection should be scaled first, usually with main street green initiation
at t=0, followed by periods of green and red.
3. The main street green of the next downstream signal should be located next, relative to
t=0 and at the proper distance from t he first intersection. With this point located, the
periods of green, yellow and red for this signal are filled in.
4. This procedure is repeated for all other intersections working one at a time.
Distance (m)
6 2000
5 1600
4 1200
point 3
3 800
Point 2
2 400
1 0
Point 1 60 120 180 240
Time (sec)
Distance (m)
6 2000
5 1600
4 1200
3 800
2 400
1 0
60 120 180 240
Time (sec)
Fig. 38:4 shows the time-space diagram for the illustration mentioned previously. Fig. 38:5
explores some features of the time-space diagram.
Distance (m)
6 2000
5 1600
4 1200
3 800
2 400
1 0
60 120 180 240
Time (sec)
$t_{NB}$
$t_{NB} + t_{SB} = C$
$L$
$C$ $2C$
$t_{SB}$
Figure 38:7: Offsets on 2 way arterial are not independent- One cycle length
Distance $2C$
$t_{NB}$
$L$
$t_{SB}$
$C$ $2C$
Figure 38:8: Offsets on 2 way arterial are not independent- Two cycle length
$N$
3 $B$ 2
$C$ $A$
4 $D$ 1
$N$
where the offsets are actual offsets, n is an integer and C is the cycle length. Any actual offset
can be expressed as the desired ideal offset, plus an error or discrepancy term:
1. the windows of green (through which platoons of vehicles can move) are easy visual images
for both working professionals and public presentations
4 600
3 400
2 200
1
0 60 120
Time (sec)
Distance
1500 vpl (m)
600m
N 2 lanes/directions
600m
V = 20m/s
600m
4
60 120 180
1500 vph
Time (sec)
New
3
4
60 120 180
Time (sec)
and somewhat elaborate manual techniques for establishing maximum bandwidths. Refer to
Fig. 38:11, which shows four signals and decent progressions in both the directions. For purpose
of illustration, assume it is given that a signal with 50:50 split may be located midway between
Intersections 2 and 3. The possible effect as it appears in Fig. 38:12 is that there is no way to
include this signal without destroying one or the other through band, or cutting both in half.
The offsets must be moved around until a more satisfactory timing plan develops. A change in
cycle length may even be required. The changes in offset may be explored by:
• cutting the copy horizontally into strips, one strip per intersection
• placing a guideline over the strips, so as to indicate the speed of the platoon(s) by the
slope of the guideline
• sliding the strips relative to each other, until some improved offset pattern is identified
There is no need to produce new strips for each cycle length considered: all times can be made
relative to an arbitrary cycle length ‘C. The only change necessary is to change the slope(s) of
the guidelines representing the vehicle speeds. The northbound vehicle takes 3600/60 = 60sec
to travel from intersection 4 to intersection 2. If the cycle length C = 120sec, the vehicle would
have arrived at intersection 2 at C/2, or one half of the cycle length. To obtain a good solution
through trial-and-error attempt, the following should be kept in consideration:
• If the green initiation at Intersection 1 comes earlier, the southbound platoon is released
sooner and gets stopped or disrupted at intersection 2.
• Nor can intersection 3 help the southbound without harming the northbound.
• The system cycle length should be specified based primarily on the geometry and platoon
speed whenever possible, to enhance progressions.
• The task of good progression in both directions becomes easy if an appropriate combina-
tion of cycle length, block length and platoon speed exist.
• In considering the installations of new signals on existing arterial, the same care should
be taken to preserve the appropriate combinations and/or to introduce them.
• streets that can be treated as one-way, due to the actual or desired flow patterns
• larger grids in which streets interact because they form unavoidable closed trees and are
each important in that they cannot be ignored for the sake of establishing a master grid
which is an open tree
• smaller grids in which the issue is not coordination but local land access and circulation
Downtown grids might well fall into the last category, at least in some cases. Third, attention
should focus on the combination of cycle length, block length and platoon speed and their
interaction. Fourth, if the geometry is not suitable, one can adapt and fix up the situation to
a certain extent. Another issue to address, of course, is whether the objective of progressed
movement of traffic should be maintained.
• Update the signalization, for poor signalization is frequently the cause of what looks like
an incurable problem
• If the problem persists, use novel signalization to minimize the impact and spatial extent
of the extreme congestion.
38.7 Summary
The concept of signal coordination is presented in this chapter. Coordination in one way is
simple and effective and results in better progression. Two-way coordination is complex and
less effective. Bandwidth is an important parameter in evaluating the efficiency of coordination.
Further, the concepts of forward and reverse progression are introduced.
38.8 References
1. William R McShane, Roger P Roesss, and Elena S Prassas. Traffic Engineering. Prentice-
Hall, Inc, Upper Saddle River, New Jesery, 1998.
Chapter 39
39.1 Introduction
Now-a-days, controlling traffic congestion relies on having an efficient and well-managed traffic
signal control policy. Traffic signals operate in either pre-timed or actuated mode or some com-
bination of the two. Pre-timed control consists of a series of intervals that are fixed in duration.
They repeat a preset constant cycle. In contrast to pre-timed signals, actuated signals have
the capability to respond to the presence of vehicles or pedestrians at the intersection. Actu-
ated control consists of intervals that are called and extended in response to vehicle detectors.
The controllers are capable of not only varying the cycle length & green times in response to
detector actuation, but of altering the order and sequence of phases. Adaptive or area traf-
fic control systems (ATCS) belong to the latest generation of signalized intersection control.
ATCS continuously detect vehicular traffic volume, compute optimal signal timings based on
this detected volume and simultaneously implement them. Reacting to these volume variations
generally results in reduced delays, shorter queues and decreased travel times. Coordinating
traffic signals along a single route so that vehicles get progressive green signal at each junction
is another important aspect of ATCS. In the subsequent pages, the operating principles and
features of Vehicle-Actuated Signals & Area Traffic Control Systems will be briefly discussed.
by-cycle basis. Timing of the signals is controlled by traffic demand. Actuated controllers may
be programmed to accommodate:
Such variability allows the signal to allocate green time based on current demands and opera-
tions. A proper clearance interval between the green & the red phases is also ensured.
• If traffic demand pattern is very regular, the extra benefit of adding local actuation is
minimal, perhaps non-existent.
• Installation cost is two to three times the cost of a pre-timed signal installation.
• Actuated controllers are much more complicated than pre-timed controllers, increasing
maintenance costs.
1. Semi-Actuated Control
2. Full-Actuated Control
3. Volume-Density Control
Semi-Actuated Control
This type of controller is used at intersections where a major street having relatively uniform
flow is crossed by a minor street with low volumes. Detectors are placed only on the minor
street. The green is on the major street at all times unless a call on the side street is noted. The
number and duration of side-street green is limited by the signal timing and can be restricted
to times that do not interfere with progressive signal-timing patterns along the major street.
Full-Actuated Control
This type of controller is used at the intersections of streets or roads with relatively equal
volumes, but where the traffic distribution is varying. In full actuated operation, all lanes of
all approaches are monitored by detectors. The phase sequence, green allocations, and cycle
length are all subjected to variation. This form of control is effective for both two-phase and
multi-phase operations and can accommodate optional phases.
Volume-Density Control
Volume-density control is basically the same as full actuated control with additional demand-
responsive features. It is designed for intersections of major traffic flows having considerable
unpredictable fluctuations.
• Magnetometer detectors
• Magnetic detectors
• Pressure-sensitive detectors
• Radar detectors
• Sonic detectors
The vast majority of actuated signal installations use inductive loops for detection purpose.
Now, the type of detection is of greater importance than the specific detection device(s) used.
There are two types of detection that influence the design and timing of actuated controllers:
1. Passage or Point Detection:- In this type of detection, only the fact that the detector
has been disturbed is noted. The detector is installed at a point even though the detector
unit itself may involve a short length. It is the most common form of detection.
2. Presence or Area Detection:- In this type of detection, a significant length (or area)
of an approach lane is included in the detection zone. Entries and exits of vehicles into
and out of the detection zone are remembered. Thus, the number of vehicles stored in
the detection zone is known. It is provided by using a long induction loop, or a series of
point detectors. These are generally used in conjunction with volume-density controllers.
Each actuated phase has a minimum green time, which serves as the smallest amount of green
time that may be allocated to a phase when it is initiated. Minimum green times must be set for
each phase in an actuated signalization, including the non-actuated phase of a semi-actuated
controller. The minimum green timing on an actuated phase is based on the type and location
of detectors.
where, Gmin = minimum green time in second, tL = assumed start-up lost time = 4 sec,
h = assumed saturation headway = 2 sec, d = distance between detector & stop line in
m and x = assumed distance between stored vehicles = 6 m.
Unit Extension
1. It represents the maximum gap between actuation at a single detector required to retain
the green.
2. It is the amount of time added to the green phase when an additional actuation is received
within the unit extension, U.
3. It must be of sufficient length to allow a vehicle to travel from the detector to the STOP
line.
In terms of signal operation, it serves as both the minimum allowable gap to retain a green
signal and as the amount of green time added when an additional actuation is detected within
the minimum allowable gap. The unit extension is selected with two criteria in mind:
• The unit extension should be long enough such that a subsequent vehicle operating in
dense traffic at a safe headway will be able to retain a green signal (assuming the maximum
green has not yet been reached).
• The unit extension should not be so long that straggling vehicles may retain the green or
that excessive time is added to the green (beyond what one vehicle reasonably requires
to cross the STOP line on green).
The Traffic Detector Handbook recommends that a unit extension of 3.0 s be used where
approach speeds are equal to or less than 30 mile per hour, and that 3.5 s be used at higher
approach speeds. For all types of controllers, however, the unit extension must be equal to or
more than the passage time.
It allows a vehicle to travel from the detector to the stop line. It is analogous with ’Unit
Extension’.
P = (d/S) (39.3)
where, P = passage time, sec, d = distance from detector to stop line, meter and S = approach
speed of vehicles, m/s.
Each phase has a maximum green time that limits the length of a green phase, even if there are
continued actuation that would normally retain the green. The maximum green time begins
when there is a call (or detector actuation) on a competing phase. The estimation can be done
by any of the following methods:
where, Ci = Initial cycle length, sec, L = Total lost time, sec and VC = Sum of critical
lane volumes, veh/hr. Knowing the initial cycle length, green times are then determined
as:
VCi
gi = (Ci − L) ∗ (39.5)
VC
where gi = effective green time for Phase i, sec and VCi = critical lane volume for Phase
i, veh/hr. The effective green times thus obtained are then multiplied by 1.25 or 1.50 to
determine the maximum green time.
The basic principle underlying all signal timing analysis is the queue accumulation polygon
(QAP), which plots the number of vehicles queued at the stop line over the duration of the
cycle. The QAP for a simple protected movement is illustrated in the Fig. 39:1. From Fig. 39:1,
it’s clear that queue accumulation takes place on the left side of the triangle (i.e., effective red)
and the discharge takes place on the right side of the triangle (i.e., effective green).
Red Green
0
Time (s)
Green extension time
Figure 39:1: Queue accumulation polygon illustrating two methods of green time computation
There are two methods of determining the required green time given the length of the
previous red time. The first employs a target v/c approach. Under this approach, the green-
time requirement is determined by the slope of the line representing the target v/c of 0.9. If
the phase ends when the queue has dissipated under these conditions, the target v/c will be
achieved. The second method recognizes the way a traffic-actuated controller really works.
It does not deal explicitly with v/c ratios; in fact, it has no way of determining the v/c
ratio. Instead it terminates each phase when a gap of a particular length is encountered at the
detector. Good practice dictates that the gap threshold must be longer than the gap that would
be encountered when the queue is being served. Assuming that gaps large enough to terminate
the phase can only occur after the queue service interval (based on v/c = 1.0), the average
green time may be estimated as the sum of the queue service time and the phase extension
time. Therefore, average green time = Queue Service Time + Phase Extension Time. Now,
fq qr r
Queue Service Time(gS ) = (39.6)
(s − qg )
where, qr = red arrival rate (veh/s), qg = green arrival rate (veh/s), r = effective red time (s), s =
saturation flow rate (veh/s) and fq = calibration factor = 1.08 - 0.1(actual green time/maximum green tim
where, q = vehicle arrival rate throughout cycle (veh/s), u = unit extension time setting (s),
t = time during which detector is occupied by a passing vehicle(s) = [3.6(Ld + Lv )]/SA , Lv
= Vehicle length, assumed to be 5.5 m, Ld = Detector length (m), SA = Vehicle approach
speed (kmph), ∆ = minimum arrival (intra-bunch) headway (s), λ = a parameter (veh/s) =
Φq/(1 − ∆q), Φ = proportion of free (unbunched) vehicles in traffic stream = exp(−b∆q) and
b = bunching factor.
This green-time estimation model is not difficult to implement, but it does not lead directly
to the determination of an average cycle length or green time because the green time required
for each phase is dependent on the green time required by the other phases. Thus, a circular
dependency is established that requires an iterative process to solve. With each iteration, the
green time required by each phase, given the green times required by the other phases, can be
determined. The logical starting point for the iterative process involves the minimum times
specified for each phase. If these times turn out to be adequate for all phases, the cycle length
will simply be the sum of the minimum phase times for the critical phases. If a particular
phase demands more than its minimum time, more time should be given to that phase. Thus,
a longer red time must be imposed on all of the other phases. This, in turn, will increase the
green time required for the subject phase.
Recall Switch
Each actuated phase has a recall switch. The recall switches determine what happens to the
signal when there is no demand. Normally, one recall switch is placed in the on position, while
all others are turned off. In this case, when there is no demand present, the green returns to
the phase with its recall switch on. If no recall switch is in the on position, the green remains
on the phase that had the last ”call.”demand exists, one phase continues to move to the next
at the expiration of the minimum green.
Yellow and all-red intervals provide for safe transition from green to red. They are fixed times
and are not subject to variation, even in an actuated controller. They are found in the same
manner as for pre-timed signals.
ar = (w + l)/S15 (39.9)
maximum green
minimum extensible portion
green
1111111111
0000000000
0000000000 111
1111111111 000
000
111
000 00
111 11
00
11
000
111
00 111
11
000
111
000000
111000
111
000
111 11
00
00 000
11 111
000
111
000000
111 111
000
111
000 00
111 11
00
11
00
11
where, y = yellow time, sec, ar = all red interval, sec, S85 = 85th percentile speed, m/s, S15 =
15th percentile speed, m/s, t = reaction time of the driver = 1 sec (standard), a = deceleration
rate = 3 m/s2 (standard), g = grade of approach in decimal, w = width of street being crossed,
m and l = length of a vehicle, m.
The maximum green begins timing out when a call on a competing phase is noted. During the
most congested periods of flow, however, it may be assumed that demand exists more or less
continuously on all phases. The maximum green, therefore, begins timing out at the beginning
of the green period in such a situation. Now-a-days, in India, detectors are placed mostly at
stop lines. In that case, the green times for phases are primarily determined by arrival headway.
The green time is extended until the gap between two vehicles becomes equal to or greater than
the pre-determined threshold value. Generally threshold of 4 seconds is considered.
• The green remains on the main street until a call for service on the side street is registered.
• If the main street has had enough green, the side street is given the green for just enough
time to guarantee that its vehicles are processed.
Side
Street
Stop line
Advantages
• Relative to pre-timed control, it reduces the delay incurred by the major-road through
movements during periods of light traffic.
• It does not require detectors for the major-road through movement phases and hence, its
operation is not compromised by the failure of these detectors.
• Generally the main street indeed has the green whenever possible.
Disadvantages
• Continuous demand on the phases associated with one or more minor movements can
cause excessive delay to the major road through movements if the maximum green and
passage time parameters are not appropriately set.
• Detectors must be used on the minor approaches, thus requiring installation and ongoing
maintenance.
• It also requires more training than that needed for pre-timed control.
Detector
• Green interval is extended by a preset unit extension for each actuation after the initial
interval provided a gap greater than the unit extension does not occur.
Advantages
• Reduces delay relative to pre-timed control by being highly responsive to traffic demand
and to changes in traffic pattern.
• Allows phases to be skipped if there is no call for service, thereby allowing the controller
to reallocate the unused time to a subsequent phase.
Disadvantages
• Initial and maintenance cost is higher than that of other control types due to the amount
of detection required.
• It may also result in higher percentage of vehicles stopping because green time is not held
for upstream platoons.
Solution: Step 1: Phasing: The problem statement indicates that protected left-
turn phasing will be implemented on all approaches. Note that Kennedy Avenue
has double left-turn lanes in each direction and that Monroe Street has a single
left-turn lane in each direction. At a heavily utilized intersection such as this,
quad-eight phasing would be desirable. Each street would have an exclusive LT
phase followed by a leading green in the direction of heavier LT flow and a TH/RT
700 100
Kennedy Avenue
1500
300 36 m
400
1600
110 650
16 m
phase. Such phasing provides much flexibility in that LT phasing is always optional
and can be skipped in any cycle in which no LT demand is noted. The resulting
signalization has a maximum of four phases in any given cycle and a minimum of
two. It is treated as a four-phase signal, as this option leads to the maximum lost
times. Quad-eight phasing involves overlaps that would be taken into account if
this were a pre-timed signal. As an actuated signal, the worst-case cycle, however,
would occur when there are no overlap periods. This would occur when the LT flow
in opposing directions are equal. Thus, the signal timing will be considered as if
this were a simple four-phase operation without overlaps. The controller, however,
will allow one protected LT to be terminated before the opposing protected LT,
creating a leading green phase. The four phases are:
all approaches (including LT approaches) have a 64 kmph approach speed, the far
end of detectors should be located as follows:
U = 3.5 = P = d/(64/3.6)
d = 3.5 ∗ (64/3.6) = 62.22 ≈ 62m
The near end of the detection zone would be placed within 0.3 m of the STOP
line. The minimum green time for area detection is variable, based on the number
of vehicles sensed within the detection area when the green is initiated. The
value can vary from the time needed to service one waiting vehicle to the time
needed to service Int(62/6) = 11 vehicles. The range of minimum green times
can be established for each approach. In this case, all values will be equal, as
the approach speeds are the same for all approaches and the detector location is
common to every approach, including the LT lanes, all of which are long enough
to accommodate a 62 m setback.
Step 4: Critical-Lane Volumes: As the volumes given have already been con-
verted to tvus, critical-lane volumes for each phase are easily identified:
There are four phases in the worst-case cycle. The total lost time is equal to the
sum of the yellow and all-red intervals in the cycle: L = 2*5.8 + 2*7.0 = 25.6 sec.
Step 6: Maximum Green Times and the Critical Cycle: The initial cycle length
for determining maximum green time is: Ci = 25.6/[1-1060/(1615*0.96*0.98)] =
84.8 sec. Green times are found as:
With area detection, the minimum green for all lane groups, including LT lanes,
can be as high as 24.0 s. This is inconsistent with Gmax values for the LT Phases
1 and 3. Increasing the maximum greens beyond the computed values, however,
will lead to an excessively long critical cycle length. Thus, it is recommended that
the LT lanes use point detectors, placed so that the Gmin for Phases 1 and 3 is a
constant 4.0 s. The above Gmax results will work in this scenario. The Gmax results
for Phases 2 and 4 (through phases) are close to the high value of Gmin for these
phases, but would provide some flexibility even in peak periods. It is, therefore,
not recommended that any of these times be arbitrarily increased. The critical
cycle length becomes: CC = 16.8 + 5.8 + 33.5 + 5.8 + 9.2 + 7.0 + 29.3 + 7.0 =
114.4 sec
Solution: The maximum phase time for each phase will be (46 + 4) = 50 s. The
minimum phase time will be 10 + 3 + 4 = 17 s. The first iteration will be used
with a 34-s cycle with 17 s of green time on each approach. The effective green time
will be 14 s, and the effective red time will be 20 s for each phase. For purposes
of traffic-actuated timing estimation It is recommended (HCM 2000) that, for a
specified lost time of n seconds, 1 s be assigned to the end of the phase and (n - 1)
s be assigned to the beginning. Here, start-up lost time = 2.0 secs. The following
are the steps to calculate the phase time required:
Step 1. Compute the arrival rate throughout the cycle, q: q = 675/3600 =
0.188 veh/s
Step 2. Compute the net departure rate (saturation flow rate - arrival rate): (s
- q) =1800/3600- 0.188 = 0.312 veh/s
Step 3.Compute the queue at the end of 20 s of effective red time: qr r = 20 ×
(0.188) = 3.760veh
Step 4. Compute the queue calibration factor,fq : fq = 1.08 − 0.1(13/46)2 = 1.072
Step 5. Compute the time required to serve the queue, gs : gs = 1.072(3.760/0.312) =
12.919s
Step 6. Determine λ: ∆ = 1.5 and b = 0.6 (for single lane from table in HCM)
Φ = e−b∆q
= e−(0.6×1.5×0.188) = 0.844
λ = Φq/(1 − ∆q)
= (0.844)(0.188)/1 − (1.5)(0.188)
= 0.221
G = l1 + gs + ge + Y
G = 2.0 + 12.919 + 6.550 + 4.0 = 25.469s
Step 10. Compute the phase time deficiency as the difference between the trial
phase time and the computed phase time: or 25.469 - 17.0 = 8.469 s. For next
iteration: Trial green time = 25.469 s. Cycle length = 50.968 s. This process is
continued through successive iterations until the solutions converge or the phase
deficiency i.e. the error is negligible practically. The following figure shows the
results of successive iterations for this problem and the final convergence. The
Phase time deficiency
Computed phase time
0.289 0.157 0.0590.012 0.007
40 0.547
0.992
1.771
3.089
5.230
30
8.469
Phase Time (s)
20
Minimum = 17 s
10
0
1 2 3 4 5 6 7 8 9 10 11
Iteration Number
final phase time is 37.710 s giving a cycle length of 75.420 s. The convergence was
considered for threshold of 0.1 difference in successive cycle times.
39.3 Conclusion
Modern actuated controllers give the traffic engineers a great deal of flexibility in
dealing with variations in demand. Area traffic control system along with Vehicle
actuated signals can reduce traffic delays substantially. These are highly complex
subject. Timing of VA signals is almost as much an art as a science, and more then
one solution is possible. Regarding ATC systems, SCOOT and SCAT are popular in
advance countries but such systems cannot cope up with Indian situations without
adaptation to Indian traffic scenario. Presently, an advance ATC system known as
CoSiCoSt has been developed considering the Indian Traffic scenario.
39.4 References
1. Highway Capacity Manual. Transportation Research Board. National Re-
search Council, Washington, D.C., 2000.
Chapter 40
40.1 Introduction
ATC systems are intelligent real-time dynamic traffic control systems which are designed to
effectively respond to rapid variations in dynamic traffic conditions. It is an advanced process
to control the traffic. It is a traffic responsive system that use data from vehicle detectors
and optimize traffic signal time in real time. The timing plan of traffic controllers changed
automatically. The technique employs digital computers for achieving the desired objective.
1. Ability to update signals from a Central Location: The ability to retime signals from
a central location without having to send people along an entire arterial to retime the
signals individually at each intersection saves lot of time.
2. Ability to have multiple plans and special plans: In many localities a three-dial controller
is quite sufficient: if traffic is generally regular, three basic plans (A.M. peak, P.M. peak,
computer pattern
y
4 1
Traffic data
Operator
off-peak) can meet the needs. The computer opens the possibility to have an N-dial
controller, with special plans stored for certain days. With appropriate plans stored for
each such event, the plans can be called up by time of day, or by operator intervention.
3. Information on equipment failures: The early systems simply took control of electro-
mechanical controllers, driving the cam-shaft from the central computer and receiving
a confirmation signal. Failure to receive this signal meant trouble. The information
provided by the control computer allowed such failures to be detected and repair crews
dispatched.
4. Performance data on contractor or service personnel: With a failure detected and noti-
fication made, the system can log the arrival of the crew and/or the time at which the
intersection is returned to active service.
Collection of traffic data The ability of a computer to receive great amount of data and
process it is made use of by detectors in the field for sending information back to the central
location. If the information is not being used in an “online” setting and hence still does not
influence the current plan selection. Typically, the computer is being used as the tool for the
collection of permanent or long-term count data.
Traffic data used for plan selection Fig. 40:1 shows a computer control system that
actually uses the traffic data to aid in plan selection. This can be done in one of three principal
ways:
1. Use library - Monitor deviations from expected pattern: This concept uses a time-of-day
approach, looking up in a library both the expected traffic pattern and the preselected plan
matched to the pattern. The actual traffic pattern can be compared to the expected, and if a
deviation occurs, the computer can then look through its library for a closer match and use the
appropriate plan.
2. Use library - Match plan to pattern: This is a variation on the first concept, with the observed
pattern being matched to the most appropriate pre-stored pattern and the corresponding plan
being used.
3. Develop plan on-line: This concept depends on the ability to do the necessary computations
within a deadline either as a background task or on a companion computer dedicated to such
a computations. This approach presumes an advantage to tailoring the control plan to specific
traffic data.
It is necessary to note that the time between plan updates is constrained by the speed with
which the on-line plan computations can be done. The desire to have more frequent updates
implicitly assumes that the real traffic situation can be known precisely enough to differentiate
between consecutive update periods.
40.2.1 Advantages
The various Advantages of an area traffic control system are
• Minimizing journey time for vehicles- Are traffic control system minimize the overall
journey time by reducing the no of stop delays, increasing the average travel speed etc.
• Reducing accidents- Are traffic control system reduces the no of accident by reducing
the congestion as congestion is less the traffic flow will be smooth so accident also will be
less.
• Increasing average saving in fuel- As we discussed above that it will minimize the
journey time, accident, congestion, stop delays so we can easily say that average saving
in fuel will increase and traffic flow also will be safe and smooth.
40.2.2 Disadvantages
The various disadvantages of an area traffic control system are
• Very costly- Area traffic control is a very advanced traffic control strategy it involve
very advanced technology and highly skilled persons to operate the system to control the
traffic which makes it very costly.
• Very complex- Area traffic control system is a very big system which includes many
unites in it like Vehicle Detectors, Intersection Controller, Communication Network, Ap-
plication Software, Central (Regional) Control System. These unit is use to perform
different-different task for the system. These unit and task make it very complex.
• Suitable only for lane following traffic- In area traffic control system we use vehicle
detector to collect the data to find the actual flow and to get signal timing according to
the present condition of traffic. These vehicle detectors detect the vehicle on the basis of
lane. For example we are collecting data for tow lane road then the detectors will able
to detect the vehicle which will come from their respective lane and the vehicle which is
using space other than these two lanes cannot be detected. So data will not be accurate.
So we can say that it will give best result only for lane following traffic.
formation to the signal controller as per the data processed. It transfers the data obtained
from detectors to central control which then implements the signal timings as instructed at the
intersection. Fig. 40:3 is showing the communication network.
Central
Controller
Decision Data
Intersection
Controller
Signal Vehicle
Hardware Detector
Decision Data
Figure 40:4: Area traffic control architecture (Source: Pitu B. Mirchandani, K. Larry
Head,1998)
value. Some examples of operational models are SCOOT, SCAT and OPAC which are described
below.
Principles of SCOOT
2. Queue Estimation
It is necessary to predict new signal timing due to the queues after alteration according
to the situation after knowing CFP, the computer can be programmed to estimate no
of vehicles which will reach the downstream signals during red phase. So size of the
queue and duration to clear the queue can be calculated. In this calculation it is assumed
that the traffic platoons travel at a known cruising speed with some dispersion. Queues
discharge during the green time at a saturation flow rate that is known and constant for
each signal stop line.
3. Incremental Optimization
Incremental Optimization is done to measure the coordination plan that it is able to
respond to new traffic situations in a series of frequent, but small, increments. It is
necessary because research shows that prediction of traffic flow is very difficult for next
few minutes. SCOOT split optimizer calculates whether it is good to advance or retard
the scheduled change by up to 4 s, or to leave it unaltered. It is achieved by split
optimization, offset optimization, cycle time.
Scoot system consists of a number of SCOOT cells or computers, each cell can control up
to 60 junctions and handling input data from up to 256 vehicle counting detectors on street.
SCOOT detectors are placed at 14 m from the stop-line, from the approach to the junction as
possible. Fig. 40:6 clearly shows the working principle of SCOOT where the detectors placed
upstream sense the occupancy and the information is transmitted to the central computer.
SCOOT traffic model and optimizers use this information to calculate signal timings to achieve
the best overall compromise for coordination along all links in the SCOOT area. The main aim
On line
Queue traffic
11
00 Stopline model
00
11
Red
Signal
optimiser
Split
cycle Peak period
offset
Successive
cycles
Figure 40:5: Key elements of the SCOOT ATC system (Source: Dennis I. Robertson and R.
David Bretherton 1991)
10
Vehicle detector
1010
11
00 1010
00
11
00
11
00
11
Data network
Signal Queue
Optimiser estimater
Operator I/O
Online Computer
of the SCOOT traffic signal control system is to react to changes in observed average traffic
demands by making frequent, but small, adjustments to the signal cycle time, green allocation,
and offset of every controlled intersection. For each coordinated area, the system evaluates
every 5 minutes, or 2.5 minutes if appropriate, whether the common cycle time in operation at
all intersections within the area should be changed to keep the degree of saturation of the most
heavily loaded intersection at or below 90%. In normal operation SCOOT estimates whether
any advantage is to be gained by altering the timings. Fig. 40:6 is showing the working principle
of SCOOT. From above fig we can have an idea that vehicle will be detected with the help of
vehicle detector. The collected data will be send to intersection controller after that it will be
send to the central controller with the help of communication network. There it will be use to
estimate the signal timing according to the actual traffic flow needs. Then the central controller
Features of SCOOT
2. Diversions
This feature is provided to deal with any emergency situation for example if any problem
is found out in any lane which is found out with the help of Fault Identification &
Management unit then traffic will be diverted from that lane to another lane.
Limitations
1. Inability to handle closely spaced signals due to its particular detection configuration
requirements, its require some time to detect vehicle.
4. Primarily designed to react to long-term, slow variations in traffic demand, and not to
short-term random fluctuations.
Figure 40:7: Shows the SCAT Computer Hierarchy (Source: Lowrie, 1982)
has a library of plans that it selects from and therefore banks extensively on available traffic
data.
Working Principle
The system is very flexible, powerful, expandable, and yields unprecedented monitoring and
management possibilities. The total system is divided into intersection, regional and a central
system management. Distribution of the regional computers is determined by the economics
of communication. Each regional computer maintains autonomous control of its region. Input
data is collected by a system of traffic sensors. Sensors may be inductive loop detectors em-
bedded in the pavement or video image devices mounted overhead on the signal strain poles.
The system is designed to auto calibrate itself according to the data received, to minimize the
need for manual calibration and adjustment. Fig. 40:7 shows the SCAT Computer Hierarchy.
2. Fall-Back Mode- Implement the time plans when computer or communication failure
occurs
Benefits of SCAT
1. Travel time and accident reduction, saving in fuel consumption, and reduces air pollution.
2. It replaces the manual collection of data which are required for road Planning.
Limitations
2. The error messages are not easy to read & do not provide the opportunity for corrective
actions by system operators.
Feature of OPAC
2. Algorithm uses measured and modeled demand to determine phase distribution at each
signal that are constrained by minimum and maximum green time.
Limitation
2. Its performance varies with traffic saturation condition. Better in under saturated traffic
conditions.
40.6 Conclusion
Area traffic control system can reduce traffic delays, fuel consumption, accident, congestion,
travel time, environmental pollution substantially and can increase average flow speed. Re-
garding ATC systems, SCOOT, SCAT and OPAC are popular in advanced countries but such
systems cannot cope up with Indian situations because in India traffic is not lane following,
highly mixed traffic, uncontrolled side road and on-street parking, Data loss due to power failure
and Availability of funds.
40.7 References
1. Christina M Andrews, S Manzur Elahi, and James E Clark. Evaluation of New Jer-
sey Route 18 OPAC/MIST Traffic-Control System. TRANSPORTATION RESEARCH
RECORD 1603, 2019.
2. Pitu B Mirchandani K Larry Head. A real-time traffic signal control system: architecture,
algorithms, and analysis. 1998.
3. William R McShane, Roger P Roesss, and Elena S Prassas. Traffic Engineering. Prentice-
Hall, Inc, Upper Saddle River, New Jesery, 1998.
5. A G Sims and K W Dobinson. The sydney coordinated adaptive traffic (scat) system
philosophy and benefits, 1980.
Chapter 41
Parking Studies
41.1 Overview
Parking is one of the major problems that is created by the increasing road traffic. It is an
impact of transport development. The availability of less space in urban areas has increased
the demand for parking space especially in areas like Central business district. This affects the
mode choice also. This has a great economical impact.
1. Parallel parking: The vehicles are parked along the length of the road. Here there is
no backward movement involved while parking or unparking the vehicle. Hence, it is the
most safest parking from the accident perspective. However, it consumes the maximum
curb length and therefore only a minimum number of vehicles can be parked for a given
kerb length. This method of parking produces least obstruction to the on-going traffic on
the road since least road width is used. Parallel parking of cars is shown in figure 41:1.
N
The length available to park N number of vehicles, L = 5.9
2. 30◦ parking: In thirty degree parking, the vehicles are parked at 30◦ with respect to the
road alignment. In this case, more vehicles can be parked compared to parallel parking.
5.0
A B CD E
30
O .... n 4.66 m
1Q 2
P
5m
m
5
2.
Also there is better maneuverability. Delay caused to the traffic is also minimum in this
type of parking. An example is shown in figure 41:2. From the figure,
AB = OBsin30◦ = 1.25,
BC = OP cos30◦ = 4.33,
BD = DQcos60◦ = 5,
CD = BD − BC = 5 − 4.33 = 0.67,
AB + BC = 1.25 + 4.33 = 5.58
3. 45◦ parking: As the angle of parking increases, more number of vehicles can be parked.
Hence compared to parallel parking and thirty degree parking, more number of vehicles
can be accommodated in this type of parking. From figure 41:3, length of parking space
available for parking N number of vehicles in a given kerb is L = 3.54 N+1.77
4. 60◦ parking: The vehicles are parked at 60◦ to the direction of road. More number of
vehicles can be accommodated in this parking type. From the figure 41:4, length available
for parking N vehicles =2.89N+2.16.
5. Right angle parking: In right angle parking or 90◦ parking, the vehicles are parked
perpendicular to the direction of the road. Although it consumes maximum width kerb
5.
0
m
m
5
2.
Figure 41:3: Illustration of 45◦ parking
60
2.5m
length required is very little. In this type of parking, the vehicles need complex maneu-
vering and this may cause severe accidents. This arrangement causes obstruction to the
road traffic particularly if the road width is less. However, it can accommodate maximum
number of vehicles for a given kerb length. An example is shown in figure 41:5. Length
available for parking N number of vehicles is L = 2.5N.
2.5
Figure 41:5: Illustration of 90◦ parking
parking. They may be operated by either public agencies or private firms. A typical layout of
an off-street parking is shown in figure 41:6.
1. Congestion: Parking takes considerable street space leading to the lowering of the road
capacity. Hence, speed will be reduced, journey time and delay will also subsequently
increase. The operational cost of the vehicle increases leading to great economical loss to
the community.
2. Accidents: Careless maneuvering of parking and unparking leads to accidents which are
referred to as parking accidents. Common type of parking accidents occur while driving
out a car from the parking area, careless opening of the doors of parked cars, and while
bringing in the vehicle to the parking lot for parking.
3. Environmental pollution: They also cause pollution to the environment because stop-
ping and starting of vehicles while parking and unparking results in noise and fumes. They
also affect the aesthetic beauty of the buildings because cars parked at every available
space creates a feeling that building rises from a plinth of cars.
4. Obstruction to fire fighting operations: Parked vehicles may obstruct the movement
of firefighting vehicles. Sometimes they block access to hydrants and access to buildings.
2. Parking volume: Parking volume is the total number of vehicles parked at a given
duration of time. This does not account for repetition of vehicles. The actual volume of
vehicles entered in the area is recorded.
3. Parking load : Parking load gives the area under the accumulation curve. It can also
be obtained by simply multiplying the number of vehicles occupying the parking area at
each time interval with the time interval. It is expressed as vehicle hours.
4. Average parking duration: It is the ratio of total vehicle hours to the number of
vehicles parked.
parking load
parking duration = (41.1)
parking volume
5. Parking turnover: It is the ratio of number of vehicles parked in a duration to the
number of parking bays available. This can be expressed as number of vehicles per bay
per time duration.
parking volume
parking turnover = (41.2)
no. of bays available
6. Parking index: Parking index is also called occupancy or efficiency. It is defined as the
ratio of number of bays occupied in a time duration to the total space available. It gives
an aggregate measure of how effectively the parking space is utilized. Parking index can
be found out as follows
parking load
parking index = × 100 (41.3)
parking capacity
Numerical Example
To illustrate the various measures, consider a small example in figure 41:7, which shows the
duration for which each of the bays are occupied(shaded portion). Now the accumulation graph
can be plotted by simply noting the number of bays occupied at time interval of 15, 30, 45 etc.
minutes is shown in the figure. The various measures are calculated as shown below: Parking
11111
00000
00000
11111 00000
11111
00000
11111
1
00000
11111 11111111
00000000
00000
11111
00000000
11111111
2
00000
11111 00000000
11111111
000000
111111
3
00000
11111 000000
111111
Bays and occupancy
No. of vehicles
3
2
1
Numerical Example
From an in-out survey conducted for a parking area consisting of 40 bays, the initial count was
found to be 25. Table gives the result of the survey. The number of vehicles coming in and
out of the parking lot for a time interval of 5 minutes is as shown in the table 41:1. Find the
accumulation, total parking load, average occupancy and efficiency of the parking lot.
• Accumulation can be found out as initial count plus number of vehicles that entered the
parking lot till that time minus the number of vehicles that just exited for that particular
time interval. For the first time interval of 5 minutes, accumulation can be found out as
25+3-2 = 26. It is being tabulated in column 4.
• Occupancy or parking index is given by equation For the first time interval of five min-
26
utes, P arking index = 40 × 100 = 65%. The occupancy for the remaining time slot is
similarly calculated and is tabulated in column 5. Average occupancy is the average of
the occupancy values for each time interval. Thus it is the average of all values given in
column 5 and the value is 80.63%.
• Total parking load is the summation of all the values in column 5 which is equal to 1935
vehicle minutes or 32.25 vehicle hours
Numerical Example
The parking survey data collected from a parking lot by license plate method is s shown in
the table 41:3 below. Find the average occupancy, average turn over, parking load, parking
capacity and efficiency of the parking lot.
Solution See the following table for solution 41:4. Columns 1 to 5 is the input data. The
parking status in every bay is coded first. If a vehicle occupies that bay for that time interval,
then it has a code 1. This is shown in columns 6, 7, 8 and 9 of the table corresponding to the
time intervals 15, 30, 45 and 60 seconds.
• Turn over is computed as the number of vehicles present in that bay for that particular
hour. For the first bay, it is counted as 3. Similarly, for the second bay, one vehicle is
present throughout that hour and hence turnout is 1 itself. This is being tabulated in
Sum of turn−over
column 10 of the table. Average turn over = Total number of bays
= 2.25
• Accumulation for a time interval is the total of number of vehicles in the bays 1 to 12 for
that time interval. Accumulation for first time interval of 15 minutes = 1+1+1+1+1+0+0+1+1+1+1
= 10
• Parking volume = Sum of the turn over in all the bays = 27 vehicles
• Average duration is the average time for which the parking lot was used by the vehicles.
It can be calculated as sum of the accumulation for each time interval × time interval
divided by the parking volume = (10+11+9+11)×15
27
= 22.78 minutes/vehicle.
• Occupancy for that time interval is accumulation in that particular interval divided by
total number of bays. For first time interval of 15 minutes, occupancy = (10×100)/12 =
83% Average occupancy is found out as the average of total number of vehicles occupying
the bay for each time interval. It is expressed in percentage. Average occupancy =
0.83+0.92+0.75+0.92
4
× 100 = 85.42%.
• Parking load = total number of vehicles accumulated at the end of each time interval ×
time = (10+11+9+11)×15
60
= 10.25 vehicle hours
Parking load 10.25
• Efficiency = Total number of bays
= 12
= 85.42%.
41.5 Summary
Providing suitable parking spaces is a challenge for traffic engineers and planners in the scenario
of ever increasing vehicle population. It is essential to conduct traffic surveys in order to design
the facilities or plan the fares. Different types of parking layout, surveys and statistics were
discussed in this chapter.
41.6 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
Chapter 42
Accident Studies
42.1 Overview
This lecture covers one of the most important negative impact of transportation system, namely
the accidents. This lecture first presents some introductory stuff including some salient accident
statistics, causes of accidents, accident data collection, accident reconstruction, safety measures
and safety audit.
42.2 Introduction
The problem of accident is a very acute in highway transportation due to complex flow pattern
of vehicular traffic, presence of mixed traffic along with pedestrians. Traffic accident leads to
loss of life and property. Thus the traffic engineers have to undertake a big responsibility of
providing safe traffic movements to the road users and ensure their safety. Road accidents
cannot be totally prevented but by suitable traffic engineering and management the accident
rate can be reduced to a certain extent. For this reason systematic study of traffic accidents are
required to be carried out. Proper investigation of the cause of accident will help to propose
preventive measures in terms of design and control.
1. To study the causes of accidents and suggest corrective measures at potential location
4. To support the proposed design and provide economic justification to the improvement
suggested by the traffic engineer
5. To carry out before and after studies and to demonstrate the improvement in the problem.
1. Road Users - Excessive speed and rash driving, violation of traffic rules, failure to per-
ceive traffic situation or sign or signal in adequate time, carelessness, fatigue, alcohol,sleep
etc.
2. Vehicle - Defects such as failure of brakes, steering system, tyre burst,lighting system .
4. Road design - Defective geometric design like inadequate sight distance, inadequate
width of shoulders, improper curve design, improper traffic control devices and improper
lighting,.
5. Environmental factors -unfavorable weather conditions like mist, snow, smoke and
heavy rainfall which restrict normal visibility and and makes driving unsafe.
6. Other causes -improper location of advertisement boards, gate of level crossing not
closed when required etc..
31.25
31.18
35
30
24.16
21.06
25
18.57
17.49
16.26
20
12.53
12.25
12.08
10.83
15
8.88
8.27
7.91
7.48
7.39
6.86
10
5.55
5.45
4.13
4.04
5 Niger 1.68
Philippines 1.21
Indonesia
Russian Federation
China
U.S.A.
Korea, Republic of
France
Kuwait
South Africa
Germany
Brazil
Canada
U.K.
Japan
Anguilla
India
Denmark
Australia
Jordan
Qatar
Malaysia
Italy
Figure 42:1: Country-wise number of person killed per 100000 populations (Ref. Ministry of
Road Transport and Highways Transport Research Wing)
the Figure 42:1 and the increase in rate of accident from year 2005 to year 2009 is shown in
the table. 42:1. In 2009, 14 accidents occurred per hour. Figure 42:2 and 42:3 gives the
percent of accident occurring from a specific vehicle class and the causes of accident in the form
of pie-chart. Since the data collection of accident is mostly done by the traffic police its the
users who are put to blame in majority of cases. Thus such statistical records are not much
useful for the traffic engineer.
1. General - Date, time, person involved in accident, classification of accident like fatal,
serious, minor
Table 42:1: Number of Accidents and Number of Persons Involved : 2001 to 2009(Ref. Ministry
of Road Transport and Highways Transport Research Wing)
No. of Accidents No. of persons affected Accident severity
Year Total Fatal Killed Injured (No. of persons killed
per 100 accidents)
2005 4,39,255 83,491 94,968 4,65,282 22
2006 4,60,920 93,917 1,05,749 4,96,481 23
2007 4,79,216 1,01,161 1,14,444 5,13,340 24
2008 4,84,704 1,06,591 1,19,860 5,23,193 25
2009 4,86,384 1,10,993 1,25,660 5,15,458 25.8
7.9
10.9 22.4
22.6
6.9
8.7 20.6
Others
Trucks, Tempos, MAVs, Tractors
Figure 42:2: Percent share in total road accident by type of motor vehicle involved (Primary
responsible) in year 2009 (Ref. Ministry of Road Transport and Highways Transport Research
Wing)
78.5
Figure 42:3: Causes of road accident in year 2009 (Ref. Ministry of Road Transport and
Highways Transport Research Wing)
7. Accident cost - Financial losses incurred due to property damage, personal injury and
casualty
These data collected need proper storing and retrieving for the following purpose. The purposes
are as follows:
2. Detailed functional evaluation of critical accident location to identify the causes of acci-
dents.
(a) Motorist accident report - It is filed by the involved motorist involved in all
accidents fatal or injurious.
(b) Police accident report - It is filed by the attendant police officer for all accidents
at which an officer is present. This generally includes fatal accidents or mostly
accidents involving serious injury required emergency or hospital treatment or which
have incurred heavy property damage.
3. Technical Preparation: This data collection step is needed for organization and inter-
pretation of the study made. In this step measurement of grades, sight distance, preparing
drawing of after accident situation, determination of critical and design speed for curves
is done.
5. Cause Analysis: It is the effort made to determine why the accident occurred from the
data available and the analysis of accident reconstruction studies..
1. Driver and Pedestrian - Accident occurrence by age groups and relationships of accidents
to physical capacities and to psychological test results.
It is important to compute accident rate which reflect accident involvement by type of highway.
These rates provide a means of comparing the relative safety of different highway and street
system and traffic controls. Another is accident involvement by the type of drivers and vehicles
associated with accidents.
Numerical Example
The Motor vehicle consumption in a city is 5.082 million liters, there were 3114 motor vehicle
fatalities, 355,799 motor vehicle injuries, 6,721,049 motor vehicle registrations and an estimated
population of 18,190,238. Kilometer of travel per liter of fuel is 12.42 km/liter. Calculate
registration death rate, population death rate and accident rate per vehicle km.
Solution Approximate vehicle kms of travel = Total consumption o fuel × kilometer of travel
per liter of fuel =5.08 × 109 × 12.42 = 63.1 × 109 km.
3. Accident rate per vehicle kms of travel can be obtained from the equation below as:
C × 100, 000, 000
R=
V
Here, R is the accident rate per 100 million vehicle kms of travel, C (total accident same
as vehicle fatalities) is 3114, V (vehicle kms of travel) is 63.1 × 109 .
Below in Figure 42:4 a schematic diagram of collision of two vehicles is shown that occur
during turning movements. This diagram is also known as collision diagram. Each collision is
represented by a set of arrows to show the direction of before and after movement. The collision
diagram provides a powerful visual record of accident occurrence over a significant period of
time. The collision may be of two types collinear impact or angular collision. Below each of
them are described in detail. Collinear impact can be again divided into two types :
b) u
Car 1 Car 2
c) u1 u2
Car 1 Car 2
2. Head-on collision.
2. Energy Theory
−F F
Car 1 Car 2
force F . The vehicle ahead will also push the rear vehicle with same magnitude of force but
has different direction. The action force is represented by F , whereas the reaction force is
represented by −F as shown in Figure 42:6. In the compression phase cars are deformed. The
compression phase terminates when the cars have equal velocity. Thus the cars obtain equal
velocity which generates the following equation:
m1 (u − v1 ) = −Pc m2 (u − v2 ) = Pc (42.7)
Rτ
where, Pc ≡ 0 c F dt which is the compression impulse and τc is the compression time. Thus,
the velocity after collision is obtained as:
m1 v1 + m2 v2
u= (42.8)
m1 + m2
The compression impulse is given by:
m1 m2
Pc = (v1 − v2 ) (42.9)
m1 + m2
In the restitution phase the elastic part of internal energy is released
Pr = e Pc (42.12)
Numerical Example
Two vehicles travelling in the same lane have masses 3000 kg and 2500 kg. The velocity of
rear vehicles after striking the leader vehicle is 25 kmph and the velocity of leader vehicle is 56
kmph. The coefficient of restitution of the two vehicle system is assumed to be 0.6. Determine
the pre-collision speed of the two vehicles.
Solution Given that the: mass of the first vehicle (m1 ) = 3000 kg, mass of the second vehicle
(m2 ) = 2500 kg, final speed of the rear vehicle (u1 ) = 25 kmph, and final speed of the leader
vehicle (u2 ) = 56 kmph. Let initial speed of the rear vehicle be v1 , and let initial speed of the
leader vehicle be v2 .
Step 1: From equation. 42.15,
(1.6)2.5(v1 − v2 )
25 = v1 −
(3 + 2.5)
5.5v1 − 4v1 + 4v2 = 137.5
4v2 − 1.5v1 = 137.5 (42.17)
Step 3: Solving equations. 42.17 and 42.18, We get the pre collision speed of two vehicles
as: v1 = 73 kmph, and v2 = 62 kmph.
Step 4: Initial speed of the rear vehicle, v1 = 73 kmph, and the initial speed of leader
vehicle, v2 = 62 kmph. Thus from the result we can infer that the follower vehicle was travelling
at quite high speed which may have resulted in the collision. The solution to the problem may
be speed restriction in that particular stretch of road where accident occurred.
W (v12 − v22 )
= W.f.S (42.19)
2g
where, f is the skid resistance coefficient and S is the skid distance. It also follows the law
of conservation of momentum (m1 , v1 are the mass and velocity of first vehicle colliding with
another vehicle of mass and velocity m2 , v2 respectively)
m1 v1 = m2 v2 (42.20)
Numerical example
A vehicle of 2000 kg skids a distance of 36 m before colliding with a stationary vehicle of 1500
kg weight. After collision both vehicle skid a distance of 14 m. Assuming coefficient of friction
0.5, determine the initial speed of the vehicle.
Solution: Let the weight of the moving vehicle is WA , let the weight of the stationary
vehicle is WB , skid distance before and after collision is s1 and s2 respectively, initial speed is
v1 , speed after applying brakes before collision is v2 and the speed of both the vehicles A and
B after collision is v3 , and the final speed v4 is 0. Then:
1. After collision: Loss in kinetic energy of both cars = Work done against skid resistance
(can be obtained from equation mentioned below). Substituting the values we obtain v3 .
2. At collision: Momentum before impact = momentum after impact (can be obtained from
equation. 42.20)
3. Before collision (can be obtained from equation. 42.19): Loss in kinetic energy of moving
vehicle = work done against braking force in reducing the speed
Car 1
Car 2
Car 1
Car 2
Figure 42:7: Angular collision of two vehicles resulting in movement in resultant direction
1 2
β
α
1
Figure 42:8: After collision movement of car 1 north of west and car 2 in east of north
1
2
α
β
1
Figure 42:9: After collision movement of car 1 and car 2 in north of east
α
1
β
Figure 42:10: After collision movement of car 1 north of east and car 2 in south of east
Numerical example
Vehicle A is approaching from west and vehicle B from south. After collision A skids 600 north
of east and B skids 300 south of east as shown in Figure 42:10. Skid distance before collision
for A is 18 m and B is 26 m. The skid distances after collision are 30m and 15 m respectively.
Weight of A and B are 4500 and 6000 respectively. Skid resistance of pavement is 0.55 m.
Determine the pre-collision speed.
Solution Let: initial speed is vA1 and vB1 , speed after skidding before collision is vA2 and
vB2 , speed of both the vehicles A and B after collision is vA3 and vB3 , final speed is vA4 and
vB4 is 0, initial skid distance for A and B is sA1 and sB1 , final skid distance for A and B is sA2
and sB2 , and weight of vehicle A is WA and Weight of vehicle B is WB .
1. After collision: Loss in kinetic energy of each cars= Work done against skid resistance
(can be obtained from equation. 42.19)
2
WA vA3
= WA f sA2
2g
As vA4 = 0, it is not considered in the above equation
p
vA3 = 2gf sA2
vA3 = 18 m/s
Similarly, we calculate vB3 using the similar formula and using sB2
2. At collision: Momentum before impact is momentum after impact (resolving along west-
east direction and using equation. 42.20)
WA WB WA
× vA2 + 0 = cos BvB3 + cos AvA3
g g g
WB
vA2 = cos BvB3 + cos AvA3
WA
6
= cos 30 × 12.7 + cos 60 × 18
4.5
vA2 = 23.66 m/s.
3. Before collision: Loss in kinetic energy of each cars= Work done against skid resistance
(can be obtained from equation. 42.19)
2 2
WA (vA1 − vA2 )
= WA .f.sA2
2g
q
2
vA1 = 2gf sA1 + vA2
= 27.45m/s = 99 km/hr
Answer: The pre-collision speed of the vehicle A (approaching from west) is vA1 = 99
km/hr and vehicle B (approaching from south) is vB1 = 63.26 km/hr.
There is consecutive change of picture in drivers mind while he is in motion. The number of
factors that the driver can distinguish and clearly fix in his mind is limited. On an average the
perception time for vision is 1/16th , for hearing is 1/20th and for muscular reaction is 1/20th .
The number of factors that can be taken into account by organs of sense of a driver in one
second is given by the formula below.
E = MV /L (42.21)
where, M = No. of factors that can be taken into account by the organ of sense of driver for L
m long, V = speed of vehicle in m/sec. Factors affecting drivers attention when he is on road
can be divided into three groups:
1. Factors relating to the road elements of road that directly affect the driving of a vehicle
are traffic signs, changes in direction of road, three legged intersection and various other
things.
3. Factors related indirectly to the vehicle motion Building and structures that strike the
eye, vegetation, landscape, etc.
So using the laws of visual perception certain measures have been suggested:
1. Contrast in visibility of the road should be achieved by provision of elements that differ
from its surrounding by colors, pattern such as shoulder strips, shoulder covered with
grass, edge markings.
3. The visibility of crown of trees from a distant location is also very useful in visual guiding.
4. The provision of guard rails of different contrasting colors also takes drivers attention and
prevent from monotonous driving.
Figure 42:11 and 42:12 is a visual guidance measure. Planting trees along side of roadway
which has a turning angle attracts attention of the driver and signals that a turn is present
ahead. The figure below is another example, when the direction of road has a hazardous at-
grade intersection trees are planted in such a way that it seems that there is dense forest ahead
and driver automatically tends to stop or reduce the speed of the vehicle so that no conflicts
occur at that point. Driver tends to extrapolate the further direction of the road. So it is the
responsibility of the traffic engineer to make the driver psychologically confident while driving
that reduces the probability of error and prevent mental strain.
Local Road
Highway
1
0
0
1 0110
N
111
000 0110 N
000
111 10
000
111
000
111 111
000
111
000
000
111 000
111 000
111
111
000
000
111
000
111
000
111
111
000 111
000
000
111 111
000
000
111 000
111 000
111
000
111
000
111
000
111 000
111 0110 000
111
000
111
10
Road reconstruction
The number of vehicles on the road increases from year to year, which introduces complications
into organization of traffic, sharply reduces the operation and transportation characteristic of
roads and lead to the growth of accident rate. This leads to the need of re constructing road.
The places of accidents need to be properly marked so that the reconstruction can be planned
accordingly. The Figure 42:13 shows that there were too many conflict points before which
reduced to a few number after construction of islands at proper places. Reconstruction process
may also include construction of a new road next to the existing road, renewal of pavement
without changing the horizontal alignment or profile of the road, reconstruction a particular
section of road. Few more examples of reconstruction of selected road section to improve
traffic safety are shown in Figure 42:14. The Figure 42:14 (a) shows separation of direction
of main stream of traffic from the secondary ones by shifting place of three-leg intersection,
Figure 42:14(b) shows separation of roads with construction of connection between them and
Figure 42:14(c) shows the construction of additional lane for turning vehicles. The plus sign
indicates the conflict points before the road reconstruction has been carried out. The after
reconstruction figure shows that just by little alteration of a section of road how the conflict
points have been resolved and smooth flow of the vehicles in an organized manner have been
obtained.
Channelization
The Channelization of traffic at intersection separates the traffic stream travelling in different
direction, providing them a separate lane that corresponds to their convenient path and spread-
ing as far as possible the points of conflict between crossing traffic streams. The traffic lanes
(a) L L
B
B
M M
(b)
+ +
++
+ +
(c)
++ +
Before After
are separated by marking relevant lines or by constructing slightly elevated islands as shown
in Figure 42:15. Proper Channelization reduces confusion. The number of decision required to
be made by the driver at any time is reduced allowing the driver time to make next decision.
The principles of proper channelized intersection are:-
1. The layout of intersection should be visibly clear, simple and understandable by driver.
3. Layout of intersection makes it necessary for a driver running through it to choose at each
moment of time one of not more than two possible direction of travel. This is achieved
by visual guidance, islands and markings.
4. The island provided should separate high speed, through and turning traffic flows.
5. The width of traffic lane should ensure unhampered turning to the big vehicles. Width of
straight section without kerb should be 3.5 m and that of traffic lane near island is 4.5-5
m at entry and 6 m at exit.
11111
00000
00000
11111
00000
11111
00000
11111
00000 11111111111
11111
0000000000
1111111111
00000000000
00000 00000000000
11111
0000000000
1111111111
00000 11111111111
11111 0000
1111
0000000000
1111111111
00000000000
11111111111
0000
1111
0000000000
1111111111
00000000000
11111111111
0000000000
1111111111
00000000000
11111111111
0000000000
1111111111
(b)
111111111111111
000000000000000
000000000000000
111111111111111
000000000000000
111111111111111
000000000000000
111111111111111
000000
111111
000000000000000
111111111111111
000000
111111
000000000000000
111111111111111
000000
111111
000000000000000
111111111111111 000000000000000
111111111111111
000000
111111
00000000
11111111
0000000
1111111
000000000000000
111111111111111
000000
111111
00000000
11111111
0000000
1111111
11 111111111111111
00 000000000000000
000000
111111
00000000
11111111
0000000
1111111
0000000
1111111 000000000000000
111111111111111
000000
111111
00000000
11111111
0000000
1111111
0000000
1111111
00000000
11111111 000000000000000
111111111111111
0000000
1111111
00000000
11111111 000000000000000
111111111111111
000000000000000
111111111111111
0000000
1111111
00000000
11111111 000000000000000
111111111111111
0000000
1111111 000000000000000
111111111111111
0000000
1111111
Road signs
Road signs are integral part of safety as they ensure safety of the driver himself (warning signs)
and safety of the other vehicles and pedestrians on road (regulatory signs). Driver should be
able to read the sign from a distance so that he has enough time to understand and respond. It is
essential that they are installed and have correct shape, colour, size and location. It is required
to maintain them as well, without maintenance in sound condition just their installment would
not be beneficial. According to British investigation height of text in road sign should be
(N + 6)v 3
H = + L
64 4
Where, N = No. of words on the sign, v = speed of vehicle (kmph), L = distance from which
inscription should be discernible (m)
Other methods
1. Street lighting
Street lightning of appropriate standard contributes to safety in urban area during night
time due to poor visibility. Installation of good lighting results in 21% reduction in all
accidents, 29% reduction in “all casualty” accidents, 21% reduction in “non pedestrian
casualty” accidents, and 57% reduction in “pedestrian casualty” accidents.
3. Road markings
Road markings ensure proper guidance and control to the traffic on a highway. They serve
as supplementary function of road sign. They serve as psychological barrier and delin-
eation of traffic path and its lateral clearance from traffic hazards for the safe movement
of traffic. Thus their purpose is to provide smooth and safe traffic flow.
5. Guard rail
Guard rail have similar function as of guide post. On high embankments, hilly roads,
road running parallel to the bank of river, shores of lake, near rock protrusion, trees,
bridge, abutments a collision with which is a great hazard for a vehicle. It is required to
retain the vehicle on the roadway which has accidentally left the road because of fault or
improper operation on the part of the driver. Driver who has lost control create a major
problem which can be curbed by this measure.
that the data related to accidents are again collected to check the efficiency of the measures
and for future implementation of further preventive measures.
Speed control
Checks on spot speed of all vehicles should be done at different locations and timings and legal
actions on those who violate the speed limit should be taken
The transport authorities should be strict while issuing licence to drivers of public service
vehicles and taxis. Driving licence of the driver may be renewed after specified period, only
after conducting some tests to check whether the driver is fit
Medical check
The drivers should be tested for vision and reaction time at prescribed intervals of time
The passengers and pedestrians should be taught the rules of the road, correct manner of
crossing etc. by introducing necessary instruction in the schools for the children and by the
help of posters exhibiting the serious results due to carelessness of road users.
Safety drive
Imposing traffic safety week when the road users are properly directed by the help of traffic
police as a means of training the public. Training courses and workshops should be organized
for drivers in different parts of the country.
1. Feasibility Stage - The starting point for the design is determined such as number and
type of intersection, relationship of the new scheme to the existing road, the relevant
design standards.
2. Draft Stage - In this stage horizontal and vertical alignment, junction layout are deter-
mined. After the completion of this stage decision about land acquisition is taken.
3. Detailed design stage - Signing, marking, lighting, other roadside equipment and land-
scaping are determined.
4. Pre-opening stage - Before opening a new or modified road should be driven, walked
or cycled. It should be done at different condition like bad weather, darkness.
5. Monitoring of the road in use - Assessment is done at the final stage after the road
has been in operation for few months to determine whether the utilization is obtained as
intended and whether any adjustment to the design are required in the light of the actual
behavior of road users.
(n1 t2 − n2 t1 )2
X2 = 2
≥ Xnorm (42.22)
t1 t2 (n1 + n2 )
where, t1 and t2 = period of time before and after reconstruction of a stretch of road for
which statistical data of accident is available, n1 and n2 = corresponding numbers of accident,
2
Xnorm = minimum values of Chi Square at which probability of deviation of laws of accident
2
Table 42:2: Relationship between P and Xnorm
P 10 8 5 3 2 1 0.1
2
Xnorm 1.71 2 2.7 3.6 4.25 5.41 9.6
occurrence after reconstruction P from the laws existing before reconstruction does not exceed
2
permissible values (usually 5%) The relationship between P and Xnorm is shown in Table. 42:2.
Numerical example
Before reconstruction of an at-grade intersection, there were 20 accidents during 5 years. Af-
ter reconstruction there were 4 accidents during 2 years. Determine the effectiveness of the
reconstruction.
(20 × 2 − 4 × 5)2
X2 = = 1.67 < 2.7
5 × 2(20 + 4)
Thus the statistical data available are not yet sufficient for considering with probability of
95 % that the relative reduction in number of accident is due to intersection reconstruction.
Assuming one more accident occurs next year.
(20 × 3 − 5 × 5)2
X2 = = 3.267 > 2.7
5 × 3(20 + 5)
Therefore additional analysis confirms that the reduction in accident is due to road reconstruc-
tion.
42.6 Conclusion
This chapter provides an important subject of highway safety and accident studies. Everything
a traffic engineer does, from field studies, planning and design; to control operation is related
to the provision of the safety system for vehicular travel. This chapter gives an insight of how
the analysis of traffic accident can be done from the viewpoint to reduce it by designing proper
safety measure.
42.7 References
1. Road accidents in india, 2009.
2. V F Babkov. Road Condition and traffic safety. MIR Publishers, Moscow, 2019.
3. J Stannard Baker. Traffic Accident Investigation Manual. The traffic Institute North-
western University, 2019.
4. Milan Batista. On the mutual coefficient of restitution in two car collinear collisions,
2006.
5. S K Khanna C E G Justo. Highway Engineering. Nem Chand and Bros, Roorkee, 2001.
Chapter 43
43.1 Overview
This chapter is an attempt to provide a basic knowledge about the fuel consumption and
vehicular emissions. The concepts of air pollution and automobile pollution are also given due
importance. Various types of numerical models related to fuel consumption and air pollution
are discussed briefly. The report aims to identify the necessity of understanding the impact of
vehicular pollution on the environment. In order to bring the fuel consumption and emission
levels to a minimum, various mitigation measures are to be implemented, which are also pointed
out in the report.
43.2 General
Urbanization has paved the way for higher levels of comfort and standard of living. Rapid
urbanization has thus caused an increase in the number of vehicles and this, on the other
hand, is causing another set of problems including lack of space, reduction in natural resources,
environmental pollution, etc. We need to consider the existence of a future generation and plan
the utilization of our environment and resources wisely. The following sections discuss how the
transportation engineering is helpful in bringing about welcome changes in the development of a
sustainable environment. For this, we need to have a basic knowledge about fuel consumption,
emission and resulting air pollution, which are discussed briefly below.
parameters of a vehicle, including its engine parameters, aerodynamic drag, weight, and rolling
resistance. Higher the value of fuel efficiency, the more economical a vehicle is (i.e., the more
distance it can travel with a certain volume of fuel). Fuel efficiency also affects the emissions
from the vehicles.
Air pollution has become a major concern in most of the countries of the world. It is responsible
for causing respiratory diseases, cancers and serious other ailments. Besides the health effects,
air pollution also contributes to high economic losses. Poor ambient air quality is a major
concern, mostly in urban areas. Air pollution is also responsible for serious phenomena such as
acid rain and global warming.
The substances causing air pollution are collectively known as air pollutants. They may
be solid, liquid or gaseous in nature. Pollutants are classified as primary and secondary air
pollutants. Primary pollutants are those which are emitted directly to atmosphere, whereas,
secondary pollutants are formed through chemical reactions and various combinations of the
primary pollutants. Some of the major primary and secondary air pollutants are given in
Table. 43:1 and Table. 43:2. The sources of air pollution may be natural or anthropogenic.
The anthropogenic sources of air pollution are those which are caused by human activity. The
major anthropogenic sources include Stationary sources (such as smoke stacks of power plants,
incinerators, and furnaces), Mobile sources (e.g. motor vehicles, aircraft), Agriculture and
industry (e.g. chemicals, dust), Fumes from paint, hair spray, aerosol sprays, Waste deposits
in landfills (which contain methane) and Military (e.g. Nuclear weapons, toxic gases). The
natural sources of air pollution may be Dust from areas of low vegetation, Radon gas from
radioactive decay of Earths crust, Smoke and CO from wildfires, and volcanic activity which
produces sulfur, chlorine and particulates.
Similarly, the typical engine combustion which occurs in vehicles can be represented by the
below chemical equation.
Exhaust
Emissions
1. Exhaust emissions: Exhaust emissions are those which are emitted through the exhaust
pipe when the vehicle is running or is started. Hence, the exhaust emissions maybe of 2
types - start up emissions and running emissions.
(a) Startup emissions: Emissions when the vehicle is started initially. Based on how
long the vehicle had been turned off after use, they may be cold start and hot start.
Cold start refers to when the vehicle is started suddenly after a long gap of use,
whereas, hot start refers to when the vehicle is started without the vehicle getting
enough time to cool off after its previous use.
(b) Running emissions: Emissions during normal running of the vehicle, i.e., when
the vehicle is in a hot stabilized mode.
2. Evaporative emissions: These include running losses and hot soak emissions produced
from fuel evaporation when an engine is still hot at the end of a trip, and diurnal emissions
(daily temperature variations).
Combustion of petroleum generates Sulfur Dioxide. It is a colorless, pungent and non flammable
gas. It causes respiratory illness, but occurs only in very low concentrations in exhaust gases.
Further oxidation of SOx forms H2 SO4 and thus acid rains.
Combustion under high temperature and pressure emits Nitrogen dioxide. It is reddish brown
gas. Nitrogen oxides contribute to the formation of ground level Ozone and acid rain.
Hydrocarbons result from the incomplete combustion of fuels. Their subsequent reaction with
the sunlight causes smog and ground level Ozone formation. V OCs are a special group of
Hydrocarbons. They are divided into 2 types methane and non methane. Prolonged exposure
to some of these compounds (like Benzene, Toluene and Xylene) may also cause Leukemia.
It is an indicator of complete combustion of the fuel. Although it does not directly affect our
health, it is a greenhouse gas which causes global warming.
It is a product of the incomplete burning of fuel and is formed when Carbon is partially oxidized.
CO is an odorless, colorless gas, but is toxic in nature. It reaches the blood stream to form
Carboxyhemoglobin, which reduces the flow of Oxygen in blood.
Lead (P b)
It is a malleable heavy metal. Lead present in the fuel helps in preventing engine knock. Lead
causes harm to the nervous and reproductive systems. It is a neurotoxin which accumulates in
the soft tissues and bones.
Particulate Matter (P M)
These are tiny solid or liquid particles suspended in gas (soot or smoke). Particulate Matter in
higher concentrations may lead to heart diseases and lung cancer.
The number of trips, distance travelled and driving mode are the major travel related factors
affecting emissions. As the number of trips increases, the amounts of emissions also increase.
Emissions increase with the distance travelled by the vehicle. The vehicular emissions also
depend on the driving mode. The driving modes may be idling, cruising, acceleration and
deceleration. These modes complete one driving cycle. Other factors affecting the emission
rates are the speed, acceleration and engine load of the vehicle. Low speeds, congested driving
conditions, sharp acceleration, deceleration, etc. result in higher emissions. On the other hand,
intermediate speeds and low density traffic conditions cause lower emissions.
These include the geometric design features of the highway such as grade. The emission rate
is very high at steep gradients, as the vehicle needs to put in more effort to maintain its speed.
The highway network facilities such as signalized intersections, freeway ramps, toll booths,
weaving sections, etc. also influence the vehicular emission rates.
Vehicle related factors include the engine sizes, horsepower and weight of the vehicle. Vehicles
with large engine sizes emit more pollutants. Since larger sized engines are seen in vehicles with
more horsepower and more weight, these factors also contribute to the emission rates. Another
important factor is the age of the vehicle. Older vehicles have higher emission rates.
Other Factors
2. Type of engine: Two stroke petrol engines emit more amounts of pollutants than the
four stroke diesel engines.
3. Urbanization: Congestion is higher in urban areas, and hence emissions are also higher.
Table 43:3: Indian Emission Standards (4-Wheel Vehicles), Source: Emission Norms, SIAM
India
Standard Reference Date Region
India 2000 Euro 1 2000 Nationwide
2001 NCR*, Mumbai, Kolkata, Chennai
Bharat Stage II Euro 2 2003.04 NCR*, 13 Cities**
2005.04 Nationwide
Bharat Stage III Euro 3 2005.04 NCR*, 13 Cities**
2010.04 Nationwide
Bharat Stage IV Euro 4 2010.04 NCR*, 13 Cities**
* National Capital Region (Delhi)
** Mumbai, Kolkata, Chennai, Bengaluru, Hyderabad, Ahmedabad,
Pune, Surat, Kanpur, Lucknow, Sholapur, Jamshedpur and Agra
Table 43:4: Emission Standards for Diesel Truck and Bus Engines, g/kWh, Source: Emission
Norms, SIAM India
Year Reference Test CO HC NOx PM
1992 - ECE 17.3- 2.7-3.7 - -
R49 32.6
1996 - ECE 11.2 2.4 14.4 -
R49
2000 Euro I ECE 4.5 1.1 8 0.36*
R49
2005** Euro II ECE 4 1.1 7 0.15
R49
2010** Euro III ESC 2.1 0.66 5 0.1
ETC 5.45 0.78 5 0.16
2010# Euro IV ESC 1.5 0.46 3.5 0.02
ETC 4 0.55 3.5 0.03
* 0.612 for engines below 85 kW
** earlier introduction in selected regions, see Table. 43:1 # only in selected
regions, see Table. 43:1
Table 43:5: Emission Standards for 3-Wheel Wheel Gasoline Vehicles, g/km, Source: Emission
Norms, SIAM India
Year CO HC HC + NOx
1991 Dec- 08- -
30 Dec
1996 6.75 - 5.4
2000 4 - 2
2005 (BS II) 2.25 - 2
2010.04 (BS III) 1.25 - 1.25
Table 43:6: Emission Standards for 2- Wheel Gasoline Vehicles, g/km, Source: Emission Norms,
SIAM India
Year CO HC HC + NOx
1991 Dec- 08- -
30 Dec
1996 5.5 - 3.6
2000 2 - 2
2005 (BS II) 1.5 - 1.5
2010.04 (BS III) 1 - 1
Table 43:7: Emission Standards for 4 - Wheel Gasoline Vehicles (GVW 3,500 kg), g/km,
Source: Emission Norms, SIAM India
Year Reference CO HC HC + NOx NOx
1991 - 14.3- 2.0- -
27.1 2.9
1996 - 8.68- -
12.4 3.00-4.36
1998* - 4.34- -
6.20 1.50-2.18
2000 Euro 1 2.72- -
6.90 0.97-1.70
2005** Euro 2 2.2-5.0 - 0.5-0.7
2.3 0.2 0.15
2010** Euro 3 4.17 0.25 - 0.18
5.22 0.29 0.21
1 0.1 0.08
2010# Euro 4 1.81 0.13 - 0.1
2.27 0.16 0.11
* for catalytic converter fitted vehicles
** earlier introduction in selected regions, see Table. 43:1 # only
in selected regions, see Table. 43:1
Litres/100m
110
100
90
80
70
60 Overall OGV
PSVs
50
40
30
20
10
0
0 20 40 60 80 100 120 140 160
Speed kph
stronger. The fuel consumed is related to the average speed (or travel time) using the relation
below:
F = k1 + k2 T (43.3)
k2
F = k1 + (43.4)
v
where, F = Fuel consumed per vehicle per unit distance (liters/km), T = Travel time per unit
distance, including stops and speed changes (minutes/km), v = Avg. speed measured over a
distance including stops and speed changes (10 ≤ v ≤ 56kmph), k1 = parameter associated
with fuel consumed to overcome rolling resistance, approximately proportional to vehicle weight
(liters/veh- km), k2 = Parameter approximately proportional to fuel consumption while idling
(liters/hr).Fig. 43:2 gives the relation between fuel and consumption and speed of the vehicle.
It can be inferred from the figure that fuel consumption is high for lower speeds and is the
minimum for intermediate speeds. Fig. 43:3 shows the relation between bus fuel consumption
and number of stops. It is clear from the graph that fuel consumption increases as the number
of stops of the vehicle increases.
Numerical Example 1
A city has a total of 20000 commuters travelling at an average speed of 25kmph, and using an
arterial road of length 15 km. Due to the congestion and parking problems, 35% commuters
form car pools with a car occupancy of 3.0 and 20% arrange for subscription bus service (50
seater). Rest of the commuters choose to travel by private cars. The peak period congestion
was found to be reduced and the speed was increased to 35kmph. Assuming the no. of stops
to be 7, calculate the amount of fuel saved. Take k1 = 0.085liters/km, k2 = 1.5 liters/hr.
0.5
0.4
0.3
Without air conditioning
0.2
0.1
0
1 2 3 4 5 6 7 8 9 10
Solution: It is required to find the difference in fuel consumption between the two cases. In
the first case, all commuters use private cars (i.e. car occupancy 1) and in the second case,
some of them use public transport services, while others still use private cars.
In the first case, there were a total of 20000 commuters with car occupancy = 1, speed
25kmph and the distance to be travelled is 15 km. from the equation 43.3, we have: Total
fuel consumption, F = k1 + k2 /v. Thus for the distance of 15km travelled, the total fuel
consumption is equal to [0.085 * 15] + [(1.5/25) * 15], which is 2.175 liters/vehicle. Thus for a
total of 20000 commuters, the fuel consumption will be 2.175 * 20000 which is equal to 43500
liters.
In the second case, the vehicles move with a new speed of 35kmph, and out of the total
20000 commuters, 35% (0.35 * 20000 = 7000) form car pools with occupancy 3.0. Hence, the
number of car pool vehicles is 7000/3, that is 2333 vehicles. 20% (0.20 * 20000 = 4000) of the
commuters use a 50 seater bus service. Hence the number of buses will be 4000/50, which is
equal to 80 buses. Remaining (20000 - 7000 - 4000 = 9000) are single car drivers. The total
consumption by car will include the consumption of cars of single occupancy and the cars in
the car pool. Hence, the fuel consumption by cars is [0.085 * 15] + [(1.5/35) * 15], that is 1.917
liters/vehicles. So, for all the cars, the total fuel consumption will be 1.917* (9000 + 2333),
which is 21725.36 liters. Similarly, the bus fuel consumption for a bus with 7 stops will be 0.3
*2.35 * 80 * 15 which is 846 liters.
Fuel consumption corresponding to 7 stops is obtained from Fig. 43:3. 2.35 is a conversion
factor to bring the fuel consumption in terms of liters/km instead of gallons/mile. Total fuel
consumption will be the sum of fuel consumptions of bus and car. That is 21725+846 = 22571
liters. The total amount of fuel saved will be the difference of fuel consumptions in both the
cases. Hence the amount of fuel saved is 43500 - 2257, which is equal to 20929 liters.
G = f1 L + f2 D + f3 S (43.5)
where, G = fuel consumed per vehicle over a measured distance (total section distance), L
= total section distance traveled, D = stopped delay per vehicle (time spent in idling), S
= number of stops, f1 = fuel consumption rate per unit distance while cruising, f2 = fuel
consumption rate per unit time while idling, f3 = excess fuel used in decelerating to stop and
accelerating back to cruise speed
Numerical example
The total fuel consumption by a vehicle travelling on a stretch of road is 0.0735 liters/veh-km.
The average stopped delay for the vehicle is 6s. The vehicle stops thrice during its journey.
Assume f1 = 0.0045, f2 = 0.0035 and f3 = 0.002. Calculate the length of road considered. If the
vehicle is cruising throughout the stretch of the road, what is the decrease in fuel consumption?
Solution: From the equation. 43.5, the fuel consumed per vehicle over a measured distance
is given by
G = f1 L + f2 D + f3 S
Step 1: It is given that fuel consumed per vehicle is 0.0735 liters/veh-km, average delay is
6s and the number of stops are 3. The values of f1 , f2 and f3 are given as 0.0045,0.0035 and
0.002 respectively. It is required to find the length of the road. The length L can be computed
from the above equation as given: 0.0735 = (0.0045 ∗ L) + (0.0035 ∗ 6) + (0.002 ∗ 3). Therefore,
Length, L is equal to 10 km.
Step 2: When the vehicle is cruising throughout the length, there will not be any delays or
stops. Therefore, total fuel consumption: G = f1 L = 0.0045 ∗ 10 = 0.045liters/veh − km.
Step 3: The decrease in fuel consumption is will be the difference in fuel consumptions as
obtained in steps 1 and 2, which is 0.0735-0.045 = 0.0285 liters/veh-km.
Emissions array
Speed (km/h) Emissions CO, HC, N Ox, P M,
Acceleration (m/s2) module CO2, C
(g)
factors used in the emission models reflect different levels of congestion. The various types of
emission models are briefly discussed in the following paragraphs.
The model is similar to the instantaneous fuel consumption model. It describes the vehicle
emission behavior during any instant of time. The advantages of the model are that the
emission factors can be calculated and generated for any vehicle operating profile, and the
model considers dynamics in driving patterns. The model has some disadvantages also such as:
Detailed and precise information on vehicle operation and location is required and The process
of data collection is expensive.
This model is useful in macro level where detailed information is not required. A single emission
factor is used to represent a particular type of vehicle and general type of driving. Emission is
estimated using the equation:
E = A ∗ EF (43.6)
where, E = emissions, in units of pollutant per unit of time, A = activity rate, in units of weight,
volume, distance or duration per unit of time, EF = emission factor, in units of pollutant per
unit of weight, volume, distance or duration The variation of exhaust emission factors with
speed for the major exhaust pollutants are given in the following figures (Fig. 43:5 to Fig. 43:10).
Cars petrol Cars diesel LGVs petrol LGVs diesel
For Particulate Matter (P M10) and Volatile Organic Compounds, the emissions steadily
decrease with the speed. In case of Nitrogen Oxides, Sulphur Oxides and Carbon Dioxide, the
emission is highest for low speeds, decreases for intermediate speeds and then again increases
with the speed. For Carbon Monoxide, the highest emission levels occur for higher speeds and
minimum emission occurs for intermediate speeds.
1.4
1.2
1
0.8
0.6
0.4
0.2
0
0 20 40 60 80 100 120
Speed (km/hr)
Figure 43:5: Variation of emission factor with Speed for Particulate Matter
Emission factor, g/km
18
NOx
16
14
12
10
6
4
2
0
0 20 40 60 80 100 120
Speed (km/hr)
Figure 43:6: Variation of emission factor with Speed for Nitrogen Oxides
5
4
0
0 20 40 60 80 100 120
Speed (km/hr)
Figure 43:7: Variation of emission factor with Speed for Volatile Organic Compounds
Emission factor. g/km
45
CO
40
35
30
25
20
15
10
5
0
0 20 40 60 80 100 120
Speed (km/hr)
Figure 43:8: Variation of emission factor with Speed for Carbon Monoxide, Source: [5]
SO2
0.4
0.3
0.2
0.1
0
0 20 40 60 80 100 120
Speed (km/hr)
Figure 43:9: Variation of emission factor with Speed for Sulphur Dioxide
Emission factor, g/km
600
CO2
500
400
300
200
100
0
0 20 40 60 80 100 120
Speed (km/hr)
Figure 43:10: Variation of emission factor with Speed for Carbon Dioxide
Numerical example
Using the emission factor model, the amount of CO emitted by a vehicle was estimated as 50
grams per hour. If the vehicle travelled at a velocity of 40kmph, estimate the emission factor
for CO for the vehicle.
Solution It is given that the total emission E is 50g/hr. The activity A here is the amount of
CO emitted by the vehicle, which is 40km/hr. from the eqn. 43.6, we have, the total emissions
is E = A ∗ EF . Therefore, the emission factor will be E/A = 50/40 = 1.25. That is, the
emission factor of CO is 1.25 grams/km.
Average Speed Models are used in the measurement of emission rates of a pollutant for a
given vehicle for various speeds during a trip. Average Speed Emission models, along with the
Emission factor models are widely applied in national and regional inventories. The emission
factor in this model (EF ) is measured over a range of driving cycle (which includes driving,
stops, starts, acceleration and deceleration). It is given in g/veh-km. Though these models are
good in measuring congestion, they have certain disadvantages, which are explained below:
1. A single emission factor is used for a value of average speed irrespective of the vehicle
operational characteristics.
2. Average speed is a less reliable indicator of estimation of emissions for the newest gener-
ation of vehicles ( as they have after treatment devices).
3. The shape of an average speed function is not fundamental, but depends, amongst other
factors, on the cycle type used. Even though each cycle used in the development of these
functions represents a real life driving condition, the real distribution of these driving
conditions is not normally taken into account.
4. Average speed models do not allow for detailed spatial resolution in emission predictions.
This model is similar to the drive mode elemental fuel consumption model. Emission rates are
explained as a function of the vehicle operation mode. The model provides accurate emission
estimates at micro level. For each mode, emission rate is fixed for a particular type of vehicle
and pollutant. Instantaneous traffic related data is required to estimate the fuel consumption.
The total emission for a trip on a section of road is given by the product of modal emission
rate and the time spent in the mode.
Various emission models are available to estimate the contribution of motor vehicle transporta-
tion to air pollution. The major vehicular emission models in use are discussed briefly below:
1. MOBILE: This model was proposed by the Environmental Protection Agency of the
United States. The MOBILE model estimates the emission rates from on-road motor ve-
hicles. The outputs of the MOBILE model are emissions per unit time or distance of a fleet
or vehicle type (i.e. grams/mile or grams/hour) of HC, CO, NOx, CO2, P M, NH3 , SO2
and six toxic air contaminants such as lead. MOBILE estimates emissions of both ex-
haust and evaporative emissions, and particulate emissions from brake and tire wear.
MOBILE does not apply the vehicle operation such as distance travelled and number of
starts. The model is designed to be able to predict emission rates from a future fleet to
understand how emissions will change over time. Aggregate driving cycles are considered
in this model. MOBILE 6.2 is the current version of the model.
2. MOVES: MOVES stands for “Motor Vehicle Emission Simulator”. MOVES is also a
product of EPA. This model was proposed as a replacement to their MOBILE model.
The MOVES model contains fine scale information, such as second by second resolution
emissions and driving behaviour that can now be collected with on-board instrumentation.
Any driving pattern can be modelled.
3. EMFAC: The “Emission Factors” model is developed by the California Air Resources
Board. The model is similar to the MOBILE model, except that it is pertained to
California only. The emission standards of California are different from rest of the US.
5. CMEM: The “Comprehensive Modal Emissions Model”, or CMEM, was developed at the
University of California, Riverside and is fine-scale emissions predictions model. CMEM
2.0 is the latest version. The model predicts emissions based, not only on the average
speed of the vehicles, but also on the fuel consumption and power of the vehicles.
Plume
Centerline
y
For a given x, the max conc. is at the
h hs plume centerline and decreases
exponentially away from the centerline
at a rate dependent upon the sigma values,
σy and σz
σy andσz are functions of x
where, C = concentration of the emission (micro grams/cubic meter) at any point x meters
downwind of the source, y meters laterally from the centerline of the plume, and z meters above
ground level.Q = quantity or mass of the emission (in grams) per unit of time (seconds), u =
wind speed (in meters per second), h = height of the source above ground level (in meters), σy
and σz are the standard deviations of a statistically normal plume in the lateral and vertical
dimensions, respectively. They are functions of x.
Numerical example
A bus stalled at a signal emits pollutants at the rate of 20000g/s. The exhaust pipe is situated
at height of 0.75 m from the Ground level. What will be the concentration of pollutants inhaled
by a man living on the first floor of a building with storey height 3.5 m? The building is situated
at a lateral distance of 5m from the main road and longitudinal distance of 4m downwind of
the source. Assume a wind velocity of 10 m/s, σy = 375m and σz = 120m.
Given that, the man lives on the first floor of a building which has a storey height 3.5m. Hence,
the man will inhale the pollutants at a distance of 3.5 * 2 = 7m from the ground level. Also
given that the exhaust pipe is at a height of 0.75m form the ground and the lateral distance
y is 5m. The longitudinal distance ′ x′ is 4m. σy and σz are functions of x and are given as
′ ′
375m and 120m respectively. Substituting the values given, we have, The concentration of the
emission,
5. Legislative measures: under legislative measures the various factors responsible for
emission from the vehicle can be put under certain restriction, for e.g overloading of
heavy vehicles is a cause of more fuel consumption and emission, so a standard load or
weight can be fixed beyond that load, the vehicles should be considered overloaded and
penalties for the amount of overload can be charged, this measure will discourage the
overloading, other legal measures are deciding the type of engine installed in the different
category of vehicles.
8. Burn less fuel: we should implement the ”burn less fuel” strategy. Burning the less fuel
will lead to lesser emission and consequent the lesser air pollution and its harmful effect.
9. Vent Controls: for reducing the evaporative emission vent control is necessary. By
controlling the vent we can control the leakage of the vapours.
10. Vehicle maintenance: as we know the poor vehicle characteristic is one of the factor
responsible of higher emission, so proper maintenance of vehicles can be helpful to reduc-
ing the emission specially the old vehicles should be checked and examined for amount of
emission.
11. Enhancing dispersion: once the harmful gases from the vehicles are emitted, they
should not be allowed to concentrate surrounding area, they should be immediately dis-
persed.
12. Using vegetation: we know that plants and trees are a good sink of harmful gases like
CO2 etc. so we should encourage the vegetation on the sides of the roads as much as
possible to reduce the amount of pollutants in ambient air
43.7 Conclusion
Automobiles are large contributer to the environmental pollution. The different fuel consump-
tion and air pollution models discussed in this report help us to estimate how much fuel we are
using and the amount of pollutants we are releasing in the atmosphere. As the population and
number of vehicles are increasing abruptly, more amounts of pollutants are being discharged. If
this trend continues, there will not be any more energy sources left for the future generations.
Also, the world will be so polluted that living organisms may not be able to thrive. Hence, we
need to understand the importance of saving the environment. Alternate sources of fuels for
e.g. renewable sources can be used which also help in reducing the pollution. Our aim must
be to preserve the nature and have the environment, along with a sustainable transportation
system.
43.8 References
1. Society of indian automobile manufacturers:emission norms, 2011.
Chapter 44
Congestion Studies
44.1 Introduction
Transportation system consists of a group of activities as well as entities interacting with each
other to achieve the goal of transporting people or goods from one place to another. Hence,
the system has to meet the perceived social and economical needs of the users. As these needs
change, the transportation system itself evolves and problems occur as it becomes inadequate
to serve the public interest. One of the negative impacts of any transportation system is
traffic congestion. Traffic congestion occurs wherever demand exceeds the capacity of the
transportation system. This lecture gives an overview of how congestion is generated, how
it can be measured or quantified; and also the various countermeasures to be taken in order
to counteract congestion. Adequate performance measures are needed in order to quantify
congestion in a transportation system. Quality of service measures indicates the degree of
traveller satisfaction with system performance and this is covered under traveller perception.
Several measures have been taken in order to counteract congestion. They are basically classified
into supply and demand measures. An overview of all these aspects of congestion is dealt with
in this lecture.
Growth Effects
Transportation
System
Growth Effects
Transportation
System
Traffic Growth
Location
Pattern
than the capacity of the roadway. This situation is called traffic congestion.
• Drivers who encounter unexpected traffic may be late for work and other appointments
causing a loss in productivity and their valuable time.
• Since congestion leads to increase in travel time i,e.,vehicles are made to travel for more
time than required which consumes large amount of fuel there by causing fuel loss and
economic loss to the drivers.
• One of the most harmful effects of traffic congestion is its impact on the environment.
Despite the growing number of vehicles ,cars stopped in traffic still produces a large volume
of harmful carbon emissions . Increase in pollutants (because of both the additional fuel
burned and more toxic gases produced while internal combustion engines are in idle or in
stop-and-go traffic)
• Drivers who become impatient may be more likely to drive aggressively and dangerously
and leads to high potential for traffic accidents
• Negative impact on people’s psychological state, which may affect productivity at work
and personal relationships
• Decrease in road surface lifetime: When a vehicle moves over the surface, the areas of
contact (where the vehicles’ tyres touch the road) are deflected downwards under the
weight of the vehicle and as the vehicle moves forward, the deflection corrects itself to its
original position.
• Vehicle maintenance costs; ’Wear and tear’ on mechanical components of vehicles such as
the clutch and brakes is also considerably increased under stop-start driving conditions
and hence increasing the vehicle maintenance costs.
• One beneficial effect of traffic congestion is its ability to encourage drivers to consider
other transportation options like a subway, light rail or bus service. These options reduce
traffic on the roads ,thereby reducing congestion and environmental pollution.
The summation of all these effects yields a considerable loss for the society and the economy
of an urban area
1. Congestion is the travel time or delay in excess of that normally incurred under light or
free flow traffic condition.
2. Unacceptable congestion is travel time or delay in excess of agreed norm which may vary
by type of transport facility, travel mode, geographical location, and time of the day.
Fig. 44:2 shows the definition of congestion. The solid line represents the travel speed under
free-flow conditions and the dotted line represents the actual travel speed. During congestion,
Speed
Amount of
Congestion
the vehicles will be travelling at a speed less than their free flow speed. The shaded area in
between these two lines represents the amount of congestion. Traffic congestion may be of two
types:
1. Duration,
2. Extent,
3. Intensity, and
4. Reliability.
44.3.3 Duration
Duration of congestion is the amount of time the congestion affects the travel system. The
peak hour has now extended to peak period in many corridors. Measures that can quantify
congestion include:
• Amount of time during the day that the travel rate indicates congested travel on a system
element or entire system.
• Amount of time during the day that traffic density measurement techniques (detectors,
aerial surveillance, etc.) indicate congested travel.
Duration of congestion is the sum of length of each analysis sub period for which the demand
exceeds capacity. This component measures the performance of a particular road in handling
traffic efficiently i,e.,with the increase in the duration of congestion, poorer will be the perfor-
mance of the transportation system. The maximum duration on any link indicates the amount
of time before congestion is completely cleared from the corridor. Duration of congestion can
be computed for a corridor using the following equation: For corridor analysis,
H =N ×T (44.1)
where, H is the duration of congestion (hours), N is the number of analysis sub periods for
which v/c > 1, and T is the duration of analysis sub-period (hours). For area wide analysis,
T vcii (1 − r)
Hi = (44.2)
1 − r( vcii )
where, Hi is the duration of congestion for link i (hours), T is the duration of analysis period
(hours), r is the ratio of peak demand to peak demand rate, vi is the vehicle demand on link i
(veh/hr), and ci is the capacity of link i (veh/hr).
44.3.4 Extent
Extent of congestion is described by estimating the number of people or vehicles affected by
congestion and by the geographic distribution of congestion. These measures include:
Performance measures of extent of congestion can be computed from sum of length of queuing
on each segment. Segments in which queue overflows the capacity are also identified. This is
useful for ramp metering analysis. To compute queue length, average density of vehicles in a
queue need to be known. The default values suggested by HCM 2000 are given in Table 1.
Queue length can be found out using the equation:
T (v − c)
QLi = (44.3)
N × ds
where; QLi is the queue length (meter), v is the segment demand (veh/hour), c is the segment
capacity (veh/hour), N is the number of lanes, ds is the storage density (veh/meter/lane), and
T is the duration of analysis period (hour). If v < c, Qi =0 The equation for queue length is
similar for both corridor and area-wide analysis.
Numerical example
Consider a road segment of 6 lanes with a capacity of 2400 veh/hr/lane. It is observed that
the storage density is 75 veh/meter and the segment demand is found to be 2800 veh/hr/lane.
Given that the duration of analysis sub period is 2 hrs calculate the queue length that is formed
due to congestion.
44.3.5 Intensity
Intensity of congestion marks the severity of congestion. It is used to differentiate between levels
of congestion on transport system and to define total amount of congestion. It is measured in
terms of:
• Delay per capita or per vehicle travelling in the corridor, or per person or per vehicle
affected by congestion;
DP H = TP H − TP0 H (44.5)
where, DP H is the person hours of delay, TP H is the person hours of travel under actual
conditions, and TP0 H is the person hours of travel under free flow conditions. The TP H is given
by:
OAV × v × l
TP H = (44.6)
S
where, OAV is the average vehicle occupancy, v is the vehicle demand (veh), l is the length of
link (km), and S is the mean speed of link (km/hr). The TP H is given by:
OAV × v × l
TP0 H = (44.7)
S0
where, OAV is the average vehicle occupancy, v is the vehicle demand (veh), l is the length of
link (km), and S0 is the free flow speed on the link (km/hr)
Numerical example
On a 2.8 km long link of road, it was found that the demand is 1000 Vehicles/hour mean speed
of the link is 12 km/hr, and the free flow speed is 27 km/hr. Assuming that the average vehi-
cle occupancy is 1.2 person/vehicle, calculate the congestion intensity in terms of total person
hours of delay.
Solution: Given data: Length of the link=l=2.8 km, Vehicle demand=v=1000 veh, Mean
Speed of the link=S=12 km/hr, Free flow speed on the link=So=27 km/hr, and Average Vehicle
Occupancy=AVO=1.2 person/veh. Person hours of delay is given as
DP H = TP H − TP0 H
Person hours of travel under actual conditions,
OAV × v × l
TP H =
S
1.2 × 1000 × 2.8
=
12
= 280 person hours
Person hours of travel under free flow conditions,
OAV × v × l
TP0 H =
S0
1.2 × 1000 × 2.8
=
27
= 124.4 person hours
Therefore, person hours of delay can be calculated as follows,,
DP H = = 280 − 124.4
= 155.6 person hours
= 156 person hours (approx).
Hence, the intensity of congestion is determined in terms of person hours of delay as 156 person
hours.
11111111111
00000000000
00000000000
11111111111
00000000000
11111111111
Time
Duration
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
00000000000
11111111111
Extent
Distance
Broad Critical
General System−Wide
Congestion Problems
Extent
Limited Critical
Links or
Problem Corridors
Duration
indicates general congestion, great delay for small extent indicates critical links and great delay
for large extent indicates critical system-wide problem. Fig. 44:3 also illustrates the relation-
ship between duration, extent and intensity The extent of congestion is seen on the x-axis, the
duration on the y-axis. The intensity is shown in the shading. Based on the extent and dura-
tion the congestion can be classified into four types as shown in Fig.44:4. Fig.44:3 indicates a
time distance graph with the shaded area indicating congestion in individual road segments for
discrete time periods. The figure shows the relationship between duration, extent, and inten-
sity. The product of extent and duration indicates the intensity, or magnitude of the congestion
problem.
44.3.7 Reliability
Reliability is a measure of a drivers ability to accurately predict and plan for a certain travel
time. The more unexpected events that occur on a roadway, the less reliable it is. Non
recurrent congestion has a bigger impact on the reliability of the roadway relative to concurrent
congestion. In other words, Travel-time reliability is defined as the level of consistency in
travel conditions over time and is measured by describing the distribution of travel times that
occur over a substantial period of time. Reliability is an important component of roadway
performance and perhaps more importantly, of motorists perceptions of roadway performance.
The importance of measuring and managing reliability in reducing congestion is explained as
follows.
• Motorists have less tolerance for unexpected delay than for expected delay
44.4.1 classification
Congestion countermeasures include supply measures and demand measures.,which will be dis-
cussed in detail in the next section. Other than these two measures, an additional longer-term
tool used against traffic problems is land-use planning and policy. It has the potential
• To control the number and growth of major traffic generators along congestion corridors.
• To establish sensible allocations of land for future development given present constraints
and expansion plans for the transportation network and
• To enforce balanced employment and residential development, thus reducing the long
home-to-work trips.
1. Development of new or expanded infrastructure: This includes civil projects (new free-
ways, transit lines etc), road widening, bridge replacements, permanent freeway lane
conversions, technology conversions(a new rail technology, a modernized bus fleet and
ITS)
2. Small scale capacity and efficiency improvements: This includes signal system upgrade
and coordination, freeway ramp metering, re-location of bus stops, lane management
schemes, bottleneck elimination through channelization and operational improvements.
Cost of Trips
P
S
O Q No. of trips
Journey costs include private journey cost, congestion cost, environmental cost, and road main-
tenance cost. The benefit a road user obtains from the journey is the price he prepared to pay
in order to make the journey. As the price gradually increases, a point will be reached when the
trip maker considers it not worth performing or it is worth performing by other means. This is
known as the critical price. At a cost less than this critical price, he enjoys a net benefit called
as consumer surplus(es) and is given by:
s =x−y (44.8)
where, x is the amount the consumer is prepared to pay, and y is the amount he actually
pays. The basics of congestion pricing involves demand function, private cost function as well
as marginal cost function. These are explained below.
Demand
Fig. 44:5 shows the general form of a demand curve. In the figure, area QOSP indicates the
absolute utility to trip maker and the area SRP indicates the net benefit.
Private cost
Marginal cost
Marginal cost is the additional cost of adding one extra vehicle to the traffic stream. It reduces
speed and causes congestion and results in increase in cost of overall journey. The total cost
incurred by all vehicles in one hour(CT ) is given by:
CT = cq (44.11)
Marginal cost is obtained by differentiating the total cost with respect to the flow(q) as shown
in the following equations.
d(cq) dc
M= = c+q (44.12)
dq dq
dc dc dv
= × (44.13)
dq dv dq
= (−b)/v 2 × −e (44.14)
2
= be/v (44.15)
d(cq) dc
= c+q (44.16)
dq dq
b d − v be
= a+ + × 2 (44.17)
v e v
Note that c and q in the above derivation is obtained from Equations 44.9 and 44.10 respectively.
Therefore the marginal cost is given as:
b (d − v)b
M =a+ + (44.18)
v v2
Fig. 44:6 shows the variation of marginal cost per flow as well as private cost per flow. It is seen
that the marginal cost will always be greater than the private cost, the increase representing
the congestion cost.
Flow(q)
Superimposing the demand curve on the private cost/flow and marginal cost/flow curves, the
position as shown in Fig. 44:7 is obtained. The intersection of the demand curve and the private
costs curve at point A represents the equilibrium condition, obtained when travel decisions are
based on private costs only. The intersection of the demand curve and the marginal costs curve
at point B represents the optimum condition. At this point the flow Q0 corresponds to the cost
C0 which is the marginal cost as well as the value of the trip to the trip maker. The net benefit
under the two positions A and B are shown by the areas ACZ and BY CY Z respectively. If
the conditions are shifted from point A to B, the net benefit due to change will be given by
area CCy Y X minus AXB. If the area CCy Y X is greater than arc AXB, the net benefit will
be positive. The shifting of conditions from point A to B can be brought about by imposing
a road pricing charge BY. Under this scheme, the private vehicles continuing to use the roads
will on an average be worse off in the first place because BY will always exceed the individual
increase in benefits XY.
Cost / Benifit
Z
Optimum
Condition
Marginal Cost / Flow
B
Private Cost / Flow
X A
Equilibrium
Condition
Y
Flow(q)
Figure 44:7: Relation between material cost, private cost and demand curves.
It is given that Flow rate, q=500 veh/hr. Speed of the vehicle is given by,
v = d − eq
= d − 500e
b (d − v)b
M = a+ +
v v2
b (d − 15)b
= a+ +
15 225
Therefore, the equation of marginal cost for the vehicles moving on the given congested road
is given by M = a + (b/15) + [(d − 15) ∗ b/225]
3. Collects sufficient fund for major upgrades of highways and other road maintenance works.
4. Method should be simple for road users to understand and police to enforce
7. Should be reliable
44.5 Conclusion
Causes and effects of congestion along with various performance measures and with many other
counter measures are discussed in detail considering the actual or technical definition of con-
gestion. The congestion performance measures described are generalized measures. There are
several other performance measures and indices. Advanced study on congestion can include
improved measurement schemes and the combined travel demand modeling and route choice
under congested conditions. With the implementation of all the counter measures traffic conges-
tion, the most pronouncing problem of transportation may be reduced or controlled to certain
extent. The principle and process of congestion pricing was also discussed with the help of
certain graphs..
44.6 References
1. Transport research board - quantifying congestion volume 1 final report, nchrp report
398, 1997.
Chapter 45
Queuing Analysis
45.1 Introduction
One of the major issues in the analysis of any traffic system is the analysis of delay. Delay is
a more subtle concept. It may be defined as the difference between the actual travel time on a
given segment and some ideal travel time of that segment. This raises the question as to what
is the ideal travel time. In practice, the ideal travel time chosen will depend on the situation;
in general, however, there are two particular travel times that seem best suited as benchmarks
for comparison with the actual performance of the system. These are the travel time under free
flow conditions and travel time at capacity.
Most recent research has found that for highway systems, there is comparatively little
difference between these two speeds. That being the case, the analysis of delay normally focuses
on delay that results when demand exceeds its capacity; such delay is known as queuing delay,
and may be studied by means of queuing theory. This theory involves the analysis of what is
known as a queuing system, which is composed of a server; a stream of customers, who demand
service; and a queue, or line of customers waiting to be served.
Queue
Arrival rate discipline Service rate
• Queue discipline
It is the rate at which customers (vehicles in transportation scenario) depart from a transporta-
tion facility. It is expressed in flow (customers/hr or vehicles/hour in transportation scenario)
or time headway (seconds/customer or seconds/vehicle in transportation scenario). If inter
service time that is time headway (h) is known, the service rate can be found out from the
equation:
3600
µ= (45.2)
h
Number of servers
The number of servers that are being utilized should be specified and in the manner they work
that is they work as parallel servers or series servers has to be specified.
Queue discipline
Queue discipline is a parameter that explains how the customers arrive at a service facility.
The various types of queue disciplines are
4. Priority scheduling
1. First in first out (FIFO): If the customers are served in the order of their arrival,
then this is known as the first-come, first-served (FCFS) service discipline. Prepaid taxi
queue at airports where a taxi is engaged on a first-come, first-served basis is an example
of this discipline.
2. First in last out (FILO): Sometimes, the customers are serviced in the reverse order
of their entry so that the ones who join the last are served first. For example, assume
that letters to be typed, or order forms to be processed accumulate in a pile, each new
addition being put on the top of them. The typist or the clerk might process these letters
or orders by taking each new task from the top of the pile. Thus, a just arriving task
would be the next to be serviced provided that no fresh task arrives before it is picked
up. Similarly, the people who join an elevator first are the last ones to leave it.
3. Served in random order (SIRO): Under this rule customers are selected for service at
random, irrespective of their arrivals in the service system. In this every customer in the
queue is equally likely to be selected. The time of arrival of the customers is, therefore,
of no relevance in such a case.
4. Priority Service: Under this rule customers are grouped in priority classes on the
basis of some attributes such as service time or urgency or according to some identifiable
characteristic, and FIFO rule is used within each class to provide service. Treatment of
VIPs in preference to other patients in a hospital is an example of priority service.
5. Processor (or Time) Sharing: The server is switched between all the queues for a
predefined slice of time (quantum time) in a round-robin manner. Each queue head is
served for that specific time. It doesn’t matter if the service is complete for a customer or
not. If not then it’ll be served in it’s next turn. This is used to avoid the server time killed
by customer for the external activities (e.g. Preparing for payment or filling half-filled
form ).
5. W = Expected waiting time in system (includes service time) for each individual customer
or time a customer spends in the system. [sometimes denoted as Ws]
6. Wq = waiting time in queue (excludes service time) for each individual customer or
Expected time a customer spends in a queue
2. Lq = λW q
1
3. W = W q + λ
m l
l m
t t
Sv Sv
l
t t
µ
µ
λ
λ
t t
Σv Σv
λ λ
µ’
µ
µ
t t
µ
µ
λ λ
t t
Σv Σv
λ
λ
µ
µ
t t
µ
µ
λ λ
t t
Σv Σv
λ
λ
µ
µ
t t
of the right hand side part of the figure is an incident or an accident on the roads which causes
a reduction in the service rate.
ρ2
2. Average number of customers in the system = Lq = 1−ρ
L λ 1
3. Expected waiting time in the system W = λ
= (1/λ) µ−λ = µ−λ
Lq 1 λ2 λ
4. Expected waiting time in the queue Wq = λ
= λ
× µ(µ−λ)
= µ(µ−λ)
Numerical example
Vehicles arrive at a toll booth at an average rate of 300 per hour. Average waiting time at
the toll booth is 10s per vehicle. If both arrivals and departures are exponentially distributed,
what is the average number of vehicles in the system, average queue length, the average delay
per vehicle, the average time a vehicle is in the system?
λ /N
Server 1
Dispatching Departures
Arrivals
discipline
λ=arrival
rate
Server N
λ /N
Solution Mean arrival rate λ = 300 vehicles/hr. Mean service rate µ = 3600 10
vehicles/hr.
λ 300
Utilization factor = traffic intensity = ρ = µ = 360 = 0.833. Percent of time the toll booth
will be idle = P(0) = P(X=0) = ρ0 (1 − ρ) = (0.833)0 (1 − 0.833) = 0.139(60min)=8.34 min.
ρ
Average number of vehicles in the system = E[X] = 1−ρ =4.98. Average number of vehicles in
ρ2
1
the queue =E[Lq ] = 1−ρ = 4.01. Average a vehicle spend in the system =E[T ] = µ−λ = 0.016 hr
λ
= 0.96 min = 57.6 sec. Average time a vehicle spends in the queue =E[Tq ] = µ(µ−λ) = 0.013hr
= 0.83 min = 50 sec.
3600
Solution Average arrival rate = λ = 300 vehicles/hr. Average service rate = µ = 10
300
vehicles/hr. Utilization factor = traffic intensity = ρ = µλ = 360 = 0.833.
"N −1 #−1
X ρx ρN
P (0) = +
x=0
x! (N − 1)!(N − ρ)
= 0.92(60) = 55.2min
ρ N+1
Average number of vehicles in the system is = L = E[X] = ρ + [ (N −1)!(N −ρ)2
]P (0) = 1.22.
ρ N+1
The average number of customers in the queue = Lq = E[Lq ] = [ (N −1)!(N −ρ)2
]P (0)= 0.387.
E[X]
Expected time in the system =W = λ
= 0.004 hr = 14 sec. The expected time in the queue
=Wq = Lλq = 0.00129 hr = 4.64 sec.
λ /N
Server 1
Departures
Arrivals
λ=arrival
rate
Server N
λ /N
Solution Mean arrival rate = λ = 150 vehicles/hr. Mean service rate =µ = 3600 10
vehicles/hr.
λ 150
Utilization factor = traffic intensity = ρ = µ = 360 = 0.416. The percent of time the toll booth
will be idle = P(0) = P(X=0) = (0.416)0 (1 − 0.416) = 0.584(60min)=35.04 min. The average
ρ
number of vehicles in the system = E[X] = 1−ρ = 0.712. The average number of vehicles in
ρ2
1
the queue =Lq = 1−ρ = 0.296. The average a vehicle spend in the system =E[T ] = W = µ−λ =
0.0047 hr = 0.285 min = 17.14 sec. The average time a vehicle spends in the queue =E[Tq ] =
λ
Wq = µ(µ−λ) = 0.0022hr = 0.13 min = 8.05 sec
From the Table 1 by providing 2 servers the queue length reduced from 4.01 to 0.387 and the
average waiting time of the vehicles came down from 50 sec to 4.64 sec, but at the expense
of having either one or both of the toll booths idle 92% of the time as compared to 13.9% of
the time for the single-server situation. Thus there exists a trade-off between the customers’
convenience and the cost of running the system.
Assumptions
Solution The arrival volume is given in the table. Service rate is given as 8 seconds per
vehicle. This implies for 10 min, 75 vehicles can be served by each server. It is given there are
3 servers. Hence 225 vehicles can be served by 3 servers in 10 min. In the first 10 min only 200
vehicles arrive which are served so the service rate for rest 50 min is 225 veh/10 min as there is
a queue for the rest period. The solution to the problem is showed in the table 3 following. The
cumulative arrivals and services are calculated in columns 3 and 5. Queue length at the end
of any 10 min interval is got by simply subtracting column 5 from column 3 and is recorded in
column 6. Maximum of the column 6 is maximum queue length for the study period which is
300 vehicles. The service rate has been found out as 225 vehicles per hour. From proportioning
we get the time required for each queue length to be served and as 475 vehicles is the max
queue length, the max delay is corresponding to this queue. Therefore max delay is 21.11 min.
45.5 Conclusions
The queuing models often assume infinite numbers of customers, infinite queue capacity, or
no bounds on inter-arrival or service times, when it is quite apparent that these bounds must
exist in reality. Often, although the bounds do exist, they can be safely ignored because the
differences between the real-world and theory is not statistically significant, as the probability
that such boundary situations might occur is remote compared to the expected normal situation.
Furthermore, several studies show the robustness of queuing models outside their assumptions.
In other cases the theoretical solution may either prove intractable or insufficiently informative
to be useful. Alternative means of analysis have thus been devised in order to provide some
insight into problems that do not fall under the scope of queuing theory, although they are
often scenario-specific because they generally consist of computer simulations or analysis of
experimental data.
45.6 References
1. James H Banks. Introduction to transportation engineering. Tata Mc-Graw Hill, 2004.
3. Adolf D. May. Fundamentals of Traffic Flow. Prentice - Hall, Inc. Englewood Cliff New
Jersey 07632, second edition, 1990.
Chapter 46
Toll Operation
46.1 Introduction
Toll tax is collected to recover the total capital outlay which includes the cost of construction,
repairs, maintenance, expenses on toll operation and interest on the outlay. The new facility
thus constructed should provide reduced travel time and increased level of service. In India
most of the highway projects are given on PPP basis, i.e. Public Private Partnership. In this
the private organization finances and constructs the facility and recovers the capital from the
users in the form of toll tax. This tax is collected for a reasonable period of time after which
the facility is surrendered to the public. Of late, toll tax is being levied on parking of vehicles
in the urban centers in a move to decongest the streets and reduce the pollution levels. This
concept is known as Congestion Pricing.
In an open toll system, not all patrons are charged a toll. In such a system, the toll plaza is
generally located at the edge of the urban area, where a majority of long distance travelers are
committed to the facility, with a minimum likelihood of switching to the parallel free route, or
at the busiest section of the toll way [2]. Patrons are identified by their category and pay a
fixed toll for it. The local traffic around the plaza either gets rebate or can use a service lane.
The general layout of an open toll collecting system is highlighted in Fig. 46:1.
TOLL PLAZZA
TOLL PLAZZA
In a closed toll system, patrons pay the toll based on miles of travel on the facility and category
of vehicle. There are no free-rides. In a closed toll system, plazas are located at all the entry
and exit points, with the patron receiving a ticket upon entering the system. Upon exiting,
patron surrenders the ticket to the collector and is charged a prescribed fee based on category
of vehicle and distance travelled [2]. It has just two stops for the vehicles whereas open system
can have multiple stops. But closed system is expensive to construct than open system. The
general layout of an open toll collecting system is highlighted in Fig. 46:2.
Manual toll collection is most widely used collection method in India. It requires a toll collector
or attendant. Based on the vehicle classification, cash toll is received by the collector. The col-
lector, who also dispenses change, may accept and sell scrip, tickets, coupons, making an entry
of the vehicle in the system and issuing receipt to the patron [2]. Due to manual intervention,
the processing time is highest.
Automatic toll collection is based on the use of Automated Coin Machine (ACM). These accept
both coins and tokens issued by the operating agency. Depending on the toll rate, the use
of automated coin or token collection instead of manual collection reduces transaction and
processing time as well as the operating cost.
Electronic Toll Collection (ETC) is a system that automatically identifies a vehicle equipped
with a valid encoded data tag or transponder as it moves through a toll lane or checkpoint.
The ETC system then posts a debit or charge to a patron’s account, without the patron having
to stop to pay the toll. ETC increases the lane throughput because vehicles need not stop to
pay the toll.
46.1.3 Terminology
Some of the basic terms that will be used in the chapters to come have been discussed in this
section. Following are the terms and their definitions:
1. Throughput: It is the number of vehicles passing through the toll plaza over a short
period of time, usually 1 hour.
2. Demand: It is the sum of throughput and the number of vehicles queued up at the toll
plaza during 1 hour.
3. Processing Time: It is the difference between the time a vehicle leaves and the time
when it enters the toll area. The entry time is taken from the moment a vehicle stops in
the queue.
4. Queueing Area: It is the area of the toll plaza where the number of lanes of incoming
vehicles increase from the number of lanes on highway to the number of tollbooths. The
vehicles queue up in this area to make the toll payment. Fig. 46:3 shows the location of
queueing area in a toll plaza.
5. Merging Area: It is the area of the toll plaza where the number of lanes of outgoing
vehicles decrease from the number of tollbooths to the number of lanes on highway. The
vehicles have to merge with other vehicles in this area before the highway comes to its
normal width. Fig. 46:3 shows the location of merging area in a toll plaza.
6. Optimal Toll Plaza Configuration: It is the one which minimizes the expected time
a driver must spend while travelling through the system.
111
000
000
111
000
111
000
111
000
111
000
111
000
111
000
111
W 000
111
000
111
000
111
000
111
000
111
000
111
000
111
000
111
000
111
Toll Plaza
Queueing Merging
000
111
000
111
Area 000
111
Area
000
111
000
111
000
111
000
111
000
111
000
111
000
111
000
111
Start of flare area 000
111 End of flare area
Similarly, the time wasted at merging area is calculated using the following logic. If there
are T tollbooths which are finally merged into N lanes of highway then the number of merging
points are given by (T −N) (see Fig. 46:4). From Fig. 46:4 we can see that in a toll plaza with a
side merging layout which has T tollbooths, the first merging point takes a stream coming from
2 tollbooths, and the second merging point would take a stream from 3. By Little’s theorem,
the average waiting time in the system tsys (λ) is given by the equation. 46.2:
L(λ) 1 µB − µ0
tsys (λ) = = + (46.2)
λ µB − λ λ(µB − µ0 ) + µ0 µB
The average wasted time of a driver at a merging point is the difference between tsys and the
time he or she would spend on a normal lane. The expected time a driver spends when no
merging happens is 1/µ0. Hence, the average wasted time is given by the equation. 46.3.
1 1 µB − µ0 1
tdif f (λ) = tsys (λ) − = + − (46.3)
µ0 µB − λ λ(µB − µ0 ) + µ0 µB µ0
where, µB = Service rate when merging of vehicles takes place (veh/hr), µ0 = Service rate when
no merging of vehicles takes place (veh/hr), λ = Vehicle arrival rate = (k/T ) × φ (veh/hr), k
= No. of conflicting lanes at a merging point. k has a range between [2, T − N + 1]
The above formula gives the average wasted time of a driver at each merging point. The
overall wasted time is the weighted sum of all the wasted time at each merging point, where
the corresponding weight is the probability for a driver to reach that point. The overall wasted
time (WB ) can be calculated using the equation. 46.4.
TX
−N
i+1 i+1
WB = × tdif f ( × φ) sec/veh (46.4)
i=1
T T
As per the optimal toll plaza configuration, we need to keep the total delay time as minimum
[4]. The Total Wasted Time (Wtotal ) for the vehicle (Tollbooth + Merging) is given by the
equation. 46.5:
TX−N
1 i+1 i+1
Wtotal = WA + WB = + × tdif f ( × φ) (46.5)
µA − φ/T i=1
T T
Numerical example
Calculate the Total delay time in toll plaza if the total no of tolls are 3 on a single-lane highway.
The total traffic flow on the highway is 800 veh/hr. Assume the following data: Service rate
of Tollbooth = 400 veh/hr; Service rate when merging of vehicles takes place =1500 veh/hr;
Service rate when no merging of vehicles takes place =2500 veh/hr
Solution: The following data has been given to us in the problem: N=1 lane; Ø= 800 veh/hr;
µA = 400 veh/hr; µB = 1500 veh/hr; µ0 = 2500 veh/hr. Our aim is to determine the total
delay time in toll plaza. From eqn above ; WA = (400−1 800 ) =0.0075 hr/veh = 27 sec/veh. It
3
means that the wasted time at the tollbooth is 27 sec/veh. Now we move on to find the overall
wasted time in the merging area (WB). To find that, first we need to find the wasted time at
each merging point which can be calculated using the equation. Now, eqn uses a term k in
it which signifies the number of conflicting lanes at each merging point. k ranges between [2,
T-N+1]. Therefore in this case (T=3) k lies between [2, 4-1+1], i.e. [2,3] When K=2: Hence,
λ at first merging point = ( 23 ) × 800 = 533.3veh/hr. From eqn above, for (λ = 533.33)
1 (1500−2500) 1
Tdif f = (1500−2× 800 +
) [2× 800 (1500−2500)+1500×2500]
− 2500 = 1.166 sec.
3 3
WB for the 1st merging point = ( 23 ) × 1.166 = 0.777sec When K=3: ( 3Ø T
)
1 (1500−2500) 800 1
Tdif f = (1500−3× 800 ) + 3
× 3 (1500 − 2500) + 1500 × 1500 − 2500
3
tsys = 2.48 sec. WB for the 2st merging point =( 33 )×2.48 = 2.48sec. Total WB=0.777+2.48.
WB= 3.257 sec. Wtotal=WA+WB=27.0+3.257. Total delay time Wtotal = 30.257 sec.
Numerical example
Solution: The following data has been given to us in the problem: N=1 lane; φ = 900 veh/hr;
µA = 350 veh/hr; µB = 1184.9 veh/hr; µ0 = 3017.1 veh/hr Our aim should be to determine
the total vehicle delays for different values of tollbooths (T ). The value of T corresponding to
which the delay time in minimum is the optimal condition. Let us initially start with T =4;
From equation. 46.1; WA = 1/(350 900/4) = 0.008 hr/veh = 28.8 sec/veh. It means that the
wasted time at the tollbooth is 28.8 sec/veh. Now we move on to find the overall wasted time
in the merging area (WB ). To find that, first we need to find the wasted time at each merging
point which can be calculated using the equation. 46.3. Now, equation. 46.3 uses a term k in it
which signifies the number of conflicting lanes at each merging point. It can be seen from figure
4 that k ranges between [2, T − N + 1]. Therefore in this case (T =4) k lies between [2, 4-1+1],
i.e. [2,4]. Hence, λ at first merging point = (2/4) * 900 = 450 veh/hr. From equation. 46.3,
(λ = 450)
Tdif f = 1/(1184.9 − 2 × 900/4) + (1184.9 − 3017.1)/[2 × 900/4(1184.9 − 3017.1) + 1184.9 ×
1 A 1
10 10
2+2−lane toll plaza
C
L
Proposed row
2
1
2.0 4.1 1.8 3.2 1.8 3.2 1.8 3.2 1.8 3.2 1.8 4.1 2.0
varies varies
15.0 15.0
Extra width of future widening
Right of way
depending upon the width of accquired
land \& height of embankmentCross section A−A
Figure 46:5: General Layout 2+2 lane Toll Plaza (Source: [3])
vehicles is provided at the left hand side of the highway. Some extra space is also maintained
for the scope of future plaza expansion. The design specifications for the design of the flared
portions are as listed below:
3. Transition - 1 in 10 may be provided from two-lane section to the widened width at Toll
Plaza on either side.
1. Peak Hour Factor: Percentage of vehicles travelling during the peak hour to the average
daily traffic.
2. Number of toll lanes should be corresponding to the forecast traffic for at least 5 years.
3. Forecast traffic in terms of veh/day for all the tollable categories. Non-tollable vehicles
(e.g. VIP vehicles, ambulances, etc) are exempted from the toll tax and flow through a
separate lane.
Table 46:2: Number of Semi Automatic Toll gates in each direction, Source: [3]
Forecast Traffic Peak Hour Factor
(in vehicles/day) total 6% 7% 8% 9%
of both directions
Less than 7000 2 2 2 2
7000-12000 2 2 3 3
More than 12000 3 3 4 4
4. If the queue becomes so long that the waiting time exceeds three minutes then the number
of tollbooths need to be increased.
2. Collection of toll and recording of data would be made through electronic equipment.
3. Intercom facility shall be provided between booths and the office of the supervisors.
4. If any booth is closed for any reason, incoming traffic shall be guided into the adjoining
working booth with the help of appropriate signs.
46.3.4 Tollbooth
A tollbooth is that location of the toll plaza where the tax is actually paid. This section lays
emphasis on the procedures involved in the construction of a tollbooth.
2. Toll booth should have space for seating for toll collector, computer system, printer and
cash.
3. Signs should be installed to inform the users about the toll price for different categories
of vehicles.
4. Electronic signs should be installed over the toll booths to display their operation status.
2. Diagonal markings for central traffic island and chevron marking sat side traffic island
shall be provided to guide the approaching and separating traffic.
46.3.7 Lighting
Toll plaza lighting needs due consideration because user should be able to spot the existence of
a toll plaza from a distance at night. The specifications for different types of lighting provided
at a toll plaza are listed below:
1. Highway Lighting: Lighting in 100m length on both sides of toll plaza shall be provided
to enhance safety and to make drivers conscious of approaching a toll gate.
2. Canopy Lighting: Higher level of illumination shall be provided at the tollgate and toll
booth locations.
4. High Mast Lighting: IS:1944 (Part I & II) recommends 30 Lux of average illumination on
road surface. 30m height of mast is considered suitable [3].
1. Traffic Volume: Determining the traffic volume that will be using the facility is the most
important factor. Success of any toll will virtually depend on the accurate estimation and
forecasting of toll traffic and its composition.
2. Willingness to pay: Users will be willing to pay a realizable portion of their savings to
use the improved facility.
1. Toll rate should be fixed in such a way that a vehicle owner should not shy away from
using the facility.
2. The operator should get maximum toll revenue so that it can recover the total outlay
cost in a reasonable period.
Toll rates of all the vehicles are obtained after including the maintenance cost and the interest
on construction cost to the total outlay cost [1].
46.5 Conclusion
From the above discussions we can conclude that toll tax is a fee which is used for the use of a
newly constructed facility to recoup the total capital outlay. The private organization builds,
operates and then transfers the facility after a projected period of time. The Electronic Toll
Collection (ETC) system is the most efficient method of toll collection with minimum delays.
But due to its high installation cost its not that prevalent in India. We can find the optimum
number of tollbooths by applying queueing theory to ascertain the delays in both queueing and
merging areas. The optimum number of tollbooths should minimize the overall delay time.
The toll plaza design should be done in accordance with the Indian Standard Codes available.
Toll prices are set in a way that they attract maximum number of users and the agency should
be able to recover the cost within specified period of time.
46.6 References
1. Modelling toll plaza behavior using queuing theory, 2011. [Accessed 25 August 2011].
2. secretariat for infrastructure, goi; two-laning of highways through public private partner-
ship, 2011.
3. R G Motwani. Optimum Toll Charges for proposed Airoli Bridge. M Tech Disseration,
1995.
Chapter 47
Pedestrian Studies
47.1 Introduction
People walk for many reasons: to go to a neighbour’s house, to run errands, for school, or
to get to a business meeting. People also walk for recreation and health benefits or for the
enjoyment of being outside. Some pedestrians must walk to transit or other destinations if
they wish to travel independently. It is a public responsibility to provide a safe, secure, and
comfortable system for all people who walk. In this lecture we will discuss about the pedestrian
problems, pedestrian survey (data collection), characteristics, different level of services, and
design principles of pedestrian facilities. There are many problems related to safety security of
pedestrians. These are discussed below in brief.
Special Problems
1. Age: Children under 15 years of age from the largest group of pedestrian victims and have
the highest injury rate per population in their age group, the elderly have the highest
fatality rate because of the lower probability of their recovery from injuries.
2. Intoxication and Drug effects: Alcohol and drugs impair the behavior of pedestrians to
the extent that they may be a primary cause of accident.
3. Dusk and Darkness: Special pedestrian safety problems arise during the hours of dusk
and darkness, when it is most difficult for motorists to see pedestrians.
1. The nature of the local community- Walking is more likely to occur in a community
that has a high proportion of young people.
2. Car ownership -The availability of the private car reduces the amount of walking, even
for short journey.
3. Local land use activities- Walking is primarily used for short distance trips. Conse-
quently the distance between local origins and destinations (e.g. homes and school, homes
and shops) is an important factor influencing the level of demand, particularly for the
young and elderly.
4. Quality of provision- If good quality pedestrian facilities are provided, then demand
will tend to increase.
5. Safety and security- It is important that pedestrians perceive the facilities to be safe
and secure. For pedestrians this means freedom from conflict with motor vehicle, as well
as a minimal threat from personal attack and the risk of tripping on uneven surfaces.
47.1.4 Terminology
1. Pedestrian speed is the average pedestrian walking speed, generally expressed in units of
meters per second.
2. Pedestrian flow rate is the number of pedestrians passing a point per unit of time, ex-
pressed as pedestrians per 15 min or pedestrians per minute. Point refers to a line of
sight across the width of a walkway perpendicular to the pedestrian path.
3. Pedestrian flow per unit of width is the average flow of pedestrians per unit of effective
walkway width, expressed as pedestrians per minute per meter (p/min/m). Pedestrian
density is the average number of pedestrians per unit of area within a walkway or queuing
area, expressed as pedestrians per square meter (p/m2).
4. Pedestrian space is the average area provided for each pedestrian in a walkway or queuing
area, expressed in terms of square meters per pedestrian. This is the inverse of density,
and is often a more practical unit for analyzing pedestrian facilities.
Manual counts
Count the flow of pedestrian through a junction, across a road, or along a road section/footway
manually using manual clicker and tally marking sheet. Manual counts need to satisfy the
following conditions.
1. The time period(s) in the day over which the counts are undertaken must coincide with
the peak times of the activity of study.
2. The day(s) of the week and month(s) of the year when observations are made must be
representative of the demand. School holidays, early closing, and special events should
be avoided since they can result in non-typical conditions.
3. The survey locations need to be carefully selected in order to ensure that the total existing
demand is observed.
Advantages of this manual counting are that these are simple to set up and carry out, and
flexible to response observed changes in demand on site and disadvantages are that these are
labour intensive also simple information can be achieved and not detailed information.
Video survey
Cameras are setup at the selected sites and video recording taken of the pedestrians during the
selected observation periods. A suitable vantage point for the camera is important. Such survey
produces a permanent record of pedestrian movement and their interaction with vehicles. In it
the record of behavior pattern is also obtained which helps in analyzing the crossing difficulties.
Attitude survey
Detailed questionnaire requires enabling complete information about pedestrian’s origins and
destination points, also can gather information on what new facilities, or improvements to ex-
isting facilities, need to be provided to divert trips to walking, or increase the current pedestrian
activities.
120
90 Students
60 Commuters
Shoppers
30
The fundamental relationship between speed, density, and volume for pedestrian flow is analo-
gous to vehicular flow. As volume and density increase, pedestrian speed declines. As density
increases and pedestrian space decreases, the degree of mobility afforded to the individual
pedestrian declines, as does the average speed of the pedestrian stream, it is shown in Fig. 47:1.
Flow-Density Relationships
The relationship among density, speed, and flow for pedestrians is similar to that for vehicular
traffic streams, and is expressed in equation.
where, Qped = unit flow rate (p/min/m), Sped = pedestrian speed (m/min), and Dped= pedestrian
density (p/m2 ). Pedestrian density is an awkward variable in that it has fractional values in
pedestrian per square meter. This relationship often expressed in terms of Space module(M)
which is the inverse of pedestrian density. The inverse of density is more practical unit for
analyzing pedestrian facilities ,so expression becomes
Sped
Qed = (47.2)
M
where M in(m2 /ped). The basic relationship between flow and space, recorded by several
researchers, is illustrated in the Fig. 47:2. The conditions at maximum flow represent the
Flow (p/min/m)
150
125
100
75
50
25
0
0 1 2 3 4 5 6 7 8 9 10
Space2(m /p)
capacity of the walkway facility. From Fig. 47:2, it is apparent that all observations of maximum
unit flow fall within a narrow range of density, with the average space per pedestrian varying
between 0.4 and 0.9 m2 /p. Even the outer range of these observations indicates that maximum
flow occurs at this density, although the actual flow in this study is considerably higher than
in the others. As space is reduced to less than 0.4 m2 /p, the flow rate declines precipitously.
All movement effectively stops at the minimum space allocation of 0.2 to 0.3 m2 /p.
Speed-Flow Relationships
The following Fig. 47:3 illustrates the relationship between pedestrian speed and flow. These
curves, similar to vehicle flow curves, show that when there are few pedestrians on a walkway
(i.e., low flow levels), there is space available to choose higher walking speeds. As flow in-
creases, speeds decline because of closer interactions among pedestrians. When a critical level
of crowding occurs, movement becomes more difficult, and both flow and speed decline. The
Fig. 47:4 confirms the relationships of walking speed and available space, and suggests some
points of demarcation for developing LOS criteria. The outer range of observations indicates
that at an average space of less than 1.5 m2 /p, even the slowest pedestrians cannot achieve
their desired walking speeds. Faster pedestrians, who walk at speeds of up to 1.8 m/s, are not
able to achieve that speed unless average space is 4.0 m2 /p or more.
Pedestrian facility designers use body depth and shoulder breadth for minimum space standards,
at least implicitly. A simplified body ellipse of 0.50 m * 0.60 m, with total area of 0.30 m2 is
used as the basic space for a single pedestrian, as shown in Fig. 47:5 this represents the practical
Speed (m/s)
2.5
2.0
1.5
1.0
0.5
0
0 25 50 100 125 150
Flow (p/min/m)
2.5
2.0
1.5
1.0
0.5
0
0 1 2 3 4 5 6 7 8 9 10
Space2(m /p)
0.5 m
body
depth
Pedestrian walking speed is highly dependent on the proportion of elderly pedestrians (65 years
old or more) in the walking population. If 0 to 20 per cent of pedestrians are elderly, the average
walking speed is 1.2 m/s on walkways. If elderly people constitute more than 20 per cent of
the total pedestrians, the average walking speed decreases to 1.0 m/s. In addition, a walkway
upgrade of 10 per cent or more reduces walking speed by 0.1 m/s. On sidewalks, the free-flow
speed of pedestrians is approximately 1.5 m/s. There are several other conditions that could
reduce average pedestrian speed, such as a high percentage of slow-walking children in the
pedestrian flow.
Pedestrian Space > 5.6 m2 /p Flow Rate ≤ 16 p/min/m. At a walkway LOS A, pedestrians move
in desired paths without altering their movements in response to other pedestrians. Walking
speeds are freely selected, and conflicts between pedestrians are unlikely. It is shown in Fig. 47:7.
LOS B
Pedestrian Space > 3.7 − 5.6 m2 /p Flow Rate > 16 − 23 p/min/m. At LOS B, there is sufficient
area for pedestrians to select walking speeds freely, to bypass other pedestrians, and to avoid
crossing conflicts. At this level, pedestrians begin to be aware of other pedestrians, and to
respond to their presence when selecting a walking path. It is shown in Fig. 47:8.
LOS C
Pedestrian Space > 2.2 −3.7 m2 /p Flow Rate > 23 −33 p/min/m. At LOS C, space is sufficient
for normal walking speeds, and for bypassing other pedestrians in primarily unidirectional
streams. Reverse-direction or crossing movements can cause minor conflicts, and speeds and
flow rate are somewhat lower. It is shown in Fig. 47:9.
LOS D
Pedestrian Space > 1.4 − 2.2 m2 /p Flow Rate > 33 − 49 p/min/m. At LOS D, freedom to select
individual walking speed and to bypass other pedestrians is restricted. Crossing or reverse flow
movements face a high probability of conflict, requiring frequent changes in speed and position.
The LOS provides reasonably fluid flow, but friction and interaction between pedestrians is
likely. It is shown in Fig. 47:10.
LOS E
Pedestrian Space > 0.75 − 1.4 m2 /p Flow Rate > 49 − 75 p/min/m. At LOS E, virtually
all pedestrians restrict their normal walking speed, frequently adjusting their gait. At the
lower range, forward movement is possible only by shuffling. Space is not sufficient for passing
slower pedestrians. Cross- or reverse-flow movements are possible only with extreme difficulties.
Design volumes approach the limit of walkway capacity, with stoppages and interruptions to
flow. It is shown in Fig. 47:11.
LOS F
Pedestrian Space ≤ 0.75 m2 /p Flow Rate varies p/min/m. At LOS F, all walking speeds
are severely restricted, and forward progress is made only by shuffling. There is frequent,
unavoidable contact with other pedestrians. Cross- and reverse-flow movements are virtually
impossible. Flow is sporadic and unstable. Space is more characteristic of queued pedestrians
than of moving pedestrian streams. It is shown in Fig. 47:12.
Average Pedestrian Space > 1.2 m2 /p. Standing and free circulation through the queuing area
is possible without disturbing others within the queue.
LOS B
Average Pedestrian Space > 0.9 − 1.2 m2 / p. Standing and partially restricted circulation to
avoid disturbing others in the queue is possible.
LOS C
Average Pedestrian Space > 0.6 − 0.9 m2 /p. Standing and restricted circulation through the
queuing area by disturbing others in the queue is possible; this density is within the range of
personal comfort.
LOS D
Average Pedestrian Space > 0.3 − 0.6 m2 /p. Standing without touching is possible; circulation
is severely restricted within the queue and forward movement is only possible as a group;
long-term waiting at this density is uncomfortable.
LOS E
Average Pedestrian Space > 0.2 − 0.3 m2 /p. Standing in physical contact with others is un-
avoidable; circulation in the queue is not possible; queuing can only be sustained for a short
period without serious discomfort.
LOS F
Average Pedestrian Space ≤ 0.2 m2 /p. Virtually all persons within the queue are standing in
direct physical contact with others; this density is extremely uncomfortable; no movement is
possible in the queue; there is potential for panic in large crowds at this density.
The signalized intersection crossing is more complicated to analyze than a mid-block crossing,
because it involves intersecting sidewalk flows, pedestrians crossing the street, and others queued
waiting for the signal to change. The service measure is the average delay experienced by a
pedestrian. Research indicates that the average delay of pedestrians at signalized intersection
crossings is not constrained by capacity, even when pedestrian flow rates reach 5,000 p/h. The
average delay per pedestrian for a crosswalk is given by Equation:
0.5(C − g)2
dp = (47.3)
C
Where, dp = average pedestrian delay (s), g = effective green time (for pedestrians) (s), and C=
cycle length (s).
Numerical example
Calculate time delay of pedestrian crossing at a signalized intersection operating on a two phase,
80.0-s cycle length, with 4.0-s change interval, and no pedestrian signals. Major street: Phase
green time, Gd = 44.0 s; Crosswalk length, Ld = 14.0 m; Minor street: Crosswalk length, Lc
= 8.5 m; Phase green time, Gc = 28.0 s;
Solution dp =(c − g)2 /2c, dp (major) = (80.0 - 28.0)* (80.0 - 28.0)/2(80), = 16.9 s (i.e. LOS
B using above table), dp (minor) = (80.0 - 44.0)* (80.0 - 44.0)/2(80) = 8.1 s (i.e. LOS A using
above table).
1. Width: The minimum clear width of a pedestrian access route shall be 1220 mm
exclusive of the width of curb. It varies according to pedestrian flow rate and different
LOS. It is shown in following Table.
2. Cross slope: The cross slope of the pedestrian access route shall be maximum 1:48.
3. Surfaces: Surface should be firm, stable, slip resistance and prohibit openings & avoid
service elements i.e. manholes etc.
A buffer zone of 1.2 to 1.8 m (4 to 6 ft) is desirable and should be provided to separate
pedestrians from the street. The buffer zone will vary according to the street type. In downtown
or commercial districts, a street furniture zone is usually appropriate.
3. The parallel line should be 0.2-0.6 m in width and min. length 1.8 m (standard 3m).
4. Marking may be of different type to increase visibility like as solid, standard, continental,
dashed, zebra, ladder. It is shown in Fig. 47:13.
1. It works best when refuse area median is greater than cross walk width or 3.6 m, have
a surface area of at least 4.6 sq.m, are free of obstructions, have adequate drainage, and
provide a flat, street level surface to provide accessibility to people with disabilities.
2. The Refuge area width should be at least 1.2 m wide and depend upon traffic speed.
It should be 1.5m wide on streets with speeds between 40-48 kmph, 1.8 m wide(48-56
kmph), and 2.4 m (56-72 kmph).
1. These are expensive method but eliminate all or most conflicts. These may be warranted
for critical locations such as schools factory gates, sports arenas, and major downtown
intersections (specially in conjunction with transit stations).
2. Overpasses are less expensive than underpass. However , vertical rise and fall to be
negotiated by pedestrians is usually greater for an overpass, and it may be aesthetically
inferior.
4. Ramps slopes not greater than 1:12 (8.33%) are preferable to flights of stairs to accom-
modate wheelchair, strollers, and bicycles and to comply with ADA.
Crosswalk D
Sidewalk A
Vdi
Wa Vdo
W
d
2
Vco Vci Area = 0.215R
where, TS =available time-space (m2 -s), Wa = effective width of Sidewalk a (m), Wb = effective
width of Sidewalk b (m), R = radius of corner curb (m), and C = cycle length (s).
where, Gs=min time gap in sec, W= width of crossing section, ts= startup time, tc=consecutive
time between two pedestrian, N=no of rows, and Sped =pedestrian speed.
Figure 47:16: In-Pavement Raised Markers with Amber LED Strobe Lighting and LED Signs
Given w=7.5m; tc= 3 sec Sped = 0.9m/s Find out N N=27/5 i.e. 6 row (5 containing 5 & 6th
containing 2) Time gap
W
Gs = + tc(N − 1) + ts
Sped
= [(7.5/0.9) + 2(6 − 1) + 3]
= 21.33sec
47.5 Conclusion
This lectures covers pedestrian problems, their characteristics, different level of services and de-
sign principles of pedestrian facilities. Pedestrian as the most basic unit / component for street
and public space design. Pedestrian includes vulnerable road users - elderly, disabled, children,
people with luggage etc. Safety of pedestrians to be on top priority (to be never compro-
mised by design / policy). Effective integration of technical innovations, policies, institutional
mechanisms for pedestrian safety.
47.6 References
1. Pedestrians Research Problem Statements. Transportation Research Circular E-C084,
Transportation Research Board, 2005.
5. Adolf D. May. Fundamentals of Traffic Flow. Prentice - Hall, Inc. Englewood Cliff New
Jersey 07632, second edition, 1990.
Chapter 48
48.1 Overview
Intelligent Transportation Systems (ITS) is the application of computer, electronics, and com-
munication technologies and management strategies in an integrated manner to provide traveler
information to increase the safety and efficiency of the road transportation systems. This pa-
per mainly describes ITS user services, ITS architecture and ITS planning. The various user
services offered by ITS have been divided in eight groups have been briefly described. The
ITS architecture which provides a common framework for planning, defining, and integrating
intelligent transportation systems is briefly described emphasizing logical and physical architec-
ture. Integration of ITS in transportation planning process which follows a systems engineering
approach to develop a transportation plan is also briefly described in this paper.
48.2 Introduction
Intelligent Transportation Systems (ITS) is the application of computer, electronics, and com-
munication technologies and management strategies in an integrated manner to provide traveler
information to increase the safety and efficiency of the surface transportation systems. These
systems involve vehicles, drivers, passengers, road operators, and managers all interacting with
each other and the environment, and linking with the complex infrastructure systems to improve
the safety and capacity of road systems.
As reported by Commission for Global Road Safety(June 2006) , the global road deaths were
between 750,000 to 880,000 in the year 1999 and estimated about 1.25 million deaths per year
and the toll is increasing further. World health organization report (1999), showed that in the
year 1990 road accidents as a cause of death or disability were the ninth most significant cause of
death or disability and predicted that by 2020 this will move to sixth place. Without significant
changes to the road transport systems these dreadful figures are likely to increase significantly.
Traditional driver training, infrastructure and safety improvements, may contribute to certain
extent to reduce the number of accidents but not enough to combat this menace. Intelligent
Transport Systems are the best solution to the problem. Safety is one of the principal driving
forces behind the evolution, development, standardization, and implementation of ITS systems.
ITS improves transportation safety and mobility and enhances global connectivity by means
of productivity improvements achieved through the integration of advanced communications
technologies into the transportation infrastructure and in vehicles. Intelligent transportation
systems encompass a broad range of wireless and wire line communication based information
and electronics technologies to better manage traffic and maximize the utilization of the exist-
ing transportation infrastructure. It improves driving experience, safety and capacity of road
systems, reduces risks in transportation, relieves traffic congestion, improves transportation
efficiency and reduces pollution.
3. Electronic payment
6. Emergency management
7. Information management
Road Maintanance
Intelligent Parking
Scheduling and Monitoring
This user service provides information to the travelers about the transportation system before
they begin their trips so that they can make more informed decisions regarding their time of
departure, the mode to use and route to take to their destinations. The travelers can access
this information through computer or telephone systems at home or work and at major public
places. Pre travel information can be accessed through mobile phones as shown in Fig. 48:2.
Different routes and respective travel time durations indicated on VMS are shown in Fig. 48:3.
The information include real time flow condition, real incidents and suggested alternate routes,
scheduled road construction and maintenance tasks, transit routes, schedules, fares, transfers,
and parking facilities.
This user service provides travel related information to the travelers en route after they start
their trips through variable message signs (VMS), car radio, or portable communication devices.
Fig. 48:4 shows the various congested and non congested routes shown on display screen. VMS
START :ABCD
: 396
: 12:21
END : XYZ
: 13:05
City Transit
ROUTE DUE
69 3 mins
98 6 mins
408 7 mins
535 9 mins
LYNNWOOD 11 MIN
S. EVERETT 19 MIN
indicating different routes and travel time is shown in Fig. 48:5. This helps the travelers to
better utilize the existing facility by changing routes etc to avoid congestion. This also provides
warning messages for roadway signs such as stop signs, sharp curves, reduced speed advisories,
wet road condition flashed with in vehicle displays to the travelers to improve the safety of
operating a vehicle. The information can be presented as voice output also.
Route guidance
This service provides information to the travellers with a suggested route to reach a specified
destination, along with simple instructions on upcoming turns and other manoeuvres. This
also provides travellers of all modes the real-time information about the transportation system,
including traffic conditions, road closures, and the status and schedule of transit systems. The
benefits of this service are reduced delay and drivers stress levels particularly in an unfamiliar
area.
This user service provide real-time ride matching information to travellers in their homes, offices
or other locations, and assists transportation providers with vehicle assignments and scheduling.
Access road
Loop detectors
0
1
1
0
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
0
1
2 4
Accident Occurs
1
Travellers give information to the service center and get number of ride sharing options from
which they can choose the best.
This service provides a business directory of information on travel-related services and facilities
like the location, operating hours, and availability of food, lodging, parking, auto repair, hos-
pitals, gas stations and police facilities. This also makes reservations for many of these traveler
services. The traveler services information are accessible in the home, office or other public
locations to help plan trips. These services are available en-route also.
Traffic Control
This service collects the real time data from the transportation system, processes it into usable
information, and uses it to determine the optimum assignment of right-of-way to vehicles and
pedestrians. This helps in improving the flow of traffic by giving preference to transit and other
high occupancy vehicles or by adjusting the signal timing to current traffic conditions. The
information collected by the Traffic Control service is also disseminated for use by many other
user services.
Incident Management
This service aims to improve the incident management and response capabilities of transporta-
tion and public safety officials, the towing and recovery industry, and others involved in incident
response. Advanced sensors (close circuit TV cameras), data processors and communication
technologies are used to identify incidents quickly and accurately and to implement response
which minimizes traffic congestion and the effects of these incidents on the environment and
the movement of people and goods. Fig. 48:6 shows the occurrence of incident and its detection
by the center and decision implemented responding to the incident on a highway pertaining to
incident management.
This user service develop and implement strategies to reduce the number of single occupancy
vehicles while encouraging the use of high occupancy vehicles and the use of more efficient
travel mode. The strategies adopted are:
1. Congestion pricing
The main objective of this service is to monitor and implement strategies to divert traffic away
from sensitive air quality areas, or control access to such areas using advanced sensors. This
also used to identify vehicles emitting pollutants exceeding the standard values and to inform
drivers to enable them to take corrective action. This helps in facilitating implementation and
evaluation of various pollution control strategies by authorities.
This service is to provide improved control of highway and train traffic to avoid or decrease
the severity of collisions between trains and vehicles at highway-rail intersections. This also
monitors the condition of various HRI equipments.
Implementing the
Construction and Development Improving the
of Metropolitan Rapid Transit Operational
Systems
Enviornment of Urban
Bus Systems
Providing a Healthy
Operational Environment of
Mass Rapid Transit Systems
Facilitating the
Development of
Enhancing the Service Urban Bus Systems
Quality of Rapid Transit
Systems
This user service collects data through advanced communications and information systems to
improve the operations of vehicles and facilities and to automate the planning and management
functions of public transit systems. This offers three tasks:
1. To provide real-time computer analysis of vehicles and facilities to improve transit op-
erations and maintenance by monitoring the location of transit vehicles, by identifying
deviations from the schedule, and offering potential solutions to dispatchers and operators.
This service is intended to provide information on expected arrival times of t vehicles, transfers,
and connections to travellers after they begin their trips using public transportation. This also
provide real-time, accurate transit service information on-board the vehicle, at transit stations
and bus stops to assist travellers in making decisions and modify their trips underway.
The aim of this service is to offer public transport facility to travellers by assigning or scheduling
vehicles by
2. assigning privately operated vehicles on demand which include small buses, taxicabs, or
other small, shared-ride vehicles.
Under this service, travellers provide information of their trip origin and destination to service
station. The center then assigns the closest vehicle to service the request and to inform the
travellers regarding arrival of such vehicles well in advance to reduce their anxiety.
This user service creates a secure environment for public transportation operators and support
staff and monitors the environment in transit facilities, transit stations, parking lots, bus stops
and on-board transit vehicles and generates alarms (either automatically or manually) when
necessary. It also provides security to the systems that monitor key infrastructure of transit
(rail track, bridges, tunnels, bus guide ways, etc.).
1. CV electronic clearance
traffic
monitoring camera
tag reader
traffic gate
111111111111111
000000000000000
000000000000000
111111111111111
REDUCE
SPEED
000000000000000
111111111111111
000000000000000
111111111111111
PASS
5 111111111111111
000000000000000
MPH
traffic
Information display
5. Freight Mobility
This service allows enforcement personnel to electronically check safety status, vehicle’s creden-
tials, and size and weight data for the commercial vehicles before they reach an inspection site.
The authorities send the illegal or potentially unsafe vehicles only for inspection and bypass
safe and legal carriers to travel without stopping for compliance checks at weigh stations and
other inspection sites.
At inspection station the safety requirements are checked more quickly and more accurately
during a safety inspection using automated inspection capabilities. Advanced equipments are
used to check brake, steering and suspension performance and also the driver’s performance
pertaining to driver alertness and fitness for duty.
This service monitors the driver, vehicle, and cargo and notify the driver, carrier, and, also
to the enforcement personnel, if an unsafe situation arises during operation of the vehicle.
This is user service also assures freight container, trailer, and commercial vehicle integrity by
monitoring on-board sensors for a breach or tamper event.
This service allows carriers to purchase credentials such as fuel use taxes, trip permits, over-
weight permit, or hazardous material permits automatically. The mileage and fuel reporting
and auditing components are provided to the carriers automatically which reduce significant
amount of time and paperwork.
This user service provides immediate information regarding the types and quantities of haz-
ardous materials present at incident location to the emergency personnel in order to facilitate
a quick and appropriate response. The emergency personnel are informed regarding shipment
of any sensitive hazardous materials so that timely action could be taken in case of accidents.
Freight Mobility
This service provides information to the drivers, dispatchers, and inter-modal transportation
providers, enabling carriers to take advantage of real-time traffic information, as well as vehicle
and load location information, to increase productivity.
This user service provides assistance to vehicle operators in avoiding longitudinal collisions
to the front and/or rear of the vehicle. This is achieved by implementing rear-end collision
warning and control, Adaptive Cruise Control (ACC), head-on collision warning and control,
and backing collision warning to the drivers.
This helps drivers in avoiding accidents that result when a vehicle leaves its own lane of travel,
by warning drivers and by assuming temporary control of the vehicle. This service provides
to the drivers the lane change/blind spot situation display, collision warning control and lane
departure warning and control.
This user service is specifically aimed at providing vehicle operators with assistance in avoiding
collisions at intersections. The system tracks the position of vehicles within the intersection
area through the use of vehicle-to-vehicle communications or vehicle to infrastructure commu-
nications.
This service helps in reducing the number of vehicle crashes that occur during periods of
poor visibility by in vehicle sensors capable of capturing an image of driving environment and
providing a graphical display of the image to the drivers.
Safety Readiness
This helps to provide drivers with warnings regarding their own driving performance, the con-
dition of the vehicle, and the condition of the roadway as sensed from the vehicle.
This service helps in reducing the number and severity of injuries caused by vehicle collisions
by anticipating an imminent collision and by activating passenger safety systems prior to the
actual impact.
This service provides a fully automated vehicle-highway system in which instrumented vehicles
operate on instrumented roadways without operator intervention.
2. Emergency vehicle management - This user service is to reduce the time from the receipt
of an emergency notification to the arrival of the emergency vehicles at incident location
thereby reducing the severity of accident injuries.
1. Interoperability - The ITS architecture should be such that the information collected,
function implemented or any equipment installed be interoperable by various agencies in
different state and regions.
Table 48:1: User service requirements for Traffic Control user service
Traffic Control provides the capability to efficiently manage the movement of traffic
on streets and highways. Four functions are provided which are
(1) Traffic Flow Optimization,
(2) Traffic Surveillance,
(3) Control, and
(4) Provide Information.
This will also include control of network signal systems with integration of freeway
control. The specified User service requirements
(1) TC shall include a Traffic Flow Optimization function to provide the capability
to optimize traffic flow.
(1.1) Traffic Flow Optimization shall employ control strategies that seek to maximize
traffic-movement efficiency.
(1.2) Traffic Flow Optimization shall include a wide area optimization capability, to
include several jurisdictions.
(1.2.1) Wide area optimization shall integrate the control of network signal systems
with the control of freeways.
(1.2.2) Wide area optimization shall include features that provide preferential
treatment for transit vehicles.
(2) TC shall include a Traffic Surveillance function.
Manage Manage
Emergency Commercial
Provide Services Vehicles Manage
Driver and
Traveller Archived
Services Data
Provide
Electronic Manage
Payment Transit
Services
Manage
Provide Manage
Maintenance
Vehicle Traffic
Monitoring and
and Construction
Control
processes. The sub process is further broken into sub process which are called process specifica-
tions (P-specs) lowest level. These p specs are required to be performed to fulfill user services
requirements. Fig. 48:10 shows process decomposition into process specifications.
B Function
D
Physical Architecture
(Group functions Subsystem A Subsystem H
together)
Architecture
flow
Travelers Centers
Traffic Emergency Commercial Maintenance &
Toll Vehicle
Management Management Administration Administration Construction
Management
Remote
Traveler
Support Information Fleet and Archived
Emissions Transit
Service Freight Data
Provider Management Management Management Management
Personal
Information
Access
Vehicle Roadway
Vehicle − Vehicle Communications
Emergency Security
Vehicle Monitoring
Commercial Toll
Vehicle Collection
Transit Parking
Vehicle Management
Figure 48:12: National ITS physical architecture showing subsystems and communications
Vehicle group consists of five different types of vehicles. The traveler group represents
different ways a traveler can access information on the status of the transportation system.
There are four different types of communication systems.
Through the communication systems all the subsystems are interconnected and transfer the
required data. Fig. 48:13 shows the communication between traffic management subsystem
and the roadway subsystem. Traffic management subsystem is connected to communications
Travelers Centers
Traffic Emergency Payment Commercial Maintenance and
Remote Traveler Vehicle
Support Management Management Management Administration Construction
Roadway
Vehicle
Emergency Security
Vehicle Monitoring
Commercial
Vehicle Roadway
Pavement
Transit
Vehicle Parking
Management
Maintanance and Commercial Vehicle
Construction
Vehicle Vehicles Field Check
which gets real time information of the transportation system through roadway subsystem
which comprise of signal control, detectors, camera, VMS etc.
roadway
signal control equipment
data Roadway coordination Other
Traffic Roadway
signal control
Management status driver
Roadway information Driver
traffic flow + Basic
traffic images Surveillance crossing
traffic sensor call
control + Roadway crossing Pedestrians
video surveillance Equipment permission
control Coordination
request for Roadway traffic
right−of−way Signal characteristics Traffic
Controls
Collect Traffic
Surveillance traffic operator
TMC Signal data
Control Traffic Operations
Traffic Personnel
Maintenance traffic operator
inputs
ITS transportation planning process differs from the traditional transportation planning pro-
cess. ITS has the unique capability to integrate different modes of transportation such as
public auto, transit, and infra-structural elements through communications and control. The
multi-modal integration potential provides a great opportunity for planning across modes. The
comparison between ITS approach and conventional approach for solving various transportation
problems are shown for few problems are shown in table. 48:3.
Table 48:3: Relationship between problems, conventional approach and ITS approach
Problem Possible solutions Conventional approach ITS approach
Lack of Provide user Expand fixed route Multi-modal pre trip and
mobility friendly access to transit and Para en-route traveler
and quality transit service information
accessibility transportation
services Radio and TV Personalize public
traffic reports transportation
Personalized public
transport
Telecommuting
transportation pricing
Traffic Improve safety Improve roadway Fully automated vehicle
accidents geometry, sight control system
distance, traffic
signal Automated warning
system
Grade separated
intersection Driver condition on
monitoring
Driver training
Automated detection of
Street lighting adverse weather
Emergency notification
Table 48:4: ITS approach for the goal enhance public safety
Vision Improvement of travelers safety by providing advance warning by
implementing crash counter measures and by controlling to the security
of the transportation facilities
Goal Enhance public safety
Objectives Promote safety of transportation Reduce crashes on freeways
facility and streets
Functions # Monitoring of rest areas # Implement crash counter
measures at high accident
# Provide public safety at park locations
and ride lots
# Implement work zone safety
# Coordinate emergency response measures
using appropriate agency
# Install traffic signs signals and
road marking
Most public agencies are aware of the challenges in mainstreaming ITS into transportation
planning process where ITS projects are part of traditional transportation programs on local
or state level to achieve the best output from transportation investments.
48.6 Summary
This lecture introduces three important intelligent transportation system concepts such as:
user services architecture planning. ITS user services includes concept on Travel and traffic
management, Public transportation operations, Electronic payment, Commercial Vehicle op-
erations, Advanced vehicle control and safety systems, Emergency management, Information
management, and Maintenance and construction management A general ITS architecture and
its national representation is then covered. The ITS planning discusses how to integrate ITS
into transportation planning
48.7 References
1. M A Chowdhary and A Sadek. Fundamentals of Intelligent Transportation systems
planning. Artech House Inc., US, 2003.
Chapter 49
49.1 Standards
Standards provide some norms and regulations to be followed. Just as the standards are
provided by IRC for the signs to be used similar standards are there for ITS. They bring
oneness in the system. They help in generalizing any system. Also they bring homogeneity in
the design. The standards help the non-transportation designers to adhere to some guidelines
so that the system is sound technically.
• Product behavior.
• Interface.
• Performance.
Product behavior
The standards prescribe ways the product should behave. The behavior everywhere should be
uniform. It should not happen that the product behaves differently in some different scenarios.
It ensures uniform product responses. It also helps in easy understanding of a device. It
provides consistency in the output. Confusion to the users is also avoided. Just as a STOP or
GO sign is used it everywhere and every time means the same. Standards do the same thing
in ITS.
Interface
Many devices are to be connected with each other. Connection of components to system must
be universal. More ‘plug and play’ type devices should be used. By having a standard the
device will get connected using a standard interface. For ex, many traffic signals should be
connectable to same controller. If universal interface is not there, then many devices will not
work everywhere, which is not desirable.
Performance
Check on performance of a device is essential. Standards should be set to have at-least minimum
performances. The standards will help the manufacturers to develop quality and less expensive
products. It will set the minimum quality threshold accepted for the product. Detection of
under-performance of a device is essential to keep an overall check on the system.
Data transfer is an important aspect in the ITS and the data flows from one agency to other.
Thus the co-ordination and interaction between various agencies must take place effectively.
The data must be in stored or transferred in standard format. Data sharing must be possible.
Standard data dictionary and message sets are required for this purpose. The data for each
organization should mean the same. Thus the data dictionary is essential.
It helps the government in enforcing some rules which are otherwise difficult to implement. It
also helps the vendors to choose the manufacturer best from the lot which will also be best for
the users. It provides manufacturer with a guide to produce efficient device. If some standards
are made by the government then the manufacturer has to follow the rules. So the uniformity is
achieved in the product and its output. As all the devices are made by following same standards
it provides same platform for vendors to judge a product. Thus a best product is selected by
the vendor which will also be good for the user.
ETC was thus started with this issue in mind. Standardization will provide uniform platform.
Still the process of standardization is ongoing and a single standard is in the making. It is
expected to reduce the problems of toll collection in US. Thus from this case study it can be
seen that the standards are helping the engineers to simplify the system and help in reducing
complexities.
Each of the class has some sub classes or sub-groups. For each sub-group some set of standards
are to be used. Each sub-group may have more than one standard to follow. This takes care
for the standard to be effective in all aspects.
• Ramp metering
• Traffic signal
• Vehicle sensors
This application area includes the interface between a traffic management center or a data
archive and roadside equipment. Primarily the interface is between traffic management sub-
system and roadway sub-system. By this standard we can effectively control, monitor and
collect data from the equipment on or at the roadside. The roadside equipment collects and
processes signals from the sensors as vehicles are detected to generate information. The roadside
equipment sends the information to the center. The standards included are:
• Object definitions for environmental sensor station and roadside weather information
system.
The 1st , 2nd and 4th standards are used for video data collection. The 3rd is used when some
environmental data collection is to be done. The last is the common standard to be followed
while data collection is done.
It is an interface between traffic management and roadway system. It gives real time information
such as traffic conditions, weather conditions or any other advisory to user. It has one primary
and several secondary standards. The primary standard is listed below. The standard included
is
Ramp metering
This application area provides an interface between traffic management and roadway system.
The roadway sub-system includes a ramp meter which controls traffic in freeway lanes. One
primary standard is included for this application. The standard included is
Traffic signal
It is an interface that is used for local signal controllers. It is also used for master controller.
The roadway sub-system includes a local-signal controller or on-street master controller. Based
on the traffic data appropriate signal timing is decided and then interface provides information
to controller about the signal timings. 2 major standards for this are:
The standards used are:
Vehicle sensors
This application area includes the interface between a traffic management and roadway system
and a roadway and archived data management subsystem. The roadway subsystem includes
roadway sensors that identify different characteristics and communicates it to main center.
There are 4 primary standards for this application. The standards are:
• Data archival
• Traffic management
• Traveller information
Data archival
This application area includes an interface between the archived data management subsystem
and the sources and the users of archived data. The data archive collects data for off-line
analysis purposes such as planning and research. Data sources for the archive include traffic
management centers, emergency management centers and commercial vehicle administration
system. Effectively it is the data transfer between centers for planning and research. There are
two primary standards for this. Standards used are:
Traffic management
It provides an interface between a traffic management center and other centers like transit
management center, emergency management, toll operation, event promoter, media and other
management centers. It enables transfer of real time traffic data and control over emergency-
maintenance operations. Three standards are used for this. Standards used are:
Traveller information
This application area includes the interface between information service provider and traveler
information collector/disseminator. These interfaces support the roles of an ISP that may
include information collection, integration of collected data and dissemination of aggregated
data. Four standards are included in this. Standards used are:
MAYDAY
This application area includes interface between driver and emergency management center. The
interface enables the driver or traveler to either request emergency assistance or have such a
request automatically sent after a crash. One standard is included for this type of application.
Standards used is
• On-board land vehicle Mayday reporting interface
This application area includes interface between transit vehicle and transit management center.
Transit vehicles send information on location, passenger count, maintenance and so on to the
transit management center. Similarly the transit management center provides information
regarding dispatch, routing and other information. Standards used are:
• TCIP-control center business area standard.
• Toll/fee collection
• Signal priority
Toll/Fee collection
This application area includes interface between toll or parking management facility and vehicles
that would pay the toll or fee. This interface supports reading vehicle and processing electronic
identification and associated account information. 5 primary standards are included in this.
Standards used are:
• Specification for Dedicated Short Range Communication (DSRC) medium access and
logical link control
• Specification for Dedicated Short Range Communication (DSRC) physical layer using
microwave in 902-928 MHz.
Signal priority
This application area includes interface between traffic controllers and transit or emergency
vehicles. The interface supports providing priority to the transit vehicles or preempting emer-
gency vehicles, depending on the detection of the vehicle type or request from vehicle. This
application area has 5 standards associated with it. Out of these 5 standards 4 are same as for
toll collection. Standards used are:
• Specification for Dedicated Short Range Communication (DSRC) medium access and
logical link control
• Specification for Dedicated Short Range Communication (DSRC) physical layer using
microwave in 902-928 MHz.
This application area includes interface between railway and roadside equipment. The interface
support co-ordinated operations of the railway and roadway-side equipment to improve the
operations and safety for both rail transit and highway vehicles. This includes one standard
between two systems. Standard used is:
• Standard for interface between railway subsystem and highway sub-system at intersection
Sign configuration
All the parameters regarding the sign boards are included in this feature. Whenever a message
has to be displayed some standard data of the sign board is required for proper display of
message. To access this parameter some syntax is to be followed to get the information. 2
important parameters are:
• Height/Width of sign board- it gives the height and width of the board.
Font configuration
All data regarding the type of font, the size is described by the font configuration. It is a
read-write parameter where we can access the data and also overwrite it if required. Height
may be expressed in pixels. The important parameters are:
• Font name parameter - it gives the type of font to be used as default which can be changed.
These provide some codes that are used for controlling any sign. The activity on a sign is
governed by these parameters. Some important parameters are:
• Message display time remaining parameter - states the display time remaining for a par-
ticular message.
Message parameters
All the data regarding the various types of messages their characteristics are controlled by these
parameters. The changing of any message or the status of any message can be assessed by these
parameters. Some important parameters are discussed below:
• Max. no. of changeable message parameter - it specifies the maximum number of change-
able messages that can be stored or used at a time.
• Message run time priority parameter - it gives the run time priority of the message and
thus is helps in decision making.
• Message status parameter - it gives the status of the message i.e. whether it has been
displayed or not; whether it is edited; whether it is being edited, etc.
Illumination objects
This gives the parameters related to the illumination of the sign boards. The status of present
illumination, the source of illumination can be assessed. Some important parameters of it are:
• Illumination control parameter - it gives the source of the illumination of the sign board.
The source can be assessed and also can be changed. Thus it is a read-write parameter.
• Illumination brightness level parameter - it gives the brightness around the sign board.
Some sensors are used to know the current brightness level.
Status objects
They help in finding the status as is specified initially. Some important parameters are:
• Current speed parameter - it gives the current speed of the vehicle. It is an read-only
parameter.
• Current speed limit parameter - it denotes the current speed limit of the corridor. It is a
read-write parameter.
It gives the power status of a vehicle. This type of DMS service is inside the vehicle. It gives
information to the driver. Some important parameters of this field are discussed below:
Validation testing
Standards are continually tested during development process. It ensures that it satisfies all
requirements. The standards are validated in this step.
Verification testing
This examines the practicality and economic viability to build system based on standards.
This is mainly done by vendors and users. It can be performed by reviewing and analyzing the
standards documents or developing software for the same.
This type of testing is done by experience. It includes real world experience with the system.
As it is subjective mostly it is not followed.
49.3 Evaluation
Just like testing is done for standards the whole ITS system is also needed to be evaluated in
stages. It helps in judging any project and its deployment. It minimizes the risk of project
failure. It helps in identification of current performance of system.
• Deployment tracking
• Impact assessment
• RP and SP survey
Evaluation is done before the project is implemented. During the planning stage this type of
evaluation can be done. Previous data can be used for doing this. Two methods of this are:
• Benefit cost analysis- the benefits of the project need to be evaluated. The cost of the
project is also to be found out. Then depending upon the ratio the evaluation is done.
• Relative ranking- it is a weight based method. Weight given to criteria and the value of
each alternative is calculated.
S = ΣK × V (49.1)
where, S is the value of alternative, V is the value of one criterion, and K is the weight of that
criterion.
Here, S is the total value of the alternative. More the value of alternative, more prospects
of that alternative to be selected. Each alternative can be evaluated by different criteria. The
value of that criteria is denoted by V . Study is to be conducted to calculate the value of the
criteria. K denotes the importance of that criteria to the alternative. It is a global entity and
does not change with the value of the criteria. For example, consider a case of providing the
signal priority system on a certain link. For evaluating this system an important criteria is the
travel time on a corridor. The value of the travel time will be the V value. Also the weightage
to this parameter will be K.
Deployment tracking
This evaluation is done when the project is being implemented. It gives the idea regarding the
difference in the goals and actual work undertaken. We can determine the current progress rate
of the work. The future directions needed to to be taken can also be assessed. Effective way of
knowing this is the amount of data transfer between various agencies.
Impact assessment
After an ITS system is deployed it is allowed to collect data over a period of time. The data
collected is regarding the parameters from which assessment can be done. The criteria and the
measure of effectiveness is mentioned in table. 49:1.
RP and SP survey
Many times benefits cannot be expressed in terms of monetary units as is required for benefits
cost analysis. In such cases RP and SP surveys are conducted. RP survey is the revealed
preference survey. In this assessment of present system is done. In this survey the questionnaire
is asked regarding the present facilities. The respondents grade the parameters set in the survey.
Based on this grading the evaluation is done. SP survey is stated preference survey. This
survey is done for future projects. In this type of survey the future project is explained to the
respondents. They are given alternatives regarding this project. The respondents rate each
alternative and thus total evaluation is done.
This is a model based technique. In this method, models such as ‘INTEGRATION’, ‘DYNAS-
MART’, ‘DYNAMIT’ are used for evaluation. It is a cost effective way of analysis. In these
models simulation is done considering the future ITS installment in the facility. The facility is
reproduced in the software. The future changes to be made in the facility are added. Then it
is simulated to show the desired results in terms of some traffic parameters. Also simulation is
done without the introduction of the new facility. The parameters are again calculated. These
two analysis gives the difference in the facility that may arise in the facility. This gives instant
evaluation of the facility of ITS. Also it is cost effective as less personnel are required and the
data collection is not a major issue. Evaluation can be done before the implementation of any
facility. Thus cost savings in selection of alternative facilities is also observed. If the present
technology used is not found satisfactory then some improved technology can be procured to
fulfill our requirements.
In this type of technique the traditional way of benefit-cost analysis is done. There are some
software that directly compute cost and benefit. Some software use parameters like travel time,
speed, delay to compute cost and benefit. But the basic idea remains the same. IDAS model
of US DOT is an example of such software.
The basic principle in IDAS model is to calculate the benefit cost ratio. It helps in providing
BENEFITS
ALTERNATIVE
MODULE
COMPARISON
MODULE
COST MODULE
COST ALTERNATIVES
INPUTS GENERATOR
INPUT/OUTPUT INTERFACE
a step wise approach for calculate it. Initially input is to be given from a travel demand
model. It will evaluate the input and output parameters from the system. Depending upon
the parameters various parameters will be generated. Then the control goes to cost and benefit
module where the benefits and cost of alternatives are calculated. Last step is comparison of
these calculated cost and benefits. Depending upon the comparison is done. At all the steps
cost input is given. This cost may not always be in monetary terms but can be expressed in
some discomfort. The IDAS model is shown in Fig. 49:1.
Sample Question 1
Answer Dynamic message sign standard is a standard employed to have certain set of rules
and regulations for dynamic message signs. All the devices used should comply with the
standard so that the device can be used on any platform. All the functioning of the device
should be universal. It defines the data elements required for DMS. Data elements are like
font, font size, the height of font, the spacings between characters, the type of message etc.
It also defines the conformity-performance of a DMS device. That is it defines how the DMS
system should work in any scenario. The performance of the system is thus checked. It contains
mandatory, optional and conditional clauses which are needed to be followed.
There are many actions that are required to be done in a DMS system. All such actions can
be done using some syntax. The standard provides these syntaxes that are to be used while
working with the DMS devices. All devices should work with these syntax.
Features:
1. Sign configuration: All the parameters regarding the sign boards are included in this
feature. Whenever a message has to be displayed some standard data of the sign board
is required for proper display of message. To access this parameter some syntax is to be
followed to get the information. Two important parameters are:
• Height/Width of sign board- it gives the height and width of the board.
• Horizontal/vertical border parameter- it gives the border available on the board.
2. Font configuration: All data regarding the type of font, the size is described by the
font configuration. It is a read-write parameter where we can access the data and also
overwrite it if required. Height may be expressed in pixels. The important parameters
are:
• Font name parameter which gives the type of font to be used as default which can
be changed.
• Font size parameter which gives the size of font.
3. Sign control objects: These provide some codes that are used for controlling any sign.
The activity on a sign is governed by these parameters. Some important parameters are:
• Activate message parameter which provides a code stating when to activate a certain
parameter.
• Message display time remaining parameter indicating states the display time remain-
ing for a particular message.
Sample Question 2
Answer ITS evaluation can be done in four different ways as given below:
(a) Planning level evaluation: evaluation is done before the the project is imple-
mented. During the planning stage this type of evaluation can be done. Previous
data can be used for doing this. Two methods of this are:
• Benefit cost analysis- the benefits of the project need to be evaluated. The
cost of the project is also to be found out. Then depending upon the ratio the
evaluation is done.
• Relative ranking- it is a weight based method. Weight given to criteria and the
value of each alternative is calculated as S = ΣK × V , where S is the value of
alternative, V is the value of one criterion, and K is the weight of that criterion.
(b) Deployment tracking: this evaluation is done when the project is being imple-
mented. It gives the idea regarding the difference in the goals and actual work
undertaken. We can determine the current progress rate of the work. The future
directions needed to to be taken can also be assessed. Effective way of knowing this
is the amount of data transfer between various agencies.
(c) Impact assessment: after an ITS system is deployed it is allowed to collect data
over a period of time. The data collected is regarding the parameters from which
assessment can be done(Table. 3c).
(d) RP and SP survey: many times benefits cannot be expressed in terms of monetary
units as is required for benefits cost analysis. In such cases RP and SP surveys are
conducted. RP survey is the revealed preference survey. In this assessment of present
system is done. SP survey is stated preference survey. This survey is done for future
projects.
Sample Question 3
Answer The basic principle in IDAS model is to calculate the benefit cost ratio. It
helps in providing a step wise approach for calculate it. Initially input is to be given
from a travel demand model. It will evaluate the input and output parameters from the
system. Depending upon the parameters various parameters will be generated. Then
the control goes to cost and benefit module where the benefits and cost of alternatives
are calculated. Last step is comparison of these calculated cost and benefits. Depending
upon the comparison is done. At all the steps cost input is given. This cost may not
always be in monetary terms but can be expressed in some discomfort.
49.4 Summary
This lecture give in detail ITS standards, its use and classification followed by various ways of
evaluation ITS deployment. Some of the important ways of evaluation include: planning level
evaluation, deployment tracking, impact assessment, and RP and SP survey.
49.5 References
1. M A Chowdhary and A Sadek. Fundamentals of Intelligent Transportation systems
planning. Artech House Inc., US, 2003.
3. Yokota Toshiyuki and Weiland Richard. Its standards for developing countries. (3),
2004.
Chapter 50
Advanced ITS
50.1 Introduction
Some new features in the ITS sector are covered in this section. The first basic concept in any
ITS implementation is SMART CAR. It is the car with all modern features. The SMART CAR
has to be complimented by a SMART ROAD. The developments in the ITS field started with
the infrastructure to infrastructure communications. They formed the basis of further devel-
opment of ITS. Then the I2I communications were upgraded with the vehicle to infrastructure
communications. They are called V2I communications. The latest development is the vehicle
to vehicle communications, i.e. V2V communications.
• Anti-collision sensors
A smart car must be able to sense, analyze, predict and react to the road environment, which
is the key feature of smart cars. The car works with a central component that monitors
the roadway and the driver. It also evaluates of the potential safety benefits. It addresses
navigation, obstacle avoidance and platooning problems. The car aims at expanding the time
horizon for acquiring safety relevant information and improving precision, reliability and quality
of driving. There are some preventive safety technologies and in-vehicle systems, which sense
the potential danger. The Adaptive Integrated Driver-vehicle Interface (AIDE) project tries
to maximize the efficiency and safety of advanced driver assistance systems, while minimizing
the workload and distraction imposed by in-vehicle information systems. Almost 95% of the
accidents are due to human factors and in almost three-quarters of the cases human behaviour
is solely to blame. Smart cars present promising potentials to assist drivers in improving their
situational awareness and reducing errors. With cameras monitoring the driver’s gaze and
activity, smart cars attempt to keep the driver’s attention on the road ahead. Physiological
sensors can detect whether the driver is in good condition. The actuators will execute specified
control on the car without the driver’s commands. The smart car will adopt active measures
such as stopping the car in case that the driver is unable to act properly, or applying passive
protection to reduce possible harm in abrupt accidents, for example, popping up airbags.
STOP
WERE ON
RED
• Weather warning
• eCALL
• Collision warning
50.7 Summary
This chapter briefly covers some pointers to future directions of ITS developments. This include
smart cars and smart road and a communication system between them resulting in complete
automation of the traffic system.
50.8 References
1. L. R Kadiyali. Traffic Engineering and Transportation Planning. Khanna Publishers,
New Delhi, 1987.
Brake
Support
Collision
Warning