# Signal Control Strategy for Supersaturated Traffic at Urban Road Intersections with a Large Technical Grade Gap

Authors: Baiqun Ding; Liu Yang; He Xu; Yongming He
Journal: Journal of Advanced Transportation
 (2021)

---

## Abstract

To reduce the risk of queuing overflow on the urban minor road at the intersection under supersaturation where the capacity of the arterial and minor roads shows extreme disparity, reduce the adverse effects caused by long queues of vehicles on the minor road, and comprehensively balance the multiobjective requirements such as priority of the main road, queuing restrictions, and delay on the minor road, the minor road queue model at the end of red, a road remaining capacity model, and multiparameter coordinated signal control model were established, and a multiobjective genetic algorithm was used to optimize this solution. As an example, the multiparameter coordinated control strategy decreased the delay per vehicle by approximately 17% and the queue length by approximately 30%–50% on the minor road and slightly increased the delay per vehicle at the intersection and the length on the main road queue. This control strategy can make full use of the capacity of the main road to control the queue length on the minor road, effectively reduce the risk of minor road queue overflow blocking local road network traffic operation involved, and comprehensively balance the traffic demand between arterial and minor roads. It provides a reference control method for coping with the transfer of the main traffic contradiction under the oversaturated state of the road intersection with large disparity.


---

## Body

## 1. Introduction

Many urban primary and minor road intersections usually adopt the primary road priority control strategy to ensure the traffic capacity of the main road. However, at intersections with large technical level gaps between primary and minor roads, this control method will cause queued vehicles on minor roads to overtake when the traffic reaches supersaturation. As the signal cycle continues to accumulate, the minor road queue will be too long or even overflow, which interferes with or even “locks up” the upstream intersections, causing local road networks to involve traffic control failures and traffic operation paralysis.When the supersaturated traffic state develops to a certain extent, the main contradiction of urban primary and minor road intersections transforms from ensuring traffic efficiency to avoiding traffic congestion and balancing traffic demand. At present, the number of two-way main roads with more than 8–10 lanes is increasing in many large cities. These roads have a large capacity and can accommodate more vehicles. How to make full use of the capacity of urban arterial roads to control the overflow caused by supersaturated traffic, balance the traffic demand of the primary and minor roads, and maintain the traffic operation and microcirculation of the local road network are questions worth considering.The phenomenon of queue overflow can also be expressed as supersaturated traffic. Wu X took the green lost time and traffic efficiency at intersections as indicators for evaluating the severity of supersaturation. Many researchers have proposed different methods to calculate the queue length [1]. Wunderlich et al. used computer simulation to predict the maximum queue length when the intersection was in a steady-state flow [2]. Mirchandani and Zou established the steady state of vehicles based on a queuing theory of queue length calculation model for distribution [3]. Lin and Liu calculated the queuing length and delay time at intersections based on taxi positioning data, and the results obtained were applicable for noncongested road conditions [4].Based on the queue length model, a variety of multiparameter signal control strategies were proposed. Aboudolas et al. regarded the parameters and constraints of signal control as a quadratic programming problem and balanced the queue length of each entrance at the intersection [5]. Li et al. established a multiobjective optimization model with the objectives of the shortest queue length, minimum delay, and minimum exhaust emissions and obtained the optimal timing scheme [6]. Reference [7] comprehensively considered the signal design of the upstream and downstream intersections, the turning flow, the length of the road section, and the phase difference. A method was then obtained for calculating the maximum queuing length at the intersection. Reference [8] proposed the concept and calculation method of the space-time coordination index of adjacent signalized intersections. Reference [9] calculated the signal control delay at the intersection by using the stop delay and acceleration or deceleration delay. Cheng Wei et al. proposed a traffic transfer method based on sensation control to solve the congestion problem caused by queue overflow in a certain direction [10].The majority of the research on oversaturated intersections focused on the use of coordinated control of adjacent intersections to disperse greater queuing pressure to upstream intersections, but there were few studies involving multiparameter coordinated control at intersections with large and minor road capacities. Aiming at the adverse effects of excessively long vehicle queues on minor roads due to supersaturation, this study comprehensively coordinates the traffic capacity, queuing, and delays of primary and minor roads and establishes a well-directed control strategy for intersections on roads with large technical grade gaps.


## 2. Queuing Calculation Model of the Red End on Minor Roads

### 2.1. Model Establishment

On the basis of traffic wave theory and two-fluid theory, a queue length model at the end of the red light on a minor road was established, and the reliability of the model was verified by VISSIM simulation software.


#### 2.1.1. Single-Lane Queue Length Model

The final number of vehicles in the queue at the entrance of a signalized intersection is equal to the sum of the number of vehicles detained in the previous cycle and the number of vehicles detained in this cycle, which can be expressed by(1)ΔN=N+N1–N2ΔNr+C=Nr+N1r+C−N2r+C=Nr+N1r−N2r,where N is the number of vehicles stuck in the entrance lane after the red light ends in the last cycle, pcu; N1 is the number of vehicles entering the entrance lane from the start of the green light to the end of the red light in this signal cycle, pcu; N2 is the number of vehicles leaving the entrance lane from the beginning of the green light to the end of the red light during this period, pcu; and ΔN is the total number of vehicles between the upstream and downstream sections of the entrance road at the end of the red light of this cycle, pcu.Figure1 shows the traffic state at the red light at the entrance of intersection B. N represents the vehicles waiting in the line for release in the LA section, and the traffic density is approximately the congestion density, namely, kj; N1 is the number of vehicles entering the road section in this cycle, that is, the vehicles that are about to start queuing in the LB and LC sections. The LC section vehicles run normally, and the vehicles in the LB section start to decelerate and enter the queue. At this time, the density kc is between the optimal density km and the jam density kj, that is, km < kc < kj.Figure 1
Traffic flow operation on the downstream queuing section.N2 is the number of vehicles leaving in this cycle. At this time, the density kq will start to decrease from the congestion density, so the maximum vehicle queue length in this cycle is as follows:(2)LD=NKm+N1KC−N2Kq,where LD is the queue length between the upstream and downstream sections at the end of red light, km, and kj is the blocking density between the upstream and downstream sections, pcu/km.When the traffic is in the optimal state of operation, the traffic density is the unobstructed densitykm, and the length of the road section between the upstream intersection and the downstream intersection is L. At this time, ΔN = km·L, and the queue length LD = 0. When a certain period of road conditions is completely blocked, the density is the blocking density kj; at this time, ∆N = kj·L, so the queue length LD = L. Since km < k < kj, equation (2) is applicable to the case where the density is between the best density and blocking density. Among them, kj, kc, and kq need to be calibrated according to actual conditions.


#### 2.1.2. Multilane Queue Length Model

When the traffic flow becomes congested, the lane-changing situations are reduced. If the traffic density is higher and the compressibility of space is smaller, the interaction between lanes will be smaller. At this time, the multilane entrance can be regarded as a whole, and the overall queuing situation of the multilane entrance can be calculated using the queuing length model of the single-lane entrance at the intersection:(3)L¯D′=∑i=1nLD′in,where LD′¯ is the average queuing length on the certain direction entrance of the intersection at the end of red in the current cycle, km; LD′(i) is the queuing length of lane i in the cycle, m; and n is the number of lanes in that direction at the intersection.


