Question 4 of 7: D/D/1 queueing at a signalised approach
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
Notes on this paper
Paper format. National Examinations, May 2018 — 16-Civ-B10 Traffic Engineering, 3-hour duration, OPEN BOOK (any non-communicating calculator permitted). Seven questions, all of equal value (20 marks each); the paper requires five solutions and marks only the first five as they appear in the answer book. Because the set is a study resource, all seven questions are solved here. The paper's own Note 1 invites a clear statement of any assumptions made and Note 2 permits any required-but-not-given data to be assumed; every assumption used below is stated explicitly where it is introduced. Page 4 reproduces the AASHTO 2001 metric stopping-sight-distance table, which Question 5 is built around.
Reference texts.
Garber, N.J. and Hoel, L.A., Traffic and Highway Engineering, 5th ed., Cengage — Ch. 5 (traffic-engineering studies, moving-vehicle method), Ch. 6 (fundamental principles of traffic flow and queueing), Ch. 8 (intersection control and signal timing), Ch. 15 (geometric design, vertical curves).
Transportation Research Board, Highway Capacity Manual — signalised-intersection capacity, saturation flow, lane-group definition and the pedestrian-interval method.
AASHTO, A Policy on Geometric Design of Highways and Streets, 2001 metric edition — stopping sight distance and crest vertical curves (the SSD table printed on page 4 of this paper is AASHTO 2001, Table 3-1).
Transportation Association of Canada, Geometric Design Guide for Canadian Roads — the Canadian design-controls equivalent of the AASHTO Green Book and the governing document for Canadian practice.
Transportation Association of Canada, Manual of Uniform Traffic Control Devices for Canada (MUTCDC) — signal displays, bicycle facilities, pedestrian intervals and clearance timing.
Webster, F.V. and Cobbe, B.M., Traffic Signals, Road Research Technical Paper No. 56, HMSO — the optimum-cycle and delay relations used in Questions 2 and 7.
Question 4 — D/D/1 queueing at a signalised approach (a) to (h), 2.5 marks each — 20 marks
D/D/1, deterministic arrivals and departures, FIFO
Find. (a) capacity against demand; (b) queue clearance time $t_0$; (c) proportion of the cycle with a queue; (d) proportion of vehicles stopped; (e) maximum queue; (f) total delay per cycle; (g) average delay per vehicle; (h) maximum individual delay.
Approach. Build the cumulative arrival and departure curves for one cycle. Arrivals accumulate at the uniform rate $q$ throughout; departures are zero during the effective red and then run at the saturation flow $s$ until the queue is exhausted, after which they track the arrivals. Every one of the eight answers is a geometric property of the triangle enclosed between the two curves.
Figure 4.1 — Cumulative arrival and departure curves for one 85 s cycle. The queue peaks at the end of the effective red, clears 13.75 s into the green, and the shaded triangle between the curves is the total delay of 288.9 veh·s. The longest individual wait is the horizontal width of the triangle at its base, which is the whole effective red.
Part (a) — verify the approach has enough capacity. The capacity of a signalised approach is its saturation flow prorated by the green ratio:
Since $c=970.6>q=550$ veh/h, the approach is undersaturated with a degree of saturation of $x=q/c=550/970.6=0.567$. The equivalent form of the same test, which is the one used in the steps that follow, compares the flow ratio with the green ratio:
Both statements confirm that a queue formed during red will clear within the green, so the single-cycle triangle closes and no residual queue carries over. This is the precondition for every subsequent part, which is why the paper asks for it first.
Part (b) — time to clear the queue after the start of the green. During the effective red, $q\,r$ vehicles arrive and none depart. Once the green begins, departures run at $s$ while arrivals continue at $q$, so the queue drains at the net rate $s-q$. Letting $t_0$ be the clearance time measured from the start of the green, the number discharged equals the number that has arrived:
So for 80.9 per cent of the cycle — 68.75 s of every 85 s — at least one vehicle is stopped or slowing on the approach.
Part (d) — proportion of vehicles stopped. Every vehicle that arrives before clearance joins the queue, and those are exactly the vehicles discharged during $t_0$ at the saturation rate. As a fraction of the $qC$ vehicles arriving per cycle,
Note the identity between parts (c) and (d), which is a property of the model rather than a coincidence. The clearance condition $s\,t_0=q(r+t_0)$ can be substituted directly into the expression for $P_s$:
so the two parts are algebraically the same number reached by two different routes — one a ratio of times, the other a ratio of vehicles. Both derivations are shown because the paper awards 2.5 marks to each, but no arithmetic discrepancy should be hunted for. The equality holds only because arrivals are deterministic and uniform; under M/D/1 or M/M/1 a residual queue survives in some cycles, vehicles are stopped that arrive after nominal clearance, and the two proportions separate.
Part (e) — maximum number of vehicles in the queue. The queue grows for the whole of the effective red and shrinks thereafter, so it peaks precisely at the end of the red — not at clearance:
In practice this is 8 to 9 vehicles, requiring roughly 8.4 × 6.5 = 55 m of storage on the approach, which is the number a designer would take to the lane-length check.
Part (f) — total vehicle delay per cycle. The aggregate delay is the area enclosed between the arrival and departure curves, a triangle of base $r+t_0$ and height $Q_{max}$. Evaluating it in the standard closed form,
Equivalently, $\tfrac12(r+t_0)Q_{max}=\tfrac12(68.75)(8.403)=288.8$ veh·s, which is the same area computed geometrically — a useful cross-check because the two forms share no intermediate quantity. Expressed in the units a delay study would report, 288.9 veh·s is 0.080 veh·h per cycle, or 3.40 veh·h per hour of operation over the 42.4 cycles in an hour.
Part (g) — average delay per vehicle. Dividing the cycle's total delay by the number of vehicles arriving in the cycle,
By the HCM control-delay criteria, 22.2 s/veh corresponds to level of service C for a signalised approach.
Part (h) — maximum delay of any vehicle. A vehicle arriving $t$ seconds after the onset of the effective red waits until its turn to discharge, which gives the delay function
$$d(t)=r-t\left(1-\frac{q}{s}\right)$$
This decreases monotonically in $t$, so the worst-off vehicle is the first one to arrive after the onset of the red, not the last vehicle to arrive during it. Setting $t=0$,
$$d_{max}=r=\boxed{55\ \text{s}}$$
which is simply the whole effective red: the first vehicle stops at the stop line and moves off at the start of the green with no queue ahead of it. The last vehicle to join the queue, arriving at $t=r$, waits only $55-55(0.8)=11.0$ s, and the average of 22.2 s/veh sits between the two as it must.
Results.
Part
Quantity
Value
(a)
Capacity $c=sg/C$ against demand $q$
970.6 veh/h > 550 veh/h ($x=0.567$; $q/s=0.200)
(b)
Time to queue clearance after start of green, $t_0$