# Integration of Model-Based Signal Control and Queue Spillover Control for Urban Oversaturated Signalized Intersection

Authors: Haitao Xu; Jing Chen; Jie Xu
Journal: Mathematical Problems in Engineering
 (2019)

---

## Abstract

An improved model-based predictive control approach integrating model-based signal control and queue spillover control is proposed in this paper, which includes three modules: model-based signal control, queue spillover identification, and spillover control to deal with the problem of traffic congestion for urban oversaturated signalized intersection. The main steps are as follows. First of all, according to the real-time traffic flow data, the green time splits for all intersections will be solved online by the model-based signal control controller whose optimization model is based on model-predictive control (MPC) strategy. Second, the queue spillover identification module will be used to detect the potential queue spillover. If potential queue spillover is detected, the spillover control module will be activated to prevent vehicles from the upstream link of the link with possible spillover from entering the downstream link to avoid traffic congestion. The experiment is performed on a simulated road network. The results verify that the proposed scheme can significantly decrease the delay which reflects the overall performance of the studied intersection.


---

## Body

## 1. Introduction

With the rapid development of society and economy, the number of vehicles has grown larger and larger. Urban Signalized intersections are under oversaturated traffic conditions during peak hours more and more frequently. Under this circumstance, the urban traffic congestion becomes more and more serious, resulting in excessive delays and increased travel times. The traffic congestion resulting from oversaturated traffic conditions will bring about significant economic losses and social costs. Therefore, it is necessary to develop an effective control method for the control of urban oversaturated signalized intersection to avoid traffic congestion.Different solutions including traffic signal control [1, 2], route guidance [3, 4], continuous network design (CNDP) [5], and different combinations of these strategies [6, 7] have been developed to deal with the problem of traffic congestion. Among the above methods, traffic signal control is of great importance to control and manage traffic effectively [8]. Many scholars have done a lot of research work on traffic signal control methods for a long time. As we all know, SCOOT and SCATS are two famous traffic-responsive urban control systems which have been extensively applied in many cities. Liu [9] proposed a method to optimize green phase time, offset, cycle length, and left-turn phase sequence simultaneously. Samra et al. [10] proposed a dynamic programming method to obtain the optimal green time splits. Castro et al. [11] proposed an adaptive biologically-inspired neural network method to control urban traffic. However, they function ineffectively under oversaturated condition [12].To solve the problem of traffic signal control for oversaturated intersections, extensive efforts have been made. To the best of our knowledge, traffic demand which represents the traffic arrivals on intersection approaches is too high to be managed effectively when the intersection is oversaturated, which may induce queue spillover [13]. Therefore, the first and the most important thing is to avoid queue spillover when the intersections are under oversaturated conditions. Traffic signal control methods under such conditions mainly fall into two categories: offline control methods and online control methods. For offline control method which is termed as pretimed control method, the semigraphical method is proposed to optimize the control of two adjacent oversaturated intersections [14]. Michalopoulos et al. [15] employed a “bang-bang” control model with restrained queue length to deal with the problem of optimal timing during the oversaturated period. However, these strategies obtain optimal timing according to historical data rather than real-time data, which is difficult to adapt to the real-time traffic conditions [16]. Therefore, extensive research on online control strategies has been proposed [17].For online control method which can adjust the timing scheme according to current collected traffic flow, a number of methods have been presented. Lin et al. [18] proposed a quasidynamic robust control method which can balance the proportion of queue length on different roads under oversaturated traffic condition. Ma et al. [19] proposed a bottleneck control method to prevent spillovers under oversaturated traffic conditions, which can adjust the capacity of bottleneck links according to the data of occupancy. Qi et al. [20] developed a virtual signal method to avoid the spillback of channelized section. A simulation-based approach which takes the queue-length information as objective function was proposed by Osorio et al. [21]. Xiang et al. [16] proposed a static state feedback control strategy to relieve the waiting vehicles in lanes. Sun et al. [22] presented a queue-based quasi-optimal feedback control strategy to limit queue length and extended it afterwards [17]. More recently, Ren et al. [23] proposed a method to identify potential spillover conditions and to prevent it periodically. Ren et al. [24] proposed a method based on the connected vehicle environment to identify queue spillover trend and optimized the signal timing. Wu et al. [25] proposed a two-point-three state traffic state perception model to analyze the traffic state and to determine the corresponding green time extension scheme.Although the aforementioned methods can limit the queue length to mitigate oversaturation to some extent, these methods cannot predict future traffic condition. A model-based predictive control method which deals with the optimal problem over a finite horizon according to the current traffic flow can address this problem perfectly. Aboudolas et al. [26] proposed a model predictive control method which embeds a store-and-forward model into a rolling-horizon control scheme to calculate the optimal timing plan. To improve the computational complexity further, an improved model predictive control method based on a simplified model [27] was proposed by enlarging the simulation time interval to one cycle time. The simulation results demonstrated that the proposed method can improve significantly the traffic signal control performance. For these methods, it is important to predict the traffic demand over the finite horizon accurately. However, it is difficult to calculate the traffic demand accurately based on the basic model predictive control approach when the queue over detectors is often encountered under oversaturated traffic conditions. Therefore, we propose a novel method to optimize green time splits under such conditions.The details of the contributions in this paper include two aspects which can be listed as follows. (1) We propose an improved model-based predictive control approach integrating model-based signal control and queue spillover control to obtain an optimal green time allocation scheme and to avoid spillover simultaneously under oversaturated traffic conditions. (2) Considering that the objective of this model is complicated when the model is optimized in several cycles, we propose an improved hybrid artificial bee algorithm to address the optimal control problem of the proposed improved model-based predictive control approach as soon as possible.The rest of the paper is organized as follows. Section2 describes the control framework of the proposed method. Section 3 includes the prediction model, optimization model, and optimization algorithm for model-based signal control controllers. The control method to detect the possible spillover is given in Section 4. The queue dissipation identification and spillover control method is introduced in Section 5. Simulation evaluation results of a case study and the comparative analysis of the proposed control scheme with other methods are provided in Section 6. Recommendations for future research and conclusions are provided in Section 7.


## 2. System Framework

In this paper, we proposed an improved model-based predictive control method which can simultaneously optimize green time splits according to the predicted traffic demand over a finite horizon and manage queue based on different traffic flow conditions. The framework of the proposed method is shown in Figure1.Figure 1
Framework of the proposed method. The proposed method mainly includes three modules: model-based signal control, queue spillover identification, and spillover control.Figure1 shows that the control architecture mainly consists of three parts: model-based signal control, queue spillover identification, and spillover control. The model-based signal control method is designed to deal with the optimal control problem based on the control strategy of the basic model predictive control, which contains a prediction model to predict the future traffic flow over a given horizon. The optimization model of model predictive control with the control objective of minimizing the total travel time can be constructed according to the prediction results. A new IGAABC algorithm is proposed to obtain the optimal solutions of the optimization model. The part of queue spillover identification and spillover control can adaptively regulate the green time of the relevant signal phases encountering possible queue spillover.In order to control the studied intersection, the corresponding traffic data should be collected by some detectors. The information of queue length and the number of vehicles in linklu,d (for all l∈L, where L is the set of roads) collected from the road at the start of each cycle is used as the input of model-based signal control controller. The information of real-time vehicle speed and vehicle counts can be used to identify queue spillover and dissipation. Assume that the cycle time for all intersections is equal to the sampling time interval. The process of the proposed integrated control scheme will be formulated in detail in the following.At the beginning of each signal cycle, the model-based signal control method will firstly be applied to obtain an optimal control sequence (green time splits for each phase at all intersections) with the objective of minimizing the total travel time according to the current traffic flow information including the number of vehicles and queue length for each link. Then the queue spillover identification method will be activated to identify the possible queue spillover according to the real-time traffic flow information (the speed and the vehicle count) which is obtained by the detector periodically and the current traffic signal status. The spillover control method will be used to prevent the potential queue spillover if potential queue spillover is identified. When there is no potential queue spillover on the downstream link, the system will further determine whether the current control cycle should be terminated. If yes, the next cycle will be executed; otherwise, the queue spillover identification method will continue to detect the possible spillover.


## 3. Model-Based Signal Control

Suppose that the signal phase and phase sequence is fixed at each intersection. At every control moment, the model-based signal control method will provide the optimal green time splits at each intersection on the basis of the information of current traffic flow. Accordingly, we should choose an appropriate prediction model to predict traffic flow dynamics and an appropriate optimization model to reflect the optimization objective of traffic control. Finally, a novel optimization algorithm is developed for obtaining solutions of the optimization model. We will first introduce the prediction model and optimization model, respectively [28], and then explain the optimization algorithm.


### 3.1. Prediction Model

#### 3.1.1. Traffic Data Collection

The model-based signal control method will be executed to obtain the optimal green time splits periodically according to the current number of vehicles and queue length for each link. Therefore, it is necessary to configure the corresponding detectors to detect traffic flow data to provide the input for the model-based signal control controller. The detectors can be deployed after the stop bars for all intersections to detect the queue length and the number of vehicles in all links at the start of every traffic signal cycle periodically. As shown in Figure2, the black rectangle at intersection 1 denotes the corresponding lane which should be deployed with a queue counter detector. The configurations of other intersections are similar.Figure 2
Detector configuration at intersection 1. Four queue detectors are deployed over the stop bar at the intersection where arrows represent the corresponding turning movement.


#### 3.1.2. Prediction Model Description

