Optimization of mixed cycle length traffic signals

Mixed cycle length operation has been recommended for networks where individual intersections process considerably different traffic volumes. The signals to operate at lower or higher cycle lengths are determined heuristically. This paper demonstrates that the use of mixed cycle lengths as given by the heuristic is inferior to operation under a common cycle length. This contradicts findings in earlier studies, and the difference in conclusion is due to the use of updated optimization methodology. A procedure for incorporating the allocation of mixed cycle lengths into the global optimization of all signal timing variables by a genetic algorithm is proposed. The mixed cycle length timing plans obtained from this procedure are an improvement over those determined heuristically. Mixed cycle length operation is found to be of a more limited application than indicated in previous studies. Copyright © 2012 John Wiley & Sons, Ltd.     

Queue discharge patterns at signalized intersections with green signal countdown device and long cycle length

Two apparent features that prevail at signalized intersections in China are green signal countdown device and long cycle lengths. The objective of this study is to investigate the impacts of green signal countdown device and long cycle length on queue discharge patterns and to discuss its implications on capacity estimation in the context of China's traffic. At five typical large intersections in Shanghai and Tianjin, 11 through lanes were observed, and 9251 saturation headways were obtained as valid samples. Statistical analyses indicate that the discharge process of queuing vehicles can be divided into three distinct stages according to the discharge flow rate: a start‐up stage, a steady stage, and a rush stage. The average time for queuing vehicles to reach a stationary saturation flow rate, that is, the start‐up stage, was found to be approximately 20–30 seconds; the rush stage usually occurs during the phase transition period. The finding is contrary to the conventional assumption that the discharge rate reaches a maximum value after the fourth vehicle is discharged and then remains constant during the green time until the queue is completely dissolved. The capacity estimation errors that might arise from the conventional methods are discussed through a comparative study and a sensitivity analysis that are based on the identified queue discharge patterns. In addition, a piecewise linear regression method was proposed in order to reduce such errors. The proposed method can be used for capacity estimation at signalized intersections with the identified queue discharge patterns. Copyright © 2017 John Wiley & Sons, Ltd.     

Area-wide urban traffic control: A Bee Colony Optimization approach

The paper describes a new method of optimizing traffic signal settings. The area-wide urban traffic control system developed in the paper is based on the Bee Colony Optimization (BCO) technique. The BCO method is based on the principles of the collective intelligence applied by the honeybees during the nectar collecting process. The optimal (or near-optimal) values of cycle length, offsets, and splits are discovered by minimizing the total travel time of all network users travelling through signalized intersections. The set of numerical experiments is performed on well-known traffic benchmark network. The results obtained by the BCO approach are compared with the results found by Simulated Annealing (SA). It has been shown that the suggested BCO approach outperformed the SA.     

Multi-stage stochastic program to optimize signal timings under coordinated adaptive control

In the wake of traffic congestion at intersections, it is imperative to shorten delays in corridors with stochastic arrivals. Coordinated adaptive control can adjust green time flexibly to deal with a stochastic demand, while maintaining a minimum through-band for coordinated intersections. In this paper, a multi-stage stochastic program based on phase clearance reliability (PCR) is proposed to optimize base timing plans and green split adjustments of coordinated intersections under adaptive control. The objective is to minimize the expected intersection delay and overflow of the coordinated approach. The overflow or oversaturated effect is explicitly addressed in the delay calculation, which greatly increases the modeling complexity due to the interaction of overflow delays across cycles. The notion of PCR separates the otherwise related green time settings of consecutive cycles into a number of stages, in which the base timing plan and actual timing plan in different cycles are handled sequentially. We then develop a PCR based solution algorithm to solve the problem, and apply the model and the solution algorithm to actual intersections in Shanghai to investigate its performance as compared with Allsop’s method and Webster’s method. Preliminary results show the PCR-based method can significantly shorten delays and almost eliminates overflow for the coordinated approaches, with acceptable delay increases of the non-coordinated approaches. A comparison between the proposed coordinated adaptive logic and a coordinated actuated logic is also conducted in the case study to show the advantages and disadvantages.     

