# Improved Road-Network-Flow Control Strategy Based on Macroscopic Fundamental Diagrams and Queuing Length in Connected-Vehicle Network

Authors: Xiaohui Lin; Jianmin Xu; Peiqun Lin; Chengtao Cao; Jiahui Liu
Journal: Mathematical Problems in Engineering
 (2017)

---

## Abstract

Connected-vehicles network provides opportunities and conditions for improving traffic signal control, and macroscopic fundamental diagrams (MFD) can control the road network at the macrolevel effectively. This paper integrated proposed real-time access to the number of mobile vehicles and the maximum road queuing length in the Connected-vehicles network. Moreover, when implementing a simple control strategy to limit the boundary flow of a road network based on MFD, we determined whether the maximum queuing length of each boundary section exceeds the road-safety queuing length in real-time calculations and timely adjusted the road-network influx rate to avoid the overflow phenomenon in the boundary section. We established a road-network microtraffic simulation model in VISSIM software taking a district as the experimental area, determined MFD of the region based on the number of mobile vehicles, and weighted traffic volume of the road network. When the road network was tending to saturate, we implemented a simple control strategy and our algorithm limits the boundary flow. Finally, we compared the traffic signal control indicators with three strategies:(1) no control strategy, (2) boundary control, and (3) boundary control with limiting queue strategy. The results show that our proposed algorithm is better than the other two.


---

## Body

## 1. Introduction

With the rapid development of the social economy, vehicle ownership has surged, causing urban traffic congestion problems and bottlenecks in urban development. To reduce vehicle-delay time and queuing length and ease traffic congestion, advanced traffic-control technologies are being used, and intelligent traffic signal control systems are implemented in largest cities [1–3]. However, as traffic volume continues to increase, urban traffic appears oversaturated, and the effectiveness of the original traffic-control system is reduced.Daganzo et al. [4–9] researched many traffic-data reports and found that there was objective regularity in the urban traffic network. In other words, there is a connection between the traffic condition of the road network and the number of mobile vehicles, which is called the macroscopic fundamental diagrams (MFDs). He et al. [10] presented a figure-eight hysteresis pattern of MFDs for the 3rd ring urban freeway in Beijing, China. The observation is unveiled to be the results of the counterclockwise loop in the figure-eight hysteresis pattern and the association between lower occupancy variance and lower mean occupancy.Some other scholars have proposed to control the traffic in oversaturated areas using MFD theory to improve the traffic congestion in oversaturated areas. For example, Yan et al. [11] proposed a novel iterative learning control (ILC) strategy for traffic signals of urban road networks using the repeatability feature of traffic flow. Zhong et al. [12] explored a new robust perimeter control framework for dynamic traffic networks with parameter uncertainty (on the MFD) and exogenous disturbance induced by travel demand. Ji et al. [13] proposed a feedback gating control policy which can be used to mitigate network congestion by adjusting signal timings of gating intersections based on MFD. Girault et al. [14] examined the impacts of signal coordination on an idealized grid network using the AIMSUN microsimulation software. Han and Moutarde [15] pursued to describe the typical temporal patterns of the global traffic states and achieve long-term prediction of the large-scale traffic evolution in a unified data-mining framework. Geroliminis et al. [16] proposed an optimal perimeter control for two-region urban cities with the use of MFDs. Yi-Man et al. [17] proposed a new traffic management method that focuses on regional traffic volume dynamic control (based on macroscopic fundamental diagram and gating measure) and supplemented by conventional optimization. An et al. [18] proposed four-step network partition approach to solve the problem of heterogeneous network partitioning, which utilizes the concept of lambda-connectedness and the technique of region growing. Lin [19, 20] also has proposed a simple control strategy to limit the boundary flow of a road network based on MFD and verified its effectiveness. In our further study, strategies that limit the peripheral traffic flow on the road network should avoid the situation of upstream intersection congestion caused by overflow of vehicle queues at the intersection where peripheral flow is limited. In addition, we found that determining whether the boundary section occurs the overflow phenomenon has become the key to the problem.Recently, more and more developed and developing countries have been vigorously promoting vehicle network technologies because of their great potentials in the intelligent transportation systems. In the vehicle network, vehicle location, speed, and other information can be uploaded in real-time to the command centre through the vehicle terminal and roadside unit to provide a reliable means to determine the number of vehicles and queuing length of the road network and to provide opportunities and conditions for improving the traffic signal controllers.In this new study, we proposed a control strategy to limit road-network boundary traffic based on MFD and queuing length that real-time accesses the number of vehicles in road network and the maximum queuing length in the road section based on the MFD. Moreover, when implementing the road traffic-control strategy in the road network, our strategy based on the MFD helps to determine whether the maximum queuing length of each boundary section exceeds the road safety queue length or not and timely adjust the influx rate of road network to avoid the overflow phenomenon of the boundary section.


