Professional Documents
Culture Documents
Traffic Planning
(Chapters
(Ch t
20/21 of
Study Guide)
Lecture Outline
Last Time
s* nf
su
eo = (0
(0.5
5 g) / (su gu + nf)
gs gu
su = q* exp(-αq*) / [1 - exp(-βq*)]
gu = (s*g-q*c) / (s*-q*) *=Opposing flow
Cycle
C cle time must
m st meet demand + lost time
cmin = L / (1 - Y) and U = (c - L) / c
Question to Ponder...
Ponder
q(c-g)
q
(s-q)
1
1
0 (c-g) c time
effective red effective green g
saturated
d unsaturated
d
green gs green
Queue Lengths (Ch.20 p.120)
q(c-g)
q
(s-q)
1
1
0 (c-g) c time
effective red effective green g
gs
Saturated
Green Time gs (Ch.20 p.120)
q (c-g) = s gs - q gs queue
length
q (c g ) q(c-g)
gs
(s q )
q
1
(s-q)
1
0 (c-g) c time
effective red effective green g
gs
Stops per Cycle (Ch.20 p.120-121)
q (c g )
During interval gs gs
(s q )
Vehicles continue to arrive at rate q and join
the queue (i.e. stop) length
queue
No of such vehs is
No. q(c-g)
q 2 (c g ) q
q gs 1
(s-q)
(s q ) 0 (c-g)
1
c time
effective red effective green g
gs
= s (c g )
c (s q )
Delay per Cycle (Ch.20 p.121)
q (c g )
Total delay per cycle is given by gs
(s q )
area under the graph
1
2 (c g ) q (c g ) 12 g s q (c g )
qs (c g )2
2 (s q )
Number of vehicles arriving and departing
per cycle is qc queue
length
1 1
q
s (c g )2 (s-q)
2c (s q ) 0
effective red
(c-g)
effective green g
c time
gs
Overflow Queues (Ch.20 p.121)
N
No. off complete
l t stops
t (H) per unit
it time
ti
experienced by movement with flow rate q
H=qh (stops/hr)
Max queue q (c g )
Maximum
M i queue length
l th (Nmax) is
i
Nmax = N / (
(1 - y) ((veh))
co = [(1
[(1.4
4+0
0.01
01 K) L + 6] / (1 - Y)
cp = L / (1 - U)
cp = minimum cycle time cmin if xp= 1.0
Choosing a Cycle Time (Ch.20 p.118)
Traffic Signals 60 80 20
+ + +
Analysis Example 10 15 5
Main
See Course Notes Road
(Ch.21)
320 + 35 225 + 25