A method, system and storage medium for identifying potential traffic bottlenecks on urban roads

By calculating the bottleneck discrimination coefficients of each section, combining the road network structure and traffic demand characteristics, potential traffic bottlenecks are identified, and the problem of failure to effectively identify potential traffic bottlenecks in the existing technology is solved, providing better traffic management decision-making basis and optimization plan.

CN114926976BActive Publication Date: 2024-11-29WUHAN URBAN PLANNING & DESIGN INST
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202210316663.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2022-03-28
Publication Date
2024-11-29
Estimated Expiration
2042-03-28

AI Technical Summary

Technical Problem

The prior art has shortcomings in identifying potential traffic bottlenecks in urban roads, and fails to effectively consider signal control factors, making it difficult to identify and optimize traffic management in advance.

Method used

By collecting road network topology information, signal control information and traffic turn information, the bottleneck discrimination coefficients of each section are calculated, potential traffic bottlenecks are identified and their causes are analyzed, and combined with road network structure and traffic demand characteristics, a potential traffic bottleneck identification of urban roads is provided. Methods and systems.

Benefits of technology

Effectively identify potential traffic bottlenecks, provide decision-making basis for traffic management, optimize and improve traffic measures, and reduce traffic congestion risks.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN114926976B_ABST
    Figure CN114926976B_ABST
Patent Text Reader

Abstract

The present invention relates to the field of urban traffic management, and aims to provide a method, system and storage medium for identifying potential traffic bottlenecks in urban roads. The method for identifying potential traffic bottlenecks in an urban road network comprises the steps of obtaining basic information of each road section in the urban road network to be identified, calculating its bottleneck discrimination coefficient based on the basic information of the road section, judging whether the road section is a potential traffic bottleneck and analyzing the cause of its congestion in combination with the bottleneck discrimination coefficient. The present invention uses the defined bottleneck discrimination coefficient to identify potential traffic bottlenecks in an urban road network, which can effectively consider the signal control influence of each intersection of the urban road network, and provides a method for traffic management departments to discover and locate potential traffic bottlenecks.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the field of urban traffic management, and in particular to a method, system and storage medium for identifying potential traffic bottlenecks on urban roads. Background Art

[0002] Traffic bottlenecks are the main cause of traffic congestion, and their essence is the imbalance between traffic supply and traffic demand at local points and sections. On urban roads, traffic management, especially the signal scheme of signal-controlled intersections, is an important factor affecting traffic supply. Unreasonable signal schemes will cause vehicles to queue up multiple times at intersections, increase the length of road queues, and even cause queues to go back up, which seriously affects the operation of the traffic network. Therefore, it is very important to consider the impact of urban road traffic signal schemes in bottleneck research. In addition, existing research focuses on the characteristic analysis of traffic bottlenecks, the identification of existing traffic bottlenecks, and the congestion diffusion research of traffic bottlenecks. There are not many studies on potential traffic bottlenecks that have not yet developed into bottlenecks but may develop into bottlenecks. However, urban road networks are relatively complex and traffic congestion spreads rapidly. Identifying potential traffic bottlenecks in the traffic system can buy more time for traffic management and provide decision-making basis for optimizing and improving traffic management measures. Summary of the invention

[0003] The purpose of this application is to provide a method, system and storage medium for identifying potential traffic bottlenecks in urban roads, combining the road network structure characteristics, traffic demand characteristics, and signal control schemes to calculate the bottleneck discrimination coefficient of each section in the road network, further identify potential traffic bottlenecks in the road network and analyze the causes of congestion.

[0004] The technical solution of this application:

[0005] In a first aspect, an embodiment of the present application provides a method for identifying potential traffic bottlenecks on urban roads, comprising the following steps:

[0006] c1. Collect road network topology information, signal control information, and traffic diversion information in the study area, and form basic data with road sections as the basic analysis object;

[0007] c2. For any road section, calculate the bottleneck discrimination coefficients of left-turn traffic, through-traffic traffic, and right-turn traffic on that road section;

[0008] c3. For any road section, determine whether it is a potential traffic bottleneck based on the bottleneck discrimination coefficient of the road section, and analyze the possible causes of the traffic bottleneck;

[0009] The c1 collects the road network topology information, signal control information, and traffic diversion information in the study area, and forms basic data with the road section as the basic analysis object, including the following steps:

[0010] c11. Collect the road network topology data in the study area and construct matrix A to express the adjacency relationship between road sections:

[0011] A={a ij |i=1,2,…,M,j=1,2,…,M}

[0012] In the formula, matrix A represents the adjacency relationship between road segments. When road segment j is the downstream adjacent road segment of road segment i, a ij The value is 1, otherwise the value is 0, M is the number of road segments in the road network;

[0013] c12. Collect the number of lanes in the lane group where vehicles enter the downstream adjacent section from a certain section, and the green signal ratio corresponding to the lane group, and construct matrices N and Λ respectively to represent them:

[0014] N={n ij |i=1,2,…,M,j=1,2,…,M}

[0015] Λ={λ ij |i=1,2,…,M,j=1,2,…,M}

[0016] Where, the matrix N represents the number of lanes in the lane group. ij When n is 1, ij The value is the number of lanes in the lane group that the vehicle passes through when entering the road section j from the road section i, otherwise the value is 0;

[0017] The matrix Λ represents the green-to-signal ratio. ij When λ is 1, ij The value is the green signal ratio of the lane group that the vehicle passes through when entering the road section j from the road section i, otherwise the value is 0;

[0018] c13. Collect the turning ratios of traffic flows in different directions on each section of the road network, and construct matrices L, S, and R to represent the turning ratios of traffic flows entering the upstream section for left turn, straight ahead, and right turn on this section respectively:

[0019] L = {l ij |i=1,2,…,M,j=1,2,…,M}

[0020] S={s ij |i=1,2,…,M,j=1,2,…,M}

[0021] R = {r ij |i=1,2,…,M,j=1,2,…,M}

[0022] Where, matrix L represents the left-turn traffic ratio. ij When l is 1, ijThe value is the ratio of the flow rate of road section i entering road section j and turning left at road section j to the flow rate of road section i entering road section j within a certain period of time, otherwise the value is 0;

[0023] The matrix S represents the straight traffic turning ratio. ij When s is 1, ij The value is the ratio of the flow rate of road section i entering road section j and going straight out of road section j to the flow rate of road section i entering road section j within a certain period of time, otherwise the value is 0;

[0024] The matrix R represents the right-turn traffic diversion ratio. ij When r is 1, ij The value is the ratio of the flow rate of road section i entering road section j and turning right at road section j to the flow rate of road section i entering road section j within a certain period of time, otherwise the value is 0;

[0025] c14. Collect the signal cycle information of each section in the road network and construct vector C to represent it:

[0026] C={c i |i=1,2,…,M}

[0027] In the formula, vector C represents the signal period, c i The value is the downstream signal period of section i.

[0028] For any road section in c2, the bottleneck discrimination coefficients of left-turn traffic, through-traffic traffic, and right-turn traffic of the road section are calculated, including the following steps:

[0029] c21. Calculate the bottleneck discrimination coefficient of the left-turn traffic flow on section j:

[0030]

[0031] In the formula, is the bottleneck discrimination coefficient of the left-turn traffic flow on section j, h is the saturated headway, is the green signal ratio corresponding to the left-turn traffic flow on section j, is the number of lanes corresponding to the left-turn traffic on section j;

[0032] c22. Calculate the bottleneck discriminant coefficient of the through traffic flow on section j:

[0033]

[0034] In the formula, is the bottleneck discrimination coefficient of the through traffic flow on section j, h is the saturated headway, is the green signal ratio corresponding to the straight traffic flow on section j, is the number of lanes corresponding to the through traffic flow on section j;

[0035] c23. Calculate the bottleneck discrimination coefficient of the right-turn traffic flow on section j:

[0036]

[0037] In the formula, is the bottleneck discrimination coefficient of the right-turn traffic flow on section j, h is the saturated headway, is the green signal ratio corresponding to the right-turn traffic flow on section j, is the number of lanes corresponding to the right-turn traffic on section j.

[0038] In the above-mentioned c3, for any road section, judging whether it is a potential traffic bottleneck according to the bottleneck discrimination coefficient of the road section, and analyzing the possible causes of the traffic bottleneck, includes the following steps:

[0039] c31. If the bottleneck discrimination coefficients of left-turn traffic, through-traffic traffic, and right-turn traffic on section j are greater than 0, then the section is a potential traffic bottleneck;

