CN109509350B - Intersection operation efficiency calculation method based on directed binary weight network - Google Patents
Intersection operation efficiency calculation method based on directed binary weight network Download PDFInfo
- Publication number
- CN109509350B CN109509350B CN201811582116.5A CN201811582116A CN109509350B CN 109509350 B CN109509350 B CN 109509350B CN 201811582116 A CN201811582116 A CN 201811582116A CN 109509350 B CN109509350 B CN 109509350B
- Authority
- CN
- China
- Prior art keywords
- intersection
- network
- directed binary
- operation efficiency
- weight
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0125—Traffic data processing
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/01—Detecting movement of traffic to be counted or controlled
- G08G1/0104—Measuring and analyzing of parameters relative to traffic conditions
- G08G1/0137—Measuring and analyzing of parameters relative to traffic conditions for specific applications
Abstract
A method for calculating the running efficiency of an intersection based on a directed binary weight network comprises the following steps: (1) establishing an intersection directed binary network by taking the road sections as nodes and the intersections connecting the road sections as line sections; (2) acquiring the weight of each line segment in the intersection directed binary network according to the acquired traffic flow data; (3) and calculating the efficiency of the intersection directed binary weight network based on the construction of the directed binary weight network, and obtaining the operation efficiency of the intersection. According to the invention, the operation efficiency of the intersection is obtained through the construction of the directed binary network of the intersection and the effective estimation of the weight of the line segments in the network, and the result can be applied to a traffic guidance and control system.
Description
Technical Field
The invention belongs to the field of traffic control, and relates to an intersection operation efficiency calculation method based on a directed binary weight network.
Background
The urban road network state is the basis for traffic control and traffic inducement. The problem of traffic congestion seriously affects the sustainable development of cities. The essential reason for the traffic jam is that the traffic supply capacity is not matched with the traffic demand, so that the phenomena of local traffic flow concentration, traffic space-time resource waste and the like are caused. The intersection is a node of an urban road network and is also a key point for vehicle collection, steering and evacuation. The effective calculation of the intersection running efficiency is a precondition for making reasonable and effective traffic control and guidance decisions, is an important way for improving the road passing efficiency, and is also a key for relieving traffic jam.
At present, the existing intersection operation efficiency calculation methods mainly include intersection operation efficiency calculation methods based on indexes such as delay time, vehicle passing, passing time and evaluation queuing. However, these methods have certain limitations: (1) the intersection running efficiency calculation method is mainly based on VISSIM simulation software and cannot reflect actual traffic conditions; (2) the calculation of most indexes does not take into account the topology of the road network.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides the intersection running efficiency calculation method based on the directed binary weight network.
The technical scheme adopted by the invention is as follows:
a method for calculating the running efficiency of an intersection based on a directed binary weight network comprises the following steps:
(1) establishing an intersection directed binary network by taking the road sections as nodes and the intersections connecting the road sections as line sections;
(2) acquiring the weight of each line segment in the intersection directed binary network according to the acquired traffic flow data;
(3) and calculating the efficiency of the intersection directed binary weight network based on the construction of the directed binary weight network, and obtaining the operation efficiency of the intersection.
Further, the step (2) of obtaining the weight of each line segment in the intersection directed binary network comprises the following steps:
the section of road reaching the intersection is MiThe road section leaving the intersection is Nj(ii) a Connecting entry section MiExit road section NjSegment weight w ofij(t) is:
wherein S isij(t) denotes an entry route section M at time tiTo an exit stretch NjTraffic state of (1), mainly at the entrance section MiFlow data or saturation data for a certain flow direction; gamma rayij(t) is a traffic flow State SijMean value of (t), σij(t) is a traffic flow State Sij(t) mean square error.
Further, a traffic flow state Sij(t) is an entry road section MiFlow data or saturation data of a certain flow direction
Further, in the step (3), the weight of each line segment is used as the operation efficiency between each node pair, and the average value of the operation efficiency between all the node pairs of the directed binary weight network is used for representing the operation efficiency of the intersection.
The invention has the beneficial effects that: the running efficiency of the intersection is obtained through the construction of the directed binary network of the intersection and the effective estimation of the weight of the line segments in the network, and the result can be applied to a traffic guidance and control system.
Drawings
Fig. 1 is a schematic structural diagram of a directed binary network at a crossroad according to the present invention.
Fig. 2 is a schematic structural diagram of an exemplary intersection model of the present invention.
Fig. 3 is a schematic structural diagram of the intersection directed binary network in fig. 2.
Figures 4-10 are the intersection operating efficiencies obtained in the actual road segment.
Detailed Description
The present invention is further illustrated by the following examples, which are not intended to limit the invention to these embodiments. It will be appreciated by those skilled in the art that the present invention encompasses all alternatives, modifications and equivalents as may be included within the scope of the claims.
The embodiment provides an intersection operation efficiency calculation method based on a directed binary weight network, which comprises the following steps:
(1) step for establishing intersection directed binary network
Assume that the section of road to the intersection is MiM, N for the road section leaving the intersectionjThe number is n, the road sections are used as nodes, intersections connecting the entering road sections and the exiting road sections are used as line sections, a directed binary network of the intersections is constructed, as shown in figure 1, and the turning flow direction is less in the actual intersection, so that the directed binary network constructed by the method does not consider the turning flow direction;
specifically, in this embodiment, for a typical intersection, an entrance and an exit road section are set, as specifically shown in fig. 2. The directed bipartite network corresponding to the intersection is shown in fig. 3. The number of inlet segments is 4 and the number of outlet segments is 4.
(2) Step for obtaining directed binary network weight
For road section M arriving at intersectioniSetting a connection entry section MiExit road section NjSegment weight w ofij(t) is:
wherein S isij(t) denotes an entry route section M at time tiTo an exit stretch NjTraffic state of (1), mainly at the entrance section MiTraffic data or saturation data for a certain flow direction. Gamma rayij(t) is a traffic flow State SijMean value of (t), σij(t) is a traffic flow State Sij(t) mean square error.
The traffic flow state change is nonlinear, so that the traffic flow passes
And mapping the weight value to 0-1, wherein the larger the traffic flow state is, the lower the intersection running efficiency is, and the weight value belongs to 0-1, so as to obtain the weight calculation formula.
Specifically, in the present embodiment, the connection entrance section M1And exit road section N3Segment weight w of13(t) is:
wherein S is13(t) indicates a certain 15-minute entry route section M1To an exit stretch N1The traffic state of (i.e. the entry section M)1Straight-line flow data or saturation data. Gamma ray13(t) traffic flow status S of each time period all day of the day13Mean value of (t), σ13(t) is a traffic flow State S13(t) mean square error.
(3) Step of evaluating intersection state based on directed binary weight network
And (3) counting the weight of each line segment of the directed binary weight network, wherein the larger the traffic flow state is, the lower the running efficiency of the intersection is, so that the weight of each line segment is taken as the running efficiency between each node pair, and finally, the average value of the running efficiency between all the node pairs of the directed binary weight network is used for representing the running efficiency of the intersection.
For a typical intersection in this embodiment, the operation efficiency of the intersection at time t is as follows:
running straight at No. 1 No. 13 of No. 6 month in 2017 at the junction (818) of the liberation road and the autumn wave road in Hangzhou city of Zhejiang: 00-14: the time interval 00 is taken as an example, data such as the flow rate, the saturation, the corresponding mean value, the mean square error, the weight and the like are respectively given, and specific results are respectively shown in tables 1 and 2.
TABLE 1
TABLE 2
| Time period | Degree of saturation | Mean value | Mean square error | Weight of |
| 13：00-13：15 | 68 | 45.0 | 30.15 | 0.318 |
| 13：15-13：30 | 84 | 45.0 | 30.15 | 0.218 |
| 13：30-13：45 | 108 | 45.0 | 30.15 | 0.109 |
| 13：45-14：00 | 85 | 45.0 | 30.15 | 0.223 |
The obtained intersection running efficiency curve graph is shown in fig. 4-10, the intersection is started on the whole, and the intersection running efficiency lowest time period is mainly concentrated on 8: 00-18: 00, the time interval is mainly a commuting and traveling time interval of citizens, so the operation efficiency is low. And the change of the operating efficiency of the working days is similar, and the change of the operating efficiency of the weekends is similar. Therefore, the road condition needs to be 8: 00-18: and traffic guidance is carried out at the time of 00 hours, so that traffic jam is avoided.
Claims (3)
1. A method for calculating the running efficiency of an intersection based on a directed binary weight network comprises the following steps:
(1) establishing an intersection directed binary network by taking the road sections as nodes and the intersections connecting the road sections as line sections;
(2) according to the collected traffic flow data, the weights of all line segments in the intersection directed binary network are obtained, and the weights of all line segments in the intersection directed binary network are obtained by the following steps:
the section of road reaching the intersection is MiThe road section leaving the intersection is Nj(ii) a Connecting entry section MiExit road section NjSegment weight w ofij(t) is:
wherein S isij(t) denotes an entry route section M at time tiTo an exit stretch NjTraffic flow state of gammaij(t) is a traffic flow State SijMean value of (t), σij(t) is in the form of traffic flowState Sij(t) mean square error;
(3) and calculating the efficiency of the intersection directed binary weight network based on the construction of the directed binary weight network, and obtaining the operation efficiency of the intersection.
2. The intersection operation efficiency calculation method based on the directed binary weight network according to claim 1, characterized in that: the traffic flow state Sij(t) is an entry road section MiTraffic data or saturation data for a certain flow direction.
3. The intersection operation efficiency calculation method based on the directed binary weight network according to claim 1 or 2, characterized in that: and (3) taking the weight of each line segment as the operation efficiency between each node pair, and representing the operation efficiency of the intersection by using the average value of the operation efficiency between all the node pairs of the directed binary weight network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811582116.5A CN109509350B (en) | 2018-12-24 | 2018-12-24 | Intersection operation efficiency calculation method based on directed binary weight network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811582116.5A CN109509350B (en) | 2018-12-24 | 2018-12-24 | Intersection operation efficiency calculation method based on directed binary weight network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109509350A CN109509350A (en) | 2019-03-22 |
| CN109509350B true CN109509350B (en) | 2020-09-25 |
Family
ID=65754402
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811582116.5A Active CN109509350B (en) | 2018-12-24 | 2018-12-24 | Intersection operation efficiency calculation method based on directed binary weight network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109509350B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103337178A (en) * | 2013-06-28 | 2013-10-02 | 大连理工大学 | Traffic signal self-adaptive control method based on dynamic priority |
| US20140379628A1 (en) * | 2013-06-19 | 2014-12-25 | International Business Machines Corporation | Privacy risk metrics in location based services |
| CN104966403A (en) * | 2015-07-23 | 2015-10-07 | 合肥革绿信息科技有限公司 | Trunk line self-optimizing signal control method and device based on terrestrial magnetism |
| CN105070056A (en) * | 2015-07-23 | 2015-11-18 | 合肥革绿信息科技有限公司 | Intersection traffic congestion index calculation method based on floating car |
| CN105632177A (en) * | 2016-01-21 | 2016-06-01 | 浙江大学 | Dynamic traffic demand-oriented intersection operation efficiency change rate calculating method |
| CN108257384A (en) * | 2018-01-18 | 2018-07-06 | 沈阳建筑大学 | A kind of robustness of road network veneziano model determines method and system |
| CN108648444A (en) * | 2018-04-18 | 2018-10-12 | 北京交通大学 | A kind of signalized intersections postitallation evaluation method based on grid model |
| CN108921366A (en) * | 2018-03-24 | 2018-11-30 | 北京工业大学 | A kind of road network Important Sections screening technique based on PageRank algorithm |
-
2018
- 2018-12-24 CN CN201811582116.5A patent/CN109509350B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140379628A1 (en) * | 2013-06-19 | 2014-12-25 | International Business Machines Corporation | Privacy risk metrics in location based services |
| CN103337178A (en) * | 2013-06-28 | 2013-10-02 | 大连理工大学 | Traffic signal self-adaptive control method based on dynamic priority |
| CN104966403A (en) * | 2015-07-23 | 2015-10-07 | 合肥革绿信息科技有限公司 | Trunk line self-optimizing signal control method and device based on terrestrial magnetism |
| CN105070056A (en) * | 2015-07-23 | 2015-11-18 | 合肥革绿信息科技有限公司 | Intersection traffic congestion index calculation method based on floating car |
| CN105632177A (en) * | 2016-01-21 | 2016-06-01 | 浙江大学 | Dynamic traffic demand-oriented intersection operation efficiency change rate calculating method |
| CN108257384A (en) * | 2018-01-18 | 2018-07-06 | 沈阳建筑大学 | A kind of robustness of road network veneziano model determines method and system |
| CN108921366A (en) * | 2018-03-24 | 2018-11-30 | 北京工业大学 | A kind of road network Important Sections screening technique based on PageRank algorithm |
| CN108648444A (en) * | 2018-04-18 | 2018-10-12 | 北京交通大学 | A kind of signalized intersections postitallation evaluation method based on grid model |
Non-Patent Citations (6)
| Title |
|---|
| Petri网模型在智能交通中的应用研究;武雯婧;《科技与创新》;20170731(第14期);第154-155页 * |
| 城市区域路网交通状态分析与评价方法;黄艳国等;《重庆交通大学学报（自然科学版）》;20171231;第36卷(第12期);第91-109页 * |
| 城市路网交通运行效率评估研究;魏立夏;《中国优秀硕士学位论文全文数据库工程科技Ⅱ辑》;20121015(第10期);全文 * |
| 基于复杂网络理论的公路网结构特征;邓亚娟等;《中国公路学报》;20100131;第23卷(第1期);第98-104页 * |
| 基于对偶图的城市交叉口延误分析;徐英睿等;《公路》;20120930(第9期);第149-153页 * |
| 通行效率评价体系研究及杭州应用实践;沈明江等;《公路交通科技应用技术版》;20160331(第3期);第337-340页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109509350A (en) | 2019-03-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112820108B (en) | Self-learning road network traffic state analysis and prediction method | |
| CN106485359A (en) | A kind of urban track traffic section passenger flow estimation method based on train schedule | |
| CN102169524A (en) | Staged multi-path model algorithm of urban rail transit network passenger flow distribution | |
| CN103971530B (en) | A kind of real-time route planing method | |
| CN111008223B (en) | Regional traffic jam correlation calculation method based on space-time correlation rule | |
| CN104217129A (en) | Passenger flow estimation method for urban rail road network | |
| CN111653088A (en) | Vehicle driving quantity prediction model construction method, prediction method and system | |
| CN104484514B (en) | A kind of elastic public bus network method for designing for evading congested link | |
| CN106530756B (en) | A kind of intersection optimal period duration calculation method of consideration downstream bus station | |
| CN104239726A (en) | Passenger flow estimation system under condition of urban rail road network emergency | |
| CN109238297B (en) | Dynamic path selection method for user optimization and system optimization | |
| CN111462492B (en) | Key road section detection method based on Rich flow | |
| CN111191817B (en) | Bus network topology division method based on transfer passenger flow | |
| CN106997496A (en) | A kind of two-way two lane vural roads construction area is most preferably constructed Length Design Method | |
| CN106910350A (en) | A kind of method for finding signalized crossing group's critical path | |
| CN109544967A (en) | A kind of public transport network running state monitoring method based on low frequency AVL data | |
| CN109887280B (en) | Traffic network node criticality assessment method | |
| CN108197724B (en) | Method for calculating efficiency weight and evaluating bus scheme performance in bus complex network | |
| CN109509350B (en) | Intersection operation efficiency calculation method based on directed binary weight network | |
| CN111009140A (en) | Intelligent traffic signal control method based on open-source road condition information | |
| CN111292535B (en) | Road network traffic state evaluation method for passenger travel in vehicle and road cooperation environment | |
| CN110097757B (en) | Intersection group critical path identification method based on depth-first search | |
| CN110119884B (en) | High-speed railway passenger flow time interval division method based on neighbor propagation clustering | |
| CN109190935B (en) | Highway charging station planning method considering service area and vehicle accident | |
| CN105427394A (en) | Congestion charging optimal toll rate determining method based on trial-and-error method and motor vehicle flow |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 310012 1st floor, building 1, 223 Yile Road, Hangzhou City, Zhejiang Province Patentee after: Yinjiang Technology Co.,Ltd. Address before: 310012 1st floor, building 1, 223 Yile Road, Hangzhou City, Zhejiang Province Patentee before: ENJOYOR Co.,Ltd. |