Real-time estimation of lane-based queue lengths at isolated signalized junctions

In this study, we develop a real-time estimation approach for lane-based queue lengths. Our aim is to determine the numbers of queued vehicles in each lane, based on detector information at isolated signalized junctions. The challenges involved in this task are to identify whether there is a residual queue at the start time of each cycle and to determine the proportions of lane-to-lane traffic volumes in each lane. Discriminant models are developed based on time occupancy rates and impulse memories, as calculated by the detector and signal information from a set of upstream and downstream detectors. To determine the proportions of total traffic volume in each lane, the downstream arrivals for each cycle are estimated by using the Kalman filter, which is based on upstream arrivals and downstream discharges collected during the previous cycle. Both the computer simulations and the case study of real-world traffic show that the proposed method is robust and accurate for the estimation of lane-based queue lengths in real time under a wide range of traffic conditions. Calibrated discriminant models play a significant role in determining whether there are residual queued vehicles in each lane at the start time of each cycle. In addition, downstream arrivals estimated by the Kalman filter enhance the accuracy of the estimates by minimizing any error terms caused by lane-changing behavior.     

Stochastic adaptive control model for traffic signal systems

An adaptive control model of a network of signalized intersections is proposed based on a discrete-time, stationary, Markov decision process. The model incorporates probabilistic forecasts of individual vehicle actuations at downstream inductance loop detectors that are derived from a macroscopic link transfer function. The model is tested both on a typical isolated traffic intersection and a simple network comprised of five four-legged signalized intersections, and compared to full-actuated control. Analyses of simulation results using this approach show significant improvement over traditional full-actuated control, especially for the case of high volume, but not saturated, traffic demand.     

Modeling and controlling an isolated urban intersection based on cooperative vehicles

In this paper, we propose a new approach for controlling the traffic at isolated intersections. We assume that all vehicles are equipped with on-board units (ITS station) that make them able to wirelessly negotiate the “right of way” according to the measurements done by the positioning system during their travel. A vehicle is allowed to cross the intersection if the green color is displayed to the driver in an on-board screen. The control aims to smooth the traffic through the sequence of vehicles authorized to traverse the intersection. The main challenge raised with the assumption is that the sequence must be dynamically formed by a real time application. The dynamic behavior of the traffic is considered discrete, in order to determine the switching rule according to the instantly observed events. We propose a model based on Timed Petri Nets with Multipliers (TPNM) which allows us to propose the control policy through the structural analysis. The resulting switching rules are very simplistic and efficient for isolated intersections. Indeed, microscopic simulations show that they perform as well as the optimal sequence based on the detection of vehicles at the entrance of the intersection. Moreover, the proposed approach has been tested through a real intersection.     

Modeling delay at signalized intersections with channelized right‐turn lanes considering the impact of blockage

This paper presents a probabilistic delay model for signalized intersections with right‐turn channelization lanes considering the possibility of blockage. Right‐turn channelization is used to improve the capacity and to reduce delay at busy intersections with a lot of right‐turns. However, under heavy traffic conditions the through vehicles will likely block the channelization entrance that accrues delay to right‐turn vehicles. If the right‐turn channelization gets blocked frequently, its advantage in reducing the intersection delay is neglected and as a result the channelization lane becomes inefficient and redundant. The Highway Capacity Manual (HCM) neglects the blockage effect, which may be a reason for low efficiency during peak hours. More importantly, using HCM or other standard traffic control methods without considering the blockage effects would lead to underestimation of the delay. To overcome this issue, the authors proposed delay models by taking into account both deterministic and random aspects of vehicles arrival patterns at signalized intersections. The proposed delay model was validated through VISSIM, a microscopic simulation model. The results showed that the proposed model is very precise and accurately estimates the delay. In addition, it was found that the length of short‐lane section and proportion of right‐turn and through traffic significantly influence the approach delay. For operational purposes, the authors provided a step‐by‐step delay calculation process and presented approach delay estimates for different sets of traffic volumes, signal settings, and short‐lane section lengths. The delay estimates would be useful in evaluating adequacy of the current lengths, identifying the options of extending the short‐lane section length, or changing signal timing to reduce the likelihood of blockage. Copyright © 2016 John Wiley & Sons, Ltd.     