[0040] c32. If road section j is a potential traffic bottleneck, among its bottleneck discrimination coefficients, when the maximum value is the left-turn traffic bottleneck discrimination coefficient, the left-turn traffic is more likely to cause the cumulative vehicles in the road section to continue to increase, making the road section prone to obstruction, lane occupation, and queuing caused by left-turn traffic; when the maximum value is the through traffic bottleneck discrimination coefficient, the through traffic is more likely to cause the cumulative vehicles in the road section to continue to increase, making the road section prone to obstruction, lane occupation, and queuing caused by through traffic; when the maximum value is the right-turn traffic bottleneck discrimination coefficient, the right-turn traffic is more likely to cause the cumulative vehicles in the road section to continue to increase, making the road section prone to obstruction, lane occupation, and queuing caused by right-turn traffic.

[0041] In the second aspect, an embodiment of the present application provides a potential traffic bottleneck identification system for urban roads, including a basic data acquisition module, a bottleneck discrimination coefficient calculation module and a potential traffic bottleneck discrimination module. The basic data acquisition module collects road network topology information, signal control information, and traffic steering information in the study area, and forms basic data with road sections as the basic analysis objects. The bottleneck discrimination coefficient calculation module calculates the bottleneck discrimination coefficients of left-turning traffic, through-traffic traffic, and right-turning traffic on any road section. The potential traffic bottleneck discrimination module determines whether the road section is a potential traffic bottleneck based on its bottleneck discrimination coefficient, and analyzes the possible causes of the traffic bottleneck.

[0042] The basic data acquisition module includes a road network topology data acquisition unit, a lane number and green signal ratio acquisition unit, a traffic flow turning ratio acquisition unit, and a signal cycle information acquisition unit. The road network topology data acquisition unit collects the road network topology data in the study area, and constructs a matrix A to express the adjacency relationship between road sections. The lane number and green signal ratio acquisition unit collects the lane number of the lane group of vehicles entering the downstream adjacent section from a certain section, and the green signal ratio corresponding to the lane group, and constructs matrices N and Λ respectively for representation. The lane number and green signal ratio acquisition unit collects the turning ratio of traffic flow in different directions in each section in the road network, and constructs matrices L, S, and R to respectively represent the flow turning ratios of left turn, straight go, and right turn of vehicles entering the upstream section in this section. The signal cycle information acquisition unit collects the signal cycle information of each section in the road network, and constructs a vector C for representation.

[0043] The bottleneck discrimination coefficient calculation module includes a bottleneck discrimination coefficient calculation unit for left-turn traffic, a bottleneck discrimination coefficient calculation unit for through-traffic traffic, and a bottleneck discrimination coefficient calculation unit for right-turn traffic.

[0044] In a third aspect, an embodiment of the present application provides a computer-readable storage medium, including a computer-readable storage medium storing a computer program. When the computer program is executed by a processor, the method for identifying potential traffic bottlenecks on urban roads as described above is implemented.

[0045] Compared with the prior art, the beneficial effects of the present invention are as follows: the present invention takes into account the influence of signal control unique to urban roads in the process of identifying road network bottlenecks, and identifies potential traffic bottlenecks that have not yet developed into bottlenecks but may develop into bottlenecks, thereby buying more time for traffic management and providing a decision-making basis for optimizing and improving traffic management measures. BRIEF DESCRIPTION OF THE DRAWINGS

[0046] Figure 1 Flowchart of the method for identifying potential traffic bottlenecks on urban roads.

[0047] Figure 2 Diagram of the potential traffic bottleneck identification system for urban roads.

[0048] Figure 3 This is an example road network. DETAILED DESCRIPTION

[0049] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0050] Embodiment 1:

[0051] The present invention will be described in detail below in conjunction with the accompanying drawings. Figure 1 As shown, the specific steps of the present invention are as follows.

[0052] Step 1: Collect the road network topology information, signal control information, and traffic diversion information in the study area, and form basic data with road sections as the basic analysis object:

[0053] Collect the road network topology data in the study area and construct the matrix A to express the adjacency relationship between road sections:

[0054] A={a ij |i=1,2,…,M,j=1,2,…,M}

