Traffic Flow
Traffic Flow
Traffic Flow
3, 1999 115
drive at exactly the same speed along a link of traffic exiting)/(time taken) = v/r. From this we
(irrespective of how close together they are) and postulate the uncongested form of q{y) as
so take exactly the same time (which we call the
trip time, r) to travel from entrance to exit. This q(v)=-v. (3)
would mean, in terms of a macroscopic model,
that for an initially empty road with inflow u{t) Substituting (3) into (2) gives
(vehicles/unit time) entering the link the outflow dv 1
from the exit would be given by q(t) (vehicles/unit (4)
time) where, _ + - , = „(,).
400
300
o
100 perfect road users
uncongested flow model
0 10 20 30 40 50
time t
Fig. 1. Comparison between perfect road user model and uncongested flow model for linearly increasing traffic inflow
Journeys which take forever quickly and secondly, the final piece of traffic
Consider thee case where there is an initial entering the road moves infinitely slowly! Before
volume of traffic. Vo, on the link and there is no becoming too concerned with the existence of a
inflowing traffic, i.e. we solve (4) subject to road on which you may be trapped forever, or on
u(t) = 0 and v(0) = F o , and use (3) to obtain which you may move superluminally depending on
the somewhat demonic whim of where you are in
(8) the queue of traffic, let's look at another example.
Note that the model predicts that the time Blocks of traffic
required for all the traffic to clear the link is Consider a "block" of traffic of the form
infinite! Physically we can interpret this as meaning
0 /<0
that vehicles at the "tail end" of the block of traffic
move infinitely slowly. Even with this being the u(t) = { «0 0< t<T (11)
case, however, it is easy to show that the average 0 t>T
time, T, spent by a vehicle on the link is the trip
time r, i.e. The uncongested flow model predicts outflowing
traffic of the form,
_ (9)
f° <<°
where, substituting equation (8) into equation (3), q(t) = i Uo(\ - e~('M) 0<t<T.
(7 /r) r T
(«o(l-e- " )e( -')/ T>t
v(/) = K o e - ( l ^ ' . (10)
(12)
Thus we have two general predictions from our Figure 2 shows results generated by equation (12)
uncongested flow model so far. First (from the for a range of trip times r with UQ — 100 and
previous section), traffic entering an initially clear T = 30. Note that the outflows have been shifted
road at t = 0 moves along the road infinitely along the time scale to allow direct comparison
118 TEACHING MATHEMATICS AND ITS APPLICATIONS Volume 18, No. 3, 1999
\ \ '• *=2
V x =5
S 60 \ • • ;
i '• 1
i '• <
20 ! i :'
' ' •' 1
.'" / : i
i :]
-10 0 10 20 30 40 50
timet
Fig. 2. Comparison between perfect road user model and uncongested flow model for a block of inflowing traffic.
with the perfect road user model. Two points are Congested traffic: death by traffic jam
worth noting from Figure 2. In the uncongested flow model the volume of
First, as noted earlier, the uncongested flow traffic on the link can increase without bound and
model predicts traffic at the start of the block of the link will never become congested, because
traffic moves infinitely quickly and traffic at the increased volumes of traffic will never adversely
end of the block moves infinitely slowly. Secondly, affect traffic outflow. This is, of course, not what
as T —* 0 the outflows become more like the results we would expect to happen in real life. As the link
of the perfect road user model. Or conversely, as T volume increases we would expect flow to become
increases we can regard the outflows from the hindered and eventually jam. A simple way to
uncongested flow model as resulting from an model this is with the quadratic function
increased "diffusing" or "spreading" of the perfect
road user model.
(.3)
Such "diffusing" and "spreading" of traffic pro-
files does, of course, actually happen in real life, 0 otherwise
and so here we have he model predicting a where J is the "jam volume" at which traffic flow
real traffic phenomenon. This behaviour finds its stops. Note that for small values of v (or large
root in the model assumption that outflow, q, is a values of J) the quadratic model behaves like the
function of link volume only. As mentioned be- uncongested flow model. Also note that the out-
fore, physically this can be interpreted as the flow from the link cannot exceed the maximum
model instantaneously and uniformly spreading value of 7/4r. We refer to equations (2) and (13)
inflowing traffic along the length of the link. Thus as the congestedflowmodel.
although the uncongested flow model predicts (at The differential equation which results from
least qualitatively) a real phenomenon it does so substituting (13) into (2) has an analytic solution
from use of a crude physical assumption and so we only in the case of very simple inflows. As an
wouldn't expect good quantitative agreement at example we consider the case of constant inflow
this point between the model and the real world. where
TEACHING MATHEMATICS AND ITS APPLICATIONS Volume 18, No. 3, 1999 119
100-
s
uncongested flow model
80-
' • ' . ' '
(q(v)=v/t)
'"^••^ congested flow model
' • ' / • • ' '
(q(v) = V(J-V)/JT);
£> 60-
!*••'
\ \ - J = 3000
\ J = 2000
f
\
\ \
11
t
\ T=10
20-
',
0- 1 \
\
1
is simply the time taken for a vehicle travelling at fact that the models predict novel phenomena such
20 m/s to travel 5000 m from entrance to exit of the as infinite journey time, "road rage" and the
road. Finally we set J = 1000, which is the maxi- prospect of "death by traffic jam". Finally, the
mum number of vehicles, of length 5 m, which can best way to improve these simple models is to
be placed "bumper to bumper" along 5000 m of include spatial dependence and thus move from
road. the solution of an ordinary differential equation
with variables of time, flow and volume to the
(a) Using (22), the congestedflowmodel jams if solution of a partial differential equation with
C/o > J/4T, which is true for the above data. variables of space, time, flow and density. This
Thus jamming does occur, and using (21), more realistic formulation of the problem is
the jam begins at Tjam as 43 minutes. commonly known as the Lighthill, Whitham1 or
We can easily evaluate the predicted outflows Lighthill, Whitham and Richards model.7
from the 3 models at t = 600 seconds using (1),
(12) and (20) to give, References
1. Wan, F. Y. M., "Mathematical Models and Their Analysis."
(b) 1.2 vehicles/second, (c) 1.09 vehicles/second, Harper and Row, 1989.
and (d) 0.9 vehicles/second. 2. Prigogine, I. and Herman, R., "Kinetic Theory of Vehicular
Traffic." American Elsevier, 1971.
Concluding remarks 3. Low, D. J. and Addison, P. S., A nonlinear temporal head-
way model of traffic dynamics, Nonlinear Dynamics, 1998,
The simple traffic flow models that have been 16, 127-151.
considered in this paper will provide students with 4. Resnick, M., "Turtles, Termites and Traffic Jams." MIT
an opportunity to exercise their skills in differential Press, 1995.
equations and integration. They can also be used 5. Paramics web site: http:Hwww.paramics.com/
6. Tallarida, R. I., "Pocket Book of Integrals and
to encourage students to look critically at the Mathematical Formulas." 2/e, CRC Press, 1992.
solutions they obtain and interpret them physi- 7. Daganzo, C. F., "Fundamentals of Transportation and
cally. Hopefully this latter process is aided by the Traffic Operations." Pergamon, 1999.
TEACHING MATHEMATICS AND ITS APPLICATIONS Volume 18, No. 3, 1999 121
Mark McCartney is a Research Officer at the University of Ulster. Previous to his appointment at the University
of Ulster he was a Lecturer in Mathematics at the University of Abertay Dundee. His research interests include
theoretical atomic physics and the mathematical modelling of traffic flow.
Malachy Carey is professor of Management Science in the Faculty of Business and Management at the University
of Ulster. Prior to that he was a Senior Research Fellow at the University of Oxford, and before that Associate
Professor at Carnegie-Mellon University in Pittsburgh. His current research interests are in modelling flows,
congestion and pricing for road traffic networks and in operations managements and scheduling for public transport.