16-Civ-A6 Highway Design, Construction, and Maintenance · May 2013
Question 6 of 7: User‑equilibrium traffic assignment
Nivaar worked solution (AI-drafted; not reviewed by a licensed engineer)
Notes on this paper
Paper format. National Examination, 98‑Civ‑A6 Transportation Planning & Engineering (May 2013). Closed book, one two‑sided aid sheet, 3 hours. Seven questions; any five constitute a complete examination and each is of equal value (20 marks). All seven are solved below as a study resource.
Given. Link performance (volume–delay) functions and a fixed total demand.
Given data
Route
Travel‑time function (min)
Free‑flow time (min)
1
$t_1=22+2V_1/225$
22
2
$t_2=12+V_2/100$
12
3 (part b)
$t_3=14+4V_3/225$
14
Total demand
$\sum V_i=7200$ veh/h
—
Find. UE volumes and travel times for two routes (a) and for three routes (b); and whether adding a route always helps (c).
Two zones (O–D) joined by parallel, non‑overlapping routes; 7200 veh/h is split so that every used route carries equal travel time (Wardrop first principle).
Approach. Apply Wardrop user‑equilibrium principle: all used routes have equal (and minimum) travel time. Set the route times equal and impose flow conservation, then solve the linear system.
UE conditions, two routes (a). Equal times and conservation:
All three routes are used (each volume positive), so the equal‑time solution is valid; the new route cuts the equilibrium time from 51.18 to 43.40 min.
Question 6 — user‑equilibrium results
Case
$V_1$
$V_2$
$V_3$
Travel time
(a) Two routes
3282
3918
—
51.18 min
(b) Three routes
2407
3140
1653
43.40 min
(c) Does adding a route always reduce travel time?
No. Here the new, independent route lowered the equilibrium time, but this is not guaranteed. In a network where routes share links, adding a link or route can actually raise everyone equilibrium travel time — the celebrated Braess paradox. The reason is that user equilibrium is a selfish (Nash) equilibrium: each driver minimizes their own time with no regard for the congestion externality they impose on others. A new route can attract flow onto shared bottleneck links in a way that worsens the system outcome. Adding capacity reliably helps only when the new route is genuinely parallel and non‑overlapping (as in this problem); in a connected network the outcome must be checked, not assumed.