Nothing Special   »   [go: up one dir, main page]

CN102610094A - Traffic control method for dynamic coordination according to effective capacity of road section - Google Patents

Traffic control method for dynamic coordination according to effective capacity of road section Download PDF

Info

Publication number
CN102610094A
CN102610094A CN2012101052023A CN201210105202A CN102610094A CN 102610094 A CN102610094 A CN 102610094A CN 2012101052023 A CN2012101052023 A CN 2012101052023A CN 201210105202 A CN201210105202 A CN 201210105202A CN 102610094 A CN102610094 A CN 102610094A
Authority
CN
China
Prior art keywords
time
green
vehicles
intersection
traffic
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN2012101052023A
Other languages
Chinese (zh)
Inventor
郭海锋
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN2012101052023A priority Critical patent/CN102610094A/en
Publication of CN102610094A publication Critical patent/CN102610094A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Traffic Control Systems (AREA)

Abstract

The invention discloses a traffic control method for dynamic coordination according to effective capacity of a road section. The method comprises the following steps of: first, proposing an effective bandwidth evaluation method to monitor the running state and the control effect of the existing trunk-road green-wave coordinating and controlling system; and second, learning from a TCP/IP (Control Protocol / Internet Protocol) window flow control thought, and designing a window-flow-controlled trunk-road dynamic coordinating and controlling method to control the crowed traffic flow of urban trunk roads. Simulation tests and compared results show that a downstream intersection can inform the effective capacity of the road section to an upstream intersection in real time in a mode of a window flow notice, and a traffic signal machine of each intersection can conveniently redistribute the green time of each traffic flow according to the current traffic demand and the effective capacity of the road section to avoid the overlong green time to cause queuing vehicles in the road section to overflow.

Description