[0055] In the formula, matrix A represents the adjacency relationship between road segments. When road segment j is the downstream adjacent road segment of road segment i, a ij The value is 1, otherwise the value is 0, M is the number of road segments in the road network;

[0056] The number of lanes in the lane group where vehicles enter the downstream adjacent section from a certain section and the green signal ratio corresponding to the lane group are collected, and matrices N and Λ are constructed respectively to represent them:

[0057] N={n ij |i=1,2,…,M,j=1,2,…,M}

[0058] Λ={λ ij |i=1,2,…,M,j=1,2,…,M}

[0059] Where, the matrix N represents the number of lanes in the lane group. ij When n is 1, ij The value is the number of lanes in the lane group that the vehicle passes through when entering the road section j from the road section i, otherwise the value is 0;

[0060] The matrix Λ represents the green-to-signal ratio. ij When λ is 1, ij The value is the green signal ratio of the lane group that the vehicle passes through when entering the road section j from the road section i, otherwise the value is 0;

[0061] The turning ratios of traffic flows in different directions on each section of the road network are collected, and matrices L, S, and R are constructed to represent the turning ratios of traffic flows entering the upstream section for left turns, straight driving, and right turns on this section, respectively:

[0062] L = {l ij |i=1,2,…,M,j=1,2,…,M}

[0063] S={s ij|i=1,2,…,M,j=1,2,…,M}

[0064] R = {r ij |i=1,2,…,M,j=1,2,…,M}

[0065] Where, matrix L represents the left-turn traffic ratio. ij When l is 1, ij The value is the ratio of the flow rate of road section i entering road section j and turning left at road section j to the flow rate of road section i entering road section j within a certain period of time, otherwise the value is 0;

[0066] The matrix S represents the straight traffic turning ratio. ij When s is 1, ij The value is the ratio of the flow rate of road section i entering road section j and going straight out of road section j to the flow rate of road section i entering road section j within a certain period of time, otherwise the value is 0;

[0067] The matrix R represents the right-turn traffic diversion ratio. ij When r is 1, ij The value is the ratio of the flow rate of road section i entering road section j and turning right at road section j to the flow rate of road section i entering road section j within a certain period of time, otherwise the value is 0;

[0068] Collect the signal cycle information of each section in the road network and construct a vector C to represent it:

[0069] C={c i |i=1,2,…,M}

[0070] In the formula, vector C represents the signal period, c i The value is the downstream signal period of section i.

[0071] Step 2: For any road section, calculate the bottleneck discrimination coefficients of left-turn traffic, through traffic, and right-turn traffic on that road section:

[0072] Calculate the bottleneck discriminant coefficient of left-turn traffic on section j:

[0073]

[0074] In the formula, is the bottleneck discrimination coefficient of the left-turn traffic flow on section j, h is the saturated headway, is the green signal ratio corresponding to the left-turn traffic flow on section j, is the number of lanes corresponding to the left-turn traffic on section j;

[0075] Calculate the bottleneck discriminant coefficient of the through traffic flow on section j:

[0076]

[0077] In the formula, is the bottleneck discrimination coefficient of the through traffic flow on section j, h is the saturated headway, is the green signal ratio corresponding to the straight traffic flow on section j, is the number of lanes corresponding to the through traffic flow on section j;

[0078] Calculate the bottleneck discriminant coefficient of the right-turn traffic flow on section j:

[0079]

[0080] In the formula, is the bottleneck discrimination coefficient of the right-turn traffic flow on section j, h is the saturated headway, is the green signal ratio corresponding to the right-turn traffic flow on section j, is the number of lanes corresponding to the right-turn traffic on section j.

[0081] Step 3: For any road section, determine whether it is a potential traffic bottleneck based on the bottleneck discrimination coefficient of the road section, and analyze the possible causes of the traffic bottleneck:

[0082] If the bottleneck discrimination coefficients of left-turn traffic, through traffic, and right-turn traffic on section j are greater than 0, then the section is a potential traffic bottleneck;