The S model as a simplified macroscopic traffic model initially proposed by Lin [29], which is then applied to model a complicated traffic network by Zhou et al. [28], can be used to model the evolution of urban traffic in both unsaturated and oversaturated traffic situations. It is an appropriate model which can take account of both computation time and accuracy. What is more, we expand the prediction time interval of this model to one cycle which is of great importance to reduce the computation time and guarantee a better performance simultaneously.As shown in Figure3, assume that a road network including two intersections is composed of roads and intersections. We define the set of all intersections and links by I and L, respectively. Link u,d belonging to the set of L denotes the link which is between the intersection u and the corresponding intersection d. The collection of upstream intersections of link u,d can be denoted by Iu,d, while the collection of downstream intersections of link u,d can be denoted by Ou,d.Figure 3
A road network including two intersections. The evolution process of traffic flow at two adjacent intersection is demonstrated.Suppose thatccycle represents the control cycle of signal controller. The sampling time T of queue counter detectors is equal to ccycle. According to the value of nu,dk collected by link evaluation on link at time step k, the number of vehicles at time step k+1 can be predicted as follows:(1)nu,dk+1=nu,dk+αu,denterk-αu,dleavek·ccyclewhere αu,denterk which represents the flow rate at time step k when the vehicles enter link u,d from different upstream intersection can be calculated as below:(2)αu,denterk=∑i∈Iu,dαi,u,dleavekin which αu,dleavek is the flow rate at time step k when the vehicles leave link u,d to different downstream links, that is,(3)αu,dleavek=∑o∈Ou,dαu,d,oleavekα u , d , o l e a v e k which represents the leaving flow rate of vehicles waiting on link u,d to the intersection o at time step k is equal to the minimum value of three terms which can be calculated as below:(4)αu,d,oleavek=min⁡βu,d,o·μu,d·gu,d,okccycle,qu,d,okccycle+αu,d,oarrivek,βu,d,oCd,o-nd,okccyclewhere the first term is the free flow rate where vehicles can pass an intersection with a saturation flow rate μu,d. The second is the rate releasing the vehicles in the queue. The last one is the releasing rate when there is not enough room to accommodate vehicles in link d,o. βu,d,o represents the proportion of the vehicles entering the intersection o. The green time splits which we intend to optimize can be defined as gu,d,ok. We denote the number of vehicles that link d,o can accommodate by Cd,o.The queue length of different lanes at time stepk+1 can be predicted as below, where αu,d,oarrivek is the arriving rate from the entrance of link u,d to the lane on which vehicles can turn to intersection o.(5)qu,d,ok+1=qu,d,ok+αu,d,oarrivek-αu,d,oleavek·ccycleThe total queue length can be calculated as below:(6)qu,dk=∑o∈Ou,dqu,d,okAccording to the correspondingβu,d,o, we can calculate the arriving rate when vehicles join different queues of link u,d as below:(7)αu,d,oarrivek=βu,d,o·αu,darrivekwhere αu,darrivek is determined by the formula (8)(8)αu,darrivek=1-ξu,dk·αu,denterk-ηu,dk+ξu,dk·αu,denterk-ηu,dk-1where ηu,dk is an integral part of σu,dk divided by ccycle, while ξu,dk is the remainder of it, as shown in the following two formulas:(9)ηu,dk=σu,dkccycle(10)ξu,dk=remσu,dk,ccyclewhere σu,dk is the time the traffic flow takes to join the queue from the entrance of link u,d which can be calculated according to formula (11). lveh represents the average vehicle length. Nu,dlane represents the number of lanes of link u,d. Vehicles would move with a normal speed vu,dfree under unobstructed traffic conditions.(11)τu,dk=Cu,d-qu,dk·lvehNu,dlane·vu,dfree·ccycle


### 3.2. Optimization Model

To obtain optimal green time splits according to varied traffic flow, it is essential to select an appropriate optimization model which can balance the computation time and accuracy. The model described in [28] is used as the optimization model which can be embedded in a rolling-horizon framework. The appeal of this model is that it can provide signal timing scheme according to the predicted traffic flow data, which is good for avoiding myopic control. The optimization model is described as follows:(12)mingk∑u,d∈L∑p=1Npnu,dk+p·ccycle(13)s.t.nu,dk+p+1=fnu,dk+p,gdk+pforp=0,…,Np-1(14)∑h∈Hdgd,hk+p=ccycleforp=0,…,Np-1(15)gmin≤gk≤gmaxWe regard formula (12) which represents the total time spent as the optimization objective to obtain preferable green time splits gk, where Np is the prediction horizon which reflects the number of time steps of the prediction model.According to the queue length and the number of vehicles in all links at time stepk, formula (13) is regarded as the prediction model that can predict the future traffic flow for each road in the simulation network, which is presented in Section 3.1 in detail.Formula (14) ensures that the sum of green timing splits at each intersection is equal to ccycle, in which Hd represents all the traffic signal phases of the corresponding intersection. gd,hk represents the green time of the corresponding phase at intersection d. All intersections belonging to the set of I should subject to this constraint.Formula (15) limits green time range within gmin,gmax, where upper and lower bound denote minimum and maximum time, respectively, for each phase at different intersections.To obtain the solutions of the above optimization model online, we will propose an appropriate optimization algorithm. It will be illustrated in the following.


### 3.3. Optimization Algorithm

#### 3.3.1. Artificial Bee Colony (ABC) Algorithm

The ABC algorithm is proposed to solve optimization problems in many different fields, including unconstrained optimization problems [30], constrained problem optimization [31], and cluster analysis [32]. Recently, this algorithm has been successfully applied to the field of transportation [33]. The ABC algorithm with fewer parameters is relatively easy to implement so that a lot of researchers have studied this algorithm to deal with various problems.Suppose that both the size of employed bees and the onlooker bees areSN. This algorithm first generates SN solutions with D-dimensional variables between upper and lower bounds randomly. Secondly, every employed bee will update the solutions. If the fitness value of the new solution is better, then the solutions will be replaced. And then, onlooker bees will select the employed bee to follow according to the selection probability. Finally, if the solutions cannot be further improved in less than trials_limit times, it will be abandoned. Employed bee will be transferred to a scout bee and scout bee phase will be executed.


#### 3.3.2. An Improved Hybrid Artificial Bee Algorithm (IGAABC)

Although the ABC algorithm is simple enough to obtain optimal solutions of complicated problems, it tends to get trapped in local optima. Therefore, a number of scholars studied ABC algorithm and developed various methods to deal with this deficiency which arises from the reduction of diversity of bee population. Zhu et al. [34] propose an improved ABC algorithm to promote the performance of exploitation. Gao et al. [35] improve ABC algorithm by taking advantage of the chaotic maps where the relatively scattered chaotic sequence can traverse the corresponding interval to the population initialization to avoid premature convergence. Ma et al. [36] develop a modified ABC algorithm which adds the disturbance to avoid getting trapped in local optima.In order to obtain better solutions, we propose an IGAABC algorithm to overcome the deficiency of premature convergence and slow convergence rate of the basic ABC algorithm. The preceding few steps of this algorithm are analogous to ABC algorithm except that the fitness function of ABC algorithm is modified. After the operations of the scout bee stage are finished, we will add the steps of crossover, mutation operation to improve the basic algorithm. The flowchart of the improved hybrid artificial bee colony optimization for the optimization of signal timing is shown in Figure4, and the details of IGAABC will be introduced next.Figure 4
The flowchart of the IGAABC. The operators of crossover and mutation are introduced into the basic ABC algorithm to avoid getting trapped in local optima.It is well known that Genetic Algorithm (GA) [37] inspired by the acts of biological evolution is an excellent optimization tool. The processes of GA algorithm are as follows. Firstly, the algorithm will generate an initial population, which consists of a group of initial solution in feasible domain of the specific problem. Second, the fitness of each solution in the population will be calculated. Finally, the operators of selection, crossover, and mutation will be performed. Individuals can be selected according to their fitness in the process of selection operators which is consistent with the law of survival of the fittest. Two individuals will refer to the defined crossover probability pc to determine whether or not to execute crossover. Similarly, the individual will execute mutation operators according to the mutation probability pm. Repeat the process of selection, crossover, and mutation until the termination conditions are met. Considering that the operators of crossover and mutation can increase the diversity of solutions, we introduce these two operators into ABC algorithm to avoid getting trapped in local optima. Due to the green time splits we intend to optimize is decimal, we should choose a method to crossover in decimal. There are two ways to crossover in decimal. One is to convert to binary crossover and then convert the value to decimal. The other is to directly cross in decimal. The method of direct crossover is further divided into single point crossover, fixed, and random multipoint crossover [38]. The method of decimal random multipoint crossover is selected as the crossover methods in our algorithm. The details of this method will be introduced as follows.First, two parents will be selected from the original population. Secondly, the algorithm will generate the numberb within 0,1 randomly. Define the crossover probability as pc. If b<pc, these two individuals will be crossed according to the method of random multi-point crossover. Otherwise, it is determined whether to cross the other two individuals. The process of random multi-point crossover is as follows.(1) Generate a vector y containing D “0 or 1” randomly, where D is equal to the dimension of solutions. Each element of y corresponds to the individual's gene (decimal number).(2) The position whose value is equal to one in y of these two individuals will be crossed as below:(16)Si′=roundrSi+1-rSjSj′=roundrSj+1-rSiwhere r is a number generated randomly within the interval [0,1]. Si,Sj are two individuals performing the crossover. Si′,Sj′ are new individuals produced by the crossover.(3) After these two individuals finish crossing, we transfer to the crossover of the other two individuals.The mutation operator of our algorithm is similar to GA’s. The flowchart of the IGAABC algorithm is shown in Figure4.The selection of the fitness function directly affects the convergence speed and determines whether the optimal solution can be found because the performance of the solution is evaluated on the basis of the fitness function. Therefore, it is important to design an appropriate fitness function to determine whether a solution is good or bad so that an optimal solution can be obtained within a limited number of iterations. So we modified the fitness function of the artificial bee algorithm as follows:(17)fitnessi=11+fi2fi≥0fi2fi<0where fi represents the optimal target which reflects the total travel time in this paper. The fitness function fitnessi can be calculated based on the above formula (17). If fi≥0, the result is equal to the inverse of 1+fi2. This modification can increase the rate of change of solution which will be beneficial to speed up the convergence rate.