Traffic control method based on dynamic coordination of effective capacity of road section
Technical Field
The invention relates to the field of urban traffic trunk line control, in particular to a method for calculating effective capacity of a road section.
Background
The existing trunk line coordination control method is mainly used for pursuing maximization of green wave bandwidth under a set traffic condition by adjusting signal timing parameters of adjacent signal intersections, and therefore the method is called trunk line green wave coordination control. Practice proves that the control effect of the trunk line green wave coordination control is good under the unsaturated condition, but the expected control effect is far from being achieved under the saturated and supersaturated conditions, even queuing vehicles overflow to an upstream intersection, and a deadlock phenomenon that the vehicles cannot pass through the upstream intersection during the green light period is generated. From the development trend of existing products, when a developer designs a trunk line green wave coordination control method, the method gradually changes from micro consideration of the traffic conditions of a certain direction and a certain intersection into macro consideration of the traffic conditions of an upstream road section and a downstream road section and an adjacent intersection; the control targets are simply to reduce parking delay and gradually change into the control targets of considering the queuing length, reducing the queuing length and evacuating congestion. However, the existing research has two aspects which are not considered, on one hand, the real-time monitoring of the operation state of the main line green wave coordination control system is not considered; on the other hand, real-time detection of the available space of the road segment is lacking. The former can be used to monitor the effectiveness of the currently executed trunk green wave coordination control scheme; the latter can then design the timing of the signals from the point of view of the road section accommodating the number of vehicles, in order to prevent the aforementioned "deadlock" phenomena.
Disclosure of Invention
The invention starts from two angles, and firstly provides a method for calculating the effective bandwidth of a trunk line green wave coordination control system so as to monitor the effectiveness of green wave coordination control; based on the method, the effective capacity of the road section is notified in real time based on the window flow control idea, so that the downstream intersection can notify the upstream intersection of the current effective capacity of the road section, and the upstream intersection adjusts signal timing according to the effective capacity of the road section, so that the phenomenon that the green time is distributed too much to cause the vehicle to overflow in line on the road section is avoided.
In order to solve the technical problems, the invention adopts the technical scheme that:
a method for calculating effective capacity of a road section comprises the following steps:
(1) calculating the maximum number of vehicles which can be accommodated in the road section;
(2) calculating the number of vehicles of each lane of the current periodic road section by taking a certain time interval as a period;
(3) accumulating the vehicle number of each lane calculated in the step (2) to obtain the total vehicle number of the road section in the current period;
(4) and subtracting the total number of vehicles of the road section in the current period from the maximum number of vehicles which can be accommodated to obtain the effective capacity of the road section in the current period.
The effective capacity of the road section refers to the maximum number of vehicles from the upstream intersection accommodated in the current period of the road section; the certain time interval is the time interval of the signal period of the signalized intersection or the time interval of a specific time length.
The method for calculating the maximum number of vehicles which can be accommodated in the current road section comprises the following steps:
Figure BSA00000699366200021
wherein L (i) is the length of the basic road section, l (i) is the length of the channeled road section, LV is the average vehicle length, SV is the saturated headway distance, n is the number of non-channeled partial roads, and m is the number of channeled partial roads.
The number of vehicles on the current road section consists of two parts: one part is the number of vehicles left in the previous time interval, and the other part is the number of vehicles entering the road section in the current time interval minus the number of vehicles passing through the intersection in the current time interval.
The method for calculating the number of the queued vehicles in the left-turn lane and the right-turn lane comprises the following steps:
q (η, L, t +1) ═ Q (η, L, t) + QN (η, L, t) + QA (η, L, t +1) -QD (η, L, t +1), where Q (η, L, t), QN (η, L, t) respectively represent the number of vehicles in line between the two detectors and the number of newly arrived vehicles when the vehicle obtains the right to pass green light t +1 times; QA (η, L, t +1) and QD (η, L, t +1) respectively represent the number of arriving vehicles and the number of departing vehicles at the end of the t +1 th green light, and Q (η, L, t +1) represents the remaining number of vehicles.
The method for calculating the number of the queued vehicles of the straight lane comprises the following steps:
<math> <mrow> <mi>Q</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>=</mo> <mi>Q</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <mrow> <mo>(</mo> <mi>QN</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <mi>QA</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>&times;</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msubsup> <mi>P</mi> <mi>LT</mi> <mi>t</mi> </msubsup> <mo>)</mo> </mrow> <mo>-</mo> <mi>QD</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>,</mo> </mrow> </math> wherein
Figure BSA00000699366200033
The percentage of left-turning vehicles in the number of arriving vehicles is accumulated from the end of the t-th green light to the beginning of the t +1 green lights.
A traffic control method based on dynamic coordination of effective capacity of road sections comprises the following steps:
(1) the upstream intersection sends a request to the downstream intersection to obtain a window flow notice;
(2) aiming at preferentially releasing the traffic flow in the crowded direction, calculating the green time required by the released vehicle according to the obtained real-time window flow;
(3) and (4) optimizing and distributing the final green light time in the direction by considering the current light color state of the downstream intersection and the remaining time of the downstream intersection.
Further, the window traffic format is { T }i state,Ti remain,ASL(i)},Wherein T isi stateThe method comprises the following steps of (e) (Red, Green and Yellow), and respectively indicating that the trunk direction of the ith intersection is a Red light, a Green light and a Yellow light; t isi remainRepresents the remaining time of a certain light color, asl (i) is the effective capacity of the current road section.
If the number of vehicles to be released at the upstream intersection is smaller than ASL (i) in the window flow notice, the required green light time G (i) is calculated according to the number of the vehicles to be released, otherwise, the required green light time G (i) is calculated according to the ASL (i) in the window flow notice.
The calculation method based on the number of vehicles to be released comprises the following steps:
G(i)=L(i)+(N(η,θ)+NΔ) X h, where L (i) is the start loss time, h is the saturated headway, N (eta, theta) is the number of queued vehicles to be released, NΔA newly joined vehicle during green light release.
The method for calculating the green light time required by the number of released ASL (i) vehicles comprises the following steps:
Figure BSA00000699366200041
wherein L isASLTime is lost for startup.
The calculation method for further determining the final green time is as follows:
G(i)=GASL+Tremain If Tstate∈{Green,Yellow}
G(i)=GASL-Tremain If Tstate∈{Red}。
according to the technical scheme provided by the invention, the downstream intersection can inform the upstream intersection of the effective capacity of the road section in real time in a window flow informing mode, so that the signalers at the intersections can conveniently reorganize the green time of each traffic flow according to the current traffic demand and the effective capacity of the road section, and the trunk blockage can be better prevented.
Drawings
FIG. 1 is a time-distance graph of a road segment effective capacity calculation method provided by the present invention under ideal conditions;
FIG. 2 is a time-distance graph of a method for calculating the effective capacity of a road segment in actual traffic operation according to the present invention;
FIG. 3 is a lane diagram illustrating a method for calculating the effective capacity of a road segment according to the present invention;
FIG. 4 is a schematic diagram of a channelized structure of an intersection according to a method for calculating effective capacity of a road section provided by the invention;
fig. 5 is a graph of effective bandwidth of a fixed-time-matching trunk signal coordination system according to a method for calculating effective capacity of a road section provided by the invention.
Detailed Description
In order to make the technical solution of the present invention better understood, the following detailed description is provided for the specific implementation method of the technical solution.
A method for calculating the effective capacity of a road section comprises the following specific steps:
1) calculating the maximum number of vehicles which can be accommodated in the current road section
The maximum number of vehicles which can be accommodated in the current road section can be calculated according to the formula
Figure BSA00000699366200051
And calculating and obtaining, wherein L (i) is the length of the basic road section, l (i) is the length of the channelized road section, LV is the average vehicle length, SV is the distance between saturated vehicle heads, n is the number of non-channelized partial roads, and m is the number of channelized partial roads.
2) Calculating the number of vehicles on the current road section of each lane
The number of vehicles on the road section i is composed of two parts, one part is the number of vehicles left in the previous time interval, the other part is the number of vehicles which enter the road section in the current time interval and minus the number of vehicles which pass through the intersection in the current time interval, and the calculation method can be obtained by counting the number of vehicles queued in each lane.
The method for calculating the number of queued vehicles in each lane comprises the following steps:
in the saturation condition, when the green light of each phase is finished, all vehicles waiting to be released during the red light cannot pass through the intersection, and the staying vehicles wait for the next green light release together with the newly arrived vehicles. Based on the data provided by the traffic detector on the road, the number of vehicles waiting to be released in each lane can be calculated at the beginning of the next green light release.
The calculation method of the queuing length of each lane is described with reference to fig. 3. In fig. 3, lane 3 is a left-turn exclusive lane, lane 2 is a straight lane, and lane 1 is a straight right-turn lane. The detectors are disposed near the stop line and at the end of the left-turn exclusive lane and upstream of the straight lane, respectively. The distance between the two detectors of the left-turn lane is LLTThe method can be used for counting the number of left-turn queued vehicles; the distance between the straight line detector and the straight right detector is LRTAnd the method can be used for counting the number of vehicles in straight line queue.
(1) Number of vehicles in line on left-turn lane
Suppose that at the end of the current t-th green light, two left-turn lane detectors L1And L2The number of queued vehicles in the intersection is Q (eta, L, t), wherein eta belongs to { E, S, W, N }, and represents the east (E), south (S), west (W) and north (N) entrance directions of the intersection. The direction of travel of the vehicle may be represented as θ ∈ { L, T, R }, where L represents a left turn, T represents a straight run, and R represents a right turn. L is2Continuing to detect the newly arrived vehicle, and when the vehicle on the lane 3 obtains the right of green light passing t +1 times, L1And L2The number of the queued vehicles among the detectors is the number Q of the original queued vehiclesThe sum of (η, L, t) and the number of newly arrived vehicles QN (η, L, t), that is: n (η, L, t) ═ Q (η, L, t) + QN (η, L, t).
When the lane again obtains the right of green light passage, L1Start of detection of departing vehicles, L2The newly arriving vehicle continues to be detected. When the t +1 th green light ends, L2The number of vehicles arriving during the detection of green light is QA (η, L, t +1), L1The number of vehicles leaving during green light detection is QD (η, L, t +1), when the remaining number of vehicles between the two detectors is: q (η, L, t +1) ═ N (η, L, t) + QA (η, L, t +1) -QD (η, L, t + 1).
And calculating the number of vehicles required to be released when the lane obtains the green light again according to the iterative formula.
(2) Number of vehicles in line in each lane in direct right-hand direction
The calculation principle of the number of queued vehicles for lane 1 is the same as for lane 3. For lane 2, due to the detector T upstream of the road section2Not only straight-going vehicles but also left-turning vehicles are detected, so it is complicated to calculate the vehicles in line on the lane 2. When the number of the queued vehicles of the lane 2 is calculated, the number of the left-turning vehicles is removed, and the proportion of the left-turning vehicles can pass through L1And L2And calculating the data detected in real time. When the current lane 2 turns green for the tth time, the number of the vehicles staying in the lane 2 is: <math> <mrow> <mi>N</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>=</mo> <mi>Q</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <mi>QN</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>&times;</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msubsup> <mi>P</mi> <mi>LT</mi> <mi>t</mi> </msubsup> <mo>)</mo> </mrow> <mo>.</mo> </mrow> </math>
wherein,
Figure BSA00000699366200062
the percentage of left-turning vehicles in the number of arriving vehicles is accumulated from the end of the t-th green light to the beginning of the t +1 green lights,
Figure BSA00000699366200063
when the T +1 th green light is finished, T is on lane 21And T2The queued vehicles between the two detectors are:
<math> <mrow> <mi>Q</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>=</mo> <mi>Q</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <mrow> <mo>(</mo> <mi>QN</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>)</mo> </mrow> <mo>+</mo> <mi>QA</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> <mo>)</mo> </mrow> <mo>&times;</mo> <mrow> <mo>(</mo> <mn>1</mn> <mo>-</mo> <msubsup> <mi>P</mi> <mi>LT</mi> <mi>t</mi> </msubsup> <mo>)</mo> </mrow> <mo>-</mo> <mi>QD</mi> <mrow> <mo>(</mo> <mi>&eta;</mi> <mo>,</mo> <mi>T</mi> <mo>,</mo> <mi>t</mi> <mo>+</mo> <mn>1</mn> <mo>)</mo> </mrow> </mrow> </math>
3) method for calculating effective capacity of road section
The Link effective capacity (ASL) refers to the maximum number of vehicles from an upstream intersection that a Link can currently accommodate. Under the saturation condition, the number of vehicles released at the intersection is not only related to the green time, but also restricted by the effective capacity of the downstream road section in the traveling direction of the vehicles. If the number of vehicles queued on the downstream road section is large, the effective capacity of the downstream road section is small, and the number of vehicles from the upstream intersection can be accommodated is small; at this time, the more green light time is given to the upstream intersection in the direction, the more green light time is wasted, and the space-time benefit of the intersection is seriously affected. Therefore, when the upstream intersection gives green time to a certain direction, the effective capacity of the downstream road section should be fully considered, the number of released vehicles should be calculated according to the effective capacity of the road section, and the given green time is further determined, so that the space-time resources of the intersection are fully utilized.
The formula of the calculation method of the effective capacity of the road section is as follows: asl (i) ═ sl (i) -nq (i).
Wherein SL (i) is the capacity of the road section i, and refers to the maximum number of vehicles which can be accommodated when the road section i is full of vehicles; nq (i) refers to the number of vehicles on link i at the current time.
The traffic control method based on the dynamic coordination of the effective capacity of the road section comprises the following specific implementation methods:
under the saturation condition, an effective means for dredging the congested traffic flow is like a traffic police, the original established control process is broken, the number of vehicles which are released to a congested downstream road section at an upstream intersection is reduced, and the green light time in the congested direction of the downstream intersection is increased, so that congestion dredging is accelerated. The invention takes the prior release of traffic flow in the congestion direction as a target according to the traffic data detected by the detector in real time, and gives the green light time of the traffic flow to be released again through optimized calculation every time the green light right of traffic is released according to the obtained window traffic notification, thereby achieving the purpose of rapidly relieving the traffic congestion.
And each signalized intersection calculates the effective capacity of the governed road section in real time according to the traffic data detected by the detector, and when an upstream intersection sends a request to the signalized intersection, a downstream intersection sends a window flow notice to the downstream intersection. The window format is: { Ti state,Ti remainASL (i) }, in which Ti stateThe method comprises the following steps of (e) (Red, Green and Yellow), and respectively indicating that the trunk direction of the ith intersection is a Red light, a Green light and a Yellow light; t isi remainRepresents the remaining time of a certain light color, asl (i) is the effective capacity of the current road section.
The main line dynamic coordination control principle of window flow control is as follows:
(1) obtaining relevant static traffic data and dynamic traffic data of each intersection under current trunk line coordination control;
(2) obtaining the phase and phase sequence of each intersection;
(3) calculating the effective bandwidth ABW of the currently running trunk line coordination control system on the basis of dynamic traffic data acquired at a time interval T, if the ABW is smaller than a threshold value delta, turning to (4), otherwise, turning to (10) without changing the current signal control mode;
(4) each intersection calculates the effective capacity of the road section according to the data detected by the detector, and sends a window flow notice to the upstream intersection in a window format;
(5) after the upstream intersection receives the window flow notice, the current signal control scheme is changed, and the green time of the trunk direction is redistributed according to the current number of queued vehicles of each lane calculated by the data of the detector and the related information informed in the window flow notice;
(6) if the number of vehicles to be released at the upstream intersection is less than ASL (i) in the window flow notice, calculating the required green light time G (i) based on the number of vehicles to be released, otherwise, turning to (7);
(7) calculating the green light time required by releasing the number of the ASL (i) vehicles according to the ASL (i) in the window flow notice, and optimally distributing the final green light time in the direction by considering the current light color state and the remaining time of the downstream intersection;
(8) according to the calculation result of (6) or (7), a green light right of way is issued for the direction, and other competitive directions are red lights;
(9) repeating the steps (4) - (8) when the direction is about to obtain the right of way again;
(10) t +1, go (3).
The method for calculating the green light time in the step (6) is as follows:
G(i)=L(i)+(N(η,θ)+NΔ) X h, where L (i) is the start loss time, h is the saturated headway, N (eta, theta) is the number of queued vehicles to be released, NΔA newly joined vehicle during green light release.
Step (7) if the green time required for releasing the asl (i) number of vehicles is calculated as follows:
Figure BSA00000699366200081
wherein L isASLTo start the lost time, the final green time calculation method of step (7) is as follows:
G(i)=GASL+Tremain If Tstate∈{Green,Yellow}
G(i)=GASL-Tremain If Tstate∈{Red}
the dynamic trunk coordination control method based on window flow control is suitable for saturation conditions, the green time in the trunk direction is distributed, the current traffic demand and the effective space supply in the window flow notice are completely depended on, and the method is more effective for dredging the congested traffic flow.
Simulation analysis with specific examples:
1. simulation scheme design
With reference to fig. 4, the invention takes three continuous intersections as research objects, the west-east road sections where the three intersections are located are urban main roads, and the distance between the intersections is about 600 meters. In the experiment, VISSIM simulation software of Germany PTV company is used as a tool, VB is used for calling a COM interface of the VISSIM, detector data and signal control machine parameters are read, a program is programmed to realize the calculation of effective bandwidth, and VAP is used for realizing control logic. In the simulation scheme, the proportion of medium-sized vehicles to small vehicles is 90%, the speed is 45-60 km/h, the proportion of large vehicles to large vehicles is 10%, the speed is 25-30 km/h, 3600 seconds are simulated in total, the flow of the first 600 seconds is small, the simulation scheme is used for balancing a road network, the duration of a peak period is 2400 seconds, namely the peak time is from 600 seconds to 3000 seconds, the rest time is the peak-flattening time, and the traffic volume of the peak time in the simulation is 1.2-1.5 times of the peak-flattening time.
The simulation scheme is divided into two schemes, and green wave coordination control is adopted in the whole simulation period of the scheme I; and in the second scheme, green wave coordination control is adopted in the initial simulation stage, an effective bandwidth calculation method is adopted for monitoring, and when the effective bandwidth is found to be smaller than a threshold value, the window flow control scheme is converted. In order to simplify the calculation, only the green wave control is carried out on the trunk line from the west to the east; in the green wave coordination control scheme, the time length of a signal cycle shared by three intersections is 95 seconds, the designed bandwidth is 20 seconds, and the threshold value of the effective bandwidth is set to be 5 seconds.
The invention designs an effective bandwidth evaluation Algorithm (ASAB) to realize real-time calculation of the effective bandwidth in the existing trunk coordination control system.
The design conditions of the ASAB algorithm include: (1) the number of intersections participating in the trunk line coordination is N, wherein N is more than or equal to 2; (2) the road section between the tail end intersection participating in the coordination control and the adjacent downstream intersection is long, and vehicles released by the tail end intersection can be accommodated without queuing and overflowing; (3) the vehicle detector signal machine can acquire the speed and the type information of the arriving vehicle and the accumulated number of the vehicles passing through the detector in real time; (4) the time interval for the semaphores to perform the ASAB is the same as the period of the current trunk coordination control system.
The calculation formula of the effective bandwidth is ABW-min { G ═ min }pub(i) Where ABW is the effective bandwidth of the trunk coordination system, Gpub(i) The green time is the public green time of the ith intersection. The public green time of each intersection can be represented by formula Gpub(i)=G(i)-Gpriv(i) Calculated, wherein G (i) is the green time of the trunk direction of the ith intersection, Gpriv(i) Is the private green time of the ith intersection. The private green time of each intersection can be Gpriv(i) N (η, θ, i) × h. N (eta, theta, i) is the number of queued vehicles before a stop line at the starting moment of a green light in the i trunk direction of the intersection, and h is the saturated headway.
The calculation process of the ASAB algorithm is as follows:
(1) obtaining green light time G (i) of a main line direction of a current signal cycle intersection i, wherein i is 1, 2, …, N;
(2) monitoring whether the red light time of the trunk line direction at the intersection i is finished, if so, turning to the step (3), otherwise, continuing monitoring, wherein i is 1, 2, …, N;
(3) calculating the number N (eta, theta, i) of queued vehicles before a stop line at the starting time of a green light in the trunk direction of an intersection i, wherein i is 1, 2, … … and N;
(4) calculating the private green time G of the intersection ipriv(i),i=1,2,……,N;
(5) Calculating the public green time G of the intersection ipub(i),i=1,2,……,N;
(6) Calculating the minimum common green time min { G ] of the N intersectionspub(i) I.e. the effective bandwidth ABW.
(7) Outputting the effective bandwidth of the trunk line signal coordination control system in the current period, and matching min { G }pub(i) Giving 1 mark penalty to the intersection i belonging to, namely, finish (i) ═ finish (i) + 1;
(8) if the ABW is smaller than the threshold value delta, the current trunk line signal coordination control is invalid, and max { push (i) } belonging intersection is output; otherwise, turning to the step (1), and monitoring the next signal period.
2. And (3) analyzing simulation results by combining with the figure 5, wherein in the first scheme, in order to analyze the execution effect of the trunk line green wave coordination control, an effective bandwidth searching algorithm is adopted to carry out whole-process monitoring on the trunk line green wave coordination control during the simulation period. In the front part of the simulation period of the trunk line coordination control system in the first scheme, due to the fact that the traffic flow is small, the traffic load of a trunk line system is low, the effective bandwidth of the system is large, and the green wave control effect achieved by the trunk line system is good in the period; however, as the traffic flow increases, the traffic load of the whole trunk system continuously increases, and the effective bandwidth of the system gradually decreases until 0, which indicates that the actual green wave passing is difficult to realize in the trunk green wave coordination control during this period, and the trunk system is in a saturated state.
And in a second scheme, the green wave coordination control scheme in the first scheme is still adopted in the initial stage, and when the effective bandwidth threshold of the trunk system is monitored to be lower than 5 seconds, the green wave coordination control scheme is stopped and switched to the window flow control scheme provided by the invention. And the intersections numbered 3 and 2 timely send window traffic notifications to the upstream intersections, and the intersections 1 and 2 calculate the distributed green light time according to the number of queued vehicles in the direction and the received window traffic notifications.
Tables 1 and 2 are comparative results of performance evaluation of the control effect of the two schemes.
TABLE 1 comparison of queue lengths for two trunk signal control schemes
Figure BSA00000699366200111
TABLE 2 comparison of delay and number of passing vehicles for two scenarios
Figure BSA00000699366200121
It can be seen from comparison of performance indexes output by the VISSIM that after the control scheme of window flow control is implemented, the average queuing length and the maximum queuing length of the congested flow direction of the trunk line can be effectively reduced, the average delay of vehicles on the trunk line is greatly reduced, the total average delay of intersections is also reduced, the number of passing vehicles is relatively increased, and the trunk line coordination control scheme of implementing window flow control under the congested condition can effectively relieve the traffic congestion condition in the trunk line direction. Although the average delay of the south-north entrances of each intersection is increased after the trunk line coordination control scheme of window flow control is implemented, compared with the trunk line green wave coordination control mode, the queuing length is not increased greatly, and it is stated that the traffic flow in other competition directions is not overcrowded due to the release of the traffic flow in the trunk line direction. From the perspective of the whole system, although the benefits of traffic flows in other competing directions are sacrificed, the benefits of the whole system are maximized, the smoothness of a trunk line can be effectively ensured, and the phenomenon of deadlock is avoided. Through various evaluation indexes, the trunk dynamic coordination control mode for implementing window flow control under the saturation condition is more effective.
It should be noted that: several modifications can be made without departing from the technical principle of the present invention, and these modifications can also be regarded as the protection scope of the present invention.

