+1
Jun Su Park
After completing the research for my research question, I have determined that the
ideal signal-timing method that should be employed at oversaturated intersections should be
the algorithm based on maximizing throughput. I have examined each prevalent method used
at oversaturated intersections (fixed, delay minimizing, maintaining queue ratio) and came to
this conclusion. To understand the logic behind this decision, I will go through each method
that was covered and summarize its benefits and drawbacks. The first method is the fixed-
timing method. This strategy was not mentioned as it cannot be described as a strategy—it is
simply a signal with each approach having constant green times for every cycle. This can be
described as the most basic method at intersections to control traffic and they simply serve the
purpose to stop cars from colliding into one another rather than to reduce congestion. Therefore,
the fixed-timing method is strongly not recommended for oversaturated intersections, as it does
not alleviate the situation and can even make it worse by allocating an excess of green time to
unnecessary approaches.
The second method that was discussed was the discrete minimal delay model and the
performance index model. Both are new versions of previous delay-minimizing strategies and
they aim to find the optimal switch-over time. The discrete minimal delay method serves to
simplify delay estimation techniques used in previous research that are used to determine
switch-over times and the performance index model builds on the discrete model by adding a
factor of vehicle stopping times. The performance index model is more accurate due to the
added factor. This method provides a significant advantage over fixed-signal timing methods
as it determines the amount of green time that should be given to each approach over the whole
oversaturation period while considering delay times at each approach.
The third strategy that was covered was the vehicle actuation (VA) strategy. This
method utilizes sensors at intersections to determine when and how much green time to give to
each approach in an intersection. This source evaluated a more efficient VA strategy, called
enhanced VA strategy and found that it resulted in a 30% decrease in delay compared to
conventional VA strategies. Similar to the previous method, VA strategies also aim to minimize
delay times. However, when VA strategies are used in oversaturated situations where the whole
queue cannot disperse in one cycle with maximum green time, the method is no different from
the fixed-signal method, as the sensors will continue to detect vehicles and give maximum
green time each cycle. Another drawback is the cost of the sensors, which my cancel out the
positive congestion relief effects. Therefore, VAstrategies are more appropriate in intersections
that must be kept clear for the whole network to function, but do not have heavy traffic.
The fourth method that was analyzed was the discrete-event max-plus model, which
aims to minimize queue length. Just like the two previous methods, this algorithm also
produces optimal signal times for each approach in the intersection when applied, but
minimizes queue length instead of delay times. The authors claim that this method is more
efficient, as using queue length data from sensors are much more accurate and quicker than
estimating delay times. The data from the final source seem to support this claim, as it indicates
that queue minimizing models fared slightly better than delay minimizing models. One
drawback is that the sensors may not be appropriate for smaller intersections to be worth the
money, similar to the VA method sensors.
The last method was the throughput maximizing algorithm. This algorithm aims to
produce ideal cycle times for each approach, which is similar to the previous methods that were
discussed. The authors assert that throughput maximization is the ideal optimization category,
as previous research assume that saturation flow is constant. Also, delay minimization could
be inefficient as when queues get longer, delay gets infinitely bigger and throughput
maximization naturally leads to delay minimization. Another advantage is that this method
requires less data such as queue length and demand of intersection usage, which makes the
method more exact than previous methods. However, a drawback is that queue length have to
be sufficiently long enough for this method to work.
Combining all of the benefits and drawbacks, we can come to the conclusion that
throughput maximization is the most efficient method compared to the other methods. Queue
minimization and VA control methods require sensors, which improve accuracy but result in
high costs, which may not be appropriate for isolated intersections. Delay minimization
techniques are a more suitable choice that rivals throughput maximization techniques, but since
most delay minimization techniques’assumptions are based on that saturation flow is constant,
this may rather increase delay, as the author of the last method suggests. Also, since the delay
has to be estimated, it affects the method’s overall accuracy.
Applying this to the practical problem, I have come to the conclusion that the current
fixed-time strategy at the four-way intersection should be changed to the throughput
maximization strategy. Since this intersection is not a part of any major road network such as
intersections in the city center, sensors will incur more costs than potential benefits, which
eliminates the two strategies proposed. If the queue on the intersection was shorter, delay
minimization techniques may be viable, but since the queue during peak times require more
than 20 cycles to resolve, delay times are too great to be analyzed through this mechanism. The
conditions for the throughput maximization technique are met, as the queues are long enough
that they are not dispersed in a single cycle. This method also takes account that saturation
flows are not constant and uses less variables that need estimation. Therefore, this method, an
effective and cheap strategy, should be employed in the intersection.

More Related Content

PPTX
Transit Signalisation Priority (TSP) - A New Approach to Calculate Gains
 
PPTX
Calibration and Validation of Micro-Simulation Models
 