Increasing the capacity of signalized intersections with separate left turn phases

A separate turn phase is often used on the approach leg to an intersections with heavy left turns. This wastes capacity on the approach because some of its lanes cannot discharge during its green phases. The paper shows that the problem can be eliminated by reorganizing traffic on all the lanes upstream of an intersection using a mid-block pre-signal. If drivers behave deterministically, the capacity that can be achieved is the same as if there were no left turns. However, if the reorganization is too drastic, it may be counterintuitive to drivers. This can be remedied by reorganizing traffic on just some of the available lanes. It is shown that such partial reorganization still increases capacity significantly, even if drivers behave randomly and only one lane is reorganized. The paper shows how to optimize the design of a pre-signal system for a generic intersection. It also identifies both, the potential benefits of the proposed system for a broad class of intersections, and the domain of application where the benefits are most significant.     

Traffic conflict models to evaluate the safety of signalized intersections at the cycle level

The safety of signalized intersections has often been evaluated at an aggregate level relating collisions to annual traffic volume and the geometric characteristics of the intersection. However, for many safety issues, it is essential to understand how changes in traffic parameters and signal control affect safety at the signal cycle level. This paper develops conflict-based safety performance functions (SPFs) for signalized intersections at the signal cycle level. Traffic video-data was recorded for six signalized intersections located in two cities in Canada. A video analysis procedure is proposed to collect rear-end conflicts and various traffic variables at each signal cycle from the recorded videos. The traffic variables include: traffic volume, maximum queue length, shock wave characteristics (e.g. shock wave speed and shock wave area), and the platoon ratio. The SPFs are developed using the generalized linear models (GLM) approach. The results show that all models have good fit and almost all the explanatory variables are statistically significant leading to better prediction of conflict occurrence beyond what can be expected from the traffic volume only. Furthermore, space-time conflict heat maps are developed to investigate the distribution of the traffic conflicts. The heat maps illustrate graphically the association between rear-end conflicts and various traffic parameters. The developed models can give insight about how changes in the signal cycle design affect the safety of signalized intersections. The overall goal is to use the developed models for the real-time optimization of signalized intersection safety by changing the signal design.     

Integrated optimization of bus priority operations in connected vehicle environment

Most previous works associated with transit signal priority merely focus on the optimization of signal timings, ignoring both bus speed and dwell time at bus stops. This paper presents a novel approach to optimize the holding time at bus stops, signal timings, and bus speed to provide priority to buses at isolated intersections. The objective of the proposed model is to minimize the weighted average vehicle delays of the intersection, which includes both bus delay and impact on nearby intersection traffic, ensuring that buses clear these intersections without being stopped by a red light. A set of formulations are developed to explicitly capture the interaction between bus speed, bus holding time, and transit priority signal timings. Experimental analysis is used to show that the proposed model has minimal negative impacts on general traffic and outperforms the no priority, signal priority only, and signal priority with holding control strategies (no bus speed adjustment) in terms of reducing average bus delays and stops. A sensitivity analysis further demonstrates the potential of the proposed approach to be applied to bus priority control systems in real‐time under different traffic demands, bus stop locations, and maximum speed limits. Copyright © 2016 John Wiley & Sons, Ltd.     

Disruption management in public transit: the bee colony optimization approach