Claims (6)

1. A traffic control method based on dynamic coordination of effective capacity of road sections mainly comprises the following steps:
(1) the upstream intersection sends a request to the downstream intersection to obtain a window flow notice;
(2) aiming at preferentially releasing the traffic flow in the crowded direction, calculating the green time required by the released vehicle according to the obtained real-time window flow;
(3) and (4) optimizing and distributing the final green light time in the direction by considering the current light color state of the downstream intersection and the remaining time of the downstream intersection.
2. The traffic control method according to claim 1, wherein the window traffic format is { T }i state,Ti remainASL (i) }, in which Ti stateThe method comprises the following steps of (e) (Red, Green and Yellow), and respectively indicating that the trunk direction of the ith intersection is a Red light, a Green light and a Yellow light; t isi remainRepresents the remaining time of a certain light color, asl (i) is the effective capacity of the current road section.
3. The traffic control method according to claim 1, wherein if the number of vehicles to be released at the upstream intersection is less than asl (i) in the window traffic notification, the required green light time g (i) is calculated according to the number of vehicles to be released, otherwise, the required green light time g (i) is calculated according to asl (i) in the window traffic notification.
4. A traffic control method according to claim 3, based on the number of vehicles to be released, with dynamic coordination of the effective capacity of the section of road:
G(i)=L(i)+(N(η,θ)+NΔ) X h, where G (i) is the green time, L (i) is the start loss time, h is the saturated headway, N (η, θ) is the number of queued vehicles to be released, NΔA newly joined vehicle during green light release.
5. A traffic control method with dynamic coordination according to effective capacity of road sections as claimed in claim 3, wherein asl (i) calculation method of green time required by vehicle number:
Figure FSA00000699366100011
wherein L isASLTime is lost for startup.
6. The traffic control method according to claim 5, wherein the calculation method for determining the green time finally comprises:
G(i)=GASL+Tremain If Tstate∈{Green,Yellow}
G(i)=GASL-Tremain If Tstate∈{Red}。
CN2012101052023A 2012-04-05 2012-04-05 Traffic control method for dynamic coordination according to effective capacity of road section Pending CN102610094A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2012101052023A CN102610094A (en) 2012-04-05 2012-04-05 Traffic control method for dynamic coordination according to effective capacity of road section

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2012101052023A CN102610094A (en) 2012-04-05 2012-04-05 Traffic control method for dynamic coordination according to effective capacity of road section