[0083] If road section j is a potential traffic bottleneck, among its bottleneck discrimination coefficients, when the maximum value is the bottleneck discrimination coefficient of left-turn traffic, left-turn traffic is more likely to cause a continuous increase in the accumulated vehicles in the road section, making the road section prone to blockage, road occupation, and queuing caused by left-turn traffic; when the maximum value is the bottleneck discrimination coefficient of through traffic, through traffic is more likely to cause a continuous increase in the accumulated vehicles in the road section, making the road section prone to blockage, road occupation, and queuing caused by through traffic; when the maximum value is the bottleneck discrimination coefficient of right-turn traffic, right-turn traffic is more likely to cause a continuous increase in the accumulated vehicles in the road section, making the road section prone to blockage, road occupation, and queuing caused by right-turn traffic.

[0084] Embodiment 2:

[0085] This embodiment proposes a potential traffic bottleneck identification system for urban roads, including a basic data acquisition module 1, a bottleneck discrimination coefficient calculation module 2 and a potential traffic bottleneck discrimination module 3. The basic data acquisition module 1 collects road network topology information, signal control information, and traffic flow steering information in the study area, and forms basic data with road sections as basic analysis objects. The bottleneck discrimination coefficient calculation module 2 calculates the bottleneck discrimination coefficients of left-turning traffic, through-traffic traffic, and right-turning traffic on any road section. The potential traffic bottleneck discrimination module 3 determines whether the road section is a potential traffic bottleneck based on the bottleneck discrimination coefficient of the road section, and analyzes the possible causes of the traffic bottleneck.

[0086] The basic data acquisition module 1 includes a road network topology data acquisition unit 10, a lane number and green signal ratio acquisition unit 11, a traffic flow turning ratio acquisition unit 12, and a signal cycle information acquisition unit 13. The road network topology data acquisition unit 10 collects the road network topology data in the study area, and constructs a matrix A to express the adjacency relationship between road sections. The lane number and green signal ratio acquisition unit 11 collects the lane number of the lane group of vehicles entering the downstream adjacent road section from a certain road section, and the green signal ratio corresponding to the lane group, and constructs matrices N and Λ respectively for representation. The lane number and green signal ratio acquisition unit 11 collects the turning ratio of traffic flow in different directions in each road section in the road network, and constructs matrices L, S, and R to respectively represent the flow turning ratios of left turn, straight going, and right turn of the vehicle flow entering the upstream road section in this road section. The signal cycle information acquisition unit 13 collects the signal cycle information of each road section in the road network, and constructs a vector C for representation.

[0087] The bottleneck discrimination coefficient calculation module 2 includes a bottleneck discrimination coefficient calculation unit 20 for left-turn traffic, a bottleneck discrimination coefficient calculation unit 21 for through traffic, and a bottleneck discrimination coefficient calculation unit 22 for right-turn traffic.

[0088] Embodiment 3:

[0089] This embodiment proposes a method for identifying potential traffic bottlenecks on urban roads. The method combines the road network structure characteristics, traffic demand characteristics, and signal control schemes to calculate the bottleneck discrimination coefficient of each road section in the road network, further identify potential traffic bottlenecks in the road network and analyze the causes of congestion.

[0090] This embodiment illustrates the identification of potential traffic bottlenecks on urban roads with reference to specific data.

[0091] Figure 3 The example road network plan includes 7 signalized intersections and 22 road sections, that is, M = 22. According to the topological relationship between the road sections, the matrix A is constructed as shown in Table 1.

[0092] Table 1:

[0093] 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 1 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 1 4 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 6 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 8 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 9 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 10 1 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 11 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 12 0 0 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 13 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 14 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 1 0 0 0 0 15 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 1 0 16 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 17 0 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 18 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 1 0 0 0 19 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 20 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 21 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 22 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0

[0094] The number of lanes in the lane group where vehicles enter the downstream adjacent section from each section and the green-signal ratio corresponding to the lane group are collected, and the matrices N and Λ are constructed respectively as shown in Tables 2 and 3.

[0095] Table 2:

[0096] 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 1 0 0 2 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 1 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 0 1 4 0 1 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 0 0 1 0 0 1 0 0 0 0 0 0 0 0 6 0 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 1 0 0 0 0 8 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 9 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 1 0 0 0 10 2 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 11 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 12 0 0 0 0 0 1 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 13 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 14 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 2 0 0 0 0 15 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 1 0 16 0 0 0 0 0 0 0 1 0 0 0 0 1 0 0 0 0 1 0 0 0 0 17 0 0 0 0 0 0 0 1 0 0 0 0 1 0 1 0 0 0 0 0 0 0 18 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0 0 1 0 0 0 19 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 1 0 20 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 21 0 0 0 1 0 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 22 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 1 0 0