### 2.2. Model Checking

#### 2.2.1. Parameter Test

The congestion densitykj is the traffic flow density when the speed is zero. This study sets up three different simulation schemes with VISSIM simulation software listed in Table 1 and discussed the value of blocking density. The simulation result is shown in Figure 2.Table 1
Simulation scheme setting.
SchemeLength of road section (m)Width of vehicle lane (m)Quantity of vehicle lane12003.25124003.25134003.52Figure 2
Traffic density simulation data.From the simulation results, the blocking densitieskj of the three schemes were all approximately 160 pcu/km, so kj = 160 pcu/km was taken as the blocking density during simulation and verification of the model. According to the Greenberg logarithmic model given by (4), the best density km was 59 km/h.(4)km=kje.At the beginning of the green light, the traffic density,kq, of the 20 m section after the stop line (Figure 3) was between 90 pcu/km and 110 pcu/km, and the average value of kq was 100 pcu/km.Figure 3
Traffic density at the intersection.VISSIM does not have a clear approach to determining the position ofkc. Consequently, this study proposes an estimation method. Since km < kc < kj, and the longer LA, the fewer vehicles traveling at critical speed vm, and the closer kc approaches kj, it is assumed that kc can be solved by (5):(5)kc=km+kj2.


#### 2.2.2. Simulation Program Settings

As shown in Figure4, the simulation traffic flow direction was from intersection A to B. Each lane was set to 500 m long and 3.25 m wide, with a saturation flow rate of 1,800 pcu/h. The signal-phase timing parameters in this direction were set with the cycle 60 s, green light 20 s, red light 37 s, and amber light 3 s. The vehicle quantity detectors were set upstream of the entrance road, while the vehicle quantity detectors and queue counters were set downstream of the entrance road. The simulation time was 3,600 s.Figure 4
Simulation model and detector settings.Continuous simulation for 60 cycles showed that the vehicle queue started from the 10th cycle, and the 30th cycle started to be stable. To make the test results more stable, the 41st to 60th cycles were chosen as the simulation experiment range with an equivalent difference in the range of ±13 m and a relative error less than ±5% between the simulated and calculated queuing length. The calculated value of the model was very close to the simulated queuing length of VISSIM.The tracking errorσ is used to describe the deviation between the calculated value of the model and the simulated value. The smaller the deviation is, the more reliable the model is. Generally, the model is reliable when the deviation is less than 10.(6)σ=∑iMLmi−LeiM2,where Lmi is the queue length calculated by the model, m; Lei is the queue length of the simulation test, m; and M is the number of cycles.The calculated tracking errorsσ of the single- and double-lane models set in this study were 6.78 and 9.11, respectively. Thus, the model can be considered reliable.


## 2.1. Model Establishment

On the basis of traffic wave theory and two-fluid theory, a queue length model at the end of the red light on a minor road was established, and the reliability of the model was verified by VISSIM simulation software.


### 2.1.1. Single-Lane Queue Length Model

The final number of vehicles in the queue at the entrance of a signalized intersection is equal to the sum of the number of vehicles detained in the previous cycle and the number of vehicles detained in this cycle, which can be expressed by(1)ΔN=N+N1–N2ΔNr+C=Nr+N1r+C−N2r+C=Nr+N1r−N2r,where N is the number of vehicles stuck in the entrance lane after the red light ends in the last cycle, pcu; N1 is the number of vehicles entering the entrance lane from the start of the green light to the end of the red light in this signal cycle, pcu; N2 is the number of vehicles leaving the entrance lane from the beginning of the green light to the end of the red light during this period, pcu; and ΔN is the total number of vehicles between the upstream and downstream sections of the entrance road at the end of the red light of this cycle, pcu.Figure1 shows the traffic state at the red light at the entrance of intersection B. N represents the vehicles waiting in the line for release in the LA section, and the traffic density is approximately the congestion density, namely, kj; N1 is the number of vehicles entering the road section in this cycle, that is, the vehicles that are about to start queuing in the LB and LC sections. The LC section vehicles run normally, and the vehicles in the LB section start to decelerate and enter the queue. At this time, the density kc is between the optimal density km and the jam density kj, that is, km < kc < kj.Figure 1
Traffic flow operation on the downstream queuing section.N2 is the number of vehicles leaving in this cycle. At this time, the density kq will start to decrease from the congestion density, so the maximum vehicle queue length in this cycle is as follows:(2)LD=NKm+N1KC−N2Kq,where LD is the queue length between the upstream and downstream sections at the end of red light, km, and kj is the blocking density between the upstream and downstream sections, pcu/km.When the traffic is in the optimal state of operation, the traffic density is the unobstructed densitykm, and the length of the road section between the upstream intersection and the downstream intersection is L. At this time, ΔN = km·L, and the queue length LD = 0. When a certain period of road conditions is completely blocked, the density is the blocking density kj; at this time, ∆N = kj·L, so the queue length LD = L. Since km < k < kj, equation (2) is applicable to the case where the density is between the best density and blocking density. Among them, kj, kc, and kq need to be calibrated according to actual conditions.


### 2.1.2. Multilane Queue Length Model

When the traffic flow becomes congested, the lane-changing situations are reduced. If the traffic density is higher and the compressibility of space is smaller, the interaction between lanes will be smaller. At this time, the multilane entrance can be regarded as a whole, and the overall queuing situation of the multilane entrance can be calculated using the queuing length model of the single-lane entrance at the intersection:(3)L¯D′=∑i=1nLD′in,where LD′¯ is the average queuing length on the certain direction entrance of the intersection at the end of red in the current cycle, km; LD′(i) is the queuing length of lane i in the cycle, m; and n is the number of lanes in that direction at the intersection.


## 2.1.1. Single-Lane Queue Length Model

The final number of vehicles in the queue at the entrance of a signalized intersection is equal to the sum of the number of vehicles detained in the previous cycle and the number of vehicles detained in this cycle, which can be expressed by(1)ΔN=N+N1–N2ΔNr+C=Nr+N1r+C−N2r+C=Nr+N1r−N2r,where N is the number of vehicles stuck in the entrance lane after the red light ends in the last cycle, pcu; N1 is the number of vehicles entering the entrance lane from the start of the green light to the end of the red light in this signal cycle, pcu; N2 is the number of vehicles leaving the entrance lane from the beginning of the green light to the end of the red light during this period, pcu; and ΔN is the total number of vehicles between the upstream and downstream sections of the entrance road at the end of the red light of this cycle, pcu.Figure1 shows the traffic state at the red light at the entrance of intersection B. N represents the vehicles waiting in the line for release in the LA section, and the traffic density is approximately the congestion density, namely, kj; N1 is the number of vehicles entering the road section in this cycle, that is, the vehicles that are about to start queuing in the LB and LC sections. The LC section vehicles run normally, and the vehicles in the LB section start to decelerate and enter the queue. At this time, the density kc is between the optimal density km and the jam density kj, that is, km < kc < kj.Figure 1
Traffic flow operation on the downstream queuing section.N2 is the number of vehicles leaving in this cycle. At this time, the density kq will start to decrease from the congestion density, so the maximum vehicle queue length in this cycle is as follows:(2)LD=NKm+N1KC−N2Kq,where LD is the queue length between the upstream and downstream sections at the end of red light, km, and kj is the blocking density between the upstream and downstream sections, pcu/km.When the traffic is in the optimal state of operation, the traffic density is the unobstructed densitykm, and the length of the road section between the upstream intersection and the downstream intersection is L. At this time, ΔN = km·L, and the queue length LD = 0. When a certain period of road conditions is completely blocked, the density is the blocking density kj; at this time, ∆N = kj·L, so the queue length LD = L. Since km < k < kj, equation (2) is applicable to the case where the density is between the best density and blocking density. Among them, kj, kc, and kq need to be calibrated according to actual conditions.