## 3.1. Prediction Model

### 3.1.1. Traffic Data Collection

The model-based signal control method will be executed to obtain the optimal green time splits periodically according to the current number of vehicles and queue length for each link. Therefore, it is necessary to configure the corresponding detectors to detect traffic flow data to provide the input for the model-based signal control controller. The detectors can be deployed after the stop bars for all intersections to detect the queue length and the number of vehicles in all links at the start of every traffic signal cycle periodically. As shown in Figure2, the black rectangle at intersection 1 denotes the corresponding lane which should be deployed with a queue counter detector. The configurations of other intersections are similar.Figure 2
Detector configuration at intersection 1. Four queue detectors are deployed over the stop bar at the intersection where arrows represent the corresponding turning movement.


### 3.1.2. Prediction Model Description

The S model as a simplified macroscopic traffic model initially proposed by Lin [29], which is then applied to model a complicated traffic network by Zhou et al. [28], can be used to model the evolution of urban traffic in both unsaturated and oversaturated traffic situations. It is an appropriate model which can take account of both computation time and accuracy. What is more, we expand the prediction time interval of this model to one cycle which is of great importance to reduce the computation time and guarantee a better performance simultaneously.As shown in Figure3, assume that a road network including two intersections is composed of roads and intersections. We define the set of all intersections and links by I and L, respectively. Link u,d belonging to the set of L denotes the link which is between the intersection u and the corresponding intersection d. The collection of upstream intersections of link u,d can be denoted by Iu,d, while the collection of downstream intersections of link u,d can be denoted by Ou,d.Figure 3
A road network including two intersections. The evolution process of traffic flow at two adjacent intersection is demonstrated.Suppose thatccycle represents the control cycle of signal controller. The sampling time T of queue counter detectors is equal to ccycle. According to the value of nu,dk collected by link evaluation on link at time step k, the number of vehicles at time step k+1 can be predicted as follows:(1)nu,dk+1=nu,dk+αu,denterk-αu,dleavek·ccyclewhere αu,denterk which represents the flow rate at time step k when the vehicles enter link u,d from different upstream intersection can be calculated as below:(2)αu,denterk=∑i∈Iu,dαi,u,dleavekin which αu,dleavek is the flow rate at time step k when the vehicles leave link u,d to different downstream links, that is,(3)αu,dleavek=∑o∈Ou,dαu,d,oleavekα u , d , o l e a v e k which represents the leaving flow rate of vehicles waiting on link u,d to the intersection o at time step k is equal to the minimum value of three terms which can be calculated as below:(4)αu,d,oleavek=min⁡βu,d,o·μu,d·gu,d,okccycle,qu,d,okccycle+αu,d,oarrivek,βu,d,oCd,o-nd,okccyclewhere the first term is the free flow rate where vehicles can pass an intersection with a saturation flow rate μu,d. The second is the rate releasing the vehicles in the queue. The last one is the releasing rate when there is not enough room to accommodate vehicles in link d,o. βu,d,o represents the proportion of the vehicles entering the intersection o. The green time splits which we intend to optimize can be defined as gu,d,ok. We denote the number of vehicles that link d,o can accommodate by Cd,o.The queue length of different lanes at time stepk+1 can be predicted as below, where αu,d,oarrivek is the arriving rate from the entrance of link u,d to the lane on which vehicles can turn to intersection o.(5)qu,d,ok+1=qu,d,ok+αu,d,oarrivek-αu,d,oleavek·ccycleThe total queue length can be calculated as below:(6)qu,dk=∑o∈Ou,dqu,d,okAccording to the correspondingβu,d,o, we can calculate the arriving rate when vehicles join different queues of link u,d as below:(7)αu,d,oarrivek=βu,d,o·αu,darrivekwhere αu,darrivek is determined by the formula (8)(8)αu,darrivek=1-ξu,dk·αu,denterk-ηu,dk+ξu,dk·αu,denterk-ηu,dk-1where ηu,dk is an integral part of σu,dk divided by ccycle, while ξu,dk is the remainder of it, as shown in the following two formulas:(9)ηu,dk=σu,dkccycle(10)ξu,dk=remσu,dk,ccyclewhere σu,dk is the time the traffic flow takes to join the queue from the entrance of link u,d which can be calculated according to formula (11). lveh represents the average vehicle length. Nu,dlane represents the number of lanes of link u,d. Vehicles would move with a normal speed vu,dfree under unobstructed traffic conditions.(11)τu,dk=Cu,d-qu,dk·lvehNu,dlane·vu,dfree·ccycle


## 3.1.1. Traffic Data Collection

The model-based signal control method will be executed to obtain the optimal green time splits periodically according to the current number of vehicles and queue length for each link. Therefore, it is necessary to configure the corresponding detectors to detect traffic flow data to provide the input for the model-based signal control controller. The detectors can be deployed after the stop bars for all intersections to detect the queue length and the number of vehicles in all links at the start of every traffic signal cycle periodically. As shown in Figure2, the black rectangle at intersection 1 denotes the corresponding lane which should be deployed with a queue counter detector. The configurations of other intersections are similar.Figure 2
Detector configuration at intersection 1. Four queue detectors are deployed over the stop bar at the intersection where arrows represent the corresponding turning movement.


## 3.1.2. Prediction Model Description

The S model as a simplified macroscopic traffic model initially proposed by Lin [29], which is then applied to model a complicated traffic network by Zhou et al. [28], can be used to model the evolution of urban traffic in both unsaturated and oversaturated traffic situations. It is an appropriate model which can take account of both computation time and accuracy. What is more, we expand the prediction time interval of this model to one cycle which is of great importance to reduce the computation time and guarantee a better performance simultaneously.As shown in Figure3, assume that a road network including two intersections is composed of roads and intersections. We define the set of all intersections and links by I and L, respectively. Link u,d belonging to the set of L denotes the link which is between the intersection u and the corresponding intersection d. The collection of upstream intersections of link u,d can be denoted by Iu,d, while the collection of downstream intersections of link u,d can be denoted by Ou,d.Figure 3
A road network including two intersections. The evolution process of traffic flow at two adjacent intersection is demonstrated.Suppose thatccycle represents the control cycle of signal controller. The sampling time T of queue counter detectors is equal to ccycle. According to the value of nu,dk collected by link evaluation on link at time step k, the number of vehicles at time step k+1 can be predicted as follows:(1)nu,dk+1=nu,dk+αu,denterk-αu,dleavek·ccyclewhere αu,denterk which represents the flow rate at time step k when the vehicles enter link u,d from different upstream intersection can be calculated as below:(2)αu,denterk=∑i∈Iu,dαi,u,dleavekin which αu,dleavek is the flow rate at time step k when the vehicles leave link u,d to different downstream links, that is,(3)αu,dleavek=∑o∈Ou,dαu,d,oleavekα u , d , o l e a v e k which represents the leaving flow rate of vehicles waiting on link u,d to the intersection o at time step k is equal to the minimum value of three terms which can be calculated as below:(4)αu,d,oleavek=min⁡βu,d,o·μu,d·gu,d,okccycle,qu,d,okccycle+αu,d,oarrivek,βu,d,oCd,o-nd,okccyclewhere the first term is the free flow rate where vehicles can pass an intersection with a saturation flow rate μu,d. The second is the rate releasing the vehicles in the queue. The last one is the releasing rate when there is not enough room to accommodate vehicles in link d,o. βu,d,o represents the proportion of the vehicles entering the intersection o. The green time splits which we intend to optimize can be defined as gu,d,ok. We denote the number of vehicles that link d,o can accommodate by Cd,o.The queue length of different lanes at time stepk+1 can be predicted as below, where αu,d,oarrivek is the arriving rate from the entrance of link u,d to the lane on which vehicles can turn to intersection o.(5)qu,d,ok+1=qu,d,ok+αu,d,oarrivek-αu,d,oleavek·ccycleThe total queue length can be calculated as below:(6)qu,dk=∑o∈Ou,dqu,d,okAccording to the correspondingβu,d,o, we can calculate the arriving rate when vehicles join different queues of link u,d as below:(7)αu,d,oarrivek=βu,d,o·αu,darrivekwhere αu,darrivek is determined by the formula (8)(8)αu,darrivek=1-ξu,dk·αu,denterk-ηu,dk+ξu,dk·αu,denterk-ηu,dk-1where ηu,dk is an integral part of σu,dk divided by ccycle, while ξu,dk is the remainder of it, as shown in the following two formulas:(9)ηu,dk=σu,dkccycle(10)ξu,dk=remσu,dk,ccyclewhere σu,dk is the time the traffic flow takes to join the queue from the entrance of link u,d which can be calculated according to formula (11). lveh represents the average vehicle length. Nu,dlane represents the number of lanes of link u,d. Vehicles would move with a normal speed vu,dfree under unobstructed traffic conditions.(11)τu,dk=Cu,d-qu,dk·lvehNu,dlane·vu,dfree·ccycle


## 3.2. Optimization Model

