Question 6 of 7: Deterministic (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, December 2017 — 16-Civ-B10 Traffic Engineering, 3-hour duration, OPEN BOOK (any non-communicating calculator permitted). Seven questions 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.
Reference texts.
Garber, N.J. and Hoel, L.A., Traffic and Highway Engineering, 5th ed., Cengage — Ch. 5 (traffic-engineering studies), Ch. 6 (fundamental principles of traffic flow and queueing), Ch. 8 (intersection control and signal timing), Ch. 15 (geometric design of highway facilities).
Transportation Research Board, Highway Capacity Manual — signalized-intersection capacity, saturation flow and pedestrian-interval methods.
AASHTO, A Policy on Geometric Design of Highways and Streets, 2001 metric edition — stopping sight distance and crest/sag vertical curves (the SSD table reproduced 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, 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 3 and 4.
Question 6 — Deterministic (D/D/1) queueing at a signalised approach (a) to (h), 2.5 marks each — 20 marks
Find. The eight quantities (a)–(h): the capacity check, queue clearance time, the proportion of the cycle with a queue, the proportion of vehicles stopped, the longest queue, the total delay per cycle, the average delay per vehicle and the greatest delay suffered by any single vehicle.
Figure 6.1 — Deterministic queueing diagram for one 80 s cycle. The vertical gap between $A(t)$ and $D(t)$ is the instantaneous queue; the horizontal gap is an individual vehicle's delay; the shaded area is the total delay.
Approach. Draw the cumulative arrival and departure curves for one cycle. Arrivals accumulate at the constant rate $q$; departures are zero through the effective red and then discharge at the saturation rate $s$ until the accumulated queue is exhausted. Every requested quantity is then a geometric feature of that diagram — a vertical gap, a horizontal gap, an intersection point or an area.
Convert the flows to a per-second basis and identify the red time.
The degree of saturation is $x = q/c = 500/781.25 = 0.64 \lt 1$, so the approach is undersaturated and the queue clears within every cycle. The equivalent test on the ratios confirms it: the flow ratio $q/s = 0.200$ is less than the green ratio $g/C = 0.3125$.
(b) Time to queue clearance after the start of the effective green. At the start of green the queue is $q\,r$ vehicles, and it is worked off at the net rate $s - q$ (departures minus continuing arrivals):
The queue therefore clears 13.75 s into the 25 s green, at $t = 68.75$ s from the start of red — the point marked in Figure 6.1 where $D(t)$ meets $A(t)$.
(c) Proportion of the cycle with a queue. A queue exists throughout the red and for $t_0$ into the green:
(d) Proportion of vehicles stopped. Every vehicle arriving while a queue is present must join it. The number discharged during the clearance period is $s\,t_0$, and the number arriving in a cycle is $q\,C$, so
This equals the answer to (c), and not by coincidence: the clearance condition $s\,t_0 = q(r + t_0)$ makes $P_s$ and $P_q$ algebraically identical in a D/D/1 system. About 9.5 of the 11.1 vehicles arriving each cycle are stopped; only the 1.6 arriving after $t = 68.75$ s pass through without stopping.
(e) Maximum number of vehicles in the queue. The vertical gap between the two curves is largest at the end of the red, immediately before discharge begins:
For storage design the figure is rounded up: at about 6.5 m per queued passenger car this is roughly 52 m of storage required on the approach.
(f) Total vehicle delay per cycle. The total delay is the area between $A(t)$ and $D(t)$, the shaded region of Figure 6.1. That region is a triangle of base $(r + t_0)$ and height $q\,r$:
Equivalently 4.4 vehicle-minutes per cycle, or with 45 cycles per hour about 3.3 vehicle-hours of delay per hour on this approach.
(g) Average delay per vehicle. Dividing by the number of vehicles arriving in a cycle, $q\,C = 0.1389 \times 80 = 11.11$ veh:
$$\bar d = \frac{D_{tot}}{q\,C} = \frac{262.5}{11.11} = \boxed{23.6\ \text{s per vehicle}}$$
By the HCM criteria for a signalised approach this corresponds to level of service C — acceptable operation, consistent with the degree of saturation of 0.64 found in part (a).
(h) Maximum delay of any vehicle. An individual vehicle's delay is the horizontal gap between the curves. A vehicle arriving at time $t$ during the red is the $q\,t$-th in the queue, so it departs at $r + q\,t/s$ and its delay is
$$d(t) = r + \frac{q\,t}{s} - t = r - t\left(1 - \frac{q}{s}\right)$$
which decreases monotonically in $t$. The greatest delay therefore falls on the first vehicle to arrive after the onset of red, at $t = 0$:
$$d_{max} = r = \boxed{55\ \text{s}}$$
Note the contrast with part (g): the worst-off driver waits 55 s while the average is 23.6 s, so quoting only the average conceals a factor of more than two in the individual experience.
Check — parts (c) and (d) give the same number, and that is correct
The proportion of the cycle with a queue and the proportion of vehicles stopped are computed from different formulas — a time ratio and a vehicle ratio — yet both return 0.859. This is an identity of the deterministic model, not an error: the queue-clearance condition $s\,t_0 = q(r+t_0)$ makes $s\,t_0/(qC)$ equal to $(r+t_0)/C$ exactly. In a stochastic (M/D/1 or M/M/1) treatment the two would differ, because arrivals during the clearance period would be random and some cycles would carry over a residual queue. Both derivations are shown above so the distinct reasoning behind each part is visible.