Fundamentals of Transportation/Traffic Signals

From Wikibooks, the open-content textbooks collection

A Traffic Light

Traffic Signals are one of the more familiar types of intersection control. Using either a fixed or adaptive schedule, traffic signals allow certain parts of the intersection to move while forcing other parts to wait, delivering instructions to drivers through a set of colorful lights (generally, of the standard red-yellow (amber)-green format). Some purposes of traffic signals are to (1) improve overall safety, (2) decrease average travel time through an intersection, and (3) equalize the quality of services for all or most traffic streams. Traffic signals provide orderly movement of intersection traffic, have the ability to be flexible for changes in traffic flow, and can assign priority treatment to certain movements or vehicles, such as emergency services. However, they may increase delay during the off-peak period and increase the probability of certain accidents, such as rear-end collisions. Additionally, when improperly configured, driver irritation can become an issue. Traffic signals are generally a well-accepted form of traffic control for busy intersections and continue to be deployed. Other intersection control strategies include signs (stop and yield) and roundabouts. Intersections with high volumes may be grade separated.

[edit] Intersection Queueing

At an intersection where certain approaches are denied movement, queueing will inherently occur. Of the various queueing models, one of the more commons and simple ones is the D/D/1 Queueing Model. This model assumes that arrivals and departures are deterministic (D) and one departure channel exists. D/D/1 is quite intutive and easily solvable. Using this form of queueing with an arrival rate $λ$ and a departure rate $μ$ , certain useful values regarding the consequences of queues can be computed.

One important piece of information is the duration of the queue for a given approach. This time value can be calculated through the following formula:

$t_c {\rm{ }} = {\rm{ }}\frac{{\rho r}}{{1 - \rho }} \,\!$

Where:

$t c$ = Time for queue to clear
$ρ$ = Arrival Rate divided by Departure Rate
$r$ = Red Time

With this, various proportions dealing with queues can be calculated. The first determines the proportion of cycle with a queue.

$P_q {\rm{ }} = {\rm{ }}\frac{{r{\rm{ }} + {\rm{ }}t_c }}{C}{\rm{ }} \,\!$

Where:

$P q$ = Proportion of cycle with a queue
$C$ = Cycle Lengh

Similarly, the proportion of stopped vehicles can be calculated.

$P_s = \frac{{\lambda \left( {r + t_C } \right)}}{{\lambda \left( {r + g} \right)}} = \frac{{r + t_C }}{C} = P_q \,\!$

$P_s = \frac{{\lambda \left( {r + t_C } \right)}}{{\lambda \left( {r + g} \right)}} = \frac{{\mu t_C }}{{\lambda C}} = \frac{{t_C }}{{\rho C}} \,\!$

Where:

$P s$ = Proportion of Stopped Vehicles
$g$ = Green Time

Therefore, the maximum number of vehicles in a queue can be found.

$Q_{\max } {\rm{ }} = {\rm{ }}\lambda r \,\!$

[edit] Intersection delay

Various models of intersection delay at isolated intersections have been put forward, combining queuing theory with empirical observations of various arrival rates and discharge times (Webster and Cobbe 1966; Hurdle 1985; Hagen and Courage 1992). Intersections on arterials are more complex phenomena, including factors such as signal progression and spillover of queues between adjacent intersections. Delay is broken into two parts: uniform delay, which is the delay that would occur if the arrival pattern were uniform, and overflow delay, caused by stochastic variations in the arrival patterns, which manifests itself when the arrival rate exceeds the service flow of the intersection for a time period.

Delay can be computed with knowledge of arrival rates, departure rates, and red times. Graphically, total delay is the product of all queues over the time period in which they are present.

$D_t {\rm{ }} = {\rm{ }}\frac{{\lambda r^2 }}{{2\left( {1 - \rho } \right)}}{\rm{ }} \,\!$

Similarly, average vehicle delay per cycle can be computed.

$d_{avg} {\rm{ }} = {\rm{ }}\frac{{\lambda r^2 {\rm{ }}}}{{2\left( {1 - \rho } \right)}}\frac{1}{{\lambda C}}{\rm{ }}\,\!$