## 2. Methodology

### 2.1. Basic Assumptions

For the study, the following assumptions are made:(1)
All the vehicles are equipped with GPS in connected-vehicle network, which can achieve the location, speed, and other information to the signal control device of the intersection.(2)
The phase of the road boundary intersections used the mode of individual release of each import.(3)
The traffic flow in the studied road network is oversaturated.(4)
The studied road network with relatively uniform traffic density (homogeneous network) has macroscopic fundamental diagram.


### 2.2. Analysis of Microscopic Fundamental Diagrams

According to MFD theory, the formula of relevant parameters is the following:(1)N=∑ikili,qw=∑iqili∑ili,kw=∑ikili∑ili,ow=kw•s=∑ioili∑ili,where N represents road-network vehicles (pcu); qw, kw, and ow represent weighted traffic flow (pcu/h), weighted density (pcu/km), and weighted time occupancy rate, respectively; i and li represent section i and the length of this section (km); qi, ki, and oi represent the flow rate (pcu/h), density (pcu/km), and time occupancy of section i, respectively; and s represents the average of vehicle lengths.According to the MFD theory, the relationship between the weighted traffic (qw) and the number of vehicles (N) in the urban road network can be established, as shown in Figure 1. When N approaches Nc (critical vehicle number), the road network begins to enter the congested state from the noncongested state.Figure 1
Macroscopic fundamental diagrams, MFD.


### 2.3. Real-Time Traffic Data in a Connected-Vehicles Environment

#### 2.3.1. The Number of Mobile Vehicles and Traffic Volume in the Road Network

In the connected-vehicles network, the vehicle is equipped with GPS (vehicle equipment), which can send latitude, longitude, speed, and other information to the roadside unit in real-time. Determining whether a mobile vehicle (vehicles with average speed greater than 5 km/h) falls within the network area is equivalent to determining whether the point falls within the polygon area. The ray method [21] can be used to determine whether the vehicle falls within the network area, which the ray method draws a line from the latitude and longitude point of the vehicle to be judged in one direction and calculates the number of intersections within the road-network boundary. If the number is even or 0, then the point is outside the network area; if it is odd, then the point is inside the network area (ignore two special circumstances when the line passes through the vertex of road-network boundary and when vehicle latitude and longitude points are on the edge of road network). Based on the above judgment, the number of vehicles falling within the road-network area is converted into the equivalent traffic volume, and the number of vehicles N and the flow rate of each road section qi of the road network (i represents the ith section) can be determined.


#### 2.3.2. The Maximum Queuing Length of Road Section