## 2.1.2. Multilane Queue Length Model

When the traffic flow becomes congested, the lane-changing situations are reduced. If the traffic density is higher and the compressibility of space is smaller, the interaction between lanes will be smaller. At this time, the multilane entrance can be regarded as a whole, and the overall queuing situation of the multilane entrance can be calculated using the queuing length model of the single-lane entrance at the intersection:(3)L¯D′=∑i=1nLD′in,where LD′¯ is the average queuing length on the certain direction entrance of the intersection at the end of red in the current cycle, km; LD′(i) is the queuing length of lane i in the cycle, m; and n is the number of lanes in that direction at the intersection.


## 2.2. Model Checking

### 2.2.1. Parameter Test

The congestion densitykj is the traffic flow density when the speed is zero. This study sets up three different simulation schemes with VISSIM simulation software listed in Table 1 and discussed the value of blocking density. The simulation result is shown in Figure 2.Table 1
Simulation scheme setting.
SchemeLength of road section (m)Width of vehicle lane (m)Quantity of vehicle lane12003.25124003.25134003.52Figure 2
Traffic density simulation data.From the simulation results, the blocking densitieskj of the three schemes were all approximately 160 pcu/km, so kj = 160 pcu/km was taken as the blocking density during simulation and verification of the model. According to the Greenberg logarithmic model given by (4), the best density km was 59 km/h.(4)km=kje.At the beginning of the green light, the traffic density,kq, of the 20 m section after the stop line (Figure 3) was between 90 pcu/km and 110 pcu/km, and the average value of kq was 100 pcu/km.Figure 3
Traffic density at the intersection.VISSIM does not have a clear approach to determining the position ofkc. Consequently, this study proposes an estimation method. Since km < kc < kj, and the longer LA, the fewer vehicles traveling at critical speed vm, and the closer kc approaches kj, it is assumed that kc can be solved by (5):(5)kc=km+kj2.


### 2.2.2. Simulation Program Settings

As shown in Figure4, the simulation traffic flow direction was from intersection A to B. Each lane was set to 500 m long and 3.25 m wide, with a saturation flow rate of 1,800 pcu/h. The signal-phase timing parameters in this direction were set with the cycle 60 s, green light 20 s, red light 37 s, and amber light 3 s. The vehicle quantity detectors were set upstream of the entrance road, while the vehicle quantity detectors and queue counters were set downstream of the entrance road. The simulation time was 3,600 s.Figure 4
Simulation model and detector settings.Continuous simulation for 60 cycles showed that the vehicle queue started from the 10th cycle, and the 30th cycle started to be stable. To make the test results more stable, the 41st to 60th cycles were chosen as the simulation experiment range with an equivalent difference in the range of ±13 m and a relative error less than ±5% between the simulated and calculated queuing length. The calculated value of the model was very close to the simulated queuing length of VISSIM.The tracking errorσ is used to describe the deviation between the calculated value of the model and the simulated value. The smaller the deviation is, the more reliable the model is. Generally, the model is reliable when the deviation is less than 10.(6)σ=∑iMLmi−LeiM2,where Lmi is the queue length calculated by the model, m; Lei is the queue length of the simulation test, m; and M is the number of cycles.The calculated tracking errorsσ of the single- and double-lane models set in this study were 6.78 and 9.11, respectively. Thus, the model can be considered reliable.


## 2.2.1. Parameter Test

The congestion densitykj is the traffic flow density when the speed is zero. This study sets up three different simulation schemes with VISSIM simulation software listed in Table 1 and discussed the value of blocking density. The simulation result is shown in Figure 2.Table 1
Simulation scheme setting.
SchemeLength of road section (m)Width of vehicle lane (m)Quantity of vehicle lane12003.25124003.25134003.52Figure 2
Traffic density simulation data.From the simulation results, the blocking densitieskj of the three schemes were all approximately 160 pcu/km, so kj = 160 pcu/km was taken as the blocking density during simulation and verification of the model. According to the Greenberg logarithmic model given by (4), the best density km was 59 km/h.(4)km=kje.At the beginning of the green light, the traffic density,kq, of the 20 m section after the stop line (Figure 3) was between 90 pcu/km and 110 pcu/km, and the average value of kq was 100 pcu/km.Figure 3
Traffic density at the intersection.VISSIM does not have a clear approach to determining the position ofkc. Consequently, this study proposes an estimation method. Since km < kc < kj, and the longer LA, the fewer vehicles traveling at critical speed vm, and the closer kc approaches kj, it is assumed that kc can be solved by (5):(5)kc=km+kj2.


## 2.2.2. Simulation Program Settings

As shown in Figure4, the simulation traffic flow direction was from intersection A to B. Each lane was set to 500 m long and 3.25 m wide, with a saturation flow rate of 1,800 pcu/h. The signal-phase timing parameters in this direction were set with the cycle 60 s, green light 20 s, red light 37 s, and amber light 3 s. The vehicle quantity detectors were set upstream of the entrance road, while the vehicle quantity detectors and queue counters were set downstream of the entrance road. The simulation time was 3,600 s.Figure 4
Simulation model and detector settings.Continuous simulation for 60 cycles showed that the vehicle queue started from the 10th cycle, and the 30th cycle started to be stable. To make the test results more stable, the 41st to 60th cycles were chosen as the simulation experiment range with an equivalent difference in the range of ±13 m and a relative error less than ±5% between the simulated and calculated queuing length. The calculated value of the model was very close to the simulated queuing length of VISSIM.The tracking errorσ is used to describe the deviation between the calculated value of the model and the simulated value. The smaller the deviation is, the more reliable the model is. Generally, the model is reliable when the deviation is less than 10.(6)σ=∑iMLmi−LeiM2,where Lmi is the queue length calculated by the model, m; Lei is the queue length of the simulation test, m; and M is the number of cycles.The calculated tracking errorsσ of the single- and double-lane models set in this study were 6.78 and 9.11, respectively. Thus, the model can be considered reliable.


## 3. Switching Threshold of the Signal Control Scheme

### 3.1. Prediction Model for the Remaining Capacity of the Road Section

The maximum capacity of a road section refers to the maximum number of vehicles that can be accommodated under existing traffic conditions. The remaining capacity of the road section between adjacent intersections is one of the important parameters for determining the signal control plan of the downstream intersection. The remaining road capacity can be obtained by calculating the length of the red end of the entrance lane in this direction [11].


#### 3.1.1. Total Road Capacity