To obtain optimal green time splits according to varied traffic flow, it is essential to select an appropriate optimization model which can balance the computation time and accuracy. The model described in [28] is used as the optimization model which can be embedded in a rolling-horizon framework. The appeal of this model is that it can provide signal timing scheme according to the predicted traffic flow data, which is good for avoiding myopic control. The optimization model is described as follows:(12)mingk∑u,d∈L∑p=1Npnu,dk+p·ccycle(13)s.t.nu,dk+p+1=fnu,dk+p,gdk+pforp=0,…,Np-1(14)∑h∈Hdgd,hk+p=ccycleforp=0,…,Np-1(15)gmin≤gk≤gmaxWe regard formula (12) which represents the total time spent as the optimization objective to obtain preferable green time splits gk, where Np is the prediction horizon which reflects the number of time steps of the prediction model.According to the queue length and the number of vehicles in all links at time stepk, formula (13) is regarded as the prediction model that can predict the future traffic flow for each road in the simulation network, which is presented in Section 3.1 in detail.Formula (14) ensures that the sum of green timing splits at each intersection is equal to ccycle, in which Hd represents all the traffic signal phases of the corresponding intersection. gd,hk represents the green time of the corresponding phase at intersection d. All intersections belonging to the set of I should subject to this constraint.Formula (15) limits green time range within gmin,gmax, where upper and lower bound denote minimum and maximum time, respectively, for each phase at different intersections.To obtain the solutions of the above optimization model online, we will propose an appropriate optimization algorithm. It will be illustrated in the following.


## 3.3. Optimization Algorithm

### 3.3.1. Artificial Bee Colony (ABC) Algorithm

The ABC algorithm is proposed to solve optimization problems in many different fields, including unconstrained optimization problems [30], constrained problem optimization [31], and cluster analysis [32]. Recently, this algorithm has been successfully applied to the field of transportation [33]. The ABC algorithm with fewer parameters is relatively easy to implement so that a lot of researchers have studied this algorithm to deal with various problems.Suppose that both the size of employed bees and the onlooker bees areSN. This algorithm first generates SN solutions with D-dimensional variables between upper and lower bounds randomly. Secondly, every employed bee will update the solutions. If the fitness value of the new solution is better, then the solutions will be replaced. And then, onlooker bees will select the employed bee to follow according to the selection probability. Finally, if the solutions cannot be further improved in less than trials_limit times, it will be abandoned. Employed bee will be transferred to a scout bee and scout bee phase will be executed.


### 3.3.2. An Improved Hybrid Artificial Bee Algorithm (IGAABC)

Although the ABC algorithm is simple enough to obtain optimal solutions of complicated problems, it tends to get trapped in local optima. Therefore, a number of scholars studied ABC algorithm and developed various methods to deal with this deficiency which arises from the reduction of diversity of bee population. Zhu et al. [34] propose an improved ABC algorithm to promote the performance of exploitation. Gao et al. [35] improve ABC algorithm by taking advantage of the chaotic maps where the relatively scattered chaotic sequence can traverse the corresponding interval to the population initialization to avoid premature convergence. Ma et al. [36] develop a modified ABC algorithm which adds the disturbance to avoid getting trapped in local optima.In order to obtain better solutions, we propose an IGAABC algorithm to overcome the deficiency of premature convergence and slow convergence rate of the basic ABC algorithm. The preceding few steps of this algorithm are analogous to ABC algorithm except that the fitness function of ABC algorithm is modified. After the operations of the scout bee stage are finished, we will add the steps of crossover, mutation operation to improve the basic algorithm. The flowchart of the improved hybrid artificial bee colony optimization for the optimization of signal timing is shown in Figure4, and the details of IGAABC will be introduced next.Figure 4
The flowchart of the IGAABC. The operators of crossover and mutation are introduced into the basic ABC algorithm to avoid getting trapped in local optima.It is well known that Genetic Algorithm (GA) [37] inspired by the acts of biological evolution is an excellent optimization tool. The processes of GA algorithm are as follows. Firstly, the algorithm will generate an initial population, which consists of a group of initial solution in feasible domain of the specific problem. Second, the fitness of each solution in the population will be calculated. Finally, the operators of selection, crossover, and mutation will be performed. Individuals can be selected according to their fitness in the process of selection operators which is consistent with the law of survival of the fittest. Two individuals will refer to the defined crossover probability pc to determine whether or not to execute crossover. Similarly, the individual will execute mutation operators according to the mutation probability pm. Repeat the process of selection, crossover, and mutation until the termination conditions are met. Considering that the operators of crossover and mutation can increase the diversity of solutions, we introduce these two operators into ABC algorithm to avoid getting trapped in local optima. Due to the green time splits we intend to optimize is decimal, we should choose a method to crossover in decimal. There are two ways to crossover in decimal. One is to convert to binary crossover and then convert the value to decimal. The other is to directly cross in decimal. The method of direct crossover is further divided into single point crossover, fixed, and random multipoint crossover [38]. The method of decimal random multipoint crossover is selected as the crossover methods in our algorithm. The details of this method will be introduced as follows.First, two parents will be selected from the original population. Secondly, the algorithm will generate the numberb within 0,1 randomly. Define the crossover probability as pc. If b<pc, these two individuals will be crossed according to the method of random multi-point crossover. Otherwise, it is determined whether to cross the other two individuals. The process of random multi-point crossover is as follows.(1) Generate a vector y containing D “0 or 1” randomly, where D is equal to the dimension of solutions. Each element of y corresponds to the individual's gene (decimal number).(2) The position whose value is equal to one in y of these two individuals will be crossed as below:(16)Si′=roundrSi+1-rSjSj′=roundrSj+1-rSiwhere r is a number generated randomly within the interval [0,1]. Si,Sj are two individuals performing the crossover. Si′,Sj′ are new individuals produced by the crossover.(3) After these two individuals finish crossing, we transfer to the crossover of the other two individuals.The mutation operator of our algorithm is similar to GA’s. The flowchart of the IGAABC algorithm is shown in Figure4.The selection of the fitness function directly affects the convergence speed and determines whether the optimal solution can be found because the performance of the solution is evaluated on the basis of the fitness function. Therefore, it is important to design an appropriate fitness function to determine whether a solution is good or bad so that an optimal solution can be obtained within a limited number of iterations. So we modified the fitness function of the artificial bee algorithm as follows:(17)fitnessi=11+fi2fi≥0fi2fi<0where fi represents the optimal target which reflects the total travel time in this paper. The fitness function fitnessi can be calculated based on the above formula (17). If fi≥0, the result is equal to the inverse of 1+fi2. This modification can increase the rate of change of solution which will be beneficial to speed up the convergence rate.


## 3.3.1. Artificial Bee Colony (ABC) Algorithm

The ABC algorithm is proposed to solve optimization problems in many different fields, including unconstrained optimization problems [30], constrained problem optimization [31], and cluster analysis [32]. Recently, this algorithm has been successfully applied to the field of transportation [33]. The ABC algorithm with fewer parameters is relatively easy to implement so that a lot of researchers have studied this algorithm to deal with various problems.Suppose that both the size of employed bees and the onlooker bees areSN. This algorithm first generates SN solutions with D-dimensional variables between upper and lower bounds randomly. Secondly, every employed bee will update the solutions. If the fitness value of the new solution is better, then the solutions will be replaced. And then, onlooker bees will select the employed bee to follow according to the selection probability. Finally, if the solutions cannot be further improved in less than trials_limit times, it will be abandoned. Employed bee will be transferred to a scout bee and scout bee phase will be executed.


## 3.3.2. An Improved Hybrid Artificial Bee Algorithm (IGAABC)

Although the ABC algorithm is simple enough to obtain optimal solutions of complicated problems, it tends to get trapped in local optima. Therefore, a number of scholars studied ABC algorithm and developed various methods to deal with this deficiency which arises from the reduction of diversity of bee population. Zhu et al. [34] propose an improved ABC algorithm to promote the performance of exploitation. Gao et al. [35] improve ABC algorithm by taking advantage of the chaotic maps where the relatively scattered chaotic sequence can traverse the corresponding interval to the population initialization to avoid premature convergence. Ma et al. [36] develop a modified ABC algorithm which adds the disturbance to avoid getting trapped in local optima.In order to obtain better solutions, we propose an IGAABC algorithm to overcome the deficiency of premature convergence and slow convergence rate of the basic ABC algorithm. The preceding few steps of this algorithm are analogous to ABC algorithm except that the fitness function of ABC algorithm is modified. After the operations of the scout bee stage are finished, we will add the steps of crossover, mutation operation to improve the basic algorithm. The flowchart of the improved hybrid artificial bee colony optimization for the optimization of signal timing is shown in Figure4, and the details of IGAABC will be introduced next.Figure 4
The flowchart of the IGAABC. The operators of crossover and mutation are introduced into the basic ABC algorithm to avoid getting trapped in local optima.It is well known that Genetic Algorithm (GA) [37] inspired by the acts of biological evolution is an excellent optimization tool. The processes of GA algorithm are as follows. Firstly, the algorithm will generate an initial population, which consists of a group of initial solution in feasible domain of the specific problem. Second, the fitness of each solution in the population will be calculated. Finally, the operators of selection, crossover, and mutation will be performed. Individuals can be selected according to their fitness in the process of selection operators which is consistent with the law of survival of the fittest. Two individuals will refer to the defined crossover probability pc to determine whether or not to execute crossover. Similarly, the individual will execute mutation operators according to the mutation probability pm. Repeat the process of selection, crossover, and mutation until the termination conditions are met. Considering that the operators of crossover and mutation can increase the diversity of solutions, we introduce these two operators into ABC algorithm to avoid getting trapped in local optima. Due to the green time splits we intend to optimize is decimal, we should choose a method to crossover in decimal. There are two ways to crossover in decimal. One is to convert to binary crossover and then convert the value to decimal. The other is to directly cross in decimal. The method of direct crossover is further divided into single point crossover, fixed, and random multipoint crossover [38]. The method of decimal random multipoint crossover is selected as the crossover methods in our algorithm. The details of this method will be introduced as follows.First, two parents will be selected from the original population. Secondly, the algorithm will generate the numberb within 0,1 randomly. Define the crossover probability as pc. If b<pc, these two individuals will be crossed according to the method of random multi-point crossover. Otherwise, it is determined whether to cross the other two individuals. The process of random multi-point crossover is as follows.(1) Generate a vector y containing D “0 or 1” randomly, where D is equal to the dimension of solutions. Each element of y corresponds to the individual's gene (decimal number).(2) The position whose value is equal to one in y of these two individuals will be crossed as below:(16)Si′=roundrSi+1-rSjSj′=roundrSj+1-rSiwhere r is a number generated randomly within the interval [0,1]. Si,Sj are two individuals performing the crossover. Si′,Sj′ are new individuals produced by the crossover.(3) After these two individuals finish crossing, we transfer to the crossover of the other two individuals.The mutation operator of our algorithm is similar to GA’s. The flowchart of the IGAABC algorithm is shown in Figure4.The selection of the fitness function directly affects the convergence speed and determines whether the optimal solution can be found because the performance of the solution is evaluated on the basis of the fitness function. Therefore, it is important to design an appropriate fitness function to determine whether a solution is good or bad so that an optimal solution can be obtained within a limited number of iterations. So we modified the fitness function of the artificial bee algorithm as follows:(17)fitnessi=11+fi2fi≥0fi2fi<0where fi represents the optimal target which reflects the total travel time in this paper. The fitness function fitnessi can be calculated based on the above formula (17). If fi≥0, the result is equal to the inverse of 1+fi2. This modification can increase the rate of change of solution which will be beneficial to speed up the convergence rate.


