Study guide
2.3 Hydrodynamic Shockwave Analysis & Traffic Queuing Models
Professional Traffic Operations Engineer PTOE
Track your progress as you read
Finished sections get a check mark.
1 Introduction & PTOE Exam Overview
1.1 The PTOE Credential: Certification Overview & Industry Value 1.2 Core Industry Reference Standards in Traffic Operations 1.3 Study Guide Architecture, Blueprint Alignment & Exam-Day Strategy
2 Domain 1: Traffic Flow Theory & Fundamental Concepts
2.1 Macroscopic Traffic Stream Models & Fundamental Diagram (q = k × u) 2.2 Microscopic Traffic Characteristics & Car-Following Models 2.3 Hydrodynamic Shockwave Analysis & Traffic Queuing Models
3 Domain 1: Highway & Interrupted Flow Capacity Analysis (HCM)
3.1 Basic Freeway Segments & Multilane Highways (HCM 7th Edition) 3.2 Freeway Weaving, Merging, and Diverging Segments 3.3 Signalized Intersection Capacity & Delay Modeling (HCM)
4 Domain 1: Managed Lanes, Transit Priority, TSMO & Travel Demand Management
4.1 Unsignalized Intersections (TWSC, AWSC) & Modern Roundabouts Capacity 4.2 Managed Lanes, HOV/HOT Operations, & Ramp Metering 4.3 Transit Priority & Multimodal Signal Operations (TSP) 4.4 Transportation Systems Management and Operations (TSMO) & Regional ITS 4.5 Travel Demand Management (TDM) & Trip Reduction Strategies
5 Domain 2: Geometric Design Controls, Criteria, & Sight Distance
5.1 Functional Classification, Design Controls, & Context-Sensitive Design 5.2 Sight Distance Principles: Stopping, Decision, & Passing (AASHTO) 5.3 Horizontal Alignment, Curve Radius, & Superelevation Design
6 Domain 2: Roadway Cross-Sections & Access Management
6.1 Vertical Alignment: Tangent Grades, Crest & Sag Vertical Curves 6.2 Roadway Cross-Section Elements & AASHTO Clear Zone Concepts 6.3 Access Management Principles & Driveway Spacing Criteria
7 Domain 2: Intersection & Interchange Geometric Design
7.1 Intersection Channelization, Turn Lane Design, & Storage Length 7.2 Interchange Configurations & Operational Comparisons (Diamond, Cloverleaf, SPUI) 7.3 Diverging Diamond Interchanges (DDI / DCMI) Operational Principles 7.4 Modern Roundabout Geometric Design Elements & Fastest Paths 7.5 Multimodal Geometric Design: Pedestrian Facilities, Bikeways, & ADA
8 Domain 3: Traffic Safety Concepts, Human Factors, & Safe System
8.1 The Safe System Approach & Vision Zero Principles 8.2 Human Factors, Driver Expectancy, & Perception-Reaction Time (PRT) 8.3 Crash Collision Typologies & Statistical Rate Formulations (MEV, MVMT)
9 Domain 3: Highway Safety Manual (HSM) Predictive Methods & EB
9.1 Highway Safety Manual (HSM) Predictive Methodology & Part C Models 9.2 Safety Performance Functions (SPFs) & Crash Modification Factors (CMFs) 9.3 Empirical Bayes (EB) Method & Regression-to-the-Mean (RTM) Correction 9.4 Economic Appraisal of Safety Projects (Benefit-Cost Analysis, NPV)
10 Domain 3: Safety Countermeasures & Road Safety Audits (RSA)
10.1 Roadway Departure Countermeasures (Rumble Strips, Safety Edge, Barriers) 10.2 Intersection Safety Countermeasures (Sight Triangles, Left-Turn Calming, Roundabouts) 10.3 Vulnerable Road User (VRU) Safety Countermeasures (PHB/HAWK, RRFB, Curb Extensions) 10.4 Road Safety Audits (RSAs) & Systemic Safety Analysis
11 Domain 4: Traffic Signal Warrants & Isolated Timing (MUTCD/ITE)
11.1 MUTCD Traffic Signal Warrants (Warrants 1 through 9) 11.2 Signal Phasing Principles & NEMA Dual-Ring Operations 11.3 Clearance Intervals (ITE Kinematic Equations) & Pedestrian Timing Parameters
12 Domain 4: Signal Coordination, Networks, & ATSPMs
12.1 Actuated Signal Controller Parameters (Passage Time, Gap Reduction, Max Recall) 12.2 Traffic Signal Coordination: Bandwidth, Offsets, & Progression Models 12.3 Traffic Responsive & Adaptive Traffic Signal Control Systems (ASCS) 12.4 Automated Traffic Signal Performance Measures (ATSPMs) & High-Resolution Data
13 Domain 4: Signing, Markings, Work Zones, Grade Crossings & School Zones (MUTCD)
13.1 MUTCD Regulatory, Warning, & Guide Signs Principles and Placement 13.2 Sign Retroreflectivity Standards & Nighttime Visual Maintenance 13.3 Longitudinal Pavement Markings, Delineators, & Object Markers 13.4 Temporary Traffic Control (TTC) & Work Zone Safety (MUTCD Part 6) 13.5 Highway-Rail Grade Crossings: Warning Devices, Preemption & Storage 13.6 School Zone Traffic Control & Student Walk Route Planning
14 Domain 5: Traffic Studies & Applied Statistical Methods
14.1 Applied Statistical Distributions & Sample Size Determination 14.2 Spot Speed Studies, 85th Percentile Speed, & 10-mph Pace 14.3 Volume Count Methodologies & Expansion Factoring (ADT, AADT, PHF)
15 Domain 5: Traffic Impact Studies & Trip Generation (ITE)
15.1 Travel Time, Delay, & Intersection Queue Studies 15.2 Parking Supply, Duration, & Turnover Analysis 15.3 Traffic Impact Study (TIS) Scoping, Horizon Years, & Mitigation 15.4 ITE Trip Generation Handbook: Average Rates vs. Regression Equations
16 Domain 6: Environmental, Institutional, Ethics & Equity Issues
16.1 Vehicle Emissions, Air Quality Conformity, & Decarbonization 16.2 Traffic Noise Modeling (TNM) & Noise Abatement Criteria (NAC) 16.3 Long-Range Transportation Planning & the NEPA Environmental Review 16.4 Professional Engineering Ethics, Tort Liability, & Risk Management 16.5 Transportation Equity, Access & Multimodal Community Considerations
2.3 Hydrodynamic Shockwave Analysis & Traffic Queuing Models
Key Takeaways Explain This Topic AI
Traffic shockwaves represent moving boundary interfaces between distinct flow-density states, with velocity defined by the Rankine-Hugoniot jump condition w_AB = (q_B - q_A)/(k_B - k_A); positive velocities propagate downstream while negative velocities propagate upstream against traffic flow.
Lighthill-Whitham-Richards (LWR) kinematic wave theory establishes that infinitesimal density disturbances travel at characteristic wave speed c = dq/dk; at capacity (q_max), c = 0 (stationary wave), while in congested regimes c < 0 (backward-moving waves).
Deterministic queuing (D/D/1) models cumulative arrival and departure curves (A(t) and D(t)), where the vertical distance represents instantaneous queue length Q(t), horizontal distance represents individual vehicle delay d(t), and the enclosed area represents aggregate system delay.
Stochastic queuing models (M/M/1 vs M/D/1) quantify the severe impact of service variance: deterministic service (M/D/1) cuts average queue length and waiting delay exactly in half compared to exponentially distributed service (M/M/1) under identical traffic intensity ρ = λ / μ.
Last updated: August 2026
2.3 Hydrodynamic Shockwave Analysis & Traffic Queuing Models
PTOE Exam Focus: Shockwave analysis and queuing theory represent the core quantitative tools for evaluating bottleneck propagation, incident clearance times, and intersection delays. Master the calculation of shockwave speed ( w = Δ q / Δ k w = \Delta q / \Delta k w = Δ q /Δ k ), queue dissipation duration using Rankine-Hugoniot jump conditions, cumulative delay polygons under deterministic ( D / D / 1 D/D/1 D / D /1 ) queuing, and stochastic queue metrics ( M / M / 1 M/M/1 M / M /1 vs. M / D / 1 M/D/1 M / D /1 ).
1. Hydrodynamic Continuum & LWR Kinematic Wave Theory
In 1955 and 1956, M.J. Lighthill, G.B. Whitham, and P.I. Richards developed the LWR Hydrodynamic Model , treating traffic flow on long, uninterrupted roadways as a continuous 1D compressible fluid governed by the Continuity Equation (Conservation of Vehicles) : ∂ k ∂ t + ∂ q ∂ x = 0 \frac{\partial k}{\partial t} + \frac{\partial q}{\partial x} = 0 ∂ t ∂ k + ∂ x ∂ q = 0
Where k ( x , t ) k(x,t) k ( x , t ) is density and q ( x , t ) q(x,t) q ( x , t ) is flow rate at location x x x and time t t t .
Since macroscopic flow is a function of density ( q = q ( k ) q = q(k) q = q ( k ) ), applying the chain rule gives: ∂ k ∂ t + ( d q d k ) ∂ k ∂ x = 0 \frac{\partial k}{\partial t} + \left(\frac{dq}{dk}\right) \frac{\partial k}{\partial x} = 0 ∂ t ∂ k + ( d k d q ) ∂ x ∂ k = 0
Characteristic Wave Velocity ( c k c_k c k ):
The quantity c k = d q d k c_k = \frac{dq}{dk} c k = d k d q represents the speed at which an infinitesimal change in density propagates along the traffic stream:
Uncongested Regime ( k < k c k < k_c k < k c ): Slope d q d k > 0 ⟹ \frac{dq}{dk} > 0 \implies d k d q > 0 ⟹ Small perturbations travel downstream along the roadway.
Capacity Point ( k = k c k = k_c k = k c ): Slope d q d k = 0 ⟹ \frac{dq}{dk} = 0 \implies d k d q = 0 ⟹ Small perturbations remain stationary ( c k = 0 c_k = 0 c k = 0 ).
Congested Regime ( k > k c k > k_c k > k c ): Slope d q d k < 0 ⟹ \frac{dq}{dk} < 0 \implies d k d q < 0 ⟹ Small perturbations travel upstream against the direction of traffic flow ( c k < 0 c_k < 0 c k < 0 ).
2. Macroscopic Shockwave Velocity (Rankine-Hugoniot Jump Condition)
When a finite, discontinuous change occurs between two distinct traffic states—State A ( q A , k A , u A q_A, k_A, u_A q A , k A , u A ) and State B ( q B , k B , u B q_B, k_B, u_B q B , k B , u B )—a shockwave forms at the boundary. Applying the principle of vehicle conservation across the moving boundary interface yields the Rankine-Hugoniot shockwave jump condition : w A B = q B − q A k B − k A = Δ q Δ k w_{AB} = \frac{q_B - q_A}{k_B - k_A} = \frac{\Delta q}{\Delta k} w A B = k B − k A q B − q A = Δ k Δ q
Where w A B w_{AB} w A B is the propagation velocity of the shockwave boundary in mph or km/h. Traffic Flow ---> [ State A: q_A, k_A ] | [ State B: q_B, k_B ]
- <---
- Shockwave Boundary (w_AB)
Directional Rules for Shockwave Velocity:
w > 0 w > 0 w > 0 (Forward / Downstream): The shockwave moves in the direction of traffic flow.
w < 0 w < 0 w < 0 (Backward / Upstream): The shockwave moves backward against traffic flow (queue expands upstream).
w = 0 w = 0 w = 0 (Stationary): The shockwave remains pinned at a fixed physical location (e.g., permanent geometric lane drop or peak crest).
Relative Speed of Vehicles Entering the Shockwave: ν r e l , A = u A − w A B \nu_{rel, A} = u_A - w_{AB} ν re l , A = u A − w A B ν r e l , B = u B − w A B \nu_{rel, B} = u_B - w_{AB} ν re l , B = u B − w A B
3. Typologies of Traffic Shockwaves
Shockwave Typology Boundary States Condition Velocity Sign Operational Context & Physical Manifestation
Backward Forming q B < q A , k B > k A q_B < q_A,\; k_B > k_A q B < q A , k B > k A w < 0 w < 0 w < 0 Upstream traffic encounters bottleneck/incident; queue builds upstream.
Backward Recovery q B > q A , k B < k A q_B > q_A,\; k_B < k_A q B > q A , k B < k A w < 0 w < 0 w < 0 Incident cleared or signal turns green; capacity discharge clears queue upstream.
Forward Forming q B > q A , k B > k A q_B > q_A,\; k_B > k_A q B > q A , k B > k A w > 0 w > 0 w > 0 Upstream demand increases while facility remains uncongested; wave moves downstream.
Forward Recovery q B < q A , k B < k A q_B < q_A,\; k_B < k_A q B < q A , k B < k A w > 0 w > 0 w > 0 Upstream demand drops; uncongested recovery wave travels downstream.
Frontal Stationary q B = q A , k B > k A q_B = q_A,\; k_B > k_A q B = q A , k B > k A w = 0 w = 0 w = 0 Fixed capacity bottleneck (e.g., lane reduction) where arrival matches capacity.
4. Bottleneck Queue Growth & Clearance Analysis
Consider an incident on a freeway where a lane is blocked for duration T 0 T_0 T 0 , creating an upstream queue (State B), after which the blockage is cleared, allowing vehicles to discharge at capacity (State C):
Approach State A: Normal free-flow upstream traffic ( q A , k A q_A, k_A q A , k A ).
Queued State B: Congested standstill/metered traffic upstream of incident ( q B , k B q_B, k_B q B , k B ).
Discharge State C: Unconstrained capacity discharge after incident removal ( q C = q max , k C = k c q_C = q_{\max}, k_C = k_c q C = q m a x , k C = k c ).
Shockwave Velocities:
Queue growth wave: w A B = q B − q A k B − k A < 0 w_{AB} = \frac{q_B - q_A}{k_B - k_A} < 0 w A B = k B − k A q B − q A < 0
Queue clearing wave: w B C = q C − q B k C − k B < 0 w_{BC} = \frac{q_C - q_B}{k_C - k_B} < 0 w BC = k C − k B q C − q B < 0
Downstream recovery wave: w A C = q C − q A k C − k A w_{AC} = \frac{q_C - q_A}{k_C - k_A} w A C = k C − k A q C − q A
Time to Full Queue Dissipation ( T clear T_{\text{clear}} T clear ):
Because ∣ w B C ∣ > ∣ w A B ∣ |w_{BC}| > |w_{AB}| ∣ w BC ∣ > ∣ w A B ∣ , the recovery wave catches the forming wave at time T clear T_{\text{clear}} T clear measured from incident onset: T clear = T 0 ( w B C − w A C w B C − w A B ) = T 0 ( w B C w B C − w A B ) (if w A C ≈ 0 ) T_{\text{clear}} = T_0 \left(\frac{w_{BC} - w_{AC}}{w_{BC} - w_{AB}}\right) = T_0 \left(\frac{w_{BC}}{w_{BC} - w_{AB}}\right) \quad \text{(if } w_{AC} \approx 0\text{)} T clear = T 0 ( w BC − w A B w BC − w A C ) = T 0 ( w BC − w A B w BC ) (if w A C ≈ 0 )
Maximum Queue Length ( L max L_{\max} L m a x ): L max = ∣ w A B ∣ × T clear L_{\max} = |w_{AB}| \times T_{\text{clear}} L m a x = ∣ w A B ∣ × T clear
5. Deterministic Queuing Theory (D/D/1 Models)
Deterministic queuing ( D / D / 1 D/D/1 D / D /1 ) analyzes bottlenecks where arrival rate λ ( t ) \lambda(t) λ ( t ) and departure capacity μ ( t ) \mu(t) μ ( t ) are known deterministic functions over time. Performance is evaluated using Cumulative Vehicle Diagrams ( A ( t ) A(t) A ( t ) and D ( t ) D(t) D ( t ) ): Cumulative Vehicles
- ^
- | A(t) [Arrival Curve: slope = λ1]
- | * /
- | * / A(t) [Demand Drops: slope = λ2]
- | * /---
- | Q(t) * / |
- | | * / | D(t) [Departure Curve: slope = μ]
- | v * / |
- | * / |
- | * / |
- | * / |
- 0+--*----------*---------*-----> Time (t)
- 0 T1 t_q
Geometric Properties of Cumulative Curves:
Queue Length ( Q ( t ) Q(t) Q ( t ) ): The vertical distance between arrival curve A ( t ) A(t) A ( t ) and departure curve D ( t ) D(t) D ( t ) at time t t t : Q ( t ) = A ( t ) − D ( t ) Q(t) = A(t) - D(t) Q ( t ) = A ( t ) − D ( t )
Individual Vehicle Delay ( d ( t ) d(t) d ( t ) ): The horizontal distance from arrival time t t t to departure time t ′ t' t ′ , representing the wait time of vehicle N N N : d ( N ) = t depart ( N ) − t arrive ( N ) d(N) = t_{\text{depart}}(N) - t_{\text{arrive}}(N) d ( N ) = t depart ( N ) − t arrive ( N )
Total Aggregate Delay ( D total D_{\text{total}} D total ): The total area enclosed between A ( t ) A(t) A ( t ) and D ( t ) D(t) D ( t ) over the entire queuing interval [ 0 , t q ] [0, t_q] [ 0 , t q ] : D total = ∫ 0 t q [ A ( t ) − D ( t ) ] d t ( vehicle-hours ) D_{\text{total}} = \int_0^{t_q} [A(t) - D(t)]\, dt \quad (\text{vehicle-hours}) D total = ∫ 0 t q [ A ( t ) − D ( t )] d t ( vehicle-hours )
Average Delay per Vehicle ( d ˉ \bar{d} d ˉ ): d ˉ = D total N total \bar{d} = \frac{D_{\text{total}}}{N_{\text{total}}} d ˉ = N total D total
Multi-Period Surge Formulations:
If an initial demand surge λ 1 > μ \lambda_1 > \mu λ 1 > μ lasts for duration T 1 T_1 T 1 , after which demand drops to λ 2 < μ \lambda_2 < \mu λ 2 < μ :
Maximum Queue: Q max = ( λ 1 − μ ) T 1 Q_{\max} = (\lambda_1 - \mu) T_1 Q m a x = ( λ 1 − μ ) T 1
Time to Dissipate Queue ( t diss t_{\text{diss}} t diss after T 1 T_1 T 1 ): t diss = Q max μ − λ 2 t_{\text{diss}} = \frac{Q_{\max}}{\mu - \lambda_2} t diss = μ − λ 2 Q m a x
Total Queue Duration: t q = T 1 + t diss = T 1 ( 1 + λ 1 − μ μ − λ 2 ) = T 1 ( λ 1 − λ 2 μ − λ 2 ) t_q = T_1 + t_{\text{diss}} = T_1 \left(1 + \frac{\lambda_1 - \mu}{\mu - \lambda_2}\right) = T_1 \left(\frac{\lambda_1 - \lambda_2}{\mu - \lambda_2}\right) t q = T 1 + t diss = T 1 ( 1 + μ − λ 2 λ 1 − μ ) = T 1 ( μ − λ 2 λ 1 − λ 2 )
Total Aggregate Delay (Area of Triangle): D total = 1 2 Q max t q = 1 2 ( λ 1 − μ ) T 1 ⋅ t q D_{\text{total}} = \frac{1}{2} Q_{\max} t_q = \frac{1}{2} (\lambda_1 - \mu) T_1 \cdot t_q D total = 2 1 Q m a x t q = 2 1 ( λ 1 − μ ) T 1 ⋅ t q
6. Stochastic Queuing Systems (M/M/1, M/D/1, and M/G/1)
When arrivals and service times exhibit random variations, deterministic models underestimate delay. Stochastic queuing models use Kendall's notation ( A / B / c / K / N / Z A/B/c/K/N/Z A / B / c / K / N / Z ):
- A A A = Arrival distribution ( M M M = Markovian/Poisson, D D D = Deterministic, G G G = General)
- B B B = Service distribution ( M M M = Exponential, D D D = Constant, G G G = General)
- c c c = Number of parallel service channels/servers
- A. M/M/1 Queuing System (Poisson Arrivals, Exponential Service, 1 Server)
Traffic Intensity / Utilization: ρ = λ μ \rho = \frac{\lambda}{\mu} ρ = μ λ (System is stable if and only if ρ < 1 \rho < 1 ρ < 1 ).
Average Number of Vehicles in System (Waiting + Service): L = ρ 1 − ρ = λ μ − λ L = \frac{\rho}{1 - \rho} = \frac{\lambda}{\mu - \lambda} L = 1 − ρ ρ = μ − λ λ
Average Number of Vehicles in Queue (Waiting Line): L q = ρ 2 1 − ρ = λ 2 μ ( μ − λ ) = L − ρ L_q = \frac{\rho^2}{1 - \rho} = \frac{\lambda^2}{\mu(\mu - \lambda)} = L - \rho L q = 1 − ρ ρ 2 = μ ( μ − λ ) λ 2 = L − ρ
Average Time Spent in System (Little's Law: L = λ W L = \lambda W L = λW ): W = L λ = 1 μ − λ W = \frac{L}{\lambda} = \frac{1}{\mu - \lambda} W = λ L = μ − λ 1
Average Waiting Time in Queue ( L q = λ W q L_q = \lambda W_q L q = λ W q ): W q = L q λ = ρ μ − λ = λ μ ( μ − λ ) = W − 1 μ W_q = \frac{L_q}{\lambda} = \frac{\rho}{\mu - \lambda} = \frac{\lambda}{\mu(\mu - \lambda)} = W - \frac{1}{\mu} W q = λ L q = μ − λ ρ = μ ( μ − λ ) λ = W − μ 1
Probability of n n n Vehicles in System: P n = ( 1 − ρ ) ρ n P_n = (1 - \rho)\rho^n P n = ( 1 − ρ ) ρ n .
B. M/D/1 Queuing System (Deterministic Constant Service Time)
When service time is perfectly uniform (such as automated toll gates or fixed-cycle metered signals), service variance σ s 2 = 0 \sigma_s^2 = 0 σ s 2 = 0 : L q = ρ 2 2 ( 1 − ρ ) L_q = \frac{\rho^2}{2(1 - \rho)} L q = 2 ( 1 − ρ ) ρ 2 W q = ρ 2 μ ( 1 − ρ ) W_q = \frac{\rho}{2\mu(1 - \rho)} W q = 2 μ ( 1 − ρ ) ρ
Critical PTOE Takeaway: Under identical traffic intensity ρ \rho ρ , an M / D / 1 M/D/1 M / D /1 queue yields exactly half the queue length and waiting delay of an M / M / 1 M/M/1 M / M /1 queue ( L q , M / D / 1 = 1 2 L q , M / M / 1 L_{q, M/D/1} = \frac{1}{2} L_{q, M/M/1} L q , M / D /1 = 2 1 L q , M / M /1 ). Eliminating service variance cuts queuing delays by 50%!
C. M/G/1 Queuing System (Pollaczek-Khinchine Formula)
For general service time distribution with mean service time 1 / μ 1/\mu 1/ μ and variance σ s 2 \sigma_s^2 σ s 2 : L q = λ 2 σ s 2 + ρ 2 2 ( 1 − ρ ) L_q = \frac{\lambda^2 \sigma_s^2 + \rho^2}{2(1 - \rho)} L q = 2 ( 1 − ρ ) λ 2 σ s 2 + ρ 2 W q = L q λ = λ σ s 2 + ρ / μ 2 ( 1 − ρ ) W_q = \frac{L_q}{\lambda} = \frac{\lambda \sigma_s^2 + \rho / \mu}{2(1 - \rho)} W q = λ L q = 2 ( 1 − ρ ) λ σ s 2 + ρ / μ