Taking the urban road section between adjacent intersections as the research object, the total length of the road section isL, and the upstream and downstream intersections are named A and B, respectively, as shown in Figure 5.Figure 5
The road section being studied.The total capacity of this section is as follows:(7)Q=L−ll+h+1×n,where Q is the total capacity of the road section, pcu; L is the total length of the road section, m; l is the equivalent length of a standard car, m; h is the average space between the rear of the front vehicle and the head of the rear vehicle, m; n is the number of lanes in a certain direction of the road section; and L−l/l+h represents the integer of L−l/l+h.


#### 3.1.2. Road Capacity Occupied by Queued Vehicles

From the above analysis, it can be seen that if the length of the vehicle queue on the road segment isL′, then the capacity of the road segment occupied by the vehicle queue is as follows:(8)Q0=L′−ll+h+1×n,where Q0 is the road capacity occupied by queued vehicles, pcu; L′ is the vehicle queue length on the road section, m.


#### 3.1.3. Remaining Capacity of the Road Section

The remaining capacity of the road section can be obtained by two methods. One is obtained by calculating the difference between the total and occupied capacity shown in (9):(9)Qr=Q−Q0=L−ll+h+1×n−L′−ll+h+1×n,where Qr is the remaining capacity of the road section, pcu.The other is to calculate the length of the unoccupied road section through the vehicle queue length, and the number of vehicles that can be accommodated in this length is the remaining capacity of the road section. The length of the unoccupied section is as follows:(10)L′′=L–L′,where L″ is the unoccupied length of the road section, m.The remaining capacity is as follows:(11)Qr=L′′−ll+h+1×n=L−L′−ll+h+1×n.


### 3.2. Control Scheme Conversion Threshold

To avoid local road network traffic paralysis caused by queuing overflow of minor roads, when the queue length and remaining capacity of minor roads reach a certain limit, the general control mode of main road priority should be adjusted to reduce the minor road queuing length and the overflow risk; when the queue length is reduced to a certain extent, the main road priority control mode could be returned.If the remaining capacity of the minor road in a certain cycle of the signal-controlled intersection is equal to or even less than the number of vehicles entering the minor road from the upstream intersection, that is, whenQr ≤ N1, queuing overflow will cause the upstream intersection of the minor road to lock up to determine the critical value of the scheme conversion. It is combined with (11).(12)L′≥L−l−N1−nl+hn,where N1 is the number of vehicles arriving in the next cycle, pcu.The ratioy1 of queue length to road capacity is taken as the criterion to determine whether or not the minor route is released, namely,(13)y1=L′Q,where y1 is the capacity matching ratio, m/pcu.Equations (12) and (13) are combined to obtain the control scheme conversion threshold [y1] based on the prediction model of minor road residual capacity.(14)y1≥y1=nL−l−N1−nl+hl+hn2L+h.


## 3.1. Prediction Model for the Remaining Capacity of the Road Section

The maximum capacity of a road section refers to the maximum number of vehicles that can be accommodated under existing traffic conditions. The remaining capacity of the road section between adjacent intersections is one of the important parameters for determining the signal control plan of the downstream intersection. The remaining road capacity can be obtained by calculating the length of the red end of the entrance lane in this direction [11].


### 3.1.1. Total Road Capacity

Taking the urban road section between adjacent intersections as the research object, the total length of the road section isL, and the upstream and downstream intersections are named A and B, respectively, as shown in Figure 5.Figure 5
The road section being studied.The total capacity of this section is as follows:(7)Q=L−ll+h+1×n,where Q is the total capacity of the road section, pcu; L is the total length of the road section, m; l is the equivalent length of a standard car, m; h is the average space between the rear of the front vehicle and the head of the rear vehicle, m; n is the number of lanes in a certain direction of the road section; and L−l/l+h represents the integer of L−l/l+h.


### 3.1.2. Road Capacity Occupied by Queued Vehicles

From the above analysis, it can be seen that if the length of the vehicle queue on the road segment isL′, then the capacity of the road segment occupied by the vehicle queue is as follows:(8)Q0=L′−ll+h+1×n,where Q0 is the road capacity occupied by queued vehicles, pcu; L′ is the vehicle queue length on the road section, m.


### 3.1.3. Remaining Capacity of the Road Section

The remaining capacity of the road section can be obtained by two methods. One is obtained by calculating the difference between the total and occupied capacity shown in (9):(9)Qr=Q−Q0=L−ll+h+1×n−L′−ll+h+1×n,where Qr is the remaining capacity of the road section, pcu.The other is to calculate the length of the unoccupied road section through the vehicle queue length, and the number of vehicles that can be accommodated in this length is the remaining capacity of the road section. The length of the unoccupied section is as follows:(10)L′′=L–L′,where L″ is the unoccupied length of the road section, m.The remaining capacity is as follows:(11)Qr=L′′−ll+h+1×n=L−L′−ll+h+1×n.


## 3.1.1. Total Road Capacity

Taking the urban road section between adjacent intersections as the research object, the total length of the road section isL, and the upstream and downstream intersections are named A and B, respectively, as shown in Figure 5.Figure 5
The road section being studied.The total capacity of this section is as follows:(7)Q=L−ll+h+1×n,where Q is the total capacity of the road section, pcu; L is the total length of the road section, m; l is the equivalent length of a standard car, m; h is the average space between the rear of the front vehicle and the head of the rear vehicle, m; n is the number of lanes in a certain direction of the road section; and L−l/l+h represents the integer of L−l/l+h.


## 3.1.2. Road Capacity Occupied by Queued Vehicles

From the above analysis, it can be seen that if the length of the vehicle queue on the road segment isL′, then the capacity of the road segment occupied by the vehicle queue is as follows:(8)Q0=L′−ll+h+1×n,where Q0 is the road capacity occupied by queued vehicles, pcu; L′ is the vehicle queue length on the road section, m.


## 3.1.3. Remaining Capacity of the Road Section

The remaining capacity of the road section can be obtained by two methods. One is obtained by calculating the difference between the total and occupied capacity shown in (9):(9)Qr=Q−Q0=L−ll+h+1×n−L′−ll+h+1×n,where Qr is the remaining capacity of the road section, pcu.The other is to calculate the length of the unoccupied road section through the vehicle queue length, and the number of vehicles that can be accommodated in this length is the remaining capacity of the road section. The length of the unoccupied section is as follows:(10)L′′=L–L′,where L″ is the unoccupied length of the road section, m.The remaining capacity is as follows:(11)Qr=L′′−ll+h+1×n=L−L′−ll+h+1×n.


## 3.2. Control Scheme Conversion Threshold

To avoid local road network traffic paralysis caused by queuing overflow of minor roads, when the queue length and remaining capacity of minor roads reach a certain limit, the general control mode of main road priority should be adjusted to reduce the minor road queuing length and the overflow risk; when the queue length is reduced to a certain extent, the main road priority control mode could be returned.If the remaining capacity of the minor road in a certain cycle of the signal-controlled intersection is equal to or even less than the number of vehicles entering the minor road from the upstream intersection, that is, whenQr ≤ N1, queuing overflow will cause the upstream intersection of the minor road to lock up to determine the critical value of the scheme conversion. It is combined with (11).(12)L′≥L−l−N1−nl+hn,where N1 is the number of vehicles arriving in the next cycle, pcu.The ratioy1 of queue length to road capacity is taken as the criterion to determine whether or not the minor route is released, namely,(13)y1=L′Q,where y1 is the capacity matching ratio, m/pcu.Equations (12) and (13) are combined to obtain the control scheme conversion threshold [y1] based on the prediction model of minor road residual capacity.(14)y1≥y1=nL−l−N1−nl+hl+hn2L+h.