## 4. Queue Spillover Identification

Extensive research on queue length based method, occupancy based method, and velocity based method has been carried out to identify queue spillover accurately and timely. In terms of the method based on queue length, it is important to estimate queue length accurately. The queue length estimation mechanisms are analyzed to estimate the queue length based on different layout strategies [39]. To detect queue spillover according to the velocity of vehicles, Ren et al. [23] developed an adaptive signal control method which can prevent traffic jams effectively at a specific intersection under oversaturated traffic conditions. In this paper, we adopt the method based on the velocity of vehicles to identify queue spillover.To identify the spillover for each direction of an intersection, it is necessary to add some detectors to the corresponding link. As shown in Figure5, in order to identify the queue spillover of Link 2, Link 2 should be deployed with a data collection detector named speed detector to detect real-time vehicle speed and a stop bar detector to detect the vehicle counts. Vehicles will accumulate in Link 2 if the traffic signal for the relevant phase in Link 2 is red. We denote the width of Intersection1 by w. L1 is the distance between the speed detector and the end of queue. L2 is the distance between the entrance of the link and the deployed speed detector. L3 is the distance between the entrance of the link and the end of queue.Figure 5
Queue spillover identification based on speed detector. Speed detector is deployed to detect the speed when vehicles pass over it.According to geometric relationships in Figure5, we can conclude (18)L3=L1+L2The possible queue spillover will be detected by comparing the information collected by the speed detector with the critical speed at which the spillover will happen. We will introduce the process to obtain the critical value in the following.If the vehicle count which Link 2 can accommodate is too little to receive the vehicles from the upstream link, the spillover will occur. Assume thatkj is the density when Link 2 is completely occupied with cars. kw and kL are defined as the vehicle density at different positions. We have(19)L3kj≤w+L2·kw+L1kLAccording to relationshipsL3=L1+L2 and the formula (19), we can obtain the range of L1.(20)0≤L1≤kww+L2-kjL2kj-kLAssume that the vehicles entering from the entrance of link 2 begin to decelerate when passing over the speed detector if the vehicles queue in Link 2. These vehicles must stop within distanceL1-L1kL/kj to avoid rear-end collision. Therefore, the breaking distance which can be denoted as follows must be less than L1-L1kL/kj:(21)fυ,at≤L1-L1kLkjwhere υ and at are the speed and deceleration rate of the vehicle through speed detector respectively. However, at is difficult to calculate because it is not constant when the vehicles join the queue. It is necessary to estimate it accurately. The average deceleration rate between the stop bar detector and the speed detector is used as the approximation of at. Define t1 and t2 as the times through these two detectors which can collect the information of travel time, υ1 and υ2 as the corresponding speeds. The average deceleration rate is estimated as follows:(22)at=υ2-υ1t2-t1Supposing the deceleration rate is constant which is denoted bya, according to kinematics theory, we have fυ,a=υ2/2a. Combining the above formulae (20) and (21), we have(23)fυ,a=υ22a≤kww+L2-kjL2kjAccording to the above formula (20), we can conclude that kωω+L2-kjL2≥0, since kj is larger than kL, and L1 is always nonnegative. Thus (23) can be modified as below:(24)υ≤2akww+L2-kjL2kjTherefore, we define critical speed as below:(25)υth=2akww+L2-kjL2kjIn view of that it is difficult to obtain the parameter ofkw, we further simplify the equation (25). We denote the vehicle counts at stop bar detector by Nb which can be detected by the corresponding detectors. Similarly, Ns is the vehicle counts at the speed detector. Therefore, when Nb-Ns/kj-L2 is nonnegative, the threshold speed can be calculated as follows:(26)υth=2aNb-Ns-kjL2kj=2aNb-Nskj-L2Otherwise, the queue spillover will not occur unless the vehicle speed passing over the speed detector is nonpositive, that is,(27)υth=0ifNb-Nskj-L2<02aNb-Nskj-L2ifNb-Nskj-L2≥0Considering the disturbance in vehicle speed in real life, the method to identify the possible queue spillover can be expanded as below.(1) The speed which is less than the critical speedυth can be detected by two consecutive samplings.(2) The speed of vehicles is decreasing.


## 5. Spillover Control

When potential queue spillover is detected, the spillover control method will prevent the upstream vehicle from entering the downstream link to avoid the queue spillover until the queue dissipation is detected. Therefore, we will introduce the method to identify the queue dissipation and control the spillover in the following.


### 5.1. Queue Dissipation Identification

When the queue dissipation [23] is detected by the corresponding detector on Link 2, we should ensure that there is enough space on Link 2 to receive the vehicles entering from the upstream link [31]. Thus it is necessary to determine the position of the speed detector to guarantee the space on Link 2 is enough when the detected speed is larger than 0. The vehicles on Link 2 begin to release when the vehicle queue is served by green light, as shown in Figure 6.Figure 6
Queue dissipation identification based on speed detector. Speed detector is deployed to detect the speed when vehicles pass over it.The released capacityΔL on Link 2 can be calculated according to geometric relationships.(28)ΔL=l~-l~kfkjwhere kf represents the vehicle density at the corresponding position as shown in Figure 6. l~ is the distance between the stop bar and the frontier of queue. L~ is the distance between the stop bar and the Speed detector. We can conclude the relationship that l~≤L~.When the vehicles waiting on Link 1 are served by the green time, the number of vehicles that will enter the intersection is more thans∗gmin which represents the minimum number of released vehicles. When the queue dissipation is detected by the speed detector, the capacity on Link 2 should be large enough to accommodate the minimum number of released vehicles at least. That is, ΔL·kj≥s∗gmin which can be simplified as below:(29)l~≥s∗gminkj-kfWe can calculateL2 by the following:(30)L2=L-L~≤L-l~≤L-s∗gminkj-kfTherefore, the speed detector can be deployed near the downstream entrance as possible to detect both queue spillover and dissipation which is consistent with Section4. In order to avoid the fluctuation of vehicle speed, the following two conditions can be used to identify the occurrence of queue dissipation.(1) The speed which is larger than zero can be detected by two consecutive samplings.(2) The speed of vehicles is increasing.


### 5.2. Spillover Control

The spillover control method can be activated when the possible queue spillover occurs [23]. This control method consists of two kinds of control scheme, namely, ECG (Early Cut-Off Green) and RUG (Return Unused Green). When the possible queue spillover is detected, the ECG control scheme will first be executed to prevent possible spillover. When the queue dissipation is detected, the (Return Unused Green) will be activated to give back the remaining green time to the phase which has executed the ECG (Early Cut off Green) control scheme if the current control cycle is not ended. The flowchart of queue spillover control on link L1,2 is shown in Figure 7.Figure 7
The flowchart of queue spillover control on linkL1,2. ECG is activated to Early Cut-Off Green time of the phase encountering spillover. RUG is activated to return the unused green time the phase whose green time is Early Cut-Off.Assume Intersection 1 is the studied intersection as shown in Figure8. Both of these two intersections have 8 phases as shown in Figure 9.Figure 8
Road network Layout for the simulation. The adjacent intersection is taken into account to simulate the practical road traffic condition.Figure 9
The design of phase sequence. P1 and P5 are grouped into signal group 1. P2 and P6 are grouped into signal group 2. The residual phases are grouped into signal group 3.If we want to identify and control the spillover onL1,2, we should take Phase 2 as the phase whose green light should be truncated when spillover is detected and Phase 1 as the phase which can obtain more green time to explain our method. According to the original timing plan provided by the model-based control method in the current cycle, we can infer the time when the green time for Phase 2 is started. When Phase 2 (terminating phase) is green, the potential queue spillover on L1,2will be identified. The spillover control controller will work if a possible spillover is detected. The flowchart of the spillover control for Intersection 1 is shown in Figure 7. The spillover controller will first execute ECG to adjust the signal light state of Phase 2 to red to prevent possible spillover. The remaining green time can be reassigned to Phase 1 if the remaining green time is longer than the sum of gmin and amber time. When the queue dissipation is detected, RUG will be executed to adjust the signal light state of Phase 1 and Phase 2 to green and to red, respectively, if the remaining passing time is enough. Similarly, in order to prevent possible spillover on link L1,4 the control scheme of Phase 6 and Phase 5 can be concluded. There is no need to take control of Phases 3, 4, 7, and 8 due to the traffic flow volume is low on these phases.


## 5.1. Queue Dissipation Identification