We have previously discussed calculating the distance between each vehicle and the entrance stop line of each road section in the connected-vehicles network [15, 16], and the formula is as follows:(2)dij=AWij-BWi2×115.7892+AJij-BJi2×86.6672,where dij represents the distance between the jth vehicle in the ith section and the entrance stop line of this section; AJij, and AWij represent the latitude and longitude of the jth vehicle in the ith section, respectively; and BJi,and BWi represent the latitude and longitude of the entrance stop line in the ith section, respectively.Therefore, the distance setD of the vehicles arriving at the stop line in each section is expressed as follows:(3)D=dij∣i∈L,j∈N.The instantaneous velocity setV of the vehicles is expressed as follows:(4)V=vij∣i∈L,j∈N,where vij represents the instantaneous speed of the jth vehicle in the ith section.The vehicle with the instantaneous speedv ≤ 5 km/h is defined as a queuing vehicle, so the queuing length set QL of all the queuing vehicles in the road section can be obtained: (5)QL=dij,vij∣i∈L,j∈N,vij≤5.Therefore, the maximum queuing length of the vehicle in theith section can be expressed as follows:(6)qLmax⁡i=max⁡QLi.Take 95% of the road section lengthLi as the road safety queue length Lsi. If qLmax⁡i≥Lsi, it causes the vehicle to queue up to the upstream of upstream intersection, resulting in traffic congestion at the upstream intersections. Therefore, we should avoid upstream intersection congestion by implementing a strategy to limit road-network boundary intersection flow.


### 2.4. Boundary Traffic Limitation Strategy

We previously proposed to determine the road network traffic status based on the MFD. When the road network tends to be congested, we can apply a simple control strategy to limit the boundary flow on the road network [12] as follows.(7)qGt+Δt+Nt-Ot=NC,Rin=qGt+ΔtIt,Iit+Δt=Rin•Iit,where t represents time (h); Δt represents time step (h); qG represents postcontrol road-network boundary traffic flow influx volume (pcu/h); I represents road-network traffic flow influx volume at time t (pcu/h); Ii(t) represents the traffic influx volume (pcu/h) at the ith entrance at time i; I(t) =∑Ii(t); O(t) represents the road-network outflow volume at a time (pcu/h); and Rin represents the influx rate (allowable traffic flow influx rate).According to the allowable influx flow rateIi(t+Δt), the Webster timing method can be used to recalculate the best signal cycle of each boundary intersection after limiting the flow. The green light time gi(t+Δt) of boundary entrance after limiting the flow can be simplified as gi(t+Δt)=Rin×gi(t), and in order to avoid the influence of the green time of the opposite direction, it can be used in single phase release limiting direction, or, for the release of the symmetric phase, it can turn off the control signals (green time) of entering direction ahead of time, and the green time for the exit direction remains unchanged.After further study, we found that after implementing the simple strategy to control boundary flow, because individual boundary intersections fail to provide enough space for the vehicle queue, the queue overflows to the upstream intersections. To avoid queue overflow, we should implement the control strategy to limit boundary flow while considering the boundary section queuing space. Specific ideas are as follows:(8)qmt=1-Rin•∑SISt,where S is the numbering of entrance sections of boundary intersections that are not suitable for limiting the flow.Ifqm(t)=0, the strategy to limit the peripheral flow is implemented based on the Rin influx rate; if qm(t)>0, then qm(t) is evenly transferred to other boundary intersections, readjusting the influx rate Rin′, and the formula derivation process is as follows:(9)Δqm=qmtn-x=1-Rin•∑SIStn-x,where n is the total number of entrance sections at the road-network boundary intersections; x is the total number of entrance sections that are not suitable for limiting flow at the road-network boundary intersections; n-x is the total number of entrance sections suitable for limiting flow at the road-network boundary intersections; and Δqm is the average flow limit, which should be increased in other boundary sections when there is an overflow phenomenon in individual boundary sections.The entrance flow limit that is suitable for limiting the flow at the road-network boundary intersections is calculated as follows:(10)qmyt+Δt=1-Rin•Iyt+Δqm,where y is the numbering of entrance sections suitable for limiting flow at the road-network boundary intersection.The new influx volume of each entrance suitable for limiting flow at the road-network boundary intersections is expressed as follows:(11)qGyt+Δt=Iyt-qmyt+Δt=Iyt-1-Rin•Iyt+Δqm=Rin•Iyt-Δqm.The new influx volume of all the entrances suitable for limiting flow at the road-network boundary intersections is calculated as follows:(12)qG′t+Δt=∑yqGy=Rin•∑yIyt-n-xΔqm=Rin•∑yIyt-qmt=Rin•It-∑SISt-1-Rin•∑SISt=Rin•It-∑SISt.The actual influx volumeI′(t) of road-network boundary intersections suitable for limiting flow is calculated as follows:(13)I′t=It-∑SISt.The new influx rateRin′ after readjustment is calculated as follows:(14)Rin′=qG′t+ΔtI′t=Rin•It-∑SIStIt-∑SISt=1-Rin•Rin•It-qm1-Rin•It-qm.The details of above control process are shown in Figure2.Figure 2
Flow chart of a control strategy to limit the boundary flow that takes queuing space into account.


