CN111583629A - Method for dividing traffic network - Google Patents
Method for dividing traffic network Download PDFInfo
- Publication number
- CN111583629A CN111583629A CN202010278741.1A CN202010278741A CN111583629A CN 111583629 A CN111583629 A CN 111583629A CN 202010278741 A CN202010278741 A CN 202010278741A CN 111583629 A CN111583629 A CN 111583629A
- Authority
- CN
- China
- Prior art keywords
- traffic
- destination
- origin
- intersection
- traffic network
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 23
- 238000000638 solvent extraction Methods 0.000 claims description 8
- 238000011144 upstream manufacturing Methods 0.000 description 12
- 238000010586 diagram Methods 0.000 description 5
- 230000000903 blocking effect Effects 0.000 description 4
- 238000011217 control strategy Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000007493 shaping process Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
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
- G08G1/0125—Traffic data processing
-
- G—PHYSICS
- G08—SIGNALLING
- G08G—TRAFFIC CONTROL SYSTEMS
- G08G1/00—Traffic control systems for road vehicles
- G08G1/065—Traffic control systems for road vehicles by counting the vehicles in a section of the road or in a parking area, i.e. comparing incoming count with outgoing count
Abstract
The invention provides a method for dividing a traffic network by beginning and end travel trees, which provides an beginning and end travel Tree structure, divides the traffic network into at least one beginning and end travel Tree (OD-Tree) according to traffic flow steering flow rate, stopping fleet length or beginning and end travel amount and other parameters of the traffic network.
Description
Technical Field
The invention provides a method for dividing a traffic network into an origin-destination travel tree, in particular to an origin-destination travel tree which can be effectively applied to traffic control.
Background
At present, there are two methods for dividing the traffic network, the first method is to divide the traffic network into at least one intersection group, please refer to fig. 1, and by the step S50, first, by dividing the geographic characteristics and the special administrative areas, refer to fig. 2, at least one first traffic control area 20 or second traffic control area 22 is found in the traffic network 10.
Step S52 is performed to collect and check the static attribute data of the traffic control area, including the road length of two adjacent intersections, the road environment factors and the traffic direction, so as to initially classify the traffic network into at least one intersection group.
Checking the length of the road section, and when the length of the road section is greater than the critical length of 600 meters, the fact that the motorcade running between two adjacent intersections is diffused does not form the motorcade any more, and the two adjacent intersections can not be divided into the same intersection group.
Checking road environment factors, and when the road use pattern and the road geometric configuration of at least one road junction of the first traffic control area or the second traffic control area and the road use pattern and the road geometric configuration of at least one road section are too different, the road junctions or the road sections can not be divided into the same road junction group.
The reason for checking the traffic direction is that different control targets are used for the road sections with different traffic directions, for example: the one-way system aims at the maximum vehicle throughput in a single traffic flow direction; the two-way lane system needs to consider the minimum negative effect performance value of the two-way traffic flow direction as a control target, so that different traffic flow directions can not be divided into the same intersection group.
Continuing to step S54, the dynamic principle analysis is used to inspect and modify the intersection group, so as to obtain the final first intersection group 30, second intersection group 32, third intersection group 34, and fourth intersection group 36.
The dynamic principle analysis data comprises a travel speed and a traffic flow turning flow rate ratio, and the condition of the traffic flow in the traffic control area is inspected by utilizing the travel speed and the traffic flow turning flow rate ratio, wherein the adjacent intersections of the road section can be classified into the same intersection group by the road sections with similar travel speeds, the traffic flow turning flow rate ratio refers to the ratio of the number of vehicles in each flowing direction in a specific time period to all vehicles in the road section when all vehicles flow at the intersections in the specific time period of the road section, the larger the value is, the closer the relationship between the adjacent road sections is, the larger the traffic flow is from the road section, and the adjacent intersections of the road section can be classified into the same intersection group.
The second method for dividing the traffic network is to divide the traffic network into at least one main road traffic Path, where the main road traffic Path is an Origin-Destination Path (Origin-Path) composed of at least one road segment or at least one intersection, and the main road traffic Path may be a turning Path or a straight Path. Referring to fig. 3 and 4, the step S60 is to collect the traffic steering flow rate ratio of at least one intersection of the traffic network 10 in at least one specific time period, and the traffic steering flow rate ratio is calculated by using the traffic steering flow rate ratio as the dynamic principle analysis of the first traffic network classification manner, and the ratio of the number of vehicles in each flow direction in the specific time period to all vehicles in the road segment is calculated, and the larger the value is, the closer the relationship between adjacent road segments is.
Step S62 is executed to find the maximum traffic flow rate of the intersection in the specific time period, and the turning direction of the maximum traffic flow rate is the main traffic flow turning direction of the intersection. And step S64, finding out the main traffic flow turning direction of at least one intersection, and connecting the intersection with the road segment of the main traffic flow turning direction in series to form the first main traffic flow path 40, the second main traffic flow path 42 and the third main traffic flow path 44 of the traffic network.
A first method for dividing a traffic network divides the traffic network into at least one intersection group, which generates a zone boundary blocking obstacle between traffic control zones due to the division of the traffic network into at least one traffic control zone; the traffic control area is divided into at least one intersection group, and there may be traffic flow blocking between adjacent intersection groups divided into different traffic control areas.
The second method for dividing the traffic network directly divides the traffic network into at least one main traffic flow path to reduce traffic interruption, but the main traffic flow path only considers the main traffic flow turning direction, so the division of the traffic network into the main traffic flow paths can actually improve the continuity of the traffic flow, but neglects the traffic flow condition in other traffic flow turning directions.
Disclosure of Invention
The main objective of the present invention is to provide an origin-destination tree structure, which can divide a traffic network into origin-destination trees, and eliminate the area obstruction and reduce the traffic flow blocking situation through the origin-destination tree structure, and the origin-destination tree can consider the steering direction of each traffic flow, so as to be effectively applied to developing traffic control strategies and improve the traffic flow coordination and continuity.
The technical scheme of the invention is as follows:
a method for dividing a traffic network into an origin-destination travel tree by providing an origin-destination travel tree structure, the method comprising the steps of:
collecting the traffic flow turning flow rate or the stopping fleet length or the starting and ending travel amount of at least one intersection of the traffic network in at least one specific time period;
applying the parameters of the traffic flow turning flow rate, the stopping fleet length or the beginning and ending travel quantity to find out at least one bottleneck intersection and at least one multi-traffic path;
the multi-traffic path is formed in series, and the traffic network can be divided into at least one travel tree.
Further, the traffic flow turning rate means a percentage of the traffic flow turning rate in each turning direction of each adjacent road section to the total traffic flow, the traffic flow turning rate in each direction of at least one intersection of the traffic network for at least a specific time period is collected, the traffic flow turning rate in at least one intersection of the traffic network is analyzed, the turning direction of the traffic flow turning rate in at least one bottleneck intersection and at least one intersection of the traffic network greater than a set threshold value is found, so as to obtain at least one multi-traffic path, the set threshold value is defined by a traffic planner or adopts a preset value of 15%, the multi-traffic path is formed in a serial connection mode, and the traffic network can be divided into at least one together-received travel tree.
Further, the length of the equal-stopping fleet means the total number of vehicles stopping at the longest fleet due to the influence of the signs or road conditions, estimating or surveying the length of the equal-stopping fleet at least one road section of the traffic network at least one specific time period according to experience, finding out at least one bottleneck intersection and at least one multi-path of the traffic network according to the main equal-stopping direction and the secondary equal-stopping direction of the equal-stopping fleet, and connecting the multi-path in series to form, thus dividing the traffic network into at least one together-paid travel tree.
Furthermore, the Origin-Destination quantity means a traffic flow generated from a starting point (Origin) to a Destination point (Destination), and a Destination intersection with the maximum Origin-Destination quantity of the traffic network is found according to at least the Origin-Destination quantity of the traffic network, wherein the Destination intersection with the maximum Origin-Destination quantity is a bottleneck intersection, and the Origin-Destination quantity of the traffic network, which is traced from the bottleneck intersection and connected in series with adjacent intersections, still accounts for a ratio greater than a set threshold value, and the set threshold value is determined by a traffic planner or adopts a preset value of 15%, so that the traffic network can be divided into at least one Origin-Destination tree.
Further, the origin-destination travel tree is divided into an upper, middle and downstream group according to different traffic characteristics, and at least one traffic path in the end region of a Leaf Node is divided into an upstream group; at least one traffic flow path of the traffic flow passing path is divided into midstream groups; at least one vehicular flow path converging to the bottleneck intersection is subdivided into downstream groups.
Furthermore, the midstream group throttles the traffic flow in the group according to a formula:
wherein Q is the downstream group vehicle capacity, fmFor the traffic of the midstream group, rmThe traffic flow release ratio is shown, and k and m are the number of branch flows.
Further, the traffic flow turning rate means a percentage of the traffic flow turning rate in each turning direction of each adjacent road section to the total traffic flow, the traffic flow turning rate in each direction of at least one intersection of the traffic network for at least a specific time period is collected, the traffic flow turning rate in at least one intersection of the traffic network is analyzed, the turning direction of the traffic flow turning rate in at least one bottleneck intersection and at least one intersection of the traffic network greater than a set threshold value is found, so as to obtain at least one multi-traffic path, the set threshold value is defined by a traffic planner or adopts a preset value of 15%, the multi-traffic path is formed in a serial connection mode, and the traffic network can be divided into at least one together-received travel tree.
Further, the length of the equal-stopping fleet means the total number of vehicles stopping at the longest fleet due to the influence of the signs or road conditions, estimating or surveying the length of the equal-stopping fleet at least one road section of the traffic network at least one specific time period according to experience, finding out at least one bottleneck intersection and at least one multi-path of the traffic network according to the main equal-stopping direction and the secondary equal-stopping direction of the equal-stopping fleet, and connecting the multi-path in series to form, thus dividing the traffic network into at least one together-paid travel tree.
Furthermore, the Origin-Destination quantity means a traffic flow generated from a starting point (Origin) to a Destination point (Destination), and a Destination intersection with the maximum Origin-Destination quantity of the traffic network is found according to at least the Origin-Destination quantity of the traffic network, wherein the Destination intersection with the maximum Origin-Destination quantity is a bottleneck intersection, and the Origin-Destination quantity of the traffic network, which is traced from the bottleneck intersection and connected in series with adjacent intersections, still accounts for a ratio greater than a set threshold value, and the set threshold value is determined by a traffic planner or adopts a preset value of 15%, so that the traffic network can be divided into at least one Origin-Destination tree.
The invention adopting the technical scheme can bring the following beneficial effects:
the invention provides a method for dividing a traffic network, which provides an origin-destination Tree structure, and divides the traffic network into at least one origin-destination Tree (OD-Tree) according to the traffic steering flow rate, the length of a stop fleet or the origin-destination quantity and other parameters of the analyzed traffic network.
Drawings
FIG. 1 is a flow chart of the steps of dividing a traffic network into intersection groups according to the prior art;
FIG. 2 is a schematic diagram of a conventional traffic network divided into intersection groups;
FIG. 3 is a flow chart of the prior art steps for dividing a traffic network into major road traffic paths;
FIG. 4 is a schematic diagram of a conventional traffic network divided into major traffic paths;
FIG. 5 is a flowchart illustrating steps for partitioning a traffic network into origin-destination travel trees according to the present invention;
FIG. 6 is a schematic diagram of the present invention dividing a traffic network into origin-destination travel trees;
FIG. 7 is a schematic diagram of the present invention applied traffic parameters to divide the traffic network into the origin-destination tree;
FIG. 8 is a tree structure of origin-destination travel tree provided by the present invention;
fig. 9 is a schematic diagram of midstream group throttling.
In the figure, 10-road network, 20-first traffic control area, 22-second traffic control area, 30-first road junction group, 32-second road junction group, 34-third road junction group, 36-fourth road junction group, 40-first trunk road traffic path, 42-second trunk road traffic path, 44-third trunk road traffic path, 50-first origin travel tree, 52-second origin travel tree, 60-upstream group, 70-midstream group, 80-downstream group, Q-downstream group traffic capacity, f 1-midstream group traffic volume one, f 2-midstream group traffic volume two, f 3-midstream group traffic volume three, r 1-flow discharge proportion one, r 2-flow discharge proportion two, r 3-traffic flow discharge proportion three.
Detailed Description
Referring to fig. 5, fig. 6 and fig. 7, the flow of dividing the traffic network into the origin-destination trip tree according to the present invention is illustrated, and the applicable parameters of the flow of dividing the traffic network into the origin-destination trip tree are three, the first is the traffic flow steering flow rate; the second is stopping and waiting for the length of the fleet; the third is the number of the origin and destination trips.
Describing a flow of using a first parameter, "traffic steering flow ratio", referring to fig. 90 of fig. 7, the traffic steering flow ratio means a percentage of the traffic steering flow in each steering direction of each adjacent road segment to the total traffic flow, then proceeding to step S10, referring to fig. 6, collecting the traffic steering flow ratio in each direction of at least one intersection of the traffic network 10 for at least a specific time period, then step S12, analyzing the traffic steering flow ratio of at least one intersection of the traffic network 10, finding the steering direction of the traffic steering flow ratio of at least one bottleneck intersection and at least one intersection of the traffic network 10 greater than a predetermined threshold value to obtain at least one multi-traffic path, the predetermined threshold value is defined by a traffic planner or is 15% of the predetermined value, proceeding to step S14, shaping the multi-traffic network, i.e. dividing the traffic network 10 into at least one travel tree together, in this embodiment, FIG. 6 shows a first and second origin- destination tree 50, 52.
Referring to fig. 92 of fig. 7, the length of the waiting fleet means the total number of vehicles waiting for the longest fleet due to influence of signal or road condition, then step S10 is performed, referring to fig. 6, the length of the waiting fleet for at least one road segment of the traffic network 10 for at least a specific time period is estimated or investigated empirically, step S12 is performed, at least one bottleneck intersection and at least one multi-flow path of the traffic network 10 are found according to the primary and secondary stopping directions of the waiting fleet, and step S14 is performed, the multi-flow path is formed in series, so that the traffic network 10 can be divided into at least one together-terminal travel tree, in this embodiment, fig. 6 shows a first terminal travel tree 50 and a second terminal travel tree 52.
Referring to fig. 94 of fig. 7, the flow of the third parameter "Origin/Destination travel amount" means the traffic flow from a starting point (Origin) to a Destination point (Destination), then step S10 is performed, referring to fig. 6, the Destination point with the maximum Origin/Destination travel amount of the traffic network 10 is found out according to at least the Origin/Destination travel amount of the traffic network 10, the Destination point with the maximum Origin/Destination travel amount is the bottleneck, the Origin/Destination travel amount of the traffic network 10 connected to the adjacent intersections back from the bottleneck is larger than the ratio of the Origin/Destination travel amount of the bottleneck, the set threshold value is determined by the traffic planner or 15% of the preset value, i.e. the traffic network 10 is divided into at least one Origin/Destination travel tree, in this embodiment, fig. 6 shows the first Origin/Destination tree 50 and the second Origin/Destination tree 52.
The first and second origin- destination trip trees 50 and 52 can be used to divide the origin-destination trip trees into an upstream group, a middle group and a downstream group, taking the second origin-destination trip tree 52 as an example, in order to divide the second origin-destination trip tree 52 into the upstream group, the middle group and the downstream group according to different traffic characteristics of the second origin-destination trip tree 52, the second origin-destination trip tree 52 is analyzed, and at least one traffic path in the end region of a Leaf Node is divided into an upstream group 60; at least one traffic flow path of the traffic flow passing path is divided into midstream groups 70; at least one traffic flow path converging to the bottleneck intersection is divided into downstream groups 80, wherein the upstream group, the midstream group and the downstream group can respectively perform the actions of upstream shunting, midstream throttling and downstream dredging, so that the traffic flow at the bottleneck intersection is kept in a smooth state.
The above-mentioned upstream group 60 diversion, midstream group 70 throttling and downstream group 80 shedding are explained as follows: referring to fig. 6, the upstream group 60 is formed by collecting a plurality of traffic flows, and if the midstream group 70 and the downstream group 80 are in a congestion state, the roadside bulletin board prompt or the action device sends out a notification to make the vehicles in the upstream group 60 change the lane to travel another more smooth lane, so as to divert the traffic flow of the midstream group 70 and the downstream group 80 and make the vehicles change the lane without the trouble of traffic jam; the midstream throttling is achieved by adjusting the number of seconds of the red road lights in the road section of the midstream group 70 so that the traffic flow of the midstream group 70 entering the downstream group 80 is less than or equal to the maximum capacity of the downstream group 80, and thus the downstream group 80 can be kept unblocked, and finally the flow evacuation of the downstream group 80 can be implemented with reference to the certificate number TW I416439.
The above midstream throttling allows the traffic flow entering the downstream group 80 from the midstream group 70 to be less than or equal to the maximum capacity of the downstream group 80, which can be practically implemented by referring to fig. 9 and the following disclosureFormula (II):
wherein Q is the downstream group vehicle capacity, fmFor the traffic of the midstream group, rmFor the releasing ratio of traffic, k and m are the number of branches, and referring to fig. 9 as an example, there are three branches for the midstream group, f1Traffic flow of midstream group is one, f2The traffic flow of the group for the midstream is two and f3The traffic flow of the midstream group is three, r1、r2And r3Releasing the ratio for each traffic stream when Q is the maximum capacity of 100 cars and f1、f2And f3Each at 100 cars, at this time f1+f2+f3300 (maximum 100 of traffic capacity over Q) and congestion in downstream groups, where traffic throttling is performed by traffic lights to adjust individual traffic passing ratios, such as: r is1＝0.3、r20.5 and r3When r is 0.21f1+r2f2+r3f3When the vehicle capacity of the downstream group is 100, the downstream group 80 is adjusted to be in a smooth state and to use the vehicle capacity most effectively, and the flow pressure of the intermediate group can be relieved by matching with the split flow of the upstream group.
In summary, referring to fig. 8, the traffic network can be divided into a structure of the origin-destination tree to eliminate the area obstruction and reduce the traffic flow blocking situation, the origin-destination tree can also consider the steering direction of each traffic flow to improve the traffic flow coordination, and the origin-destination tree is further divided into the upstream, middle and downstream groups according to different traffic flow characteristics to effectively apply to the research of traffic control strategies and improve the traffic flow continuity.
The above description is only for the preferred embodiment of the present invention, and is not intended to limit the scope of the present invention. All equivalent changes or modifications made according to the features and spirit of the present invention are considered to be included in the claims of the present invention.
Claims (9)
1. A method for dividing a traffic network into an origin-destination travel tree structure is provided, and the method is characterized in that: the method for dividing the road network into the origin-destination travel tree comprises the following steps:
collecting the traffic flow turning flow rate or the stopping fleet length or the starting and ending travel amount of at least one intersection of the traffic network in at least one specific time period;
applying the parameters of the traffic flow turning flow rate, the stopping fleet length or the beginning and ending travel quantity to find out at least one bottleneck intersection and at least one multi-traffic path;
the multi-traffic path is formed in series, and the traffic network can be divided into at least one travel tree.
2. The method of partitioning a traffic network according to claim 1, wherein: the traffic flow turning rate means the percentage of the traffic flow turning rate in each turning direction of each adjacent road section and the total traffic flow, the traffic flow turning rate in each direction of at least one intersection of the traffic network is collected for at least a certain period of time, the traffic flow turning rate in at least one intersection of the traffic network is analyzed, the turning direction of the traffic flow turning rate in at least one bottleneck intersection and at least one intersection of the traffic network which is greater than a set threshold value is found out to obtain at least one multi-traffic path, the set threshold value is determined by a traffic planner or adopts a preset value of 15%, the multi-traffic path is formed in a serial connection mode, and the traffic network can be divided into at least one travel tree.
3. The method of partitioning a traffic network according to claim 1, wherein: the length of the waiting fleet means that the total number of vehicles for stopping and the like of the longest fleet is generated due to the influence of signals or road conditions, the length of the waiting fleet for stopping and the like of at least one road section of the traffic network at least in a specific time period is estimated or investigated according to experience, at least one bottleneck intersection and at least one multi-flow path of the traffic network are found out according to the main stopping and the like direction and the secondary stopping and the like direction of the waiting fleet, and the multi-flow path is formed in series, so that the traffic network can be divided into at least one together-acknowledged travel tree.
4. The method of partitioning a traffic network according to claim 1, wherein: the Origin-Destination quantity means the traffic flow generated from a starting point (Origin) to a Destination point (Destination), and the Origin-Destination intersection with the maximum Origin-Destination quantity is found according to at least the Origin-Destination quantity of the traffic network, the Origin-Destination intersection with the maximum Origin-Destination quantity is the bottleneck intersection, the Origin-Destination intersection with the maximum Origin-Destination quantity connected back to the adjacent intersections in series from the bottleneck intersection still occupies the ratio of the Origin-Destination quantity to the Destination intersection larger than a set threshold value, and the set threshold value is determined by a traffic engineer or adopts a preset value of 15%, so that the traffic network can be divided into at least the Origin-Destination tree.
5. The method of partitioning a traffic network according to claim 1, wherein: the origin-destination travel tree is divided into an upper group, a middle group and a lower group aiming at different traffic flow characteristics, and at least one traffic flow path in the end region of a leaf node (leaf node) is divided into an upper group; at least one traffic flow path of the traffic flow passing path is divided into midstream groups; at least one vehicular flow path converging to the bottleneck intersection is subdivided into downstream groups.
6. The method of claim 5, wherein the midstream group throttles traffic flow in the group according to a formula:
rmfmwherein Q is the downstream group vehicle capacity, fmFor the traffic of the midstream group, rmThe traffic flow release ratio is shown, and k and m are the number of branch flows.
7. The method of partitioning a traffic network according to claim 5, wherein: the traffic flow turning rate means the percentage of the traffic flow turning rate in each turning direction of each adjacent road section and the total traffic flow, the traffic flow turning rate in each direction of at least one intersection of the traffic network is collected for at least a certain period of time, the traffic flow turning rate in at least one intersection of the traffic network is analyzed, the turning direction of the traffic flow turning rate in at least one bottleneck intersection and at least one intersection of the traffic network which is greater than a set threshold value is found out to obtain at least one multi-traffic path, the set threshold value is determined by a traffic planner or adopts a preset value of 15%, the multi-traffic path is formed in a serial connection mode, and the traffic network can be divided into at least one travel tree.
8. The method of partitioning a traffic network according to claim 5, wherein: the length of the waiting fleet means that the total number of vehicles for stopping and the like of the longest fleet is generated due to the influence of signals or road conditions, the length of the waiting fleet for stopping and the like of at least one road section of the traffic network at least in a specific time period is estimated or investigated according to experience, at least one bottleneck intersection and at least one multi-flow path of the traffic network are found out according to the main stopping and the like direction and the secondary stopping and the like direction of the waiting fleet, and the multi-flow path is formed in series, so that the traffic network can be divided into at least one together-acknowledged travel tree.
9. The method of partitioning a traffic network according to claim 5, wherein: the Origin-Destination quantity means the traffic flow generated from a starting point (Origin) to a Destination point (Destination), and the Origin-Destination intersection with the maximum Origin-Destination quantity is found according to at least the Origin-Destination quantity of the traffic network, the Origin-Destination intersection with the maximum Origin-Destination quantity is the bottleneck intersection, the Origin-Destination intersection with the maximum Origin-Destination quantity connected back to the adjacent intersections in series from the bottleneck intersection still occupies the ratio of the Origin-Destination quantity to the Destination intersection larger than a set threshold value, and the set threshold value is determined by a traffic engineer or adopts a preset value of 15%, so that the traffic network can be divided into at least the Origin-Destination tree.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| TW108112797A TWI704533B (en) | 2019-04-12 | 2019-04-12 | A method for dividing the traffic network by origin-destination tree(od-tree) |
| TW108112797 | 2019-04-12 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111583629A true CN111583629A (en) | 2020-08-25 |
| CN111583629B CN111583629B (en) | 2021-11-26 |
Family
ID=68048688
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010278741.1A Active CN111583629B (en) | 2019-04-12 | 2020-04-10 | Method for dividing traffic road network by origin-destination trip tree |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111583629B (en) |
| TW (1) | TWI704533B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112950932A (en) * | 2021-01-26 | 2021-06-11 | 阿里巴巴集团控股有限公司 | Method and device for merging area units and electronic equipment |
| CN114267186A (en) * | 2021-12-15 | 2022-04-01 | 曾明德 | Method for adjusting traffic congestion through origin-destination tree |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110660233B (en) * | 2019-09-30 | 2021-08-13 | 山东理工大学 | Method for setting optimal signal period calculation of reverse variable lane intersection |
| TWI813043B (en) * | 2021-10-21 | 2023-08-21 | 曾明德 | A Method of Regulating Traffic Congestion Through Origin-Destination Trees |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI410905B (en) * | 2008-12-12 | 2013-10-01 | Syscom Comp Engineering Co | Method and system for determining vehicle trip |
| CN104091460A (en) * | 2014-06-25 | 2014-10-08 | 中国安全生产科学研究院 | Evacuation control method and system for tree structural network |
| CN105046949A (en) * | 2015-06-12 | 2015-11-11 | 中南大学 | Method for achieving vehicle source prediction by calculating O-D flow based on mobile phone data |
| US20160155334A1 (en) * | 2014-12-02 | 2016-06-02 | Robert Bosch Gmbh | Collision avoidance in traffic crossings using radar sensors |
| CN105894809A (en) * | 2014-12-25 | 2016-08-24 | 杭州远眺科技有限公司 | Sectional type urban road traffic state estimation method |
| CN109544925A (en) * | 2018-11-30 | 2019-03-29 | 江苏智通交通科技有限公司 | Coordinate main line analysis on its rationality and coordination mode configuration method |
| CN109584553A (en) * | 2018-11-29 | 2019-04-05 | 中电海康集团有限公司 | A kind of section degree of association missing complementing method based on space time information |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7813870B2 (en) * | 2006-03-03 | 2010-10-12 | Inrix, Inc. | Dynamic time series prediction of future traffic conditions |
| CN108364467B (en) * | 2018-02-12 | 2020-08-07 | 北京工业大学 | Road condition information prediction method based on improved decision tree algorithm |
-
2019
- 2019-04-12 TW TW108112797A patent/TWI704533B/en active
-
2020
- 2020-04-10 CN CN202010278741.1A patent/CN111583629B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI410905B (en) * | 2008-12-12 | 2013-10-01 | Syscom Comp Engineering Co | Method and system for determining vehicle trip |
| CN104091460A (en) * | 2014-06-25 | 2014-10-08 | 中国安全生产科学研究院 | Evacuation control method and system for tree structural network |
| US20160155334A1 (en) * | 2014-12-02 | 2016-06-02 | Robert Bosch Gmbh | Collision avoidance in traffic crossings using radar sensors |
| CN105894809A (en) * | 2014-12-25 | 2016-08-24 | 杭州远眺科技有限公司 | Sectional type urban road traffic state estimation method |
| CN105046949A (en) * | 2015-06-12 | 2015-11-11 | 中南大学 | Method for achieving vehicle source prediction by calculating O-D flow based on mobile phone data |
| CN109584553A (en) * | 2018-11-29 | 2019-04-05 | 中电海康集团有限公司 | A kind of section degree of association missing complementing method based on space time information |
| CN109544925A (en) * | 2018-11-30 | 2019-03-29 | 江苏智通交通科技有限公司 | Coordinate main line analysis on its rationality and coordination mode configuration method |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112950932A (en) * | 2021-01-26 | 2021-06-11 | 阿里巴巴集团控股有限公司 | Method and device for merging area units and electronic equipment |
| CN114267186A (en) * | 2021-12-15 | 2022-04-01 | 曾明德 | Method for adjusting traffic congestion through origin-destination tree |
Also Published As
| Publication number | Publication date |
|---|---|
| TWI704533B (en) | 2020-09-11 |
| TW201928904A (en) | 2019-07-16 |
| CN111583629B (en) | 2021-11-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111583629B (en) | Method for dividing traffic road network by origin-destination trip tree | |
| CN106297334B (en) | Main line section division methods under Philodendron ‘ Emerald Queen' | |
| CN111341095B (en) | Traffic signal control system and method based on edge side online calculation | |
| CN107507415A (en) | Road network border Current limited Control method based on MFD and queue length under car networking | |
| CN105046987A (en) | Pavement traffic signal lamp coordination control method based on reinforcement learning | |
| CN103700273A (en) | Signal timing optimization method based on variable guide lane | |
| CN104778834A (en) | Urban road traffic jam judging method based on vehicle GPS data | |
| CN103871241A (en) | Lane dynamic partitioning control method for expressway intersection area | |
| CN112435473B (en) | Expressway traffic flow tracing and ramp regulating method combined with historical data | |
| CN109887289A (en) | A kind of network vehicle flowrate maximization approach of urban traffic network model | |
| CN110349409B (en) | Method for determining intersection steering overflow by using single vehicle track | |
| CN113312732B (en) | Non-signal control intersection simulation control method and device combining decision advance and dynamic adjustment | |
| Liang et al. | Experiments on platoon formation of heavy trucks in traffic | |
| Arnet et al. | Effects of multimodal operations on urban roadways | |
| Li et al. | Regional coordinated bus priority signal control considering pedestrian and vehicle delays at urban intersections | |
| CN108389405A (en) | Road traffic capacity control method | |
| Skabardonis et al. | Operational analyses of freeway off-ramp bottlenecks | |
| CN111932912A (en) | Secondary releasing method of viaduct lower ramp intersection based on queuing length detection | |
| CN114387778B (en) | Urban expressway congestion cause analysis method | |
| Lidbe et al. | Comparative assessment of arterial operations under conventional time-of-day and adaptive traffic signal control. | |
| CN110070721A (en) | The control method of road junction traffic stream transit time based on traffic sturge theory | |
| CN110060480B (en) | Method for controlling traffic flow running time of road section | |
| CN113450563A (en) | Analysis model based on multi-turn road traffic jam reasons and anti-blocking method | |
| CN116343474B (en) | Expressway bottleneck dynamic prediction method and system based on microscopic traffic simulation | |
| Lohey et al. | Establishing Relationship between Actual Delay and Delay by HCM Model |
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 |