When the queue dissipation [23] is detected by the corresponding detector on Link 2, we should ensure that there is enough space on Link 2 to receive the vehicles entering from the upstream link [31]. Thus it is necessary to determine the position of the speed detector to guarantee the space on Link 2 is enough when the detected speed is larger than 0. The vehicles on Link 2 begin to release when the vehicle queue is served by green light, as shown in Figure 6.Figure 6
Queue dissipation identification based on speed detector. Speed detector is deployed to detect the speed when vehicles pass over it.The released capacityΔL on Link 2 can be calculated according to geometric relationships.(28)ΔL=l~-l~kfkjwhere kf represents the vehicle density at the corresponding position as shown in Figure 6. l~ is the distance between the stop bar and the frontier of queue. L~ is the distance between the stop bar and the Speed detector. We can conclude the relationship that l~≤L~.When the vehicles waiting on Link 1 are served by the green time, the number of vehicles that will enter the intersection is more thans∗gmin which represents the minimum number of released vehicles. When the queue dissipation is detected by the speed detector, the capacity on Link 2 should be large enough to accommodate the minimum number of released vehicles at least. That is, ΔL·kj≥s∗gmin which can be simplified as below:(29)l~≥s∗gminkj-kfWe can calculateL2 by the following:(30)L2=L-L~≤L-l~≤L-s∗gminkj-kfTherefore, the speed detector can be deployed near the downstream entrance as possible to detect both queue spillover and dissipation which is consistent with Section4. In order to avoid the fluctuation of vehicle speed, the following two conditions can be used to identify the occurrence of queue dissipation.(1) The speed which is larger than zero can be detected by two consecutive samplings.(2) The speed of vehicles is increasing.


## 5.2. Spillover Control

The spillover control method can be activated when the possible queue spillover occurs [23]. This control method consists of two kinds of control scheme, namely, ECG (Early Cut-Off Green) and RUG (Return Unused Green). When the possible queue spillover is detected, the ECG control scheme will first be executed to prevent possible spillover. When the queue dissipation is detected, the (Return Unused Green) will be activated to give back the remaining green time to the phase which has executed the ECG (Early Cut off Green) control scheme if the current control cycle is not ended. The flowchart of queue spillover control on link L1,2 is shown in Figure 7.Figure 7
The flowchart of queue spillover control on linkL1,2. ECG is activated to Early Cut-Off Green time of the phase encountering spillover. RUG is activated to return the unused green time the phase whose green time is Early Cut-Off.Assume Intersection 1 is the studied intersection as shown in Figure8. Both of these two intersections have 8 phases as shown in Figure 9.Figure 8
Road network Layout for the simulation. The adjacent intersection is taken into account to simulate the practical road traffic condition.Figure 9
The design of phase sequence. P1 and P5 are grouped into signal group 1. P2 and P6 are grouped into signal group 2. The residual phases are grouped into signal group 3.If we want to identify and control the spillover onL1,2, we should take Phase 2 as the phase whose green light should be truncated when spillover is detected and Phase 1 as the phase which can obtain more green time to explain our method. According to the original timing plan provided by the model-based control method in the current cycle, we can infer the time when the green time for Phase 2 is started. When Phase 2 (terminating phase) is green, the potential queue spillover on L1,2will be identified. The spillover control controller will work if a possible spillover is detected. The flowchart of the spillover control for Intersection 1 is shown in Figure 7. The spillover controller will first execute ECG to adjust the signal light state of Phase 2 to red to prevent possible spillover. The remaining green time can be reassigned to Phase 1 if the remaining green time is longer than the sum of gmin and amber time. When the queue dissipation is detected, RUG will be executed to adjust the signal light state of Phase 1 and Phase 2 to green and to red, respectively, if the remaining passing time is enough. Similarly, in order to prevent possible spillover on link L1,4 the control scheme of Phase 6 and Phase 5 can be concluded. There is no need to take control of Phases 3, 4, 7, and 8 due to the traffic flow volume is low on these phases.


## 6. Case Study

### 6.1. Simulation Settings

We evaluate the results of the proposed method in the above virtual network as shown in Figure8. The total time to simulate the road network is set as one hour. We set the time that the simulation will run before starting to collect results as three signal cycles. Relevant parameters and network configurations will be introduced in the following.Intersection 1 is the studied intersection in this paper. The intersection adjacent to Intersection 1 is Intersection 2. All the links of the simulation network have three lanes where lane 1, lane 2, and lane 3 which are numbered from left to right on each road represent left-turn lane, through lane, and through right-turn lane, respectively. The VISSIM4.3 is selected as the simulation tool to simulate traffic movements and provide evaluation results to determine the performance of different traffic signal methods. Python provides the output of control parameter of green time splits based on the traffic flow data collected by the corresponding detectors. The saturation flow rateμu,d for all links is 2000 vehicle/h. gmin and gmax for all intersections are set as 10 s and 50 s, respectively. ccycle is set as 140 s which is equal to the sampling time. The simulation results are based on Np=5. L1,2 is set as 200 meters.In order to obtain the results with different traffic signal control methods, we should provide traffic volume from different entries. Table1 shows the Traffic volume for Intersection 1 during the simulation duration. NB, SB, EB, and WB represent the entrance of north, south, east, and west, respectively, for Intersection 1.Table 1
Traffic volume for Intersection 1 during the simulation duration.
ENTRY Left Turn[vehicle/h] Through[vehicle/h] Right Turn[vehicle/h] NB 147 256 166 SB 181 221 168 EB 166 1297 215 WB 175 963 183Table2 lists the parameters used in IGAABC. The trials_limit represents the times for which the food source is not updated is set as 100; both the numbers of employed bees and onlooker bees are equal to 15; the crossover probability is set as 0.6 and mutation probability is 0.01; the number of iterations is 49.Table 2
IGAABC parameters settings.
Parameter Description value limit trials_limit 100 SN The number of employed bees 15 The number of onlooker bee p c Crossover probability 0.6 p m Mutation probability 0.01 nruns Number of iterations 49We select the average vehicle delay for each phase at the studied intersection and the maximum queue length on linkL1,2 obtained by the simulation evaluation of VISSIM4.3 as the evaluation criterion. The result comparison will be described in detail in the following section.


### 6.2. Simulation Results

In this section, the simulation evaluation data of delay and queue length collected from VISSIM4.3 is provided to evaluate the performance of traffic signal control. The proposed control method will be compared with the methods of model-based predictive control and adaptive signal control. In addition, the proposed control method with our improved ABC algorithm will be compared with the method with ABC algorithm to verify the performance of our algorithm. The detailed descriptions of different traffic signal control methods are introduced as below:(1)
Model-based predictive control, whose green time splits for all intersections are optimized according to the measured traffic flow state is showed.(2)
Adaptive signal control, which can adaptively adjust the green time according to the real-time traffic condition to prevent the possible queue spillover [23]. The basic green time splits scheme of each intersection consists of three signal groups. As shown in Figure 10, the green time splits of the three signal groups at Intersection 1 are 35 s, 65 s, and 40 s, respectively, while the green time splits of the three signal groups for Intersection 2 are 45 s, 55 s, and 40 s, respectively.(3)
Proposed method (ABC), whose control method is based on the proposed improved model-based predictive control method in this paper and optimization algorithm is based on the basic ABC algorithm.(4)
Proposed method (IGAABC), whose control method is based on the proposed improved model-based predictive control method, while the optimization algorithm of this method is based on the improved hybrid artificial bee colony algorithm IGAABC proposed in the paper.Figure 10
The basic green time splits scheme at different intersections. The green time splits of the three signal groups at Intersection 1 are 35 s, 65 s, and 40 s, respectively, while the green time splits of the three signal groups for Intersection 2 are 45 s, 55 s, and 40 s, respectively.Table3 shows the total average vehicle delay at Intersection 1 with different methods. We can conclude that the delay in proposed method (ABC) method can be decreased by 8.8 percentage compared with adaptive signal control [23] method and 10.4 percentage compared with the model-based predictive control. What is more, the delay in proposed method (IGAABC) method can be decreased by 11.6 percentage compared with adaptive signal control method and 13.2 percentage compared with the model-based predictive control. Therefore, the improved hybrid artificial bee colony algorithm IGAABC improves the performance of basic artificial bee colony algorithm by 3.1 percentage in terms of average vehicle delay. The simulation results verify that the proposed method (IGAABC) method can incredibly promote efficiency in traffic signal control and the solutions obtained by the optimization algorithm of IGAABC are better than the basic ABC algorithm. The average vehicle delay for different control scheme at intersection 1 is shown in Table 3 in detail.Table 3
Total average vehicle delay at intersection 1 with different control schemes.
Signal Control Method Average Vehicle Delay [s] Model-based predictive control 535.1 Adaptive signal control 525.3 Proposed method (ABC) 479.3 Proposed method (IGAABC) 464.6The detailed comparisons of average vehicle delay for each phase at intersection 1 are shown in Figure11. Due to different signal timing schemes that can be derived by the proposed method and model-based predictive control method according to different traffic flow conditions, it is more flexible to control the changing traffic flow to balance the flow in a road network. Although the differences for Phase 2 and Phase 6 between the proposed method and the model-based predictive control are not apparent, the delay of other phases can be decreased significantly because of the strategy of queue spillover control. By comparing the proposed method in this paper with adaptive signal control method, we can conclude that the delay for most phases at Intersection 1 will be decreased, which would be of great benefit to the drivers who are waiting at the corresponding intersection. The results further demonstrate that our proposed method is superior to adaptive signal control method in terms of delay.Figure 11
Average vehicle delay for each phase with different control schemes. The simulation time is one hour with the first three cycles as warm-up time.We further study the delay in a specific cycle whose simulation time ranging from 2300 s to 2440 s, where queue spillover will happen frequently. As shown in Figures12 and 13, we take the delay of Phase 2 and Phase 7, for example. We can conclude that both the adaptive signal control method and the proposed method can efficiently deal with the traffic signal control problem to decrease the delay when the traffic demand of the studied intersection is significantly huge during peak hours, while the model-based predictive control cannot control the studied intersection well which leads to a large delay over time. However, both the proposed method and the model-based predictive control method can adjust the green timing scheme according to the real-time traffic condition, which would facilitate balancing the traffic flow on each road. Therefore, the delay will be controlled according to the change of traffic flow state based on these two control method.Figure 12
Delay of Phase 2 in a cycle. The delay is evaluated in a specific cycle whose simulation time ranging from 2300 s to 2440 s.Figure 13
Delay of Phase 7 in a cycle. The delay is evaluated in a specific cycle whose simulation time ranging from 2300 s to 2440 s.According to the simulation results, the proposed method and the adaptive signal control method can both maintain the queue length less than the length ofL1,2(200 m) to avoid spillover under oversaturated traffic condition, while the model-based predictive control cannot avoid spillover on link L1,2. As shown in Figure 14, we choose the same cycle which suffers a frequent occurrence of the spillover. The adaptive signal control method and the proposed signal control method will take actions to prevent the spillover when they detect the possible queue spillover. The proposed signal control method can adjust the green time splits according to the changing traffic flow; thus it can maintain the queue length at a relatively low level. Although the model-based predictive control method will optimize the green time splits according to the measured traffic flow, it cannot prevent traffic congestion when the queue spillover occurs. Therefore, the queue under oversaturated conditions will be at a high level. The simulation results verify that the proposed method outperforms other methods in delay and maintains the queue length in a specific range.Figure 14
Maximum queue length on linkL1,2. Queue length can demonstrate the control performance to decrease traffic volume on a specific road.The proposed method will spend some time on solving the optimal solutions of green time splits. Table4 shows the CPU time of the proposed method with different prediction horizons which are equal to 3, 5, and 7 respectively. The time units in Table 4 are second. Average, Maximum, and Minimum denotes the average time, maximum time, and minimum time for a run, respectively, to obtain the optimal time splits in a control step. The time of a control step is set to one signal control cycle which equals 140 s. The CPU time shown in Table 4 for different prediction horizon is less than 140 s. Therefore, the green time splits can be obtained in time in the proposed method of this paper.Table 4
The CPU time of the integrated method with different prediction horizons.
Prediction Horizon Average[s] Maximum[s] Minimum[s] NP=3 39.09 40.99 37.38 NP=5 51.45 56.59 48.56 NP=7 81.28 86.44 77.48In a word, the proposed method can significantly improve the overall performance of the studied intersection. The proposed signal control method can not only provide appropriate timing plan according to the changing traffic flow, but also it can avoid the occurrence of queue spillover under oversaturated traffic condition. Therefore this method can benefit these two ideas to reduce the delay and improve the efficiency of traffic control.