## 2.1. Basic Assumptions

For the study, the following assumptions are made:(1)
All the vehicles are equipped with GPS in connected-vehicle network, which can achieve the location, speed, and other information to the signal control device of the intersection.(2)
The phase of the road boundary intersections used the mode of individual release of each import.(3)
The traffic flow in the studied road network is oversaturated.(4)
The studied road network with relatively uniform traffic density (homogeneous network) has macroscopic fundamental diagram.


## 2.2. Analysis of Microscopic Fundamental Diagrams

According to MFD theory, the formula of relevant parameters is the following:(1)N=∑ikili,qw=∑iqili∑ili,kw=∑ikili∑ili,ow=kw•s=∑ioili∑ili,where N represents road-network vehicles (pcu); qw, kw, and ow represent weighted traffic flow (pcu/h), weighted density (pcu/km), and weighted time occupancy rate, respectively; i and li represent section i and the length of this section (km); qi, ki, and oi represent the flow rate (pcu/h), density (pcu/km), and time occupancy of section i, respectively; and s represents the average of vehicle lengths.According to the MFD theory, the relationship between the weighted traffic (qw) and the number of vehicles (N) in the urban road network can be established, as shown in Figure 1. When N approaches Nc (critical vehicle number), the road network begins to enter the congested state from the noncongested state.Figure 1
Macroscopic fundamental diagrams, MFD.


## 2.3. Real-Time Traffic Data in a Connected-Vehicles Environment

### 2.3.1. The Number of Mobile Vehicles and Traffic Volume in the Road Network

In the connected-vehicles network, the vehicle is equipped with GPS (vehicle equipment), which can send latitude, longitude, speed, and other information to the roadside unit in real-time. Determining whether a mobile vehicle (vehicles with average speed greater than 5 km/h) falls within the network area is equivalent to determining whether the point falls within the polygon area. The ray method [21] can be used to determine whether the vehicle falls within the network area, which the ray method draws a line from the latitude and longitude point of the vehicle to be judged in one direction and calculates the number of intersections within the road-network boundary. If the number is even or 0, then the point is outside the network area; if it is odd, then the point is inside the network area (ignore two special circumstances when the line passes through the vertex of road-network boundary and when vehicle latitude and longitude points are on the edge of road network). Based on the above judgment, the number of vehicles falling within the road-network area is converted into the equivalent traffic volume, and the number of vehicles N and the flow rate of each road section qi of the road network (i represents the ith section) can be determined.


### 2.3.2. The Maximum Queuing Length of Road Section