Publications (1)

Publication Number Publication Date
CN102610094A true CN102610094A (en) 2012-07-25

Family

ID=46527428

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2012101052023A Pending CN102610094A (en) 2012-04-05 2012-04-05 Traffic control method for dynamic coordination according to effective capacity of road section

Country Status (1)

Country Link
CN (1) CN102610094A (en)

Cited By (20)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103280096A (en) * 2013-03-29 2013-09-04 苏州数伦科技有限公司 Traffic monitoring management system
CN103778792A (en) * 2014-01-09 2014-05-07 东南大学 Urban trunk one-way green wave control optimization method considering vehicle speed non-uniformity
CN106023607A (en) * 2015-03-25 2016-10-12 贵州省交通规划勘察设计研究院股份有限公司 Traffic light control method and system
CN106710251A (en) * 2017-01-20 2017-05-24 黄勇 Control system for controlling traffic flow and device and method for controlling traffic flow
CN108074403A (en) * 2018-01-18 2018-05-25 徐晓音 Control method and system that the traffic lights of crossing vehicle congestion is shown are prevented based on bidirectional camera shooting head
CN108281017A (en) * 2018-03-16 2018-07-13 武汉理工大学 A kind of intersection traffic modulating signal control method based on bus or train route cooperative system
CN108389405A (en) * 2018-04-25 2018-08-10 招商局重庆交通科研设计院有限公司 Road traffic capacity control method
CN108428338A (en) * 2017-02-15 2018-08-21 阿里巴巴集团控股有限公司 Traffic analysis method, device and electronic equipment
WO2018184413A1 (en) * 2017-04-07 2018-10-11 孟卫平 Green wave control method for traffic signals
CN109003443A (en) * 2018-07-02 2018-12-14 北方工业大学 Urban road intersection overflow control method based on geomagnetic detector
CN109285362A (en) * 2018-12-07 2019-01-29 北京工业大学 The anti-overflow dynamic control method in intersection based on priority rule
CN109300317A (en) * 2018-10-17 2019-02-01 哈尔滨工业大学 The signal control method of left turn waiting zone when straight trip, left-hand rotation common phase position
CN109472985A (en) * 2017-09-07 2019-03-15 济南全通信息科技有限公司 Actual traffic demand volume estimation method based on road trip time
CN110264749A (en) * 2019-07-19 2019-09-20 郑州工程技术学院 Based on cloud computing method for controlling traffic signal lights, device, memory and processor
CN110364002A (en) * 2019-05-22 2019-10-22 江苏科创交通安全产业研究院有限公司 A kind of vehicle three-level Induction Control method and system in Traffic Net
CN111243301A (en) * 2020-01-15 2020-06-05 长沙理工大学 Traffic signal lamp green light duration determination device, method and system
CN111915885A (en) * 2020-06-24 2020-11-10 广州运星科技有限公司 Urban road traffic simulation experiment method and system
CN113470390A (en) * 2021-07-09 2021-10-01 公安部交通管理科学研究所 Multiphase dynamic coordination control method for short-link intersection edge node fusion
CN114120654A (en) * 2022-01-26 2022-03-01 南京原力智能科技有限公司 General calculation method for influence of number of vehicles running on road network traffic capacity
CN114639255A (en) * 2022-03-28 2022-06-17 浙江大华技术股份有限公司 Traffic signal control method, device, equipment and medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101308604A (en) * 2008-01-30 2008-11-19 吉林大学 Traffic coordinating and controlling method with strategy of big range
CN101325008A (en) * 2008-07-25 2008-12-17 浙江大学 Dynamic bidirectional green wave band intelligent coordination control method for urban traffic trunk line
JP2010271990A (en) * 2009-05-22 2010-12-02 Nippon Signal Co Ltd:The Traffic signal control system
JP2010287125A (en) * 2009-06-12 2010-12-24 Nippon Signal Co Ltd:The Traffic signal control system
CN101968929A (en) * 2010-10-19 2011-02-09 北方工业大学 Optimizing control method for single intersection signal in saturated traffic state

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101308604A (en) * 2008-01-30 2008-11-19 吉林大学 Traffic coordinating and controlling method with strategy of big range
CN101325008A (en) * 2008-07-25 2008-12-17 浙江大学 Dynamic bidirectional green wave band intelligent coordination control method for urban traffic trunk line
JP2010271990A (en) * 2009-05-22 2010-12-02 Nippon Signal Co Ltd:The Traffic signal control system
JP2010287125A (en) * 2009-06-12 2010-12-24 Nippon Signal Co Ltd:The Traffic signal control system
CN101968929A (en) * 2010-10-19 2011-02-09 北方工业大学 Optimizing control method for single intersection signal in saturated traffic state

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
郭海锋: "窗口流量控制的干线动态协调控制方法", 《控制理论与应用》, vol. 27, no. 12, 31 December 2010 (2010-12-31), pages 1686 - 1692 *