### 6.3. Sensitivity Analysis

There are many factors which may affect the performance of signal optimization. Given different traffic volumes, turning movement changes, and speed limits of the road links, the simulation results which can reflect the performance of signal optimization may be different. Li et al. [40] modeled left-turn driving behavior to reveal the impact of different degrees of conflict on the performance of signal optimization under mixed traffic conditions. Considering the study in this paper is based on the assumption that traffic flow merely consists of single-motorized vehicle, the impact of degrees of conflict on signal optimization is neglected. Therefore, traffic volumes, turning movement changes, and speed limits of the road links are selected to evaluate the sensitivity of proposed method. The total delay which can reflect the signal control effect at the studied intersection is regarded as the performance index.Sensitivity analysis under different traffic volume conditions includes 6 traffic scenarios. We select different factors m which are 0.2, 0.4, 0.6, 0.8, 1.0, and 1.2 of the traffic volume shown in Table1, respectively, to simulate different traffic scenarios. As shown in Table 5, we can conclude that the total delay of proposed method and model-based predictive control method can be maintained at a low level when the value of m is no larger than 0.4 which simulates an unsaturated traffic condition. However, with an increase of the value of m which reflects an increasing traffic demand, the performance of the basic model-based predictive control method is apparently worse than the proposed method and adaptive signal control method. The percentage in parentheses represents the percentage of performance improvement by the proposed method compared with a specified method. The proposed methods can always perform well no matter what traffic condition it is. The improvement rate of performance is shown in Table 5.Table 5
Total delay at Intersection 1 with different traffic scenarios.
Traffic volume factor Proposed method Model-based predictive control Adaptive signal control 0.2 380 396.1(+4.1%) 424.7(+10.5%) 0.4 436.2 442.3(+1.38%) 452.5(+3.6%) 0.6 442.5 506.4(+12.62%) 482.1(+8.2%) 0.8 452.8 525.1(+13.77%) 517.5(+12.5%) 1 469.4 535.1(+12.28%) 525.3(+10.64%) 1.2 492.4 656.8(+25.03%) 642.4(+23.35%)Sensitivity analysis under different turning movement changes includes 3 scenarios. We assume thatβ=[L,T,R], where L,T,R represents the percentages of left-turn, through, and right-turn movements, respectively. The simulation results are shown in Table 6. Although total delay of proposed method with the value of β which is equal to [1,1,1] or [2,1,1] is no better than adaptive signal control method, it performs well when the value of β is set as [1,2,1] which can reflect the turning movement in real urban road where the percentage of through movement is larger than another movement. Therefore, the proposed method is available in practice.Table 6
Total delay at Intersection 1 with different turning movement changes.
β [ 1,1 , 1 ] [ 1,2 , 1 ] [ 2,1 , 1 ] Proposed method 514 441.8 533.7 Model-based predictive control 1009 792.5 996.3 Adaptive signal control 430.5 468.3 435.1Sensitivity analysis under different speed limits of the road links is shown in Table7. The units for the speed limits in Table 7 are km/h. The units for the total delay in Table 7 are second. The performance of proposed method performs well when the speed limits of the road links are less than 70 km/h. However, the total delay of proposed method increases slightly when the speed limit is set as 70 km/h. Considering that the speed under oversaturated traffic conditions will not be too high, the proposed method is effective to deal with the problem of traffic signal control when traffic demand is high.Table 7
Total delay at Intersection 1 with different speed limits of the road links.
speed limits 30 50 70 Proposed method 465.3 469.4 742.1 Model-based predictive control 569.9 535.1 1302.9 Adaptive signal control 492.6 525.3 655.8


## 6.1. Simulation Settings

We evaluate the results of the proposed method in the above virtual network as shown in Figure8. The total time to simulate the road network is set as one hour. We set the time that the simulation will run before starting to collect results as three signal cycles. Relevant parameters and network configurations will be introduced in the following.Intersection 1 is the studied intersection in this paper. The intersection adjacent to Intersection 1 is Intersection 2. All the links of the simulation network have three lanes where lane 1, lane 2, and lane 3 which are numbered from left to right on each road represent left-turn lane, through lane, and through right-turn lane, respectively. The VISSIM4.3 is selected as the simulation tool to simulate traffic movements and provide evaluation results to determine the performance of different traffic signal methods. Python provides the output of control parameter of green time splits based on the traffic flow data collected by the corresponding detectors. The saturation flow rateμu,d for all links is 2000 vehicle/h. gmin and gmax for all intersections are set as 10 s and 50 s, respectively. ccycle is set as 140 s which is equal to the sampling time. The simulation results are based on Np=5. L1,2 is set as 200 meters.In order to obtain the results with different traffic signal control methods, we should provide traffic volume from different entries. Table1 shows the Traffic volume for Intersection 1 during the simulation duration. NB, SB, EB, and WB represent the entrance of north, south, east, and west, respectively, for Intersection 1.Table 1
Traffic volume for Intersection 1 during the simulation duration.
ENTRY Left Turn[vehicle/h] Through[vehicle/h] Right Turn[vehicle/h] NB 147 256 166 SB 181 221 168 EB 166 1297 215 WB 175 963 183Table2 lists the parameters used in IGAABC. The trials_limit represents the times for which the food source is not updated is set as 100; both the numbers of employed bees and onlooker bees are equal to 15; the crossover probability is set as 0.6 and mutation probability is 0.01; the number of iterations is 49.Table 2
IGAABC parameters settings.
Parameter Description value limit trials_limit 100 SN The number of employed bees 15 The number of onlooker bee p c Crossover probability 0.6 p m Mutation probability 0.01 nruns Number of iterations 49We select the average vehicle delay for each phase at the studied intersection and the maximum queue length on linkL1,2 obtained by the simulation evaluation of VISSIM4.3 as the evaluation criterion. The result comparison will be described in detail in the following section.


## 6.2. Simulation Results