We have previously discussed calculating the distance between each vehicle and the entrance stop line of each road section in the connected-vehicles network [15, 16], and the formula is as follows:(2)dij=AWij-BWi2×115.7892+AJij-BJi2×86.6672,where dij represents the distance between the jth vehicle in the ith section and the entrance stop line of this section; AJij, and AWij represent the latitude and longitude of the jth vehicle in the ith section, respectively; and BJi,and BWi represent the latitude and longitude of the entrance stop line in the ith section, respectively.Therefore, the distance setD of the vehicles arriving at the stop line in each section is expressed as follows:(3)D=dij∣i∈L,j∈N.The instantaneous velocity setV of the vehicles is expressed as follows:(4)V=vij∣i∈L,j∈N,where vij represents the instantaneous speed of the jth vehicle in the ith section.The vehicle with the instantaneous speedv ≤ 5 km/h is defined as a queuing vehicle, so the queuing length set QL of all the queuing vehicles in the road section can be obtained: (5)QL=dij,vij∣i∈L,j∈N,vij≤5.Therefore, the maximum queuing length of the vehicle in theith section can be expressed as follows:(6)qLmax⁡i=max⁡QLi.Take 95% of the road section lengthLi as the road safety queue length Lsi. If qLmax⁡i≥Lsi, it causes the vehicle to queue up to the upstream of upstream intersection, resulting in traffic congestion at the upstream intersections. Therefore, we should avoid upstream intersection congestion by implementing a strategy to limit road-network boundary intersection flow.


## 2.3.1. The Number of Mobile Vehicles and Traffic Volume in the Road Network

In the connected-vehicles network, the vehicle is equipped with GPS (vehicle equipment), which can send latitude, longitude, speed, and other information to the roadside unit in real-time. Determining whether a mobile vehicle (vehicles with average speed greater than 5 km/h) falls within the network area is equivalent to determining whether the point falls within the polygon area. The ray method [21] can be used to determine whether the vehicle falls within the network area, which the ray method draws a line from the latitude and longitude point of the vehicle to be judged in one direction and calculates the number of intersections within the road-network boundary. If the number is even or 0, then the point is outside the network area; if it is odd, then the point is inside the network area (ignore two special circumstances when the line passes through the vertex of road-network boundary and when vehicle latitude and longitude points are on the edge of road network). Based on the above judgment, the number of vehicles falling within the road-network area is converted into the equivalent traffic volume, and the number of vehicles N and the flow rate of each road section qi of the road network (i represents the ith section) can be determined.


## 2.3.2. The Maximum Queuing Length of Road Section

We have previously discussed calculating the distance between each vehicle and the entrance stop line of each road section in the connected-vehicles network [15, 16], and the formula is as follows:(2)dij=AWij-BWi2×115.7892+AJij-BJi2×86.6672,where dij represents the distance between the jth vehicle in the ith section and the entrance stop line of this section; AJij, and AWij represent the latitude and longitude of the jth vehicle in the ith section, respectively; and BJi,and BWi represent the latitude and longitude of the entrance stop line in the ith section, respectively.Therefore, the distance setD of the vehicles arriving at the stop line in each section is expressed as follows:(3)D=dij∣i∈L,j∈N.The instantaneous velocity setV of the vehicles is expressed as follows:(4)V=vij∣i∈L,j∈N,where vij represents the instantaneous speed of the jth vehicle in the ith section.The vehicle with the instantaneous speedv ≤ 5 km/h is defined as a queuing vehicle, so the queuing length set QL of all the queuing vehicles in the road section can be obtained: (5)QL=dij,vij∣i∈L,j∈N,vij≤5.Therefore, the maximum queuing length of the vehicle in theith section can be expressed as follows:(6)qLmax⁡i=max⁡QLi.Take 95% of the road section lengthLi as the road safety queue length Lsi. If qLmax⁡i≥Lsi, it causes the vehicle to queue up to the upstream of upstream intersection, resulting in traffic congestion at the upstream intersections. Therefore, we should avoid upstream intersection congestion by implementing a strategy to limit road-network boundary intersection flow.


## 2.4. Boundary Traffic Limitation Strategy