Cited By (25)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103280096A (en) * 2013-03-29 2013-09-04 苏州数伦科技有限公司 Traffic monitoring management system
CN103778792A (en) * 2014-01-09 2014-05-07 东南大学 Urban trunk one-way green wave control optimization method considering vehicle speed non-uniformity
CN103778792B (en) * 2014-01-09 2015-04-15 东南大学 Urban trunk one-way green wave control optimization method considering vehicle speed non-uniformity
CN106023607A (en) * 2015-03-25 2016-10-12 贵州省交通规划勘察设计研究院股份有限公司 Traffic light control method and system
CN106710251A (en) * 2017-01-20 2017-05-24 黄勇 Control system for controlling traffic flow and device and method for controlling traffic flow
US12014629B2 (en) 2017-02-15 2024-06-18 Alibaba Group Holding Limited Road traffic analysis methods and apparatuses
CN108428338A (en) * 2017-02-15 2018-08-21 阿里巴巴集团控股有限公司 Traffic analysis method, device and electronic equipment
US11380195B2 (en) 2017-02-15 2022-07-05 Alibaba Group Holding Limited Road traffic analysis methods and apparatuses
WO2018184413A1 (en) * 2017-04-07 2018-10-11 孟卫平 Green wave control method for traffic signals
CN109472985A (en) * 2017-09-07 2019-03-15 济南全通信息科技有限公司 Actual traffic demand volume estimation method based on road trip time
CN109472985B (en) * 2017-09-07 2021-06-01 济南全通信息科技有限公司 Actual traffic demand flow estimation method based on road section travel time
CN108074403A (en) * 2018-01-18 2018-05-25 徐晓音 Control method and system that the traffic lights of crossing vehicle congestion is shown are prevented based on bidirectional camera shooting head
CN108281017A (en) * 2018-03-16 2018-07-13 武汉理工大学 A kind of intersection traffic modulating signal control method based on bus or train route cooperative system
CN108389405A (en) * 2018-04-25 2018-08-10 招商局重庆交通科研设计院有限公司 Road traffic capacity control method
CN109003443A (en) * 2018-07-02 2018-12-14 北方工业大学 Urban road intersection overflow control method based on geomagnetic detector
CN109300317A (en) * 2018-10-17 2019-02-01 哈尔滨工业大学 The signal control method of left turn waiting zone when straight trip, left-hand rotation common phase position
CN109285362A (en) * 2018-12-07 2019-01-29 北京工业大学 The anti-overflow dynamic control method in intersection based on priority rule
CN110364002A (en) * 2019-05-22 2019-10-22 江苏科创交通安全产业研究院有限公司 A kind of vehicle three-level Induction Control method and system in Traffic Net
CN110264749A (en) * 2019-07-19 2019-09-20 郑州工程技术学院 Based on cloud computing method for controlling traffic signal lights, device, memory and processor
CN111243301A (en) * 2020-01-15 2020-06-05 长沙理工大学 Traffic signal lamp green light duration determination device, method and system
CN111915885A (en) * 2020-06-24 2020-11-10 广州运星科技有限公司 Urban road traffic simulation experiment method and system
CN111915885B (en) * 2020-06-24 2024-01-23 广州运星科技有限公司 Urban road traffic simulation experiment method and system
CN113470390A (en) * 2021-07-09 2021-10-01 公安部交通管理科学研究所 Multiphase dynamic coordination control method for short-link intersection edge node fusion
CN114120654A (en) * 2022-01-26 2022-03-01 南京原力智能科技有限公司 General calculation method for influence of number of vehicles running on road network traffic capacity
CN114639255A (en) * 2022-03-28 2022-06-17 浙江大华技术股份有限公司 Traffic signal control method, device, equipment and medium

