CIVE3065 Traffic Engineering - Key Definitions and Concepts

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/36

flashcard set

Earn XP

Description and Tags

Comprehensive vocabulary flashcards covering key definitions, traffic signal parameters, transportation planning terms, and core analytical relationships for CIVE3065 Traffic Engineering.

37 Terms

1
New cards

Aspect

The signal indication displayed to traffic at a signalized junction.

2
New cards

Stream

Traffic that is treated as a single queue.

3
New cards

Phase

Traffic or a collection of streams receiving the same aspect simultaneously.

4
New cards

Stage

A time period within a signal cycle when specific phases display green signals.

5
New cards

Cycle

A complete sequence of all signal phases at a junction.

6
New cards

Cycle Time (CC)

The total time taken to complete one full cycle of signal phases.

7
New cards

Combined Green and Amber (GG)

The total duration of the green and amber display for a phase, given by G=k+aG = k + a, where kk is actual green time and aa is the duration of the amber phase.

8
New cards

Saturation Flow (ss)

The maximum continuous rate of flow possible to discharge from a traffic lane or approach during the green indication.

9
New cards

Phase Lost Time (lpl_p)

The time lost due to starting delays when a signal turns green and flow fall-off during the amber aspect (standard assumption is lp=2 sl_p = 2\,\text{s}).

10
New cards

Effective Green Time (gg)

The sum of the green and amber periods less the phase lost time, expressed as g=G−lp=k+a−lpg = G - l_p = k + a - l_p.

11
New cards

Intergreen Period (II)

The time period from one phase losing green to the next conflicting phase receiving green (standard minimum assumption is I=5 sI = 5\,\text{s} plus any all-red time). Minimum of 4s with red/amber overlap

12
New cards

Actual Green (kk)

The displayed duration of the green signal aspect, related to effective green by k=g−1k = g - 1 when a=3 sa = 3\,\text{s} and lp=2 sl_p = 2\,\text{s}.

13
New cards

Intergreen Lost Time (lil_i)

The lost time occurring during a phase transition, calculated as li=I−al_i = I - a, which consists of all-red time plus red/amber time.

14
New cards

Total Lost Time Per Cycle (LL)

The sum of intergreen lost times across stage changes plus phase lost times across relevant phases: L=∑stage changes(I−a)+∑phaseslpL = \sum_{\text{stage changes}} (I - a) + \sum_{\text{phases}} l_p.

15
New cards

Approach Capacity

The maximum traffic volume an approach can discharge per cycle, given by gsC\frac{gs}{C}, where gg is effective green time, ss is saturation flow, and CC is cycle time.

16
New cards

Degree of Saturation (xx)

The ratio of actual arrival flow (qq) to maximum capacity (gsC\frac{gs}{C}) on an approach: x=qCgsx = \frac{qC}{gs}.

17
New cards

Trip

A one-way movement from one place to another for a particular purpose.

18
New cards

Origin

The starting point of a trip.

19
New cards

Destination

The end point of a trip.

20
New cards

Study Area

The geographic area through, and within, which traffic movements are to be studied.

21
New cards

External Cordon

A continuous (imaginary) boundary line drawn around or across the perimeter of the study area.

22
New cards

Cordon Crossing Point (Cordon Station)

A location where the external cordon crosses highways having significant levels of traffic flow.

23
New cards

Vehicle Desire Movement

That part of an origin-destination trip recorded within the defined study area.

24
New cards

Zone

An individual origin (destination) or a grouping of geographic origins (destinations), categorized as internal if inside the study area or external if outside.

25
New cards

Zone Centroid

A single representative point within a zone assumed (for transport modelling purposes) to be the origin or destination of all trips starting or ending in that zone.

26
New cards

Trip Matrix (Origin-Destination Matrix)

A table or matrix in which each entry specifies the traffic flow (number of trips) occurring from a particular origin zone to a destination zone.

27
New cards

Screenline

A line dividing the study area into two portions such that traffic flows crossing it during a survey can be measured easily.

28
New cards

Fundamental Relationship of Traffic Flow

The macroscopic relation linking flow (qq), concentration/density (KK), and space mean speed (vsv_s): q=Kvsq = K v_s.

29
New cards

Time Headway (hˉt\bar{h}_t)

The average time elapsed between successive vehicles passing a point, defined as hˉt=3600q s\bar{h}_t = \frac{3600}{q}\,\text{s}, where qq is flow in veh/h\text{veh/h}.

30
New cards

Spacing (sˉ\bar{s})

The average distance between front bumpers of successive vehicles, inversely related to concentration/density by K=1sˉK = \frac{1}{\bar{s}}.

31
New cards

Flow Ratio (yy)

The ratio of arrival flow (qq) to saturation flow (ss) for an individual lane or approach: y=qsy = \frac{q}{s}.

32
New cards

Total Flow Ratio (YY)

The summation of the critical or governing flow ratios for each stage of a signal cycle: Y=∑iyiY = \sum_i y_i.

33
New cards

Reserve Capacity (RCRC)

The percentage margin by which practical junction capacity exceeds existing critical traffic demand: RC=Ypract−YY×100%RC = \frac{Y_{pract} - Y}{Y} \times 100\%.

34
New cards

User Equilibrium (Wardrop's 1st Principle)

A condition where journey times on all used routes connecting an origin and destination are equal and less than those that would be experienced on unused routes (c1(f1)=c2(f2)c_1(f_1) = c_2(f_2)).

35
New cards

System Equilibrium (Wardrop's 2nd Principle)

A condition where total network travel cost is minimized by equating marginal link travel costs: c^1(f1)=c^2(f2)\hat{c}_1(f_1) = \hat{c}_2(f_2), where c^(f)=c(f)+fdcdf\hat{c}(f) = c(f) + f \frac{dc}{df}.

36
New cards

Multinomial Logit Model

A discrete choice modal split model calculating the probability of choosing mode mm via utility UmU_m: Pm=eUm∑jeUjP_m = \frac{e^{U_m}}{\sum_j e^{U_j}}.

37
New cards

Furness Method

An iterative bi-proportional matrix balancing procedure in trip distribution that successively multiplies rows by origin growth factors (GiOG_i^O) and columns by destination growth factors (GjDG_j^D) until factors converge near 1.