We previously proposed to determine the road network traffic status based on the MFD. When the road network tends to be congested, we can apply a simple control strategy to limit the boundary flow on the road network [12] as follows.(7)qGt+Δt+Nt-Ot=NC,Rin=qGt+ΔtIt,Iit+Δt=Rin•Iit,where t represents time (h); Δt represents time step (h); qG represents postcontrol road-network boundary traffic flow influx volume (pcu/h); I represents road-network traffic flow influx volume at time t (pcu/h); Ii(t) represents the traffic influx volume (pcu/h) at the ith entrance at time i; I(t) =∑Ii(t); O(t) represents the road-network outflow volume at a time (pcu/h); and Rin represents the influx rate (allowable traffic flow influx rate).According to the allowable influx flow rateIi(t+Δt), the Webster timing method can be used to recalculate the best signal cycle of each boundary intersection after limiting the flow. The green light time gi(t+Δt) of boundary entrance after limiting the flow can be simplified as gi(t+Δt)=Rin×gi(t), and in order to avoid the influence of the green time of the opposite direction, it can be used in single phase release limiting direction, or, for the release of the symmetric phase, it can turn off the control signals (green time) of entering direction ahead of time, and the green time for the exit direction remains unchanged.After further study, we found that after implementing the simple strategy to control boundary flow, because individual boundary intersections fail to provide enough space for the vehicle queue, the queue overflows to the upstream intersections. To avoid queue overflow, we should implement the control strategy to limit boundary flow while considering the boundary section queuing space. Specific ideas are as follows:(8)qmt=1-Rin•∑SISt,where S is the numbering of entrance sections of boundary intersections that are not suitable for limiting the flow.Ifqm(t)=0, the strategy to limit the peripheral flow is implemented based on the Rin influx rate; if qm(t)>0, then qm(t) is evenly transferred to other boundary intersections, readjusting the influx rate Rin′, and the formula derivation process is as follows:(9)Δqm=qmtn-x=1-Rin•∑SIStn-x,where n is the total number of entrance sections at the road-network boundary intersections; x is the total number of entrance sections that are not suitable for limiting flow at the road-network boundary intersections; n-x is the total number of entrance sections suitable for limiting flow at the road-network boundary intersections; and Δqm is the average flow limit, which should be increased in other boundary sections when there is an overflow phenomenon in individual boundary sections.The entrance flow limit that is suitable for limiting the flow at the road-network boundary intersections is calculated as follows:(10)qmyt+Δt=1-Rin•Iyt+Δqm,where y is the numbering of entrance sections suitable for limiting flow at the road-network boundary intersection.The new influx volume of each entrance suitable for limiting flow at the road-network boundary intersections is expressed as follows:(11)qGyt+Δt=Iyt-qmyt+Δt=Iyt-1-Rin•Iyt+Δqm=Rin•Iyt-Δqm.The new influx volume of all the entrances suitable for limiting flow at the road-network boundary intersections is calculated as follows:(12)qG′t+Δt=∑yqGy=Rin•∑yIyt-n-xΔqm=Rin•∑yIyt-qmt=Rin•It-∑SISt-1-Rin•∑SISt=Rin•It-∑SISt.The actual influx volumeI′(t) of road-network boundary intersections suitable for limiting flow is calculated as follows:(13)I′t=It-∑SISt.The new influx rateRin′ after readjustment is calculated as follows:(14)Rin′=qG′t+ΔtI′t=Rin•It-∑SIStIt-∑SISt=1-Rin•Rin•It-qm1-Rin•It-qm.The details of above control process are shown in Figure2.Figure 2
Flow chart of a control strategy to limit the boundary flow that takes queuing space into account.


## 3. Simulation Experiments

In this paper, we also chose to study the Guangzhou Tianhe District Sports Center business district, as we did in a previous report [15, 16] and as shown in Figure 3, of which Tianhe North Road, Tianhe Road, and Tianhe East Road are the main roads of the region.Figure 3
Tianhe District Sports Center business district diagram.


### 3.1. Determine MFD