Similar Documents

Publication Publication Date Title
CN102610094A (en) Traffic control method for dynamic coordination according to effective capacity of road section
CN102622887A (en) Calculating method of effective capacity of road sections
CN107798868B (en) A kind of signalized intersections u-turn opening bit selecting method that traffic flow composition influences
CN108597235B (en) Intersection signal parameter optimization and effect evaluation method based on traffic video data
WO2018072240A1 (en) Direction-variable lane control method for tidal traffic flow on road network
CN109872544A (en) A kind of control method and device of traffic signals
WO2016202009A1 (en) Road traffic light coordination and control method based on reinforcement learning
CN113516854B (en) Multi-interface coordination self-adaptive control method based on police card and video detector
CN111833620B (en) Supersaturated traffic state trunk line one-way signal coordination design method and device
CN109191847B (en) Self-adaptive trunk line coordination control method and system based on city gate data
CN111127872B (en) Control method of straight-right variable guide lane considering pedestrian and right-turn vehicle collision
CN105160894B (en) The optimization method of At-grade intersection signal control based on vehicle queue length
CN110910662A (en) Single-point self-adaptive traffic signal optimization control method under cooperative vehicle and road environment
CN111932916B (en) Control method and control system for dynamic emergency lane of urban road
CN109461322B (en) Intelligent navigation method, device, equipment and readable storage medium
WO2013007075A1 (en) Method and device for acquiring distributed duration for traffic lights
CN110211405B (en) Travel path planning method based on traffic information element model
CN112037540B (en) Tidal traffic state trunk line signal coordination design method and device
CN108629971A (en) A kind of traffic lamp control method and best speed determine method
CN104183147A (en) Bus driving speed control method for improving bus punctuality rate
CN115565390B (en) Intelligent network-connected automobile multi-lane queue traffic control method, system and computer readable storage medium
CN110444031A (en) Phase control method, apparatus and system with the comprehensive intersection to row area
CN111047883A (en) Traffic signal control method for key intersection and adjacent intersection
CN107293134A (en) Bus signals priority acccess control strategy based on virtual electronic fence
CN114155724A (en) Intersection traffic signal control method under Internet of vehicles environment

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C02 Deemed withdrawal of patent application after publication (patent law 2001)
WD01 Invention patent application deemed withdrawn after publication

Application publication date: 20120725