$d_{avg} {\rm{ }} = \frac{{r^2 }}{{2C\left( {1 - \rho } \right)}} \,\!$

From this, maximum delay for any vehicle can be found.

$d_{\max } {\rm{ }} = {\rm{ }}r \,\!$

[edit] Level of Service

In order to assess the performance of a signalized intersection, a qualitative assessment called Level of Service (LOS) is assessed, based upon quantitative performance measures. For LOS, the performance measured used is average control delay per vehicle. The general procedure for determining LOS is to calculate lane group capacities, calculate delay, and then make a determination.

Lane group capacities can be calculated through the following equation:

$c = s\frac{{g}}{{C}}\,\!$

Where:

$c$ = Lane Group Capacity
$s$ = Adjusted Saturation Flow Rate
$g$ = Effective Green Length
$C$ = Cycle Length

Average control delay per vehicle, thus, can be calculated by summing the types of delay mentioned earlier.

$d = (d_1(PF)) + d_2 + d_3\,\!$

Where:

$d$ = Average Signal Delay per vehicle (sec)
$d 1$ = Average Delay per vehicle due to uniform arrivals (sec)
$P F$ = Progression Adjustment Factor
$d 2$ = Average Delay per vehicle due to random arrivals (sec)
$d 3$ = Average delay per vehicle due to initial queue at start of analysis time period (sec)

Uniform delay can be calculated through the following formula:

$d_1 = \frac{{0.5C\left( {1 - \frac{g}{C}} \right)^2 }}{{1 - \left[ {\min \left( {1,X} \right)\frac{g}{C}} \right]}} \,\!$

Where:

$X$ = Volume/Capacity (v/c) ratio for lane group.

Similarly, random delay can be calculated:

$d_2 = 900T\left[ {\left( {X - 1} \right) + \sqrt {\left( {X - 1} \right)^2 + \frac{{8kIX}}{{cT}}} } \right] \,\!$

Where:

$T$ = Duration of Analysis Period (in hours)
$k$ = Delay Adjustment Factor that is dependent on signal controller mode
$I$ = Upstream filtering/metering adjustment factor

Overflow delay generally only applies to densely urban corridors, where queues can sometimes spill over into previous intersections. Since this is not very common (usually the consequence of a poorly timed intersection sequence, the rare increase of traffic demand, or an emergency vehicle passing through the area), it is generally not taken into account for simple problems.

Delay can be calcaulated for individual vehicles in certain approaches or lane groups. Average delay per vehicle for an approach A can be calculated using the following formula:

$d_A = \frac{{\sum\limits_i {d_i v_i } }}{{\sum\limits_i {v_i } }} \,\!$

Where:

$d A$ = Average Delay per vehicle for approach A (sec)
$d i$ = Average Delay per vehicle for lane group i on approach A (sec)
$v i$ = Analysis flow rate for lane group i

Average delay per vehicle for the intersection can then be calculated:

$d_I = \frac{{\sum\limits_A {d_A v_A } }}{{\sum\limits_A {v_A } }} \,\!$

Where:

$d I$ = Average Delay per vehicle for the intersection (sec)
$d A$ = Average Delay per vehicle for approach A (sec)
$v A$ = Analysis flow rate for approach A

[edit] Critical Lane Groups

For any combination of lane group movements, one lane group will dictate the necessary green time during a particular phase. This lane group is called the Critical Lane Group. This lane group has the highest traffic intensity (v/s) and the allocation of green time for each phase is based on this ratio.

The sum of the flow ratios for the critical lane groups can be used to calculate a suitable cycle length.

$Y_c = \sum\limits_{i = 1}^n {\left( {\frac{v}{s}} \right)} _{ci} \,\!$

Where:

$Y c$ = Sum of Flow Ratios for Critical Lane Groups
$(v / s) c i$ = Flow Ratio for Critical Lane Group i
$n$ = Number of Critical Lane Groups

Similarly, the total lost time for the cycle is also an element that can be used in the calculation of cycle length.

$L = \sum\limits_{i = 1}^n {\left( {t_L } \right)_{ci} } \,\!$

Where:

$L$ = Total lost Time for Cycle
$(t L) c i$ = Total Lost Time for Critical Lane Group i