## 4. Multiparameter Coordinated Control Model for Primary and Minor Roads

### 4.1. Control Conditions

The research object is an urban intersection signalized with four-phase and permanent cycle time. The signal optimization scheme studied in this section is suitable for intersections where the minor roads are in an oversaturated state. A multiobjective optimization function to coordinate the vehicle queue length between the primary and minor roads and minimize the total delay at the intersection was established and solved by a genetic algorithm. The queue length at the intersection adopted the above-mentioned calculation method.


### 4.2. Multiobjective Optimization Model of the Signal Control

#### 4.2.1. Multiobjective Optimization Genetic Algorithm

The mathematical model of the multiobjective optimization problem is as follows:(15)Vminfx=fx1,fx2,⋯fxnT,s.t.xi∈X,X⊆Rm,where Vmin is the vector minimization, and namely, the subobjective functions in the vector objective function f(x) are minimized as much as possible.


#### 4.2.2. Weight Coefficient Method Conversion

For a multiobjective optimization problem, if each subobjective functionfi(x) (i = 1, 2, …, n) is given a weight ωi(i = 1, 2, …, n), where ωi is the corresponding fi(x) in the importance of the multiobjective optimization function, then the linear weighted sum of each subobjective function fi(x) can be expressed as follows:(16)u=∑i=1nωifix.Ifu is used as the evaluation function of the multiobjective optimization problem, the multiobjective optimization problem can be transformed into a single-objective optimization problem, and the single-objective optimization genetic algorithm can be used to solve the multiobjective problem.


### 4.3. Optimization Objective Function and Intersection Model

#### 4.3.1. Delay Model at Signalized Intersections

Vehicle delay at intersections refers to the loss of travel time caused by vehicles being controlled by signals at intersections. According to the research, deterministic queuing theory is applicable to the delay evaluation of oversaturated intersections where the vehicle arrival rate is greater than the capacity [12]. The calculation formula is as follows [13]:(17)p=Nq,y=p−1NT2,d=R2+ypq,where N is capacity, pcu/h; q is traffic arrival rate; p is saturation; d is average delay per vehicle in each lane, s; R is red light time, s; y is average supersaturated per hour number of stranded vehicles, pcu/h; and T is the duration of the investigation, generally 15 min.The average delay of each entrance is calculated according to the weighted average of the vehicle delays in each lane of the entrance:(18)dj=∑idijqij∑iqij,where dj is the average delay of each vehicle in each entrance, s; dij is the average delay per vehicle of Lane i in entrance j, s; and qij is the vehicle arrival rate in lane i of entrance j, pcu/h.The average delay per vehicle in a signal cycle at a certain intersection is the weighted average of the delays of each entrance.(19)dI=∑jdjqj∑jqj,where dI is the average delay of each vehicle at the intersection, s; qj is the vehicle arrival rate in entrance j, pcu/h.


#### 4.3.2. Queue Balancing Strategy

The vehicle queue length balancing strategy allocates more green time to the direction where the ratio of queue length to capacity is large to avoid long queue or overflow in a certain direction (usually on minor roads) to disperse the long queue of vehicles in a timely manner and prevent more serious traffic problems [14].According to the above thoughts, the control objective of a spot signalized intersection can be briefly described as follows:(20)Li′¯=L1′+L2′+L3′+L4′4,LE=minL1′−Li′¯L12+L2′−Li′¯L22+L3′−Li′¯L32+L4′−Li′¯L42,where LE is the balanced performance index of queuing length; Li′ is the queuing length at the end of red of each entrance, m; and Li is the length of the road section.


#### 4.3.3. Multiobjective Optimization Model

The objective function is that the average delay of vehicles tends to be minimal, and the queue length of each entrance tends to balance at the intersection. The weighted coefficient method is used to transform the dual-objective function into a single-objective function. The optimization conditions and constraints are as follows:(21)Fx=minαdOdI+βLOLE,s.t.Cmin≤C≤Cmax,gimin≤gi≤gimax,dI=∑jdjqj∑jqj,LE=minL1′−Li′¯L12+L2′−Li′¯L22+L3′−Li′¯L32+L4′−Li′¯L42,Li′≤Li,α+β=1,where α and β are weighting coefficients; dO and LO are the performance indicators for the average delay of vehicles at intersections and the line length balance of the optimized timing plan; dI is the average delay of vehicles at the intersections of the original timing plan; LE is the balanced performance index of queuing length; C is the signal period, s; and giis the effective green light duration, s.


## 4.1. Control Conditions

The research object is an urban intersection signalized with four-phase and permanent cycle time. The signal optimization scheme studied in this section is suitable for intersections where the minor roads are in an oversaturated state. A multiobjective optimization function to coordinate the vehicle queue length between the primary and minor roads and minimize the total delay at the intersection was established and solved by a genetic algorithm. The queue length at the intersection adopted the above-mentioned calculation method.


## 4.2. Multiobjective Optimization Model of the Signal Control

### 4.2.1. Multiobjective Optimization Genetic Algorithm

The mathematical model of the multiobjective optimization problem is as follows:(15)Vminfx=fx1,fx2,⋯fxnT,s.t.xi∈X,X⊆Rm,where Vmin is the vector minimization, and namely, the subobjective functions in the vector objective function f(x) are minimized as much as possible.


### 4.2.2. Weight Coefficient Method Conversion

For a multiobjective optimization problem, if each subobjective functionfi(x) (i = 1, 2, …, n) is given a weight ωi(i = 1, 2, …, n), where ωi is the corresponding fi(x) in the importance of the multiobjective optimization function, then the linear weighted sum of each subobjective function fi(x) can be expressed as follows:(16)u=∑i=1nωifix.Ifu is used as the evaluation function of the multiobjective optimization problem, the multiobjective optimization problem can be transformed into a single-objective optimization problem, and the single-objective optimization genetic algorithm can be used to solve the multiobjective problem.


## 4.2.1. Multiobjective Optimization Genetic Algorithm

The mathematical model of the multiobjective optimization problem is as follows:(15)Vminfx=fx1,fx2,⋯fxnT,s.t.xi∈X,X⊆Rm,where Vmin is the vector minimization, and namely, the subobjective functions in the vector objective function f(x) are minimized as much as possible.


## 4.2.2. Weight Coefficient Method Conversion

For a multiobjective optimization problem, if each subobjective functionfi(x) (i = 1, 2, …, n) is given a weight ωi(i = 1, 2, …, n), where ωi is the corresponding fi(x) in the importance of the multiobjective optimization function, then the linear weighted sum of each subobjective function fi(x) can be expressed as follows:(16)u=∑i=1nωifix.Ifu is used as the evaluation function of the multiobjective optimization problem, the multiobjective optimization problem can be transformed into a single-objective optimization problem, and the single-objective optimization genetic algorithm can be used to solve the multiobjective problem.


## 4.3. Optimization Objective Function and Intersection Model

### 4.3.1. Delay Model at Signalized Intersections