[0097] Table 3:

[0098]

[0099]

[0100] The turning ratios of traffic flows in different directions on each section of the road network are collected, and matrices L, S, and R are constructed as shown in Table 4, Table 5, and Table 6, respectively.

[0101] Table 4:

[0102] 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 1 0 0 0.6 0 0.7 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0.3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0.4 0 0 0 0 0 0 0 0 0 0.6 4 0 0 0 0 0.6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 0 0 0.6 0 0 0.3 0 0 0 0 0 0 0 0 6 0 0 0.6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.5 0 0 0.6 0 0 0 0 8 0.4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 9 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.3 0 0 0 0 0 10 0.6 0 0 0 0 0 0.4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 11 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.6 12 0 0 0 0 0 0.4 0 0 0 0 0 0 0 0.3 0 0 0 0 0 0 0 0 13 0 0 0 0 0 0.7 0 0 0 0 0.5 0 0 0 0 0 0 0 0 0 0 0 14 0 0 0 0 0 0 0 0.2 0 0 0 0 0 0 0.4 0 0 0.5 0 0 0 0 15 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.7 0 0 16 0 0 0 0 0 0 0 0.6 0 0 0 0 0 0 0 0 0 0.7 0 0 0 0 17 0 0 0 0 0 0 0 0.5 0 0 0 0 0 0 0.6 0 0 0 0 0 0 0 18 0 0 0 0 0 0 0 0 0 0.7 0 0 0 0 0 0 0 0 0 0 0 0 19 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.4 0 0 0 0 0 0 20 0 0 0 0 0 0 0 0 0 0.6 0 0 0 0 0 0 0.4 0 0 0 0 0 21 0 0 0 0 0 0 0 0 0 0 0 0.6 0 0 0 0 0 0 0 0 0 0 22 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.4 0 0 0 0.5 0 0

[0103] Table 5:

[0104] 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 1 0 0 0.4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0 0 0.4 0 0.6 0 0 0 0 0 0 0 0 0 0 0 0 0 3 0 0 0 0 0 0 0 0 0 0 0 0.6 0 0 0 0 0 0 0 0 0 0.4 4 0 0.5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0.5 0 0 0 0 0 0 0 0 6 0 0.6 0.4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 7 0 0 0 0 0 0 0 0 0 0 0 0 0.5 0 0 0 0 0 0 0 0 0 8 0.6 0 0 0 0 0 0 0 0.4 0 0 0 0 0 0 0 0 0 0 0 0 0 9 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.4 0 0.7 0 0 0 10 0.4 0 0 0 0 0 0.4 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 11 0 0 0 0.7 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.4 12 0 0 0 0 0 0 0 0 0 0 0 0 0 0.4 0 0 0 0 0 0 0 0 13 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 14 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 15 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.3 0.5 0 16 0 0 0 0 0 0 0 0 0 0 0 0 0.7 0 0 0 0 0 0 0 0 0 17 0 0 0 0 0 0 0 0 0 0 0 0 0.7 0 0 0 0 0 0 0 0 0 18 0 0 0 0 0 0 0 0 0 0.3 0 0 0 0 0 0 0 0 0.6 0 0 0 19 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.4 0 0 0 0 0.6 0 20 0 0 0 0 0 0 0 0 0 0.4 0 0 0 0 0 0 0.4 0 0 0 0 0 21 0 0 0 0.6 0 0 0 0 0 0 0 0.4 0 0 0 0 0 0 0 0 0 0 22 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0.2 0 0 0 0.5 0 0

[0105] Table 6:

[0106]

[0107]

[0108] The signal period information of each section in the road network is collected and vector C is constructed. The downstream period of each section is shown in Table 7.

[0109] Table 7:

[0110]

[0111] Combined with the above data, the bottleneck discrimination coefficients of left-turn traffic, through-traffic traffic, and right-turn traffic on each road section are calculated respectively, where the saturated headway h is taken as 2.5 seconds. The calculation results of the bottleneck discrimination coefficient are shown in Table 8.

[0112] Table 8:

[0113]