PPTX
Updated Traffic Analysis Tools for Complete Streets
 
PPTX
Transit Signal Priority
 
PPTX
Traffic Conditions - From Now Until Forever
 
PDF
TOTJ 73 Estimating queues at traffic signals
PDF
RIOH / RWS workshop
PDF
Praktijkrelevantie TRAIL PhD onderzoek
Transit Signalisation Priority (TSP) - A New Approach to Calculate Gains
 
Calibration and Validation of Micro-Simulation Models
 
Updated Traffic Analysis Tools for Complete Streets
 
Transit Signal Priority
 
Traffic Conditions - From Now Until Forever
 
TOTJ 73 Estimating queues at traffic signals
RIOH / RWS workshop
Praktijkrelevantie TRAIL PhD onderzoek

What's hot (20)

PDF
Measurement of spot speed
PPT
KAI - Arterial Performance Measures 02-03-10
PPTX
Session 38 Oded Cats
PPTX
Antony johnstone m_v2
PDF
Spot speed studies.ppt .mylan nejyar
PDF
Ieeepro techno solutions 2013 ieee embedded project person-based traffic re...
PDF
Transit Signal Priority TSP
PPTX
AITPM Conference Presentation -Callan Stirzaker
PPTX
Traffic Signals Safety and Efficiency Project – Stage Two Implementation
PPTX
A Macroscopic Dynamic model integrated into Dynamic Traffic Assignment: advan...
PDF
3445-8593-4-PB
PPTX
Beyond Level of Service – Towards a relative measurement of congestion in pla...
PDF
Proportionally fair scheduling for traffic light networks
PPTX
Presentation ATM
PPTX
MMauch HOC presentation-oct-04-2013
PPTX
Traffic studies volume study
PPTX
Uts congestion components
PDF
Travel Time Prediction Using Dedicated Short-Range Communications Probe Data
PDF
Design and-analysis-of-a-two-stage-traffic-light-system-using-fuzzy-logic-216...
PDF
L3 Traffic Flow Models
Measurement of spot speed
KAI - Arterial Performance Measures 02-03-10
Session 38 Oded Cats
Antony johnstone m_v2
Spot speed studies.ppt .mylan nejyar
Ieeepro techno solutions 2013 ieee embedded project person-based traffic re...
Transit Signal Priority TSP
AITPM Conference Presentation -Callan Stirzaker
Traffic Signals Safety and Efficiency Project – Stage Two Implementation
A Macroscopic Dynamic model integrated into Dynamic Traffic Assignment: advan...
3445-8593-4-PB
Beyond Level of Service – Towards a relative measurement of congestion in pla...
Proportionally fair scheduling for traffic light networks
Presentation ATM
MMauch HOC presentation-oct-04-2013
Traffic studies volume study
Uts congestion components
Travel Time Prediction Using Dedicated Short-Range Communications Probe Data
Design and-analysis-of-a-two-stage-traffic-light-system-using-fuzzy-logic-216...
L3 Traffic Flow Models
Ad

Similar to +1 (20)

PDF
Research
PPTX
Research
PDF
30120130405026
PDF
A Robust Algorithm To Solve The Signal Setting Problem Considering Different ...
PDF
Cooperative Traffic Control based on the Artificial Bee Colony
PDF
Intelligent Intersection Management: A Survey
PDF
Capacity analysis-of-priority-intersections-with-flare-under-mixed-traffic-co...
PDF
PDF
Operational evaluation of road
PDF
Designing of a Traffic Signaling System at T-Intersection
PDF
Ieeepro techno solutions 2013 ieee embedded project dynamic traffic control...
PPTX
webster method of signal design in traffic ..pptx
PDF
OVERT TRC 2015 Final
PDF
Comparative study of traffic signals with and without signal coordination of ...
PDF
Comparative study of traffic signals with and without signal coordination of ...
PDF
IRJET- Design and Development of Traffic Flow Prediction System for Efficient...
PDF
15 0544
DOCX
References1. HCS 2010 online manuals.2. Data Data provi.docx
DOCX
A Hybrid Method for Automatic Traffic Control Mechanism
PDF
Design of traffic signal on NH-12 near Barkatullah University, Bhopal Distric...
Research
Research
30120130405026
A Robust Algorithm To Solve The Signal Setting Problem Considering Different ...
Cooperative Traffic Control based on the Artificial Bee Colony
Intelligent Intersection Management: A Survey
Capacity analysis-of-priority-intersections-with-flare-under-mixed-traffic-co...
Operational evaluation of road
Designing of a Traffic Signaling System at T-Intersection
Ieeepro techno solutions 2013 ieee embedded project dynamic traffic control...
webster method of signal design in traffic ..pptx
OVERT TRC 2015 Final
Comparative study of traffic signals with and without signal coordination of ...
Comparative study of traffic signals with and without signal coordination of ...
IRJET- Design and Development of Traffic Flow Prediction System for Efficient...
15 0544
References1. HCS 2010 online manuals.2. Data Data provi.docx
A Hybrid Method for Automatic Traffic Control Mechanism
Design of traffic signal on NH-12 near Barkatullah University, Bhopal Distric...
Ad