In the VISSIM traffic simulation software, we established the simulation model for the road-network traffic, which can effectively simulate the connected-vehicles network, as shown in Figure4. In the road-network simulation model, we started to simulate the traffic flow from the lowest value and increased drive-in traffic volume in each road section of road-network boundary by 100 pcu/h every 900 s until reaching the peak of oversaturated state. The total-simulation time was 27000 s and the data was collected once every 120 s for a total of 225 data points; finally, statistics were performed on the number of road-network mobile vehicles (obtained by calculating road section density ki  ∗  road section length Li), traffic influx volume at boundary intersections, traffic outflow volume, and road section traffic volume for further processing to obtain the road-network benchmark MFD, as shown in Figure 4.Figure 4
Tianhe business district road-network simulation model.From the fitting curve of Figure5, the maximum weighted flow qcw = 15978 pcu/h and the critical vehicle number Nc = 1090 pcu of the region were calculated. Figure 5 shows that when the number of vehicles N>1090 pcu, the road network is in an oversaturated congestion state.Figure 5
MFD graph of the simulated road network.


### 3.2. Simulation Boundary Traffic Flow Limitation Strategy

We used the C# programming language to perform secondary development on the com programming interface provided by VISSIM and implemented the control strategy to limit the boundary flow while considering the boundary section queuing space. To obtain the maximum boundary section queuing length, a queuing detector was established in the road safety queuing position. When the road network was simulated to 133 cycles (simulation time was about 15960 s), the road network entered the congestion state. According to the control strategy to limit boundary flow, the initial road-network influx rate was 92% and 8% of the traffic rate needed to be limited. Therefore, to simplify the calculation, we reduced 8% of the green light time in the drive-in direction of boundary section for resimulation analysis. After running about 156 cycles, due to the limited queuing space of road sections CR, ED, and FG (as shown in Figure3), queuing space become insufficient, and the queue overflowed to upstream intersections. Thus, we needed to readjust the road-network outflow rate. Based on the boundary flow control algorithm that considers queuing space, we recalculated the outflow rate as 90%. In other words, we did not limit the flow on the road sections CR, ED, and FG, and we implemented 90% of influx rate limit on other boundary sections and redid the simulation analysis.We analyzed simulation data of oversaturated road network (15960–27000 s were simulation time period for oversaturation) with three control strategies: (1) no control strategy which was not implemented the strategy to limit peripheral flow; (2) boundary control which implemented the simple strategy to limit the peripheral flow; and (3) boundary control with limiting queue strategy which implemented the control strategy to limit the boundary flow while considering queuing space and obtaining the traffic signal control indicators of the oversaturated road network, as shown in Figures 6–8.Figure 6
Average queuing lengths at each intersection in oversaturated road network.Figure 7
Average delay time at each intersection in oversaturated road network.Figure 8
Average stop times at each intersection in oversaturated road network.Table1 shows that the average delay time of boundary control and boundary control with limiting queue strategy were 12.6% and 17.1%, lower than no control strategy, respectively. The average stop times of boundary control and boundary control with limiting queue strategy were 6.7% and 4.2%, lower than no control strategy, respectively. The average queuing lengths of boundary control and boundary control with limiting queue strategy were 17.7% and 18.6%, lower than no control strategy. Respectively, the service indicators of boundary control and boundary control with limiting queue strategy are better than no control strategy, and boundary control with limiting queue strategy is slightly better than boundary control.Table 1
Comparison of traffic signal control indicators for oversaturated road networks with three strategies.
No control strategy
Boundary control
Boundary control with limiting queue strategy
Average delay time (s)
19.9
17.4
16.5
Average number of stops (times)
0.45
0.42
0.39
Average queuing length (m)
23.1
19.0
18.8


## 3.1. Determine MFD