[0114] It can be seen from the above table that in the example road network, only sections 2 and 9 are not potential traffic bottlenecks. Sections 3, 4, 13, 17, 19, and 21 are prone to traffic bottlenecks caused by through traffic, sections 8, 15, and 18 are prone to traffic bottlenecks caused by right-turn traffic, and other sections are prone to traffic bottlenecks caused by left-turn traffic.

[0115] An embodiment of the present application also provides a computer-readable storage medium, including a computer program stored in the computer-readable storage medium. When the computer program is executed by a processor, the above-mentioned method for identifying potential traffic bottlenecks on urban roads is implemented.

[0116] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment in combination with software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) that contain computer-usable program code.

[0117] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0118] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0119] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0120] In addition, it should be understood that although the present specification is described according to implementation modes, not every implementation mode contains only one independent technical solution. This description of the specification is only for the sake of clarity. Those skilled in the art should regard the specification as a whole. The technical solutions in each embodiment may also be appropriately combined to form other implementation modes that can be understood by those skilled in the art.

Claims

1. A method for identifying potential traffic bottlenecks on urban roads, characterized in that: The steps include: c1. Collect road network topology information, signal control information, and traffic diversion information in the study area, and form basic data with road sections as the basic analysis object; c2. For any road section, calculate the bottleneck discrimination coefficients of left-turn traffic, through-traffic traffic, and right-turn traffic on that road section; c3. For any road section, determine whether it is a potential traffic bottleneck based on the bottleneck discrimination coefficient of the road section, and analyze the possible causes of the traffic bottleneck; The c1 collects the road network topology information, signal control information, and traffic diversion information in the study area, and forms basic data with the road section as the basic analysis object, including the following steps: c11. Collect road network topology data in the study area and construct a matrix A Express the adjacency relationship between road segments: In the formula, the matrix A Indicates the adjacency relationship between road segments. j For road section i When the downstream adjacent section a ij The value is 1, otherwise the value is 0. M is the number of road segments in the road network; c12. Collect the number of lanes in the lane group where vehicles enter the downstream adjacent section from a certain section, and the green signal ratio corresponding to the lane group, and construct matrices respectively N、 To express: In the formula, the matrix N Indicates the number of lanes in the lane group. a ij When is 1, n ij The value is the road segment where the vehicle passes. i Enter the road j The number of lanes in the lane group passed, otherwise the value is 0; matrix Indicates the green letter ratio, when a ij When is 1, λ ij The value is the road segment where the vehicle passes. i Enter the road j The green signal ratio of the lane group passed, otherwise the value is 0; c13. Collect the turning ratios of traffic flows in different directions in each section of the road network and construct a matrix L, S, R They represent the traffic turning ratios of left turn, straight ahead and right turn of the traffic entering from the upstream section in this section respectively: In the formula, the matrix L Indicates the left-turn flow steering ratio. a ij When is 1, l ij The value is the road section within a certain period of time i Entering the road j And on the road j The traffic volume of the left-turn exit section accounts for the section i Entering the road j The ratio of the flow rate, otherwise the value is 0; matrix S Indicates the straight traffic steering ratio. a ij When is 1, s ij The value is the road section within a certain period of time i Entering the road j And on the road j The traffic volume of the straight-out section accounts for the section i Entering the road j The ratio of the flow rate, otherwise the value is 0; matrix R Indicates the right-turn flow steering ratio. a ij When is 1, r ij The value is the road section within a certain period of time i Entering the road j And on the road j The traffic volume of the right-turn exit section accounts for the section i Entering the road j The ratio of the flow rate, otherwise the value is 0; c14. Collect the signal cycle information of each section in the road network and construct vector C To express: In the formula, the vector C represents the signal period, c i The value is road segment i Downstream signal cycle; For any road section in c2, the bottleneck discrimination coefficients of left-turn traffic, through-traffic traffic, and right-turn traffic of the road section are calculated, including the following steps: c21. Calculate road sections j The bottleneck discriminant coefficient of left-turn traffic is: In the formula, For road section j The bottleneck discriminant coefficient of left-turn traffic flow is h is the saturation headway, For road section j The green signal ratio corresponding to left-turn traffic, For road section j The number of lanes corresponding to left-turn traffic; c22. Calculate road sections j The bottleneck discriminant coefficient of the through traffic flow is: In the formula, For road section j The bottleneck discriminant coefficient of the through traffic flow is h is the saturation headway, For road section j The green-signal ratio corresponding to the straight traffic flow, For road section j The number of lanes corresponding to through traffic; c23. Calculate road sections j The bottleneck discriminant coefficient of right-turn traffic flow is: In the formula, For road section j The bottleneck discriminant coefficient of the right-turn traffic flow is h is the saturation headway, For road section j The green signal ratio corresponding to right-turn traffic, For road section j The number of lanes corresponding to right-turn traffic.