Vehicle delay at intersections refers to the loss of travel time caused by vehicles being controlled by signals at intersections. According to the research, deterministic queuing theory is applicable to the delay evaluation of oversaturated intersections where the vehicle arrival rate is greater than the capacity [12]. The calculation formula is as follows [13]:(17)p=Nq,y=p−1NT2,d=R2+ypq,where N is capacity, pcu/h; q is traffic arrival rate; p is saturation; d is average delay per vehicle in each lane, s; R is red light time, s; y is average supersaturated per hour number of stranded vehicles, pcu/h; and T is the duration of the investigation, generally 15 min.The average delay of each entrance is calculated according to the weighted average of the vehicle delays in each lane of the entrance:(18)dj=∑idijqij∑iqij,where dj is the average delay of each vehicle in each entrance, s; dij is the average delay per vehicle of Lane i in entrance j, s; and qij is the vehicle arrival rate in lane i of entrance j, pcu/h.The average delay per vehicle in a signal cycle at a certain intersection is the weighted average of the delays of each entrance.(19)dI=∑jdjqj∑jqj,where dI is the average delay of each vehicle at the intersection, s; qj is the vehicle arrival rate in entrance j, pcu/h.


### 4.3.2. Queue Balancing Strategy

The vehicle queue length balancing strategy allocates more green time to the direction where the ratio of queue length to capacity is large to avoid long queue or overflow in a certain direction (usually on minor roads) to disperse the long queue of vehicles in a timely manner and prevent more serious traffic problems [14].According to the above thoughts, the control objective of a spot signalized intersection can be briefly described as follows:(20)Li′¯=L1′+L2′+L3′+L4′4,LE=minL1′−Li′¯L12+L2′−Li′¯L22+L3′−Li′¯L32+L4′−Li′¯L42,where LE is the balanced performance index of queuing length; Li′ is the queuing length at the end of red of each entrance, m; and Li is the length of the road section.


### 4.3.3. Multiobjective Optimization Model

The objective function is that the average delay of vehicles tends to be minimal, and the queue length of each entrance tends to balance at the intersection. The weighted coefficient method is used to transform the dual-objective function into a single-objective function. The optimization conditions and constraints are as follows:(21)Fx=minαdOdI+βLOLE,s.t.Cmin≤C≤Cmax,gimin≤gi≤gimax,dI=∑jdjqj∑jqj,LE=minL1′−Li′¯L12+L2′−Li′¯L22+L3′−Li′¯L32+L4′−Li′¯L42,Li′≤Li,α+β=1,where α and β are weighting coefficients; dO and LO are the performance indicators for the average delay of vehicles at intersections and the line length balance of the optimized timing plan; dI is the average delay of vehicles at the intersections of the original timing plan; LE is the balanced performance index of queuing length; C is the signal period, s; and giis the effective green light duration, s.


## 4.3.1. Delay Model at Signalized Intersections

Vehicle delay at intersections refers to the loss of travel time caused by vehicles being controlled by signals at intersections. According to the research, deterministic queuing theory is applicable to the delay evaluation of oversaturated intersections where the vehicle arrival rate is greater than the capacity [12]. The calculation formula is as follows [13]:(17)p=Nq,y=p−1NT2,d=R2+ypq,where N is capacity, pcu/h; q is traffic arrival rate; p is saturation; d is average delay per vehicle in each lane, s; R is red light time, s; y is average supersaturated per hour number of stranded vehicles, pcu/h; and T is the duration of the investigation, generally 15 min.The average delay of each entrance is calculated according to the weighted average of the vehicle delays in each lane of the entrance:(18)dj=∑idijqij∑iqij,where dj is the average delay of each vehicle in each entrance, s; dij is the average delay per vehicle of Lane i in entrance j, s; and qij is the vehicle arrival rate in lane i of entrance j, pcu/h.The average delay per vehicle in a signal cycle at a certain intersection is the weighted average of the delays of each entrance.(19)dI=∑jdjqj∑jqj,where dI is the average delay of each vehicle at the intersection, s; qj is the vehicle arrival rate in entrance j, pcu/h.


## 4.3.2. Queue Balancing Strategy

The vehicle queue length balancing strategy allocates more green time to the direction where the ratio of queue length to capacity is large to avoid long queue or overflow in a certain direction (usually on minor roads) to disperse the long queue of vehicles in a timely manner and prevent more serious traffic problems [14].According to the above thoughts, the control objective of a spot signalized intersection can be briefly described as follows:(20)Li′¯=L1′+L2′+L3′+L4′4,LE=minL1′−Li′¯L12+L2′−Li′¯L22+L3′−Li′¯L32+L4′−Li′¯L42,where LE is the balanced performance index of queuing length; Li′ is the queuing length at the end of red of each entrance, m; and Li is the length of the road section.


## 4.3.3. Multiobjective Optimization Model

The objective function is that the average delay of vehicles tends to be minimal, and the queue length of each entrance tends to balance at the intersection. The weighted coefficient method is used to transform the dual-objective function into a single-objective function. The optimization conditions and constraints are as follows:(21)Fx=minαdOdI+βLOLE,s.t.Cmin≤C≤Cmax,gimin≤gi≤gimax,dI=∑jdjqj∑jqj,LE=minL1′−Li′¯L12+L2′−Li′¯L22+L3′−Li′¯L32+L4′−Li′¯L42,Li′≤Li,α+β=1,where α and β are weighting coefficients; dO and LO are the performance indicators for the average delay of vehicles at intersections and the line length balance of the optimized timing plan; dI is the average delay of vehicles at the intersections of the original timing plan; LE is the balanced performance index of queuing length; C is the signal period, s; and giis the effective green light duration, s.


## 5. Case Study of an Intersection

### 5.1. Current Situation of Intersections

The intersection of Zhengyi Road and Keyan Street in the Harbin urban area was taken as a study case. Zhengyi Road is in the north-south direction with 12 two-way lanes, and Keyan Street is in the east-west direction with 4 two-way lanes. It is a typical intersection of primary and minor roads with a large capacity gap. The basic situation is shown in Table2. There are three signal phases at the crossing: one phase is going straight in the north-south direction, one phase is turning left in the north-south direction, and the other phase is going straight and turning left in the east-west direction. The signal timing plan is shown in Figure 6.Table 2
The condition of each entrance at the intersection.
Entrance drivewayDistance from the upstream intersection (m)Grade of roadNumber of lanesWest entrance600Minor road2East entrance6002South entrance1100Primary road5North entrance12007Figure 6
Timing scheme of intersection.Part of the traffic data collected by the video observation analysis method is shown in Table3.Table 3
Traffic volume and performance indicators at the intersection.
Intersection entranceLane directionMin traffic volume (pcu)k hour traffic volume (pcu/h)Saturation flow rate (pcu/h)Green splitFlow rate ratioSaturationWest entranceStraight-left17168416360.310.421.33Straight-right17469616360.310.431.36East entranceStraight-left15662416360.310.381.22Straight-right16264816360.310.401.26South entranceStraight-right21686416360.470.531.13Straight21084016360.470.511.10Straight20782816360.470.511.09Straight21385216360.470.521.12Straight21686416360.470.531.13Left3614416360.140.090.61Left3012016360.140.070.51North entranceStraight-right20481616360.470.501.07Straight21084016360.470.511.10Straight21686416360.470.531.13Straight20481616360.470.501.07Left3915616360.140.100.66Detectors are set at the beginning and end of the entrance lane of the intersection to observe and record the number of vehicles passing by the detectors; therefore, the average queuing length of each entrance lane of the intersection can be obtained. Table4 shows the average value of multiperiod data.Table 4
The average queue length of each entrance at the intersection.
Intersection entranceNumber of vehicles remaining (pcu)Number of vehicles arriving upstream (pcu)Number of vehicles leaving downstream (pcu)Queue length (m)West entrance1654035511East entrance1053832332South entrance211146135191North entrance133113108166The average delay per vehicle of each entrance and average delay per vehicle of the intersection were calculated by (17–21), and the results are shown in Table5.Table 5
Delay data at the intersection.
Intersection entranceAverage delay per vehicle of the approaches/ (s)Average delay per vehicle of the intersection/ (s)West entrance48.0738.22East entrance45.49South entrance35.70North entrance34.93