In this section, the simulation evaluation data of delay and queue length collected from VISSIM4.3 is provided to evaluate the performance of traffic signal control. The proposed control method will be compared with the methods of model-based predictive control and adaptive signal control. In addition, the proposed control method with our improved ABC algorithm will be compared with the method with ABC algorithm to verify the performance of our algorithm. The detailed descriptions of different traffic signal control methods are introduced as below:(1)
Model-based predictive control, whose green time splits for all intersections are optimized according to the measured traffic flow state is showed.(2)
Adaptive signal control, which can adaptively adjust the green time according to the real-time traffic condition to prevent the possible queue spillover [23]. The basic green time splits scheme of each intersection consists of three signal groups. As shown in Figure 10, the green time splits of the three signal groups at Intersection 1 are 35 s, 65 s, and 40 s, respectively, while the green time splits of the three signal groups for Intersection 2 are 45 s, 55 s, and 40 s, respectively.(3)
Proposed method (ABC), whose control method is based on the proposed improved model-based predictive control method in this paper and optimization algorithm is based on the basic ABC algorithm.(4)
Proposed method (IGAABC), whose control method is based on the proposed improved model-based predictive control method, while the optimization algorithm of this method is based on the improved hybrid artificial bee colony algorithm IGAABC proposed in the paper.Figure 10
The basic green time splits scheme at different intersections. The green time splits of the three signal groups at Intersection 1 are 35 s, 65 s, and 40 s, respectively, while the green time splits of the three signal groups for Intersection 2 are 45 s, 55 s, and 40 s, respectively.Table3 shows the total average vehicle delay at Intersection 1 with different methods. We can conclude that the delay in proposed method (ABC) method can be decreased by 8.8 percentage compared with adaptive signal control [23] method and 10.4 percentage compared with the model-based predictive control. What is more, the delay in proposed method (IGAABC) method can be decreased by 11.6 percentage compared with adaptive signal control method and 13.2 percentage compared with the model-based predictive control. Therefore, the improved hybrid artificial bee colony algorithm IGAABC improves the performance of basic artificial bee colony algorithm by 3.1 percentage in terms of average vehicle delay. The simulation results verify that the proposed method (IGAABC) method can incredibly promote efficiency in traffic signal control and the solutions obtained by the optimization algorithm of IGAABC are better than the basic ABC algorithm. The average vehicle delay for different control scheme at intersection 1 is shown in Table 3 in detail.Table 3
Total average vehicle delay at intersection 1 with different control schemes.
Signal Control Method Average Vehicle Delay [s] Model-based predictive control 535.1 Adaptive signal control 525.3 Proposed method (ABC) 479.3 Proposed method (IGAABC) 464.6The detailed comparisons of average vehicle delay for each phase at intersection 1 are shown in Figure11. Due to different signal timing schemes that can be derived by the proposed method and model-based predictive control method according to different traffic flow conditions, it is more flexible to control the changing traffic flow to balance the flow in a road network. Although the differences for Phase 2 and Phase 6 between the proposed method and the model-based predictive control are not apparent, the delay of other phases can be decreased significantly because of the strategy of queue spillover control. By comparing the proposed method in this paper with adaptive signal control method, we can conclude that the delay for most phases at Intersection 1 will be decreased, which would be of great benefit to the drivers who are waiting at the corresponding intersection. The results further demonstrate that our proposed method is superior to adaptive signal control method in terms of delay.Figure 11
Average vehicle delay for each phase with different control schemes. The simulation time is one hour with the first three cycles as warm-up time.We further study the delay in a specific cycle whose simulation time ranging from 2300 s to 2440 s, where queue spillover will happen frequently. As shown in Figures12 and 13, we take the delay of Phase 2 and Phase 7, for example. We can conclude that both the adaptive signal control method and the proposed method can efficiently deal with the traffic signal control problem to decrease the delay when the traffic demand of the studied intersection is significantly huge during peak hours, while the model-based predictive control cannot control the studied intersection well which leads to a large delay over time. However, both the proposed method and the model-based predictive control method can adjust the green timing scheme according to the real-time traffic condition, which would facilitate balancing the traffic flow on each road. Therefore, the delay will be controlled according to the change of traffic flow state based on these two control method.Figure 12
Delay of Phase 2 in a cycle. The delay is evaluated in a specific cycle whose simulation time ranging from 2300 s to 2440 s.Figure 13
Delay of Phase 7 in a cycle. The delay is evaluated in a specific cycle whose simulation time ranging from 2300 s to 2440 s.According to the simulation results, the proposed method and the adaptive signal control method can both maintain the queue length less than the length ofL1,2(200 m) to avoid spillover under oversaturated traffic condition, while the model-based predictive control cannot avoid spillover on link L1,2. As shown in Figure 14, we choose the same cycle which suffers a frequent occurrence of the spillover. The adaptive signal control method and the proposed signal control method will take actions to prevent the spillover when they detect the possible queue spillover. The proposed signal control method can adjust the green time splits according to the changing traffic flow; thus it can maintain the queue length at a relatively low level. Although the model-based predictive control method will optimize the green time splits according to the measured traffic flow, it cannot prevent traffic congestion when the queue spillover occurs. Therefore, the queue under oversaturated conditions will be at a high level. The simulation results verify that the proposed method outperforms other methods in delay and maintains the queue length in a specific range.Figure 14
Maximum queue length on linkL1,2. Queue length can demonstrate the control performance to decrease traffic volume on a specific road.The proposed method will spend some time on solving the optimal solutions of green time splits. Table4 shows the CPU time of the proposed method with different prediction horizons which are equal to 3, 5, and 7 respectively. The time units in Table 4 are second. Average, Maximum, and Minimum denotes the average time, maximum time, and minimum time for a run, respectively, to obtain the optimal time splits in a control step. The time of a control step is set to one signal control cycle which equals 140 s. The CPU time shown in Table 4 for different prediction horizon is less than 140 s. Therefore, the green time splits can be obtained in time in the proposed method of this paper.Table 4
The CPU time of the integrated method with different prediction horizons.
Prediction Horizon Average[s] Maximum[s] Minimum[s] NP=3 39.09 40.99 37.38 NP=5 51.45 56.59 48.56 NP=7 81.28 86.44 77.48In a word, the proposed method can significantly improve the overall performance of the studied intersection. The proposed signal control method can not only provide appropriate timing plan according to the changing traffic flow, but also it can avoid the occurrence of queue spillover under oversaturated traffic condition. Therefore this method can benefit these two ideas to reduce the delay and improve the efficiency of traffic control.


## 6.3. Sensitivity Analysis

There are many factors which may affect the performance of signal optimization. Given different traffic volumes, turning movement changes, and speed limits of the road links, the simulation results which can reflect the performance of signal optimization may be different. Li et al. [40] modeled left-turn driving behavior to reveal the impact of different degrees of conflict on the performance of signal optimization under mixed traffic conditions. Considering the study in this paper is based on the assumption that traffic flow merely consists of single-motorized vehicle, the impact of degrees of conflict on signal optimization is neglected. Therefore, traffic volumes, turning movement changes, and speed limits of the road links are selected to evaluate the sensitivity of proposed method. The total delay which can reflect the signal control effect at the studied intersection is regarded as the performance index.Sensitivity analysis under different traffic volume conditions includes 6 traffic scenarios. We select different factors m which are 0.2, 0.4, 0.6, 0.8, 1.0, and 1.2 of the traffic volume shown in Table1, respectively, to simulate different traffic scenarios. As shown in Table 5, we can conclude that the total delay of proposed method and model-based predictive control method can be maintained at a low level when the value of m is no larger than 0.4 which simulates an unsaturated traffic condition. However, with an increase of the value of m which reflects an increasing traffic demand, the performance of the basic model-based predictive control method is apparently worse than the proposed method and adaptive signal control method. The percentage in parentheses represents the percentage of performance improvement by the proposed method compared with a specified method. The proposed methods can always perform well no matter what traffic condition it is. The improvement rate of performance is shown in Table 5.Table 5
Total delay at Intersection 1 with different traffic scenarios.
Traffic volume factor Proposed method Model-based predictive control Adaptive signal control 0.2 380 396.1(+4.1%) 424.7(+10.5%) 0.4 436.2 442.3(+1.38%) 452.5(+3.6%) 0.6 442.5 506.4(+12.62%) 482.1(+8.2%) 0.8 452.8 525.1(+13.77%) 517.5(+12.5%) 1 469.4 535.1(+12.28%) 525.3(+10.64%) 1.2 492.4 656.8(+25.03%) 642.4(+23.35%)Sensitivity analysis under different turning movement changes includes 3 scenarios. We assume thatβ=[L,T,R], where L,T,R represents the percentages of left-turn, through, and right-turn movements, respectively. The simulation results are shown in Table 6. Although total delay of proposed method with the value of β which is equal to [1,1,1] or [2,1,1] is no better than adaptive signal control method, it performs well when the value of β is set as [1,2,1] which can reflect the turning movement in real urban road where the percentage of through movement is larger than another movement. Therefore, the proposed method is available in practice.Table 6
Total delay at Intersection 1 with different turning movement changes.
β [ 1,1 , 1 ] [ 1,2 , 1 ] [ 2,1 , 1 ] Proposed method 514 441.8 533.7 Model-based predictive control 1009 792.5 996.3 Adaptive signal control 430.5 468.3 435.1Sensitivity analysis under different speed limits of the road links is shown in Table7. The units for the speed limits in Table 7 are km/h. The units for the total delay in Table 7 are second. The performance of proposed method performs well when the speed limits of the road links are less than 70 km/h. However, the total delay of proposed method increases slightly when the speed limit is set as 70 km/h. Considering that the speed under oversaturated traffic conditions will not be too high, the proposed method is effective to deal with the problem of traffic signal control when traffic demand is high.Table 7
Total delay at Intersection 1 with different speed limits of the road links.
speed limits 30 50 70 Proposed method 465.3 469.4 742.1 Model-based predictive control 569.9 535.1 1302.9 Adaptive signal control 492.6 525.3 655.8


## 7. Conclusion and Future Outlook

To summarize, our proposed method can deal with the problem of traffic signal control at intersections when capacity of the system cannot satisfy the demand under oversaturated traffic conditions. We propose an improved model-based predictive control approach which can predict traffic demand over a finite horizon according to the measured traffic flow information to calculate the optimal green time splits plan with the objective of total travel time minimum and avoid queue spillover under oversaturated traffic conditions. Moreover, to solve complicated optimization problems in a short time which contributes to online applications, we propose an improved hybrid artificial bee algorithm to address the optimal control problem of the proposed improved model-based predictive control approach as soon as possible. The simulation results verified that our proposed method can manage queue effectively and balance the traffic flow on different roads simultaneously which can improve the performance of the intersection significantly.Other subjects will be explored in the future. We can first consider the following aspects including how to optimize traffic control along trunk roads or a huge network under oversaturated condition. Second, we can study the algorithm to solve the optimization model to obtain the solutions as soon as possible. Finally, the proposed method is based on a fixed cycle and phase sequence which limits the application in practical urban traffic condition.



---

*Source: 3149275-2019-07-10.xml*