[edit] Cycle Length Calcuation

Cycle lengths are calculated by summing individual phase lengths. Using the previous formulas for assistance, the minimum cycle length necessary for the lane group volumes and phasing plan can be easily calculated.

$C_{min } = \frac{{L*X_c }}{{{\rm{X}}_{\rm{c}} {\rm{ - }}\sum\limits_{{\rm{i}} = {\rm{1}}}^{\rm{n}} {{\rm{Yi}}} }}{\rm{ }} \,\!$

Where:

$C m i n$ = Minimum necessary cycle length
$X c$ = Critical v/c ratio for the intersection
$(v / s) c i$ = Flow Ratio for Critical Lane Group
$n$ = Number of Critical Lane Groups

This equation calculates the minimum cycle length necesary for the intersection to operate at an acceptable level, but it does not necessarily minimize the average vehicle delay. A more optimal cycle length usually exists that would minimize average delay. Webster (1958) proposed an equation for the calculation of cycle length that seeks to minize vehicle delay. This optimum cycle length formula is listed below.

$C_{opt} = \frac{{\left[ {\left( {1.5L} \right) + 5} \right]}}{{\left( {1.0{\rm{ }} - {\rm{ }}\sum\limits_{i = 1}^n {Y_i } } \right)}}{\rm{ }} \,\!$

Where:

$C o p t$ = Optimal Cycle Length for Minimizing Delay

[edit] Green Time Allocation

Once cycle length has been determined, the next step is to determine the allocation of green time to each phase. Several strategies for allocating green time exist. One of the more popular ones is to distribute green time such that v/c ratios are equalized over critical lane groups. Similarly, v/c ratios can be found with predetermined values for green time.

$X_i = \frac{{v_i }}{{c_i }} = \frac{{v_i }}{{s_i *g_i /C}} = \frac{{v_i /s_i }}{{g_i /C}} \,\!$

Where:

$X i$ = v/c ratio for lane group i

With knowledge of cycle lengths, lost times, and v/s ratios, the degree of saturation for an intersection can be found.

$X_c = \sum {\frac{{v_i }}{{s_i }}\frac{C}{{C - L}}} \,\!$

Where:

$X c$ = Degree of saturation for an intersection cycle

From this, the total effective green for all phases can be computed.

$\sum {g_i } = \sum {\frac{{v_i }}{{s_i }}\frac{C}{{X_c }}} = C - L \,\!$

[edit] Demonstrations

[edit] Examples

[edit] Example 1: Intersection Queueing

Problem:

An approach at a pretimed signalized intersection has an arrival rate of 0.1 veh/sec and a saturation flow rate of 0.7 veh/sec. 20 seconds of effective green are given in a 60-second cycle. Provide analysis of the intersection assuming D/D/1 queueing.

Solution:

Traffic intensity, $ρ$ , is the first value to calculate.

$\rho = \frac{{\lambda}}{{\mu}} = \frac{{0.1}}{{0.7}} = 0.14\,\!$

Red time is found to be 40 seconds (C - g = 60 - 20). The remaining values of interest can be easily found.

Time to queue clearance after the start of effective green:

$t_c {\rm{ }} = {\rm{ }}\frac{{\rho r}}{{1 - \rho }} = \frac{{0.14(40)}}{{1 - 0.14}} = 6.51\ s \,\!$

Proportion of the cycle with a queue:

$P_q {\rm{ }} = {\rm{ }}\frac{{r{\rm{ }} + {\rm{ }}t_c }}{C}{\rm{ }} = {\rm{ }}\frac{{40{\rm{ }} + {\rm{ }}6.51 }}{60}{\rm{ }} = 0.775\,\!$

Proportion of vehicles stopped:

$P_s = \frac{{\lambda \left( {r + t_C } \right)}}{{\lambda \left( {r + g} \right)}} = \frac{{0.1 \left( {40 + 6.51 } \right)}}{{0.1 \left( {40 + 20} \right)}} = 0.775 \,\!$

Maximum number of vehicles in the queue:

$Q_{\max } {\rm{ }} = {\rm{ }}\lambda r = {\rm{ }}0.1(40) = 4 \,\!$

Total vehicle delay per cycle:

$D_t {\rm{ }} = {\rm{ }}\frac{{\lambda r^2 }}{{2\left( {1 - \rho } \right)}}{\rm{ }} = {\rm{ }}\frac{{0.1(40^2) }}{{2\left( {1 - 0.14 } \right)}}{\rm{ }} = 93 veh-s \,\!$

Average delay per vehicle:

$d_{avg} {\rm{ }} = \frac{{r^2 }}{{2C\left( {1 - \rho } \right)}} = \frac{{(40)^2 }}{{2(60)\left( {1 - 0.14} \right)}} = 15.5\ s\,\!$

Maximum delay of any vehicle:

$d_{\max } {\rm{ }} = {\rm{ }}r = {\rm{ }} 40\ s \,\!$

[edit] Example 2: Total Delay

Problem:

Compute the average approach delay given certain conditions for a 60-second cycle length intersection with 20 seconds of green, a v/c ratio of 0.7, a progression neutral state (PF=1.0), and no chance of intersection spillover delay (overflow delay). Assume the traffic flow accounts for the peak 15-minute period and a lane capacity of 840 veh/hr.

Solution:

Uniform Delay:

$d_1 = \frac{{0.5C\left( {1 - \frac{g}{C}} \right)^2 }}{{1 - \left[ {\min \left( {1,X} \right)\frac{g}{C}} \right]}} = \frac{{0.5(60)\left( {1 - \frac{20}{60}} \right)^2 }}{{1 - \left[ {\min \left( {1,0.7} \right)\frac{20}{60}} \right]}} = 17.39\ s\,\!$

Random Delay:

$T = 0.25\,\!$ (from problem statement)

$X = 0.7\,\!$

$k = 0.5\,\!$ (for pretimed control)

$I = 1.0\,\!$ (isolated intersection)

$c = 840\,\!$

$d_2 = 900T\left[ {\left( {X - 1} \right) + \sqrt {\left( {X - 1} \right)^2 + \frac{{8kIX}}{{cT}}} } \right] = 900(0.25)\left[ {\left( {0.7 - 1} \right) + \sqrt {\left( {0.7 - 1} \right)^2 + \frac{{8(0.5)(1)(0.7)}}{{840(0.25)}}} } \right] = 4.83\ s\,\!$

Overflow Delay:

Overflow delay is zero because it is assumed that there is no overflow.

$d_3 = 0\,\!$

Total Delay:

$d = d_1(PF) + d_2 + d_3 = 17.39(1) + 4.83 + 0 = 22.22\ s\,\!$

The average total delay is 22.22 seconds.

[edit] Example 3: Cycle Length Calculation

Problem:

Calculate the minimum and optimal cycle lengths for the intersection of Oak Street and Washington Avenue, given that the critical v/c ratio is 0.9, the two critical approaches have a v/s ratio of 0.3, and the Lost Time equals 15 seconds.

Solution:

Minimum Cycle Length:

$C_{min } = \frac{{L*X_c }}{{{\rm{X}}_{\rm{c}} {\rm{ - }}\sum\limits_{{\rm{i}} = {\rm{1}}}^{\rm{n}} {{\rm{Yi}}} }}{\rm{ }} = \frac{{15*0.9}}{{[0.9 - (2(0.3))]}} = 45 \ s\,\!$

Optimal Cycle Length:

$C_{opt} = \frac{{\left[ {\left( {1.5L} \right) + 5} \right]}}{{\left( {1.0{\rm{ }} - {\rm{ }}\sum\limits_{i = 1}^n {Y_i } } \right)}}{\rm{ }} = \frac{{1.5(15) + 5}}{{1.0 - 2(0.3)}} = 68.75 \ s \,\!$

The minimum cycle length is 45 seconds and the optimal cycle length is 68.75 seconds.

[edit] Thought Question

Problem

Why don't signalized intersections perform more efficiently than uncontrolled intersections?

Solution