### 5.2. Optimization Algorithm Solution

#### 5.2.1. The Judgment of Scheme Conversion

The parameters of queuing length and road capacity involved in (13) mainly include L′, l, h, and n. The equivalent length of vehicle l was 6 m, and the average space between the rear of the front vehicle and the head of the rear vehicle h was 2 m. According to Table 4, the average queuing length of the west entrance L′ was 511 m, and the number of lanes n was 2. The appropriate capacity matching ratio y1 was calculated as 3.4 m/pcu.The average number of vehicles entering the entrance lane from the start of the green light to the end of the red light in this signal cycleN1 was 40 pcu. By substituting the parameters into (14), the transition threshold [y1] was calculated to be 2.9; hence, y1 = 3.4 > [y1] = 2.9. The traffic flow state met the standard of scheme conversion, so the control method proposed in this study can be used.


#### 5.2.2. Determination of Weight Coefficient

The value of the weight coefficientsα and β in the optimization algorithm to solve the problem is usually determined by the service level provided by the main road. If the service level of the main road is relatively high, reducing the queue length of the minor road should be the main improvement index, that is, α <β. If the service level of the main road is poor, reducing the road delay should be the main improvement index, and reducing the queue length will become a secondary factor, that is, α >β. When the service level is medium, α = β. The value range is shown in Table 6 [6].Table 6
Value range of weight coefficient.
Service level of main roadαβService level of main roadαβHigh service level (A or B)0.30.7Low service level (E or F)0.70.3Medium service level (C or D)0.50.5———Analyzing the intersection of Zhengyi Road and Keyan Street, the average delay of imported vehicles from the north was 34.93 s, and the corresponding service level was C; the average delay of imported vehicles from the south was 35.70 s, and the corresponding service level was D. Therefore,α = 0.5, β = 0.5.


### 5.3. Comparison before and after Optimization

The collected data were input into the optimization model and solved by a genetic algorithm to obtain the optimized signal timing scheme (as shown in Figure7) and the average vehicle delay and queue length of the intersection under the timing scheme (as shown in Table 7). The applicability and effect of the model were tested by comparing the delay and queue length before and after optimization.Figure 7
Optimized timing scheme of intersection.Table 7
Comparison of queue length and delay at the intersection before and after signal timing optimization.
EntranceLength of road (m)Average queue lengthAverage delay per vehicle of the approachesAverage delay per vehicle of the intersectionBefore optimization (m)After optimization (m)Variation (%)Before optimization (s)After optimization (s)Variation (%)Before optimization (s)After optimization (s)Variation (%)West entrance600511350−31.5%48.0739.94−16.9138.2240.686.44East entrance600332166−50%45.4937.78−16.95South entrance11001912078.4%35.7045.4916.67North entrance120016618511.4%34.9340.7716.72Table7 shows that the average delay per vehicle on the main road in the north-south direction increased by approximately 16.7%, and the average queue length increased by 8.4%–11.4%. At the same time, the average delay per vehicle on the minor road in the east-west direction decreased by approximately 16.9%. The average queue length was significantly reduced by 31.5%–50%; the average delay per vehicle at the intersection increased by 6.44%. Figures 8(a) and 8(b) show the variations in various indicators before and after coordinated optimization.Figure 8
Comparison of traffic performance index before and after the signal control optimization at the intersection. (a) Average delay per vehicle. (b) Average queue length.
(a)(b)Under the original control scheme, the queue length at the west entrance was close to the full length of the road section, while the queue length at the east entrance was close to 2/3 of its own road section length. Therefore, there were risks of an overflow caused by overlong queues in both entrances of the minor road. After optimization, the queue length of the west entrance was reduced to approximately 1/2 of the length of the road section in its direction, and the queue length of the east entrance was reduced to approximately 1/6 of the length of the road section in its direction, which greatly reduced the risk of queue overflow. Regardless of whether the signal scheme was optimized, the queue length of the main road remained approximately 1/5 of the length of its own road section, and the road load in this direction did not significantly increase. It can be thus considered that the optimization effect was relatively balanced, and the optimization scheme was reasonable and effective.


## 5.1. Current Situation of Intersections

The intersection of Zhengyi Road and Keyan Street in the Harbin urban area was taken as a study case. Zhengyi Road is in the north-south direction with 12 two-way lanes, and Keyan Street is in the east-west direction with 4 two-way lanes. It is a typical intersection of primary and minor roads with a large capacity gap. The basic situation is shown in Table2. There are three signal phases at the crossing: one phase is going straight in the north-south direction, one phase is turning left in the north-south direction, and the other phase is going straight and turning left in the east-west direction. The signal timing plan is shown in Figure 6.Table 2
The condition of each entrance at the intersection.
Entrance drivewayDistance from the upstream intersection (m)Grade of roadNumber of lanesWest entrance600Minor road2East entrance6002South entrance1100Primary road5North entrance12007Figure 6
Timing scheme of intersection.Part of the traffic data collected by the video observation analysis method is shown in Table3.Table 3
Traffic volume and performance indicators at the intersection.
Intersection entranceLane directionMin traffic volume (pcu)k hour traffic volume (pcu/h)Saturation flow rate (pcu/h)Green splitFlow rate ratioSaturationWest entranceStraight-left17168416360.310.421.33Straight-right17469616360.310.431.36East entranceStraight-left15662416360.310.381.22Straight-right16264816360.310.401.26South entranceStraight-right21686416360.470.531.13Straight21084016360.470.511.10Straight20782816360.470.511.09Straight21385216360.470.521.12Straight21686416360.470.531.13Left3614416360.140.090.61Left3012016360.140.070.51North entranceStraight-right20481616360.470.501.07Straight21084016360.470.511.10Straight21686416360.470.531.13Straight20481616360.470.501.07Left3915616360.140.100.66Detectors are set at the beginning and end of the entrance lane of the intersection to observe and record the number of vehicles passing by the detectors; therefore, the average queuing length of each entrance lane of the intersection can be obtained. Table4 shows the average value of multiperiod data.Table 4
The average queue length of each entrance at the intersection.
Intersection entranceNumber of vehicles remaining (pcu)Number of vehicles arriving upstream (pcu)Number of vehicles leaving downstream (pcu)Queue length (m)West entrance1654035511East entrance1053832332South entrance211146135191North entrance133113108166The average delay per vehicle of each entrance and average delay per vehicle of the intersection were calculated by (17–21), and the results are shown in Table5.Table 5
Delay data at the intersection.
Intersection entranceAverage delay per vehicle of the approaches/ (s)Average delay per vehicle of the intersection/ (s)West entrance48.0738.22East entrance45.49South entrance35.70North entrance34.93