+1

  • 1. +1 Jun Su Park After completing the research for my research question, I have determined that the ideal signal-timing method that should be employed at oversaturated intersections should be the algorithm based on maximizing throughput. I have examined each prevalent method used at oversaturated intersections (fixed, delay minimizing, maintaining queue ratio) and came to this conclusion. To understand the logic behind this decision, I will go through each method that was covered and summarize its benefits and drawbacks. The first method is the fixed- timing method. This strategy was not mentioned as it cannot be described as a strategy—it is simply a signal with each approach having constant green times for every cycle. This can be described as the most basic method at intersections to control traffic and they simply serve the purpose to stop cars from colliding into one another rather than to reduce congestion. Therefore, the fixed-timing method is strongly not recommended for oversaturated intersections, as it does not alleviate the situation and can even make it worse by allocating an excess of green time to unnecessary approaches. The second method that was discussed was the discrete minimal delay model and the performance index model. Both are new versions of previous delay-minimizing strategies and they aim to find the optimal switch-over time. The discrete minimal delay method serves to simplify delay estimation techniques used in previous research that are used to determine switch-over times and the performance index model builds on the discrete model by adding a factor of vehicle stopping times. The performance index model is more accurate due to the added factor. This method provides a significant advantage over fixed-signal timing methods as it determines the amount of green time that should be given to each approach over the whole oversaturation period while considering delay times at each approach. The third strategy that was covered was the vehicle actuation (VA) strategy. This method utilizes sensors at intersections to determine when and how much green time to give to each approach in an intersection. This source evaluated a more efficient VA strategy, called enhanced VA strategy and found that it resulted in a 30% decrease in delay compared to conventional VA strategies. Similar to the previous method, VA strategies also aim to minimize delay times. However, when VA strategies are used in oversaturated situations where the whole queue cannot disperse in one cycle with maximum green time, the method is no different from the fixed-signal method, as the sensors will continue to detect vehicles and give maximum green time each cycle. Another drawback is the cost of the sensors, which my cancel out the positive congestion relief effects. Therefore, VAstrategies are more appropriate in intersections that must be kept clear for the whole network to function, but do not have heavy traffic. The fourth method that was analyzed was the discrete-event max-plus model, which aims to minimize queue length. Just like the two previous methods, this algorithm also produces optimal signal times for each approach in the intersection when applied, but minimizes queue length instead of delay times. The authors claim that this method is more efficient, as using queue length data from sensors are much more accurate and quicker than estimating delay times. The data from the final source seem to support this claim, as it indicates
  • 2. that queue minimizing models fared slightly better than delay minimizing models. One drawback is that the sensors may not be appropriate for smaller intersections to be worth the money, similar to the VA method sensors. The last method was the throughput maximizing algorithm. This algorithm aims to produce ideal cycle times for each approach, which is similar to the previous methods that were discussed. The authors assert that throughput maximization is the ideal optimization category, as previous research assume that saturation flow is constant. Also, delay minimization could be inefficient as when queues get longer, delay gets infinitely bigger and throughput maximization naturally leads to delay minimization. Another advantage is that this method requires less data such as queue length and demand of intersection usage, which makes the method more exact than previous methods. However, a drawback is that queue length have to be sufficiently long enough for this method to work. Combining all of the benefits and drawbacks, we can come to the conclusion that throughput maximization is the most efficient method compared to the other methods. Queue minimization and VA control methods require sensors, which improve accuracy but result in high costs, which may not be appropriate for isolated intersections. Delay minimization techniques are a more suitable choice that rivals throughput maximization techniques, but since most delay minimization techniques’assumptions are based on that saturation flow is constant, this may rather increase delay, as the author of the last method suggests. Also, since the delay has to be estimated, it affects the method’s overall accuracy. Applying this to the practical problem, I have come to the conclusion that the current fixed-time strategy at the four-way intersection should be changed to the throughput maximization strategy. Since this intersection is not a part of any major road network such as intersections in the city center, sensors will incur more costs than potential benefits, which eliminates the two strategies proposed. If the queue on the intersection was shorter, delay minimization techniques may be viable, but since the queue during peak times require more than 20 cycles to resolve, delay times are too great to be analyzed through this mechanism. The conditions for the throughput maximization technique are met, as the queues are long enough that they are not dispersed in a single cycle. This method also takes account that saturation flows are not constant and uses less variables that need estimation. Therefore, this method, an effective and cheap strategy, should be employed in the intersection.