The inherent lost time that comes from each signal change is wasted time that does not occur when intersections are uncontrolled. It comes at quite a surprise to most of the Western World, where traffic signals are plentiful, but there are intersections that perform quite well without any form of control. There is an infamous video on Youtube that shows an uncontrolled intersection in India where drivers somehow navigate through a busy, chaotic environment smoothly and efficiently. The video is humorous to watch, but it shows a valid point that uncontrolled intersections can indeed work and are quite efficient. However, the placement of traffic signals is for safety, as drivers entering an uncontrolled intersection have a higher likelihood of being involved in a dangerous accident, such as a T-bone or head-on collision.

[edit] Sample Problem

Problem (Solution)

[edit] Variables

$t c$ - Time for queue to clear

$ρ$ - Arrival Rate divided by Departure Rate

$r$ - Red Time

$P q$ - Proportion of cycle with a queue

$P s$ - Proportion of Stopped Vehicles

$c$ - Lane Group Capacity

$s$ - Adjusted Saturation Flow Rate

$g$ - Effective Green Length

$C$ - Cycle Length

$d$ - Average Signal Delay per vehicle (sec)

$d 1$ - Average Delay per vehicle due to uniform arrivals (sec)

$P F$ - Progression Adjustment Factor

$d 2$ - Average Delay per vehicle due to random arrivals (sec)

$d 3$ - Average delay per vehicle due to initial queue at start of analysis time period (sec)

$X$ - Volume/Capacity (v/c) ratio for lane group.

$T$ - Duration of Analysis Period (in hours)

$k$ - Delay Adjustment Factor that is dependent on signal controller mode

$I$ - Upstream filtering/metering adjustment factor

$d A$ - Average Delay per vehicle for approach A (sec)

$d i$ - Average Delay per vehicle for lane group i on approach A (sec)

$v i$ - Analysis flow rate for lane group i

$d I$ - Average Delay per vehicle for the intersection (sec)

$v A$ - Analysis flow rate for approach A

$Y c$ - Sum of Flow Ratios for Critical Lane Groups

$(v / c) c i$ - Flow Ratio for Critical Lane Group i

$n$ - Number of Critical Lane Groups

$C m i n$ - Minimum necessary cycle length

$X c$ - Critical v/c ratio for the intersection

$(v / s) c i$ - Flow Ratio for Critical Lane Group

$C o p t$ - Optimal Cycle Length for Minimizing Delay

$X i$ - v/c ratio for lane group i

$X c$ - Degree of saturation for an intersection cycle

[edit] Key Terms

Delay

Total Delay

Average Delay

Uniform Delay

Random Delay

Overflow Delay

Cycle Length

v/c ratio

v/s ratio

Saturation Flow Rate

Red Time

Effective Green

Minimum Cycle Length

Optimal Cycle Length

Critical Lane Group

Degree of Saturation

Progression Adjustment Factor

Lost Time

Queue

[edit] External Exercises

Use the GAME software at the STREET website to learn how to coordinate traffic signals to reduce delay.

Use the OASIS software at the STREET website to study how signals change when given information about time-dependent vehicle arrivals.

[edit] References

Hagen, Lawrence T. and Courage, Kenneth. (1992). “Comparison of Macroscopic Models for Signalized Intersection Analysis.” Transportation Research Record. 1225: 33-44.
Hurdle, V. F. (1982). “Signalized Intersections: A Primer for the Uninitiated.” Transportation Research Record 971:96-105.
Webster, F.V. (1958). Traffic Signal Settings. Road Research Technical Paper No. 39. London: Great Britain Road Research Laboratory.
Webster, F.V. and Cobbe, B. M. (1966). Traffic Signals. Road Research Technical Paper No. 56. HMSO London UK.

Fundamentals of Transportation/Traffic Signals

From Wikibooks, the open-content textbooks collection

Contents

[edit] Intersection Queueing

[edit] Intersection delay

[edit] Level of Service

[edit] Critical Lane Groups

[edit] Cycle Length Calcuation

[edit] Green Time Allocation

[edit] Demonstrations

[edit] Examples

[edit] Example 1: Intersection Queueing

[edit] Example 2: Total Delay

[edit] Example 3: Cycle Length Calculation

[edit] Thought Question

[edit] Sample Problem

[edit] Variables

[edit] Key Terms

[edit] External Exercises

[edit] References

Views

Personal tools

Navigation

Search

community

Print/export

Toolbox