## 5.2. Optimization Algorithm Solution

### 5.2.1. The Judgment of Scheme Conversion

The parameters of queuing length and road capacity involved in (13) mainly include L′, l, h, and n. The equivalent length of vehicle l was 6 m, and the average space between the rear of the front vehicle and the head of the rear vehicle h was 2 m. According to Table 4, the average queuing length of the west entrance L′ was 511 m, and the number of lanes n was 2. The appropriate capacity matching ratio y1 was calculated as 3.4 m/pcu.The average number of vehicles entering the entrance lane from the start of the green light to the end of the red light in this signal cycleN1 was 40 pcu. By substituting the parameters into (14), the transition threshold [y1] was calculated to be 2.9; hence, y1 = 3.4 > [y1] = 2.9. The traffic flow state met the standard of scheme conversion, so the control method proposed in this study can be used.


### 5.2.2. Determination of Weight Coefficient

The value of the weight coefficientsα and β in the optimization algorithm to solve the problem is usually determined by the service level provided by the main road. If the service level of the main road is relatively high, reducing the queue length of the minor road should be the main improvement index, that is, α <β. If the service level of the main road is poor, reducing the road delay should be the main improvement index, and reducing the queue length will become a secondary factor, that is, α >β. When the service level is medium, α = β. The value range is shown in Table 6 [6].Table 6
Value range of weight coefficient.
Service level of main roadαβService level of main roadαβHigh service level (A or B)0.30.7Low service level (E or F)0.70.3Medium service level (C or D)0.50.5———Analyzing the intersection of Zhengyi Road and Keyan Street, the average delay of imported vehicles from the north was 34.93 s, and the corresponding service level was C; the average delay of imported vehicles from the south was 35.70 s, and the corresponding service level was D. Therefore,α = 0.5, β = 0.5.


## 5.2.1. The Judgment of Scheme Conversion

The parameters of queuing length and road capacity involved in (13) mainly include L′, l, h, and n. The equivalent length of vehicle l was 6 m, and the average space between the rear of the front vehicle and the head of the rear vehicle h was 2 m. According to Table 4, the average queuing length of the west entrance L′ was 511 m, and the number of lanes n was 2. The appropriate capacity matching ratio y1 was calculated as 3.4 m/pcu.The average number of vehicles entering the entrance lane from the start of the green light to the end of the red light in this signal cycleN1 was 40 pcu. By substituting the parameters into (14), the transition threshold [y1] was calculated to be 2.9; hence, y1 = 3.4 > [y1] = 2.9. The traffic flow state met the standard of scheme conversion, so the control method proposed in this study can be used.


## 5.2.2. Determination of Weight Coefficient

The value of the weight coefficientsα and β in the optimization algorithm to solve the problem is usually determined by the service level provided by the main road. If the service level of the main road is relatively high, reducing the queue length of the minor road should be the main improvement index, that is, α <β. If the service level of the main road is poor, reducing the road delay should be the main improvement index, and reducing the queue length will become a secondary factor, that is, α >β. When the service level is medium, α = β. The value range is shown in Table 6 [6].Table 6
Value range of weight coefficient.
Service level of main roadαβService level of main roadαβHigh service level (A or B)0.30.7Low service level (E or F)0.70.3Medium service level (C or D)0.50.5———Analyzing the intersection of Zhengyi Road and Keyan Street, the average delay of imported vehicles from the north was 34.93 s, and the corresponding service level was C; the average delay of imported vehicles from the south was 35.70 s, and the corresponding service level was D. Therefore,α = 0.5, β = 0.5.


## 5.3. Comparison before and after Optimization

The collected data were input into the optimization model and solved by a genetic algorithm to obtain the optimized signal timing scheme (as shown in Figure7) and the average vehicle delay and queue length of the intersection under the timing scheme (as shown in Table 7). The applicability and effect of the model were tested by comparing the delay and queue length before and after optimization.Figure 7
Optimized timing scheme of intersection.Table 7
Comparison of queue length and delay at the intersection before and after signal timing optimization.
EntranceLength of road (m)Average queue lengthAverage delay per vehicle of the approachesAverage delay per vehicle of the intersectionBefore optimization (m)After optimization (m)Variation (%)Before optimization (s)After optimization (s)Variation (%)Before optimization (s)After optimization (s)Variation (%)West entrance600511350−31.5%48.0739.94−16.9138.2240.686.44East entrance600332166−50%45.4937.78−16.95South entrance11001912078.4%35.7045.4916.67North entrance120016618511.4%34.9340.7716.72Table7 shows that the average delay per vehicle on the main road in the north-south direction increased by approximately 16.7%, and the average queue length increased by 8.4%–11.4%. At the same time, the average delay per vehicle on the minor road in the east-west direction decreased by approximately 16.9%. The average queue length was significantly reduced by 31.5%–50%; the average delay per vehicle at the intersection increased by 6.44%. Figures 8(a) and 8(b) show the variations in various indicators before and after coordinated optimization.Figure 8
Comparison of traffic performance index before and after the signal control optimization at the intersection. (a) Average delay per vehicle. (b) Average queue length.
(a)(b)Under the original control scheme, the queue length at the west entrance was close to the full length of the road section, while the queue length at the east entrance was close to 2/3 of its own road section length. Therefore, there were risks of an overflow caused by overlong queues in both entrances of the minor road. After optimization, the queue length of the west entrance was reduced to approximately 1/2 of the length of the road section in its direction, and the queue length of the east entrance was reduced to approximately 1/6 of the length of the road section in its direction, which greatly reduced the risk of queue overflow. Regardless of whether the signal scheme was optimized, the queue length of the main road remained approximately 1/5 of the length of its own road section, and the road load in this direction did not significantly increase. It can be thus considered that the optimization effect was relatively balanced, and the optimization scheme was reasonable and effective.


## 6. Conclusions

Through theoretical research, simulation experiments, and case analysis, the following conclusions can be drawn:(1)
When the supersaturated traffic flow continues to develop to a certain extent, the main contradiction of the intersection with the large capacity disparity between the primary and minor road will change from ensuring traffic efficiency to avoiding local traffic blocking and balancing traffic demand, and the control strategy should also be accordingly changed. The multiparameter coordinated control method comprehensively considers the capacity, delay, queue length, and service level of the main and minor roads, which helps to make full use of the capacity of the main road to control the minor road queuing length and queue overflow risk and balance the traffic demand of the primary and minor roads.(2)
The case study showed that the average delay per vehicle at the intersection with multiparameter coordinated control increased by 6.44%, and the queue length of the main road increased by 8%–11%. However, the average delay per vehicle decreased by approximately 17% and the queue length decreased by 30%–50% on minor roads. The results show that the optimization method can significantly reduce the minor road queuing length and delay while slightly increasing the queuing length on the main road and the average delay per vehicle at the intersection, avoiding the traffic jam of the local road network caused by queuing overflow, and the control effect is relatively balanced and reasonable.



---

*Source: 5662371-2021-12-31.xml*