2. A method for identifying potential traffic bottlenecks on urban roads according to claim 1, characterized in that: In the above-mentioned c3, for any road section, judging whether it is a potential traffic bottleneck according to the bottleneck discrimination coefficient of the road section, and analyzing the possible causes of the traffic bottleneck, includes the following steps: c31, if the road section j Among the bottleneck discrimination coefficients of left-turn traffic, through-traffic traffic, and right-turn traffic, if the bottleneck discrimination coefficient of traffic in any direction is greater than 0, then the road section is a potential traffic bottleneck; c32, if the road section j It is a potential traffic bottleneck. Among its bottleneck discrimination coefficients, when the maximum value is the bottleneck discrimination coefficient of left-turn traffic, left-turn traffic is more likely to cause the cumulative vehicles in the road section to continue to increase, making the road section prone to blockage, road occupation, and queuing caused by left-turn traffic; when the maximum value is the bottleneck discrimination coefficient of through traffic, through traffic is more likely to cause the cumulative vehicles in the road section to continue to increase, making the road section prone to blockage, road occupation, and queuing caused by through traffic; when the maximum value is the bottleneck discrimination coefficient of right-turn traffic, right-turn traffic is more likely to cause the cumulative vehicles in the road section to continue to increase, making the road section prone to blockage, road occupation, and queuing caused by right-turn traffic.

3. A system for identifying potential traffic bottlenecks on urban roads, characterized in that: The method comprises a basic data collection module (1), a bottleneck discrimination coefficient calculation module (2) and a potential traffic bottleneck discrimination module (3), wherein the basic data collection module (1) collects road network topology information, signal control information and traffic flow steering information in the research area, and forms basic data with the road section as the basic analysis object, the bottleneck discrimination coefficient calculation module (2) calculates the bottleneck discrimination coefficients of left-turning traffic, straight-going traffic and right-turning traffic on any road section, and the potential traffic bottleneck discrimination module (3) determines whether the road section is a potential traffic bottleneck according to the bottleneck discrimination coefficient of the road section, and analyzes the possible causes of the traffic bottleneck.

4. A system for identifying potential traffic bottlenecks on urban roads according to claim 3, characterized in that: The basic data acquisition module (1) comprises a road network topology data acquisition unit (10), a lane number and green signal ratio acquisition unit (11), a traffic flow turn ratio acquisition unit (12), and a signal cycle information acquisition unit (13). The road network topology data acquisition unit (10) acquires road network topology data in a research area and constructs a matrix A The lane number and green signal ratio collection unit (11) collects the lane number of the lane group of the vehicle entering the downstream adjacent road section from a certain road section and the green signal ratio corresponding to the lane group, and constructs matrices N、 The lane number and green signal ratio acquisition unit (11) collects the turning ratios of traffic flows in different directions in each section of the road network and constructs a matrix L, S, R They respectively represent the flow turning ratios of left turn, straight going and right turn of the traffic flow entering the upstream section in this section. The signal cycle information collection unit (13) collects the signal cycle information of each section in the road network and constructs a vector C To express.

5. A system for identifying potential traffic bottlenecks on urban roads according to claim 4, characterized in that: The bottleneck discrimination coefficient calculation module (2) comprises a bottleneck discrimination coefficient calculation unit (20) for left-turn traffic, a bottleneck discrimination coefficient calculation unit (21) for straight traffic, and a bottleneck discrimination coefficient calculation unit (22) for right-turn traffic.

6. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the method for identifying potential traffic bottlenecks on urban roads according to any one of claims 1 to 2 is implemented.

Citation Information

Patent Citations

  • Road node recognition method and device

    CN106898139A

  • Congestion early warning method for expressway bottle-neck road segment

    CN107993438A