CN114169580B - Traffic equal-time-circle calculation method for regional hub - Google Patents
Traffic equal-time-circle calculation method for regional hub Download PDFInfo
- Publication number
- CN114169580B CN114169580B CN202111348678.5A CN202111348678A CN114169580B CN 114169580 B CN114169580 B CN 114169580B CN 202111348678 A CN202111348678 A CN 202111348678A CN 114169580 B CN114169580 B CN 114169580B
- Authority
- CN
- China
- Prior art keywords
- traffic
- node
- road section
- regional
- road
- 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
- 238000004364 calculation method Methods 0.000 title description 10
- 238000000034 method Methods 0.000 claims abstract description 19
- 238000012216 screening Methods 0.000 claims abstract description 15
- 230000010354 integration Effects 0.000 claims description 5
- 238000005457 optimization Methods 0.000 claims description 5
- 238000011161 development Methods 0.000 description 2
- 230000018109 developmental process Effects 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000013461 design Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 239000011159 matrix material Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 230000033772 system development Effects 0.000 description 1
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/04—Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
- G06Q10/047—Optimisation of routes or paths, e.g. travelling salesman problem
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/18—Complex mathematical operations for evaluating statistical data, e.g. average values, frequency distributions, probability functions, regression analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/40—Business processes related to the transportation industry
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Human Resources & Organizations (AREA)
- Economics (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Data Mining & Analysis (AREA)
- Mathematical Analysis (AREA)
- Primary Health Care (AREA)
- General Health & Medical Sciences (AREA)
- Development Economics (AREA)
- Mathematical Physics (AREA)
- Pure & Applied Mathematics (AREA)
- Operations Research (AREA)
- Health & Medical Sciences (AREA)
- Computational Mathematics (AREA)
- Mathematical Optimization (AREA)
- Bioinformatics & Computational Biology (AREA)
- Evolutionary Biology (AREA)
- Bioinformatics & Cheminformatics (AREA)
- Probability & Statistics with Applications (AREA)
- Life Sciences & Earth Sciences (AREA)
- Algebra (AREA)
- Educational Administration (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Quality & Reliability (AREA)
- Traffic Control Systems (AREA)
Abstract
The application relates to a traffic equal-time circle calculating method of a regional hub. The method comprises the following steps: acquiring all node information, road section information and OD point pair information in a target area; constructing an area traffic comprehensive network according to the node information and the road section information; in the regional traffic comprehensive network, traffic distribution is completed by utilizing OD point pair information, and traffic impedance of each road section in the regional traffic comprehensive network is determined; screening target road segments from the regional traffic comprehensive network according to the shortest travel time from the hub node to other nodes in the regional traffic comprehensive network to obtain a target road segment set; selecting critical points meeting critical conditions on each target road section in the target road section set to obtain a critical point set; and sequentially connecting the points in the critical point set around the hub node to form the traffic equal time circle of the hub node. The road network running condition under the real condition can be effectively restored, and the equal time circle is closer to the actual condition.
Description
Technical Field
The application relates to the technical field of road traffic, in particular to a method for calculating the equal circle of traffic of a regional hub.
Background
The comprehensive transportation system is constructed, and the regional development strategy pattern is molded, so that the comprehensive transportation system development planning requirements and targets are met. The regional comprehensive transportation hub is a necessary requirement for promoting regional coordination, coordination and common development.
The regional comprehensive transportation junction mainly has the functions of completing organic connection of water transportation, railways, highways, aviation and pipelines, and constructing a high-efficiency wide-radiation concentration and transport system. Wherein, the traffic waiting time is an important evaluation index of the comprehensive transportation junction. The traffic isochrones of regional junctions refer to the range covered by distances that can be reached in certain traffic patterns within a certain time, starting from a junction. The method and the system represent the maximum traffic network range which can be covered by the hub in a certain time, and reflect the concentration and transport capacity of the regional hub and the operation efficiency and management level of the regional traffic network to a certain extent.
In the related art, an equal-time-period computing method for regional traffic junction is mainly to calculate the maximum coverage that can be achieved in a traffic network within a limited time by taking the junction as a starting point. The traffic time of the road in the network is calculated by constant speed or constructing an OD matrix from a single starting point to a specified multiple ending point, and the real running state of the regional network under the traffic requirement of multiple starting points and multiple ending points cannot be well reflected.
Disclosure of Invention
In view of the above, it is desirable to provide a method for calculating a traffic isochrone of a regional hub that can solve the above-mentioned problems.
A method of traffic isochrone calculation for a regional hub, the method comprising:
acquiring all node information, road section information and OD point pair information in a target area;
constructing an area traffic comprehensive network according to the node information and the road section information, wherein the area traffic comprehensive network comprises a node set and a road section set;
in the regional traffic comprehensive network, traffic distribution is completed by utilizing the OD point pair information, and traffic impedance of each road section in the regional traffic comprehensive network is determined;
Screening target road segments from the regional traffic comprehensive network according to the shortest travel time from the hub node to other nodes in the regional traffic comprehensive network to obtain a target road segment set;
Selecting critical points meeting critical conditions on each target road section in the target road section set to obtain a critical point set;
and sequentially connecting the points in the critical point set around the junction node to form a traffic equal time circle of the junction node.
In one embodiment, the step of screening the target road segments from the regional traffic comprehensive network according to the shortest travel time from the hub node to other nodes in the regional traffic comprehensive network to obtain the target road segment set includes:
executing a shortest algorithm based on heap optimization in the regional traffic comprehensive network to obtain the shortest travel time from the hub node to other nodes;
And screening out the road sections with the shortest travel time from the hub node v i to the road section e j less than or equal to T and the shortest travel time from the hub node v i to the road section e j greater than T from the road section set according to the shortest travel time from the hub node to other nodes, determining the road sections as target road sections, and obtaining a target road section set, wherein T is a given time threshold.
In one embodiment, the step of determining the traffic impedance of each road section in the regional traffic integrated network by using the OD point pair information to complete traffic distribution in the regional traffic integrated network includes:
in an area traffic comprehensive network, traffic distribution with multipath-capacity limitation is carried out, and traffic is distributed to each road section according to traffic distribution principle;
and determining the traffic impedance of each road section in the regional traffic comprehensive network according to the traffic volume of each road section in the regional traffic comprehensive network.
In one embodiment, the step of selecting a critical point on each target road segment in the set of target road segments to meet a critical condition and obtaining the set of critical points includes:
Selecting a point p j on each target road section in the target road section set, wherein when the point p j meets a critical condition, the point p j is a critical point, and obtaining a critical point set;
The critical conditions are as follows:
Wherein d is the road distance from the start point to the point p j of the target road section; l ji is the road length of the target road, r ji is the impedance of the target road, T is a given time threshold, and w 1 is the shortest travel time of the junction node v i to the start of the target road.
In one embodiment, the step of sequentially connecting the points in the critical point set around the hub node to form a traffic isochrone of the hub node includes:
and sequentially connecting the points in the critical point set clockwise around the pivot node angle to form a traffic equal time circle of the pivot node.
According to the traffic equal time circle calculation method of the regional hub, all node information, road section information and OD point pair information in the target region are obtained; constructing an area traffic comprehensive network according to the node information and the road section information, wherein the area traffic comprehensive network comprises a node set and a road section set; in the regional traffic comprehensive network, traffic distribution is completed by utilizing OD point pair information, and traffic impedance of each road section in the regional traffic comprehensive network is determined; screening target road segments from the regional traffic comprehensive network according to the shortest travel time from the hub node to other nodes in the regional traffic comprehensive network to obtain a target road segment set; selecting critical points meeting critical conditions on each target road section in the target road section set to obtain a critical point set; and sequentially connecting the points in the critical point set around the hub node to form the traffic equal time circle of the hub node. The running condition of the road network under the real condition can be effectively restored, and the calculated isochronous cycle is closer to the actual condition; the isochronal loop calculation is more accurate based on the vector comprehensive area network.
Drawings
FIG. 1 is a flow chart of a method for computing traffic isochrones at a regional hub in one embodiment;
FIG. 2 is a schematic diagram of an area traffic integration network for an Shanghai region in one embodiment;
FIG. 3 is a schematic diagram of traffic isochronous circle ranges for nodes of a siphon station in one embodiment.
Detailed Description
The present application will be described in further detail with reference to the drawings and examples, in order to make the objects, technical solutions and advantages of the present application more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the application.
In one embodiment, as shown in fig. 1, a method for calculating a traffic equal-time circle of a regional hub is provided, and the method is applied to a terminal for illustration, and includes the following steps:
Step S220: and acquiring all node information, road section information and OD point pair information in the area.
The target area refers to a medium-large area including a traffic hub under study. The node information includes the number n of nodes, and the number corresponding to each node, the number of adjacent node sets, the adjacent node set and other attributes, which can be expressed as: v i＝(i,flagi); wherein v i represents an ith node, i is the number of v i, flag i is 0,1 takes on a value, 1 represents a node as a traffic hub, and 0 represents a general node. The link information includes the number m of links, and the number, start point, end point, type, impedance, and other attributes of each link, and can be expressed as: e j＝(j,fj,tj,typej,rj,lj),ej denotes a j-th link, j is the number of e j, f j is the starting node number of e j, t j is the end node number of e j, type j is the traffic type of the link, r j is the traffic impedance of the link of e j, and l j is the actual road length of the link.
The OD point pair information includes the OD point pair number u, and the attributes such as the start point, the end point, and the flow of the OD pair, which can be expressed as OD k＝(k,ok,dk,vk),odk to represent the kth OD pair, k is the number of OD k, o k is the starting node number of OD k, d k is the end node number of OD k, and v k is the flow of OD k; i, j, k are Z+, and i is not less than n, j is not less than m, k is not less than u, Z+ represents a positive integer.
Step S240: and constructing an area traffic comprehensive network according to the node information and the road section information, wherein the area traffic comprehensive network comprises a node set and a road section set.
Wherein, the regional traffic comprehensive network can be expressed as g= < V, E >; wherein G is an area traffic comprehensive network, V is a node set, and E is a road section set. The regional traffic comprehensive network is a traffic entity expressed by a computer graph theory technology, the starting points and the ending points of all road sections in the region form a node set, and all road sections form a road section set; each road section is provided with a pair of starting point nodes and end point nodes; each node is connected to at least one road segment.
Step S260: in the regional traffic comprehensive network, traffic distribution is completed by using the OD point pair information, and traffic impedance of each road section in the regional traffic comprehensive network is determined.
After the traffic distribution is completed, the traffic impedance attribute value in the road section set E is updated accordingly. In the regional traffic integrated network G, traffic distribution with multipath-capacity limitation is performed, and the traffic is distributed to each road section according to the traffic distribution principle. After the traffic distribution is completed, each road segment in the road segment set E has a flow value. The traffic impedance attribute value of each road segment in the road segment set E is updated with the change of the flow according to the road segment impedance function (Bureau of Public Road function).
In one embodiment, in the regional traffic integrated network, the step of using the OD point pair information to complete traffic distribution and determining the traffic impedance of each road section in the regional traffic integrated network includes: in an area traffic comprehensive network, traffic distribution with multipath-capacity limitation is carried out, and traffic is distributed to each road section according to traffic distribution principle; and determining the traffic impedance of each road section in the regional traffic comprehensive network according to the traffic volume of each road section in the regional traffic comprehensive network.
Step S280: and screening out target road sections from the regional traffic comprehensive network according to the shortest travel time from the hub node to other nodes in the regional traffic comprehensive network to obtain a target road section set.
In one embodiment, the step of screening the target road segments from the regional traffic integrated network according to the shortest travel time from the hub node to other nodes in the regional traffic integrated network to obtain the target road segment set includes:
Executing a shortest algorithm based on heap optimization in the regional transportation comprehensive network to obtain the shortest travel time from the hub node to other nodes;
And screening out the road sections with the shortest travel time from the hub node v i to the road section e j less than or equal to T and the shortest travel time from the hub node v i to the road section e j greater than T from the road section set according to the shortest travel time from the hub node to other nodes, determining the road sections as target road sections, and obtaining a target road section set, wherein T is a given time threshold.
Wherein the shortest travel time of the hub node v i to other nodes is calculated. Specifically, a heap optimization-based shortest path (Dijkstra) algorithm is executed once in the regional transportation integrated network G, and the shortest path from the hub node V i to all other nodes in the node set V is calculated. Because the traffic impedance value of the road section is the travel time of the road section, the shortest travel time from the hub node V i to all other nodes in the node set V can be obtained according to the shortest path and the traffic impedance attribute value.
The set of target segments is screened and denoted sel_e. Specifically, a time threshold T is given. And in the road segment set E, screening out the road segments with the shortest travel time from the hub node v i to the starting point of the road segment E j being less than or equal to T and the shortest travel time from the hub node v i to the end point of the road segment E j being greater than T as target road segments, and recording the target road segments as E ji. And screening out all road sections with the shortest travel time from the hub node v i to the road section E j being less than or equal to T and the shortest travel time from the hub node v i to the road section E j being greater than T, and obtaining a target road section set, namely sel_E= { E ji＝|w1≤T and w2 > T }. Where e ji is the target road segment, w 1 is the shortest travel time of the junction node v i to the start of the target road segment, and w 2 is the shortest travel time of the junction node v i to the end of its target road segment.
Step S300: and selecting critical points meeting the critical conditions on each target road section in the target road section set to obtain a critical point set.
In one embodiment, the step of selecting a critical point satisfying a critical condition on each target road segment in the set of target road segments to obtain the set of critical points includes:
Selecting a point p j on each target road section in the target road section set, wherein when the point p j meets a critical condition, the point p j is a critical point, and obtaining a critical point set;
The critical conditions are as follows:
Wherein d is the road distance from the start point to the point p j of the target road section; l ji is the road length of the target road, r ji is the impedance of the target road, T is a given time threshold, and w 1 is the shortest travel time of the junction node v i to the start of the target road.
Wherein, the statistic critical point set is denoted as P. Specifically, for each target segment E ji in the target segment set sel_e, a point p j is cut from the target segment to satisfyThe point P j is counted into the set of critical points P. Where d is the road distance from the start point of the target link e ji to the point p j; l ji is the road segment length of the target road segment e ji, r ji is the impedance of the target road segment e ji, T is a given time threshold, and w 1 is the shortest travel time of the junction node v i to the start of the target road segment.
Step S320, the points in the critical point set are sequentially connected around the hub node to form a traffic equal time circle of the hub node.
The connection may be clockwise around the pivot node or anticlockwise around the pivot node.
In one embodiment, the step of sequentially connecting the points in the set of critical points around the hub node to form the traffic isochrones of the hub node comprises sequentially connecting the points in the set of critical points clockwise around the hub node to form the traffic isochrones of the hub node.
For the critical point set P, the element points in the critical point set P are arranged clockwise according to the angle formed by the element points and the pivot node v i, and then the element points are sequentially connected to form a polygon. The polygon is the equal circle range of the hub node v i.
All the pivot nodes in the target area can obtain traffic equal time circles corresponding to all the pivot nodes in the target area by executing the steps S280 to S320, so that equal time circle calculation of all the pivot nodes in the target area can be completed.
According to the traffic equal time circle calculation method of the regional hub, all node information, road section information and OD point pair information in the region are obtained; constructing an area traffic comprehensive network according to the node information and the road section information, wherein the area traffic comprehensive network comprises a node set and a road section set; in the regional traffic comprehensive network, traffic distribution is completed by utilizing OD point pair information, and traffic impedance of each road section in the regional traffic comprehensive network is determined; screening target road segments from the regional traffic comprehensive network according to the shortest travel time from the hub node to other nodes in the regional traffic comprehensive network to obtain a target road segment set; selecting critical points meeting critical conditions on each target road section in the target road section set to obtain a critical point set; and sequentially connecting the points in the critical point set around the pivot node to form a traffic waiting period. The running condition of the road network under the real condition can be effectively restored, and the calculated isochronous cycle is closer to the actual condition; the isochronal loop calculation is more accurate based on the vector comprehensive area network. The method can realize the calculation of the equal time circle for the regional traffic comprehensive network, has simple design and low complexity, and is easy to calculate.
In one embodiment, a method for calculating a traffic equal circle of an area hub is provided, as shown in fig. 2, and illustrated by way of example in the Shanghai area of China, the method comprises the following specific steps:
step 1: and acquiring all node information, road section information and OD point pair information in the overseas region.
In total, 45790 nodes, 115167 road sections and 321 x 321 OD point pairs are arranged in the offshore area.
Step 2: and constructing an overseas area traffic comprehensive network according to the node information and the road section information.
Step 3: in the Shanghai regional traffic comprehensive network, the OD point pair information is utilized to complete balanced traffic distribution of users. After the user balanced distribution is completed, the traffic impedance attribute value of the road section is updated. The impedance of a road segment is the travel time through the road segment.
Step 4: taking the example of representing the node of the siphon bridge station (namely the hub node), the equivalent time cycle is calculated as follows:
s4.1: and calculating the shortest travel time from the nodes of the siphon bridge station to other nodes. A heap optimization-based shortest path (Dijkstra) algorithm is executed in the Shanghai regional transportation integrated network, and the shortest travel time from the node of the siphon bridge station to all other nodes in V is calculated.
S4.2: and screening the target road segment set. Given a time threshold t=45 minutes. And searching all road sections which meet the condition that the shortest travel time from the nodes of the siphon station to the starting point is less than 45 minutes and the shortest travel time at the ending point is greater than 45 minutes in all road sections, and determining the road sections as target road sections.
S4.3: and counting a critical point set. For the target road segment set screened in S4.2, for each target road segment, a point p j is intercepted from the target road segment, thereby meeting the requirements ofThe point p j is counted in the set of critical points. Where d is the road distance from the start point to the point p j of the target link; l ji is the road length of the target road, r ji is the impedance of the target road, T is a given time threshold, and w 1 is the shortest travel time of the junction node v i to the start of the target road.
S4.4: and drawing traffic isochrones of nodes of the siphon bridge station. And (3) for the critical point set obtained in the step (S4.3), arranging the element points in the critical point set clockwise according to the angle formed by the element points and the nodes of the siphon bridge station, and then connecting the element points in sequence to form a polygon. The polygon is the traffic equal-time circle range of the nodes of the rainbow bridge, as shown in fig. 3, the black dots of fig. 3 are the nodes of the rainbow bridge, and the gray shade range around the black dots is the traffic equal-time circle range.
It should be understood that, although the steps in the flowchart of fig. 1 are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not strictly limited to the order of execution unless explicitly recited herein, and the steps may be executed in other orders. Moreover, at least some of the steps in fig. 1 may include multiple sub-steps or stages that are not necessarily performed at the same time, but may be performed at different times, nor do the order in which the sub-steps or stages are performed necessarily performed in sequence, but may be performed alternately or alternately with at least a portion of other steps or sub-steps of other steps.
The technical features of the above embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples illustrate only a few embodiments of the application, which are described in detail and are not to be construed as limiting the scope of the application. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application. Accordingly, the scope of protection of the present application is to be determined by the appended claims.
Claims (5)
1. A method for calculating traffic isochrone of a regional hub, the method comprising:
acquiring all node information, road section information and OD point pair information in a target area;
constructing an area traffic comprehensive network according to the node information and the road section information, wherein the area traffic comprehensive network comprises a node set and a road section set;
in the regional traffic comprehensive network, traffic distribution is completed by utilizing the OD point pair information, and traffic impedance of each road section in the regional traffic comprehensive network is determined;
Screening target road segments from the regional traffic comprehensive network according to the shortest travel time from the hub node to other nodes in the regional traffic comprehensive network to obtain a target road segment set;
Selecting critical points meeting critical conditions on each target road section in the target road section set to obtain a critical point set;
and sequentially connecting the points in the critical point set around the junction node to form a traffic equal time circle of the junction node.
2. The method of claim 1, wherein the step of screening the target road segments from the regional transportation integration network according to the shortest travel time from the junction node to other nodes in the regional transportation integration network to obtain the target road segment set comprises the following steps:
executing a shortest algorithm based on heap optimization in the regional traffic comprehensive network to obtain the shortest travel time from the hub node to other nodes;
And screening out the road sections with the shortest travel time from the hub node v i to the road section e j less than or equal to T and the shortest travel time from the hub node v i to the road section e j greater than T from the road section set according to the shortest travel time from the hub node to other nodes, determining the road sections as target road sections, and obtaining a target road section set, wherein T is a given time threshold.
3. The method of claim 1, wherein the step of determining the traffic impedance of each road segment in the regional traffic integration network by using the OD point pair information to complete traffic distribution in the regional traffic integration network comprises:
in an area traffic comprehensive network, traffic distribution with multipath-capacity limitation is carried out, and traffic is distributed to each road section according to traffic distribution principle;
and determining the traffic impedance of each road section in the regional traffic comprehensive network according to the traffic volume of each road section in the regional traffic comprehensive network.
4. The method of claim 1, wherein the step of selecting a critical point on each of the set of target segments that satisfies a critical condition to obtain a set of critical points comprises:
Selecting a point p j on each target road section in the target road section set, wherein when the point p j meets a critical condition, the point p j is a critical point, and obtaining a critical point set;
The critical conditions are as follows:
Wherein d is the road distance from the start point to the point p j of the target road section; l ji is the road length of the target road, r ji is the impedance of the target road, T is a given time threshold, and w 1 is the shortest travel time of the junction node v i to the start of the target road.
5. The method of claim 1, wherein the step of sequentially connecting points in the set of critical points around the hub node to form a traffic isochrone for the hub node comprises:
and sequentially connecting the points in the critical point set clockwise around the pivot node angle to form a traffic equal time circle of the pivot node.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111348678.5A CN114169580B (en) | 2021-11-15 | 2021-11-15 | Traffic equal-time-circle calculation method for regional hub |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111348678.5A CN114169580B (en) | 2021-11-15 | 2021-11-15 | Traffic equal-time-circle calculation method for regional hub |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114169580A CN114169580A (en) | 2022-03-11 |
| CN114169580B true CN114169580B (en) | 2024-07-12 |
Family
ID=80478987
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111348678.5A Active CN114169580B (en) | 2021-11-15 | 2021-11-15 | Traffic equal-time-circle calculation method for regional hub |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114169580B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116311914B (en) * | 2023-02-21 | 2024-06-11 | 华南理工大学 | Road line discrete point isochronous characteristic value estimation method for traffic isochronous line |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112597259A (en) * | 2020-12-17 | 2021-04-02 | 东南大学 | Traffic distribution method based on regional comprehensive traffic network topology reconstruction |
| CN113392488A (en) * | 2021-06-04 | 2021-09-14 | 东南大学 | Method for disassembling hub node of integrated transportation network and constructing virtual network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108242203A (en) * | 2016-12-23 | 2018-07-03 | 中兴通讯股份有限公司 | A kind of region partitioning method and device |
| CN108198412B (en) * | 2017-12-06 | 2020-02-07 | 广东交通职业技术学院 | Supersaturated road network multilayer control boundary dynamic division method based on MFD under Internet of vehicles |
-
2021
- 2021-11-15 CN CN202111348678.5A patent/CN114169580B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112597259A (en) * | 2020-12-17 | 2021-04-02 | 东南大学 | Traffic distribution method based on regional comprehensive traffic network topology reconstruction |
| CN113392488A (en) * | 2021-06-04 | 2021-09-14 | 东南大学 | Method for disassembling hub node of integrated transportation network and constructing virtual network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114169580A (en) | 2022-03-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107194498B (en) | Hydrologic monitoring network optimization method | |
| CN110111576B (en) | Method for realizing urban traffic elasticity index based on space-time congestion sub-cluster | |
| CN103476051B (en) | A kind of communication net node importance evaluation method | |
| CN112069573B (en) | City group space simulation method, system and equipment based on cellular automaton | |
| CN106875281B (en) | Social network node mining activation method based on greedy subgraph | |
| CN103020267B (en) | Based on the complex network community structure method for digging of triangular cluster multi-label | |
| CN110543728B (en) | Urban traffic network key intersection discovery method | |
| CN103837154A (en) | Path planning method and system | |
| CN110619426B (en) | Road network model construction method, device, equipment and storage medium | |
| CN107092984A (en) | A kind of network function end node propagation prediction method based on cascading failure | |
| CN114093168A (en) | Urban road traffic running state evaluation method based on toughness view angle | |
| CN114169580B (en) | Traffic equal-time-circle calculation method for regional hub | |
| CN105574541A (en) | Compactness sorting based network community discovery method | |
| CN102571431A (en) | Group concept-based improved Fast-Newman clustering method applied to complex network | |
| CN115586557B (en) | Vehicle driving track deviation correcting method and device based on road network data | |
| CN104217579A (en) | Method for searching critical road sections of traffic networks on basis of redundancy of road section sub-networks | |
| CN109902138A (en) | The one-dimensional hydrodynamic force analog basis data topology relationship building in city and coding method based on GIS | |
| CN104700311B (en) | A kind of neighborhood in community network follows community discovery method | |
| CN110011847B (en) | Data source quality evaluation method under sensing cloud environment | |
| CN113409576B (en) | Bayesian network-based traffic network dynamic prediction method and system | |
| CN112597399B (en) | Graph data processing method and device, computer equipment and storage medium | |
| Wu et al. | A heuristic map-matching algorithm by using vector-based recognition | |
| CN105955710A (en) | Parallel simulation data processing method based on tree communication structure | |
| CN108198084A (en) | A kind of complex network is overlapped community discovery method | |
| CN112668761B (en) | Step-by-step line aggregation rainfall data scale conversion method |
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 |