Documente Academic
Documente Profesional
Documente Cultură
Lecture 1
1
N(t) ~
N (t )
5
4 N(t)
3 q(t)
2
1
0 time
t1 t2 t t3 t4 t5
1.225, 10/29/02 Lecture 1, Page 2
Observations on N(t)
~ ~
(t ) is a smooth approximation of N(t)
N dN (t )
exists.
dt
~
dN (
t )
q (t ) = : instantaneous flow at time t.
dt
~
N (T ) − N (0) N (T ) − N (0)
Average flow = ≅
T T
Single lane
Observer A: A(t) Observer D: D(t)
A(t)
N(t)
D(t)
n1
n
?
0 time
0 t0 A-1(n) t D-1(n) t1
1.225, 10/29/02 Lecture 1, Page 4
Accumulated Items: Q(t) = A(t) - D(t) ?
Vehicles depart in the same order as they entered a link (i.e. segment
of road) ≡ (First-In-First-Out) FIFO
N(t)
A(t)
D(t)
n1
Q(t)
n+dn
n w(n)
elemental waitings
time
0 t0 A-1(n) t D-1(n) t1
t+dt
1.225, 10/29/02 Lecture 1, Page 7
Total Waiting Time
t t
Total waiting during [t0, t1]: Area = ∫ 1 Q(t )dt = ∫ 1 ( A(t ) − D (t ))dt
t0 t0
n1
Total waiting during [0, n1]: Area = ∫ w(n)dn
0
position
h1 h2 h3 h4
x
0 time
t0 T
1.225, 10/29/02 Lecture 1, Page 9
Flows and Headways
m( x )
Flow rate: q ( x) =
T
m( x)
1 T
∑ h (x)
j =1
j
Then, = ≈ = h (x)
q ( x ) m( x ) m(
x)
1
q(x) is also called volume in traffic flow systems circles (i.e. 1.225)
position
s1
s2
0 time
t0 t
1.225, 10/29/02 Lecture 1, Page 12
n(t )
Density k (t ) =
L
1 L i ∑ s (t)
= ≈ i=1
= s (t )
k ( t ) n(t ) n(t )