Disruptions in carrying out planned bus schedules occur daily in many public transit companies. Disturbances are often so large that it is necessary to perform re-planning of planned bus and crew activities. Dispatchers in charge of traffic operations must frequently find an answer to the following question in a very short period of time: How should available buses be distributed among bus routes in order to minimize total passengers' waiting time on the network? We propose a model for assigning buses to scheduled routes when there is a shortage of buses. The proposed model is based on the bee colony optimization (BCO) technique. It is a biologically inspired method that explores collective intelligence applied by honey bees during the nectar collecting process. It has been shown that this developed BCO approach can generate high-quality solutions within negligible processing times.     

Overflow delay in signalized networks

Traffic arrivals tend to be random at signals near to the perimeter of a network (or near to traffic generators in a network). Within the signal network, however, surges in traffic demand are reduced due to limitations on the amount of traffic passing through intersections imposed by signals, resulting in more uniform arrivals from cycle to cycle. Such uniformity is a desirable property at signals as underutilization of green periods may be reduced and levels of service improved. This may have serious implications within networks where it may be possible to improve the capacity of critical intersections by the strategic placing and timing of signals at less critical locations. The analysis of such options is, however, restricted by most, if not all, of the currently available evaluation methods. Relatively simple modifications of delay formulae are proposed to overcome these restrictions.     

Real time queue length estimation for signalized intersections using travel times from mobile sensors

We study how to estimate real time queue lengths at signalized intersections using intersection travel times collected from mobile traffic sensors. The estimation is based on the observation that critical pattern changes of intersection travel times or delays, such as the discontinuities (i.e., sudden and dramatic increases in travel times) and non-smoothness (i.e., changes of slopes of travel times), indicate signal timing or queue length changes. By detecting these critical points in intersection travel times or delays, the real time queue length can be re-constructed. We first introduce the concept of Queue Rear No-delay Arrival Time which is related to the non-smoothness of queuing delay patterns and queue length changes. We then show how measured intersection travel times from mobile sensors can be processed to generate sample vehicle queuing delays. Under the uniform arrival assumption, the queuing delays reduce linearly within a cycle. The delay pattern can be estimated by a linear fitting method using sample queuing delays. Queue Rear No-delay Arrival Time can then be obtained from the delay pattern, and be used to estimate the maximum and minimum queue lengths of a cycle, based on which the real-time queue length curve can also be constructed. The model and algorithm are tested in a field experiment and in simulation.     

Special provisions for left turns at signalized intersections to increase capacity and safety

Heavy left-turns at intersections are not only difficult to accommodate but also often cause traffic accidents. Such problem can be reduced by adopting an exclusive left-turn signal phase, but in this case the cycle length needs to be extended and the overall intersection capacity reduced. This problem is particularly important in such countries as Korea where unprotected left turns are rarely used. Innovative intersection designs and operational methods for avoiding these problems are presented and their effects of increasing capacity and reducing vehicle delay are analyzed. They rule out the requirement for exclusive left-turn phase while accommodating a large volume of left-turns quite safely.     

Analytical model of traffic delays under bus signal preemption: Theory and application

Major emphasis has been placed in recent years on the improvement of the operations of existing transportation facilities, using Transportation Systems Management strategies. Accordingly, preferential treatment of high occupancy vehicles is playing an increasing role in transportation projects. This paper deals with one of these strategies, the priority treatment of buses at signalized intersections. Such treatment is aimed at improving the capacity of intersections. The paper develops an analytical model of delays at signalized intersections under a bus preemption scheme. The analysis is presented for the simplest case, i.e., two intersecting one-way streets. The results suggests that the benefits of bus preemption can be increased by properly adjusting several design parameters such as cycle and phase duration of the preempted phases as well as the non-preempted parameters. The model outlined in this paper is applicable to any situation in which stochastic variation is introduced into the signal cycle as well as to bus preemption. Consequently, other potential applications of the model include the design/analysis of traffic actuated signals, and pedestrian actuated signals.     