In the VISSIM traffic simulation software, we established the simulation model for the road-network traffic, which can effectively simulate the connected-vehicles network, as shown in Figure4. In the road-network simulation model, we started to simulate the traffic flow from the lowest value and increased drive-in traffic volume in each road section of road-network boundary by 100 pcu/h every 900 s until reaching the peak of oversaturated state. The total-simulation time was 27000 s and the data was collected once every 120 s for a total of 225 data points; finally, statistics were performed on the number of road-network mobile vehicles (obtained by calculating road section density ki  ∗  road section length Li), traffic influx volume at boundary intersections, traffic outflow volume, and road section traffic volume for further processing to obtain the road-network benchmark MFD, as shown in Figure 4.Figure 4
Tianhe business district road-network simulation model.From the fitting curve of Figure5, the maximum weighted flow qcw = 15978 pcu/h and the critical vehicle number Nc = 1090 pcu of the region were calculated. Figure 5 shows that when the number of vehicles N>1090 pcu, the road network is in an oversaturated congestion state.Figure 5
MFD graph of the simulated road network.


## 3.2. Simulation Boundary Traffic Flow Limitation Strategy

We used the C# programming language to perform secondary development on the com programming interface provided by VISSIM and implemented the control strategy to limit the boundary flow while considering the boundary section queuing space. To obtain the maximum boundary section queuing length, a queuing detector was established in the road safety queuing position. When the road network was simulated to 133 cycles (simulation time was about 15960 s), the road network entered the congestion state. According to the control strategy to limit boundary flow, the initial road-network influx rate was 92% and 8% of the traffic rate needed to be limited. Therefore, to simplify the calculation, we reduced 8% of the green light time in the drive-in direction of boundary section for resimulation analysis. After running about 156 cycles, due to the limited queuing space of road sections CR, ED, and FG (as shown in Figure3), queuing space become insufficient, and the queue overflowed to upstream intersections. Thus, we needed to readjust the road-network outflow rate. Based on the boundary flow control algorithm that considers queuing space, we recalculated the outflow rate as 90%. In other words, we did not limit the flow on the road sections CR, ED, and FG, and we implemented 90% of influx rate limit on other boundary sections and redid the simulation analysis.We analyzed simulation data of oversaturated road network (15960–27000 s were simulation time period for oversaturation) with three control strategies: (1) no control strategy which was not implemented the strategy to limit peripheral flow; (2) boundary control which implemented the simple strategy to limit the peripheral flow; and (3) boundary control with limiting queue strategy which implemented the control strategy to limit the boundary flow while considering queuing space and obtaining the traffic signal control indicators of the oversaturated road network, as shown in Figures 6–8.Figure 6
Average queuing lengths at each intersection in oversaturated road network.Figure 7
Average delay time at each intersection in oversaturated road network.Figure 8
Average stop times at each intersection in oversaturated road network.Table1 shows that the average delay time of boundary control and boundary control with limiting queue strategy were 12.6% and 17.1%, lower than no control strategy, respectively. The average stop times of boundary control and boundary control with limiting queue strategy were 6.7% and 4.2%, lower than no control strategy, respectively. The average queuing lengths of boundary control and boundary control with limiting queue strategy were 17.7% and 18.6%, lower than no control strategy. Respectively, the service indicators of boundary control and boundary control with limiting queue strategy are better than no control strategy, and boundary control with limiting queue strategy is slightly better than boundary control.Table 1
Comparison of traffic signal control indicators for oversaturated road networks with three strategies.
No control strategy
Boundary control
Boundary control with limiting queue strategy
Average delay time (s)
19.9
17.4
16.5
Average number of stops (times)
0.45
0.42
0.39
Average queuing length (m)
23.1
19.0
18.8


## 4. Conclusion

The connected-vehicles network and MFD present new ideas for studying traffic signal control methods. We implemented the control strategy to limit the boundary while considering boundary section queuing space on the road network at the macrolevel in this paper by using the MFD theory in the connected-vehicles network environment. However, the road-network boundary mentioned in this paper is predefined, and we will continue to study the dynamic division method of road-network boundaries based on MFD in the next stage.



---

*Source: 8784067-2017-11-12.xml*