Real-time estimation of turning movement counts at signalized intersections using signal phase information

A variety of sensor technologies, such as loop detectors, traffic cameras, and radar have been developed for real-time traffic monitoring at intersections most of which are limited to providing link traffic information with few being capable of detecting turning movements. Accurate real-time information on turning movement counts at signalized intersections is a critical requirement for applications such as adaptive traffic signal control. Several attempts have been made in the past to develop algorithms for inferring turning movements at intersections from entry and exit counts; however, the estimation quality of these algorithms varies considerably. This paper introduces a method to improve accuracy and robustness of turning movement estimation at signalized intersections. The new algorithm makes use of signal phase status to minimize the underlying estimation ambiguity. A case study was conducted based on turning movement data obtained from a four-leg signalized intersection to evaluate the performance of the proposed method and compare it with two other existing well-known estimation methods. The results show that the algorithm is accurate, robust and fairly straightforward for real world implementation.     

Development of a signal-head-free intersection control logic in a fully connected and autonomous vehicle environment

Establishment of effective cooperation between vehicles and transportation infrastructure improves travel reliability in urban transportation networks. Lack of collaboration, however, exacerbates congestion due mainly to frequent stops at signalized intersections. It is beneficial to develop a control logic that collects basic safety message from approaching connected and autonomous vehicles and guarantees efficient intersection operations with safe and incident free vehicle maneuvers. In this paper, a signal-head-free intersection control logic is formulated into a dynamic programming model that aims to maximize the intersection throughput. A stochastic look-ahead technique is proposed based on Monte Carlo tree search algorithm to determine the near-optimal actions (i.e., acceleration rates) over time to prevent movement conflicts. Our numerical results confirm that the proposed technique can solve the problem efficiently and addresses the consequences of existing traffic signals. The proposed approach, while completely avoids incidents at intersections, significantly reduces travel time (ranging between 59.4% and 83.7% when compared to fixed-time and fully-actuated control strategies) at intersections under various demand patterns.     

Modeling traffic operation at signalized intersections without explicit left‐turn yielding rules with an enhanced cell transmission model

This paper presents an enhanced cell transmission model (CTM) to capture traffic operation at signalized intersections without explicit permissive left‐turn yielding rules (i.e. aggressive permissive left‐turn maneuvers may not necessarily yield to opposing through traffic), which can be widely observed in many developing countries. Different from previous studies that focus on traffic dynamics on approaching links, this study contributes to modeling traffic operations within the intersection. A novel cell transmission framework with various types of virtual cells is proposed to model the dynamics of traffic movements from approach to exit. The unique phenomenon of competitive occupying of the conflict point between the left turn and opposing through movements is modeled. The cell state indicating its blockage is proposed to capture the dynamic queue formulation and dissipation and to evaluate the operational traffic performance at the intersection. Field validation results show that the proposed model can capture the operation of traffic at signalized intersections without explicit permissive left‐turn yielding rules with significantly higher level of accuracy than traditional traffic flow models. Copyright © 2016 John Wiley & Sons, Ltd.     

Solving the gate assignment problem through the Fuzzy Bee Colony Optimization

In the field of Swarm Intelligence, the Bee Colony Optimization (BCO) has proven to be capable of solving high-level combinatorial problems, like the Flight-Gate Assignment Problem (FGAP), with fast convergence performances. However, given that the FGAP can be often affected by uncertainty or approximation in data, in this paper we develop a new metaheuristic algorithm, based on the Fuzzy Bee Colony Optimization (FBCO), which integrates the concepts of BCO with a Fuzzy Inference System. The proposed method assigns, through the multicriteria analysis, airport gates to scheduled flights based on both passengers’ total walking distance and use of remote gates, to find an optimal flight-to-gate assignment for a given schedule. Comparison of the results with the schedules of real airports has allowed us to show the characteristics of the proposed concepts and, at the same time, it stressed the effectiveness of the proposed method.