Modeling method of regional road network traffic flow distribution structure model

Abstract

The invention discloses a regional road network traffic flow distribution structure model modeling method. The method comprises the following steps: 1) constructing a regional road network topological structure chart based on a regional road network GIS map or a third-party structure chart; 2) establishing a road network target period traffic scene comprehensive parameter database; 3) associating the traffic flow data in the database with the related lines and positions of the corresponding intersection road section lanes in the regional road network topological structure chart and the traffic flow identifiers; 4) coding; 5) defining a data structure relationship between intersection road section traffic flow identification codes in the topological structure; and 6) establishing a regional road network target time period traffic flow distribution structure model, and obtaining the flow track and traffic flow distribution data of the traffic scene of the target regional road network at any time period according to the model. According to the method, a credible traffic flow simulation scene can be provided for reconstruction of high fitting of a traffic scene in a target period and a real scene in a simulation optimization decision-making process of comprehensive traffic control and management.

Description

Technical Field

[0001] The present invention relates to intelligent transportation technology, and in particular to a method for modeling a regional road network traffic flow distribution structure model. Background Art

[0002] In the regional road network traffic simulation system, it is necessary to simulate and reconstruct the planning, design, calculation and simulation display of the road traffic flow distribution of the target regional road network during the target period; based on the reconstructed traffic flow distribution data, perform simulation detection calculations on the optimization plan, obtain the comprehensive traffic parameters of the optimization plan for analysis, evaluation and decision-making, and simulate and display the traffic operation process.

[0003] In the simulation process, the virtual traffic flow method is a basic link. The fit between this link and the actual scene is an important factor in the confidence level of the simulation system in obtaining reconstruction scheme data and optimization scheme data.

[0004] At present, there are many methods for traffic flow simulation modeling in the vehicle traffic operation process, mainly as follows:

[0005] 1. Method for fitting and generating local traffic flow of road sections;

[0006] The virtual vehicle flow process between the starting point and the end point of the road section is used to generate a virtual vehicle operation process with a fixed target flow in each target section structure to simulate the traffic process at the micro level. It can also be formed by the micro-combination of multiple specific sections to form a meso-level process simulation in the target area.

[0007] The traffic data reconstructed by this method is accurate, convenient for three-dimensional effect modeling, and has good visibility. However, the microscopic traffic process formed by each specific road section is a closed form, lacking the organic connection between the overall connection process of regional traffic flow, and lacking the complete random operation mechanism of target regional traffic. Therefore, the regional mesoscopic simulation scene formed is quite different from the actual scene, and the stable and uniform speed mode of the vehicle in the simulation process is also quite different from the dynamic changes of the actual scene.

[0008] 2. Random traffic fitting generation method;

[0009] This method simulates the natural formation process of traffic flow in the target area. Virtual running vehicles with random trajectories, uniform or variable speeds, and specific flow rates are sent from the boundaries of the regional road network and the parking lots defined in the road network. Through the completely random operation process of the traffic, the flow data of the traffic in the target area is formed.

[0010] The virtual traffic scene generated by this method has good similarity with the operation process of the real scene. However, the flow distribution data is highly random, and the flow data generated by some sections of the road have a poor match with the established detection data of the real target scene. The flow distribution data has obvious volatility and poor consistency in repetition. The obtained data has a low confidence level in the simulation of scenes where the flow data requires strong pertinence, making it difficult to obtain the optimal solution.

[0011] 3. Traffic trajectory simulation generation method;

[0012] This method simulates the vehicle traffic process in the target area road network, at the boundary of the target area and the defined parking lot, based on the OD trajectory data and flow frequency data of all traffic vehicles within the target period.

[0013] This method is highly targeted to actual traffic scenarios, has good data fitting, and has high confidence in the data obtained. The problem is that the vehicle ratio of traffic flow OD trajectories that can be obtained in reality is very limited. After extended fitting based on the limited trajectory data with large gaps, the traffic process scenario simulation for the entire period is performed, and the flow data of each section formed is still quite different from the actual scenario data. Summary of the invention

[0014] The technical problem to be solved by the present invention is to provide a method for modeling a regional road network traffic flow distribution structure model in view of the defects in the prior art. According to this method, a repeatable traffic simulation scenario based on the traffic flow trajectory and the random operation process of the traffic flow can be realized, which is highly consistent with the actual traffic flow distribution operation in the target area and target period.

[0015] The technical solution adopted by the present invention to solve the technical problem is: a method for modeling a regional road network traffic flow distribution structure model, comprising the following steps:

[0016] 1) Construct a regional road network topology diagram based on the regional road network GIS map or a third-party structure diagram;

[0017] The regional road network topology structure obtained based on the GIS map of the regional road network contains the key data of the road network traffic flow, encodes the road network topology structure and defines the data relationship to obtain the regional road network topology structure diagram;

[0018] The regional road network topology structure is a simplified vector structure of a GIS map or a standard vector structure of lines and nodes, including basic physical structure data; the regional road network topology structure diagram includes the following digital topology structure:

[0019] 1.1) Topological structure of road network intersection nodes;

[0020] Intersection nodes include the structural sidelines, centerlines and traffic logic lines of the related one-way / two-way sections of the intersection; structural dimension data; section direction identification; signal identification; intersection traffic parameter data; intersection node number; intersection ID code;

[0021] Lane direction signs at intersections, including straight ahead, right turn, left turn, U-turn, fork, loop out, and loop in; the fork refers to the other intersection directions outside the four phase direction intersections;

[0022] Traffic direction signs at intersections: multiple lane direction signs in the same direction are equivalent to one traffic direction sign in the same direction. The traffic direction sign is the set of all lane signs in the same direction.

[0023] The intersection traffic node identifier also has a traffic direction identifier and a corresponding associated traffic node number;

[0024] The intersection traffic node number refers to the traffic node number or code corresponding to the traffic direction graphic mark;

[0025] The intersection traffic node is composed of the intersection traffic node identifier, traffic node code and traffic node traffic data;

[0026] Traffic flow data of intersection traffic nodes, including initial values ​​of intersection traffic nodes (generated by detection values, estimated values ​​and derived values) and residual values ​​of intersection traffic nodes (calculated residual values);

[0027] The input (I) and output (O) sections of the intersection direction section refer to the section in a certain direction of the intersection divided into the input section of the traffic flow and the output section of the traffic flow relative to the intersection. The intersection direction section has a section ID code, a section node code, a section node I / O identifier, a section flow initial value, and a section flow residual value;

[0028] 1.2) Road network segment node topology;

[0029] Road network section nodes, including structural sidelines, centerlines, and traffic logic lines of single / bidirectional sections; structural dimension data; section length; section direction identification; section traffic parameter data; section node number; section ID code; section traffic direction identification; section traffic flow initial value (detected value, estimated value, and derived value); section traffic flow residual value; the section refers to a single-direction section with different directions between two intersections; two single-direction sections with different directions constitute a bidirectional section;

[0030] 1.3) Topological structure of the regional road network boundary sections;

[0031] The regional road network boundary section includes the structural sideline, center line, traffic logic line, structural dimension data, section length, section direction mark, section traffic parameter data, section node number, section ID code, section I / O number, section traffic direction mark, section traffic initial value, and section traffic residual value of the single / bidirectional section; the regional road network boundary section refers to a single-direction section with different directions from the regional road network boundary intersection to the boundary; two single-direction sections with different directions constitute a bidirectional section;

[0032] 1.4) Regional road network parking lot I / O channel section topology;

[0033] The parking lot I / O channel section includes the structural side lines, center lines, traffic logic lines, structural dimension data of the single / bidirectional section; section length; section direction identification; section traffic parameter data; section node number; section ID code; section I / O number; section traffic direction identification; section traffic initial value; section traffic residual value; the parking lot I / O channel section refers to the single-direction section in two different directions between the parking lot intersection and the parking lot, and the single-direction section in two different directions constitutes a bidirectional section;

[0034] 1.5) Traffic nodes;

[0035] The traffic node includes the intersection traffic node identification, the corresponding traffic node code and traffic data;

[0036] The traffic node identifiers include straight, right turn, left turn, U-turn, fork, loop out, and loop in; loop out and loop in refer to the traffic directions of the roundabout; fork refers to the traffic directions of other intersections besides the four directions of straight, left turn, right turn, and U-turn;

[0037] The flow nodes can be divided into flow nodes in the input direction and flow nodes in the output direction of the relevant road sections of the intersection;

[0038] The traffic node code is a traffic node number corresponding to the traffic node identifier, and the code has three coding attributes, namely, the intersection node code, the traffic flow source direction code, and the traffic flow turning code;

[0039] The flow node data includes the initial value of the flow node data (the initial value is generated by the detection value, the estimated value, and the derived value) and the flow node residual value (the calculated residual value);

[0040] 2) Establish a comprehensive parameter database of traffic scenarios during target periods of the road network;

[0041] The comprehensive parameter database of traffic scenarios in target time periods of the road network is used to store various types of traffic parameter data detected and obtained in the traffic operation scenarios of the target area road network in each time period;

[0042] The traffic parameter data include: vehicle traffic flow, average speed, queue length, congestion index, signal timing design plan, and traffic organization plan related to each intersection, road section, lane, and parking lot in the target area road network;

[0043] 3) Associating traffic flow data with the lines and positions of corresponding intersections, road sections, lanes, and flow indicators in the topological map;

[0044] 4) Coding: Use digital and letter coding to encode the road network topology to form a digital topology;

[0045] In the step 4), the encoding is as follows:

[0046] 4.1) Intersection node coding

[0047] The intersection node code is a digital identifier for numbering all the intersections in the selected target area road network. The digits of the intersection node code are one or more integer digits;

[0048] 4.2) Section node coding

[0049] The road segment node code is a digital identifier for the one-way road segment between the upstream and downstream intersections. It contains the attributes of the relevant intersection and the attributes defining the direction of traffic flow in the one-way road segment. The coding method is as follows:

[0050] The road section node codes include: upstream intersection code, downstream intersection code and road section direction code;

[0051] The road section direction code has two digital codes, including: the traffic flow direction code and the traffic flow direction code;

[0052] 4.3) Traffic node encoding;

[0053] Traffic node encoding, the encoding method is as follows:

[0054] The traffic node code includes: intersection node code and flow direction code;

[0055] The flow direction code includes: source direction code and turn code; the relevant codes can be identified by numbers and letters;

[0056] 4.4) The start and end codes of the section node path;

[0057] The start / end code of the segment node path, i.e., the segment code of the input / output end of the segment formed in the planned regional road network boundary or at the entrance and exit of the parking lot;

[0058] The start / end code of the segment node path is encoded as follows:

[0059] The start point code / end point code of the section node path includes: associated intersection code 1, associated intersection code 2 and traffic direction code (consistent with the section direction coding structure);

[0060] 4.5) The start / end node coding of the intersection node and the traffic node path is as follows:

[0061] The starting point code is: the starting point code I plus the sequence number n, that is, (In) as the input node code;

[0062] The terminal code is: the terminal code O plus the sequence number m, that is, (Om) as the output node code;

[0063] In the intersection node path and flow node path, the intersection node code and flow node code are regarded as the same, and are identified by the starting point In(x) / end point Om(y);

[0064] Among them, x is the residual value of the flow at the starting point, and y is the residual value of the flow at the end point;

[0065] 4.6) Intersection direction coding

[0066] The intersection direction code, i.e. the intersection traffic source direction code, or the section traffic output direction code; uses integer digits to identify; for example, uses two-digit codes to indicate the direction, 01 west; 02 north; 03 east; 04 south;

[0067] 4.7) Relationship rules between road section direction code and turn code

[0068] In the road section node code, a relationship correspondence rule is set between the two digital direction codes in the road section direction code and the letter code of the turn code of the traffic node; the corresponding relationship rules are summarized as follows:

[0069] The order and combination relationship between the two direction code numbers of the road section are cross-order, reverse order, order, same order, direction code + area code, area code + direction code, direction code + fork code, corresponding to straight ahead, right turn, left turn, U-turn, loop in, loop out, fork;

[0070] 5) Define the data relationship between codes of topological structure and between codes and traffic flow;

[0071] The trajectory of the traffic flow path can be composed of intersection nodes, section nodes and flow nodes. After the coding definition of each type of node is completed, the trajectory of the traffic flow path is structured by describing the path composed of the coding chain of each type of node, and the relevant flow data is associated;

[0072] 6) Establish a model, and obtain the traffic trajectory and traffic flow distribution data of the traffic scene in the target area road network at any time period based on the model, including trajectory data and corresponding traffic data;

[0073] Based on the regional road network topology diagram, relevant data, modeling comprehensive rule tools and traffic flow analysis methods, a regional road network traffic flow distribution structure model is created. The model includes:

[0074] The data foundation includes the regional road network traffic topology diagram; the comprehensive parameter database of traffic scenarios in the target road network period;

[0075] The basic part of the model includes the regional road network digital traffic topology diagram, the road network traffic topology node relationship database, and the algorithm library (including the starting point deduction path algorithm; the end point deduction path algorithm; the sequence algorithm set by special planning; the sequence algorithm planned according to the nature of the trunk line, branch line, and auxiliary road; the graphic recognition deduction algorithm; the graphic auxiliary analysis algorithm; the regional road network flow path distribution completeness algorithm; the large flow path priority algorithm;)

[0076] The model application part includes a road network traffic topology flow distribution structure database and a comprehensive database of road network traffic multi-type node path flow trajectory.

[0077] A model is established, and traffic flow trajectories and traffic flow distribution data of traffic scenes in the target area road network at any time period are obtained based on the model, as follows:

[0078] 6.1) Establish a node relationship database of road network traffic topology structure;

[0079] The topological node relationship database is based on the road network traffic topology structure and describes the upstream and downstream relationships between nodes at each intersection, that is, the relationship between adjacent intersections associated with each intersection;

[0080] This database is used for path planning of intersection node trajectories.

[0081] 6.2) Create a comprehensive database of traffic flow trajectories of multiple types of nodes in the road network, and complete the extraction of traffic flow path trajectory flow data during the target period of the target area road network;

[0082] The multi-type node flow trajectory includes a database of flow node path flow trajectory, section node path flow trajectory, and intersection node path flow trajectory. The comprehensive database of multi-type node path flow trajectory of road network traffic is a comprehensive database containing these three types of node trajectories; wherein, the section node flow trajectory is generated from the intersection node flow trajectory through coding calculation; the traffic flow direction node path flow trajectory is generated from the section node flow trajectory; the comprehensive database of multi-type node path flow trajectory of road network traffic is a relational database used for calculating the above three types of node trajectories;

[0083] 6.3) Establish a road network traffic topology flow distribution structure database;

[0084] The road network traffic topology flow distribution structure database is as follows:

[0085] The road network traffic topology flow distribution structure database includes various types of node codes of the road network traffic topology structure, including intersection node codes, section node codes, flow node codes, I / O node codes and intersection direction codes, related ID codes and node-related flow residual values, initial values, and a database of section length data; wherein the initial value is a fixed value and the residual value is a variable value;

[0086] The road network traffic topology flow distribution structure database is used to calculate the traffic flow values ​​corresponding to each node and node trajectory in the flow node trajectory, section node trajectory, and intersection node trajectory using the road network traffic flow distribution analysis algorithm according to the above data and coding rules;

[0087] The relationship between the above three databases is described as follows:

[0088] The generation of node trajectory database depends on the node relationship database of road network traffic topology structure for path planning calculation, and the calculation of each node flow value depends on the road network traffic topology flow distribution structure database;

[0089] 6.4) Based on the traffic flow analysis method in the regional road network traffic flow distribution structure model, the analysis process of the target regional road network traffic flow trajectory is completed by using program design and manual graphics operation, or a combination of program and manual operation, and the flow trajectory data of each type of node path is obtained.

[0090] According to the above scheme, in step 6.2), the road network traffic multi-type node path flow trajectory comprehensive database is established as follows:

[0091] Based on the road network traffic topology structure node relationship database (supporting path planning) and the road network traffic topology flow distribution structure database (supporting node trajectory flow data calculation), a road intersection node path flow trajectory database based on traffic flow analysis methods and rules is constructed;

[0092] The intersection node path flow trajectory database contains the following data: the starting intersection node code; each intermediate intersection node code, all intermediate two adjacent node direction codes, all intermediate two adjacent node section lengths, and the terminal intersection node code; the flow value of the flow trajectory;

[0093] According to the intersection node path flow trajectory database, a section node path flow trajectory database is constructed;

[0094] The section node path flow trajectory database includes the following data: the starting section node code, all intermediate section node codes, the end section node code, all section node section lengths, and the flow value of the flow trajectory; all section node codes include intersection nodes and direction attributes;

[0095] Based on the road section node path flow trajectory database, a traffic flow direction node path flow trajectory database is constructed;

[0096] The traffic flow direction node path flow trajectory database, i.e., the flow node database, includes the following data: the starting flow node code, the starting flow node flow residual value; each intermediate flow node code and the flow residual value corresponding to each intermediate flow node; the terminal flow node code, the terminal flow node flow residual value, and the flow value of the flow node trajectory;

[0097] Based on the intersection, road section, direction traffic node path flow trajectory database and the road network traffic topology flow distribution structure database, a comprehensive database of road network traffic multi-type node path flow trajectory is constructed;

[0098] The road network traffic multi-type node path flow trajectory comprehensive database is a tool for calculating the flow value of the relevant path flow trajectory based on the intersection, road section, direction flow node path flow trajectory database and the road network traffic topology flow distribution structure database; the path flow value, the road section node residual value, and the direction flow node residual value are filled into the data attribute fields of each database with relevant data attributes, and the flow value of the relevant path flow trajectory can be calculated;

[0099] According to the above scheme, in step 6.4), the analysis process of the traffic flow trajectory of the target area road network is completed by a program module method, specifically: through program coding calculation, the section node trajectory is generated from the intersection node trajectory, the traffic flow direction node trajectory is generated from the section node trajectory, and the flow value is calculated; the node trajectory comprehensive database is a relational database used for the calculation of three types of node trajectories.

[0100] According to the above scheme, in step 6.4), the analysis process of the traffic flow trajectory of the target area road network is completed by using a manual graphic operation method, specifically: based on the digital traffic topology structure diagram of the regional road network, the traffic flow direction flow node path flow trajectory is directly generated, and the flow value of the corresponding trajectory is calculated; at the same time, the intersection node and section node path flow trajectory and its flow value are generated.

[0101] According to the above scheme, in the step 6.4), the analysis process of the target area road network traffic flow trajectory is completed by combining the program mode with the manual graphic operation. Specifically, after the program calculation is completed, for some road section nodes and flow nodes in the regional road network digital traffic topology structure diagram and the road network traffic topology flow distribution structure database, when there are residual values, the calculation method of the manual trajectory planning graphic operation can be used to generate various types of node path flow trajectories and flow values ​​for the nodes with residual flow values ​​(flow residual values), and supplement them into the relevant database until the residual values ​​of all road section nodes and flow nodes in the regional road network digital traffic topology structure diagram and the road network traffic topology flow distribution structure database are zero. The result of the residual value of the flow node being zero can also be completed by programming.

[0102] The beneficial effects of the present invention are:

[0103] The present invention constructs a traffic flow dynamic distribution structure model based on the traffic flow vehicle trajectory of the road network traffic scene in the target area and target period. Using this model, the target traffic scene with high confidence dynamic random distribution of traffic flow can be quickly reconstructed in the simulation system. On this basis, the simulation optimization decision of the comprehensive traffic control plan can be carried out to discover the optimal comprehensive control solution. BRIEF DESCRIPTION OF THE DRAWINGS

[0104] The present invention will be further described below with reference to the accompanying drawings and embodiments, in which:

[0105] Figure 1 is a method flow chart of an embodiment of the present invention;

[0106] Figure 2 It is a schematic diagram of complex intersection nodes, road section nodes and intersection direction nodes according to an embodiment of the present invention;

[0107] Figure 3 It is a schematic diagram of typical intersection nodes, road section nodes and intersection direction nodes in an embodiment of the present invention;

[0108] Figure 4 is a schematic diagram of a regional road network traffic flow distribution structure model according to an embodiment of the present invention;

[0109] Figure 5 It is a schematic diagram of a traffic flow analysis algorithm model according to an embodiment of the present invention. DETAILED DESCRIPTION

[0110] In order to make the purpose, technical solution and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with the embodiments. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not used to limit the present invention.

[0111] like Figure 1As shown, a method for modeling a regional road network traffic flow distribution structure model includes the following steps:

[0112] 1) Construct a regional road network topology diagram based on the regional road network GIS map or a third-party structure diagram;

[0113] The regional road network topology structure diagram includes the road network intersection node topology structure, the road network section node topology structure, the regional road network boundary section topology structure, the regional road network parking lot I / O channel section topology structure, and the flow node structure;

[0114] 2) Establish a comprehensive parameter database of traffic scenarios during target periods of the road network;

[0115] 3) Associate the parameter data and traffic flow data in the traffic comprehensive parameter database with the corresponding lines and positions in the topological map and the various types of traffic signs to complete the preliminary digital construction of the real traffic scene in the target area road network and target period;

[0116] 4) Coding: Use digital and letter coding to encode the digital topological structure of the road network topology traffic to form a digital topological structure and lay the digital topological foundation of the model;

[0117] The coding and data relationship rules of the digital structure of road network topology traffic are as follows:

[0118] 4.1) Intersection node coding

[0119] The intersection node code is a digital identifier for numbering all intersections in the selected target area road network. Based on the current and future situation that the maximum number of motor vehicle intersections in cities does not exceed four digits, the intersection node code is a 4-digit integer (decimal). Other digit codes can also be used according to the situation.

[0120] The intersection node code is a sequential code automatically generated by the intersection signal configuration interface arrangement table of the regional road network topology or other convenient rules (for example, using a 4-digit code); or the coding sequence is manually planned according to the need for convenient viewing of the topology map.

[0121] The relevant numbers of the two, that is, the intersection node codes in the road network topology diagram, can be consistent with the intersection sequence numbers in the intersection list in the GIS map. This is convenient for data association in chart analysis and calculation. The basis for mapping and associating the topology diagram with the GIS map data is the ID code.

[0122] 4.2) Section node coding

[0123] The road segment node code is a digital identifier for the one-way road segment between the upstream and downstream intersections, and contains the attributes that define the traffic direction in the one-way road segment.

[0124] Section node code = upstream intersection code + downstream intersection code + section direction code

[0125] Road section direction code = incoming direction code + outgoing direction code

[0126] Note 1: Road section direction code, also known as road section traffic direction code;

[0127] Note 2: The definition of the incoming direction code / outgoing direction code is consistent with the definition of the intersection direction code.

[0128] Example 1: 0103 (from west to east) means that the traffic flow on the road section between two upstream and downstream intersections is from west to east;

[0129] Example 2: 1400, which means starting from the southwest direction as the source direction and heading to the 00 direction (from the southwest to the road network, the input direction) is the input end road section direction representation, indicating the input end traffic direction;

[0130] 4.3) Traffic node encoding;

[0131] Traffic node code, that is, traffic flow direction node code, consists of numbers + letters.

[0132] Traffic node code = intersection node code (number) + flow direction code (number + letter);

[0133] Flow direction code = source direction code (number) + driving direction code / turn code (letter);

[0134] 4.4) The starting point code / end point code of the section node path;

[0135] The start / end code of the segment node path refers to the segment code of the input / output end of the segment formed in the planned regional road network boundary or the entrance and exit of the parking lot. This code is regarded as the segment code in the segment node path.

[0136] The start / end code of the node path of the segment

[0137] = associated intersection code (number) + associated intersection code (number) + traffic direction code (number);

[0138] This code is generally used to identify the starting point / end point of a road segment node path;

[0139] For a path composed of segment nodes, the upstream and downstream intersections of the starting point and the end point are the same associated intersection, so the codes of the two intersections are the same associated intersection code.

[0140] 4.5) The start / end node coding of the intersection node and the flow node path;

[0141] Starting point code = starting point code (I) + sequence number. That is, (In) input node code;

[0142] Terminal code = terminal code (O) + sequence number. That is, (Om) output node code;

[0143] In the intersection node path and flow node path, the intersection node code and flow node code are regarded as the same, and are identified by the starting point In(x) / end point Om(y);

[0144] Note 1: x, y are the initial or residual values ​​of flow rate;

[0145] Note 2: The coding sequence number is set manually or automatically according to relevant rules and procedures.

[0146] 4.6) Intersection direction coding

[0147] The intersection direction code, i.e., the intersection traffic source direction code (the road section direction where the intersection traffic comes from), or the road section traffic output (destination) direction code, is encoded using letters or numbers.

[0148] Intersection direction code, coding definition rules, for example, using a total of 2 digits method is as follows;

[0149] 01 (west), 02 (north), 03 (east), 04 (south), 12 (northwest), 14 (southwest), 32 (northeast), 34 (southeast), 00 (area within the road network), 11 (area outside the road network);

[0150] 4.7) The corresponding rules between the road direction code and the turn code

[0151] The digital codes of the intersection direction code, the section direction code (the traffic direction code in the section code) and the letter codes of the turn code (driving direction code) of the traffic node are set to correspond to each other;

[0152] Based on this rule, the turn code of the traffic node between the two road sections can be derived from the combination relationship of the direction codes encoded by the two road section nodes.

[0153] The relationship between the numeric code of the road section direction code and the letter code of the turn code is as follows:

[0154] Road section direction code Two direction digital codes combined Turn letter code

[0155] Cross-order relationship between two direction codes; Straight D;

[0156] The reverse order relationship between the two direction codes; turn right R;

[0157] The order relationship between the two direction codes; Turn left L;

[0158] The same order relationship between the two direction codes; U-turn;

[0159] A combination of the intersection direction code and the fork direction code; Fork Cn; n is a natural integer

[0160] Combination of intra-area direction code and intersection direction code; Loop out Oo;

[0161] The combination of intersection direction code and intra-area direction code; Loop-in Oi;

[0162] The above codes are marked in the digital traffic topology map of the regional road network.

[0163] The digital structure of the regional road network digital traffic topology diagram, see the attached figure Figure 2 , Figure 3 ; Figure 2 It represents a basic way of coding and identification of intersection nodes, section nodes, flow nodes, intersection directions, section directions, fork road sections in a more complex road network topology. In the description of the intersection, the input and output sections are described mainly by the input flow node.

[0164] Figure 3 The traffic flow distribution structure model of a road network topology with a roundabout structure adopts the identification method of ring-in and ring-out type traffic nodes. The description of the intersection and the identification description of the input and output traffic nodes are carried out for the input and output sections.

[0165] 5) Define the data relationship between codes of topological structure and between codes and traffic flow;

[0166] The trajectory of the traffic flow path can be composed of intersection nodes, section nodes and flow nodes respectively; after the coding definition of each type of node is completed, the trajectory of the traffic flow path is structured according to the rules by the coding chain data and flow value of the intersection, section and flow node respectively, forming the trajectory of the traffic flow path of the intersection, section and flow node;

[0167] 6) Establish a regional road network traffic flow distribution structure model. The structure of the model is as follows: Figure 4

[0168] According to the calculation results of the model application layer, the traffic trajectory of the target area road network at any time and the traffic flow distribution data are obtained, including trajectory data and corresponding flow data;

[0169] A model is established, and traffic flow trajectories and traffic flow distribution data of traffic scenes in the target area road network at any time period are obtained based on the model, as follows:

[0170] 6.1) First, establish a road network traffic topology node relationship database; the road network traffic topology node relationship database is based on the road network traffic topology structure and describes the upstream and downstream relationships between nodes at each intersection; the database includes node number, driving direction (upstream and downstream relationship), direction code, and distance data between nodes;

[0171] For example: Crossroad A

[0172] Intersection node a----direction 1 (downstream) associated intersection / IO port node a1 (direction number xx, section distance L1)

[0173] Intersection node a----direction 2 (downstream) associated intersection / IO port node a2 (direction number xx, section distance L2)

[0174] Intersection node a----direction 3 (downstream) associated intersection / IO port node a3 (direction number xx, section distance L3)

[0175] Intersection node a----direction 4 (downstream) associated intersection / IO port node a4 (direction number xx, section distance L4)

[0176] 6.2) Create a comprehensive database of traffic path trajectories of multiple types of nodes in the road network, and complete the extraction of traffic path trajectory flow data for the target period of the target area road network; substitute the extracted data into the simulation system and execute it in the basic case and optimization case to complete the reconstruction of the traffic scene that is consistent with the actual traffic distribution in the target period of the target area road network.

[0177] In step 6.2), the comprehensive database of traffic path flow trajectories of multiple types of nodes in the road network is established as follows:

[0178] According to the node relationship database of the road network traffic topology structure, a database of intersection node path flow trajectory based on traffic flow analysis methods and rules is constructed;

[0179] According to the intersection node path flow trajectory database, a section node path flow trajectory database is constructed;

[0180] Based on the road section node path flow trajectory database, a traffic flow direction node path flow trajectory database is constructed;

[0181] Based on the intersection, road section, direction traffic node path flow trajectory database and the road network traffic topology flow distribution structure database, a comprehensive database of road network traffic multi-type node path flow trajectory is constructed;

[0182] The road network traffic multi-type node path flow trajectory comprehensive database is a tool for calculating the flow value of the relevant path flow trajectory based on the intersection, road section, direction flow node path flow trajectory database and the road network traffic topology flow distribution structure database; the path flow value, the road section node residual value, and the direction flow node residual value are filled into the data attribute fields of each database with relevant data attributes, and the flow value of the relevant path flow trajectory can be calculated;

[0183] 6.3) Establish a road network traffic topology flow distribution structure database;

[0184] 6.4) Based on the traffic flow analysis method in the regional road network traffic flow distribution structure model, the analysis process of the target regional road network traffic flow trajectory is completed by using program design and manual graphics operation, or a combination of program and manual operation, and the flow trajectory data of each type of node path is obtained.

[0185] The analysis and parsing method of the traffic flow distribution structure model of any scenario adopted in this embodiment is described as follows:

[0186] The analysis and parsing method of the traffic flow distribution structure model in any scenario is to decompose the macroscopic traffic flow state characteristics (i.e. the overall state of traffic flow distribution in a regional road network target period) into the mesoscopic traffic flow distribution structure (i.e. the traffic flow distribution structure state of intersections and road section nodes) and the microscopic traffic flow distribution structure (i.e. the traffic flow distribution structure state of traffic nodes), and then perform the path analysis of the traffic trajectory based on the distribution structure of the microscopic traffic, that is, the analysis of the vehicle collection trajectory path. On the basis of completing the traffic trajectory analysis, the simulation system is used based on the vehicle collection trajectory and its traffic data, combined with the signal timing data at that time, to reconstruct the traffic flow distribution in the target area and target period, so as to achieve the purpose of reconstructing any target traffic scene with high confidence.

[0187] 1) Based on the vehicle collection trajectory and its flow data, combined with the optimized signal configuration data, road network structure adjustment and traffic flow organization method adjustment, the optimal solution can be discovered and decided.

[0188] In this model, the road network traffic topology flow distribution structure database describes the structure of the micro-distribution of regional road network traffic flow; the road network traffic multi-type node path flow trajectory comprehensive database describes the flow trajectory data and trajectory flow of each type of node path formed by the parsing process.

[0189] The traffic analysis algorithm model in this model is a regional road network traffic flow analysis theoretical system composed of a series of expressions of the analysis algorithm, a series of analysis methods, a series of analysis program structures, and a series of coding rules, data relationship rules, and analysis rules. Figure 5 .

[0190] Based on this traffic flow analysis theory system, the analysis process of the traffic flow trajectory of the target area road network can be completed by program design or manual graphic operation or a combination of program and manual operation, and the flow trajectory and related flow data of each type of node path can be obtained.

[0191] 2) The traffic analysis algorithm model used in this embodiment is as follows:

[0192] 2.1) Analyze the expression of the algorithm;

[0193] 2.1.1) Expression of path node trajectory;

[0194] 2.1.1.1) Expression of intersection node trajectory;

[0195] Assume that the node OD value of the intersection node trajectory is In→On,

[0196] The node sequence of the intersection node OD trajectory is J1, J2, ..., Jm

[0197] Wherein, J is the node code; n and m are natural numbers;

[0198] The intersection node trajectory is expressed as:

[0199] F(In→On)=f(J1, J2, Jm);

[0200] 2.1.1.2) Expression of the track of the road segment node

[0201] Assume the node OD value of the section node trajectory is In→On,

[0202] The node sequence of the intersection node OD trajectory is Jx1Jy1, Jx2Jy2, ...., JxmJym

[0203] Among them, J is the node code; x and y are the intersection node codes; n and m are natural numbers;

[0204] The expression of the segment node trajectory is:

[0205] F(In→On)=f(Jx1Jy1, Jx2Jy2, ...., JxmJym);

[0206] 2.1.1.3) Expression of traffic node trajectory

[0207] Assume the node OD value of the flow node trajectory is In(x1)→On(Xm)

[0208] The node sequence of the traffic node OD trajectory is J1(x1), J2(x2), ...., Jm(xm)

[0209] Among them, Jm is the node code; xm is the node flow residual value; m is a natural number;

[0210] The flow node trajectory expression is:

[0211] F(In(x1)→On(Xm))=f(J1(x1), J2(x2), ...., Jm(xm));

[0212] 2.1.2) Structural relationships between different types of node trajectories

[0213]

[0214]

[0215] In different types of node trajectories, trajectory nodes can perform code Boolean operations and value operations on each other according to the coding rules. For example, the node code of a traffic node can be obtained from the corresponding intersection node code in the intersection node path. The incoming code is obtained from the direction code adjacent to the corresponding intersection code in the section code.

[0216] How to obtain the traffic node code:

[0217] The intersection node code in the traffic node code can be obtained from the second intersection node code in the section code, or can be directly obtained by calculating the corresponding intersection node code value in the intersection node path.

[0218] The intersection node code and flow direction code (flow direction code) of the traffic node code can be obtained by performing Boolean operations on the section node code, or directly obtained from the section node code field and the intersection node code field by the number-taking method, that is, the second intersection node direction code (end intersection direction code) and the first intersection direction code (starting point direction code) in the section node code.

[0219] 2.1.3) Mathematical expression for flow calculation in flow trajectory

[0220] F(Y)=f(J1(x1), J2(x2),...J(xm))

[0221] Where: Y is the flow value of the flow trajectory F(In(x1)→On(Xm)),

[0222] x1, x2, ... xm are the residual flow values ​​of each flow node

[0223] 2.2) Analysis method and program structure of analysis algorithm

[0224] 2.2.1) Program logic method of path resolution

[0225] The forward method first completes the flow path and residual value calculation of the first input end flow to all output end flows, until the input flow residual value is 0, and then calculates the flow path and residual value of the next input end flow to all output end flows; and so on.

[0226] The trunk priority method first completes the calculation of the sequence number of each input port flow to the same output port flow, and then calculates sequentially, that is, the trunk problem is solved first. The sequential numbering method is to set the same number from end to end.

[0227] The reverse method first completes the calculation of the first output end flow rate against all input end flows and the remaining values ​​until the residual value of the output end flow rate is 0; then completes the calculation of the next output end flow rate against all output end flows and the remaining values, and so on.

[0228] 2.2.2) Program logic of path resolution

[0229] 2.2.2.1) Starting point deduction path planning analysis (forward method)

[0230] 2.2.2.1.1) According to the path formed by a certain starting point to all the end points, the planning round-trip is carried out according to the sequence number of the end points (forward sequence method)

[0231] The starting point can be operated in sequence according to the sequence number, or in a set order;

[0232] From a certain starting point to all the end points, the paths formed by the end point sequence numbers are exhausted one by one until the flow residual value of the starting point is zero. If the flow of the starting point is not zero after one round, a new round of patrol with the same OD and different paths is carried out. And so on, until the flow residual value of the starting point is zero.

[0233] The sequence numbers of the endpoints can also be planned and set in order according to specific rules.

[0234] The case is as follows:

[0235] I1(a1)→O1(b1) track chain 1...track chain m1 (Note: a1 and b1 are residual values, there are m1 track chains)

[0236] I1(a1)→O2(b2)Trace chain 1.......Trace chain m2 ......

[0238] I1(a1)→On(bn)Trace chain 1.......Trace chain mn

[0239] I2(a2)→O1(b1)Trace chain 1.......Trace chain m1

[0240] I2(a2)→O2(b2)Trace chain 1.......Trace chain m2 ......

[0242] I2(a2)→On(bn)Trace chain 1.......Trace chain mn ......

[0244] In(an)→O1(b1)Trace chain 1.......Trace chain m1

[0245] In(an)→O2(b2)Trace chain 1.......Trace chain m2 ......

[0247] In(an)→On(bn)Trace chain 1.......Trace chain mn

[0248] 7.2.2.1.2 Operate in the order set by the special plan (forward special sequence method)

[0249] At a certain starting point, for all the endpoints, the OD paths formed by the endpoint sequence numbers are exhausted one by one until the flow residual value of the starting point is zero. If the flow of the starting point is not zero after one round, a new round of patrol with the same OD and different paths is carried out. And so on, until the flow residual value of the starting point is zero.

[0250] The starting points are sorted according to specific rules and the order of planning is set, and all the end points are patrolled in turn. The sequence numbers of the end points can also be planned and set according to specific rules.

[0251] 2.2.2.1.3) Analysis of high-traffic path priority planning (forward high-traffic priority method)

[0252] Starting from the sequence number of the starting point and the end point, the numbering of the starting point and the end point should be planned reasonably, and the starting point and the end point of the route with large flow should be prioritized for sequence number planning;

[0253] First, draw up the sequence numbers of the starting point and the end point, and then sort the sequence numbers in order according to the size of the traffic route.

[0254] 2.2.2.1.4) Perform sequential planning analysis according to the nature of trunk lines, branch lines, and auxiliary roads (forward trunk line priority method)

[0255] The trunk lines are prioritized and traffic resolution is performed first, followed by the branch lines, and so on.

[0256] 2.2.2.1.5) First fix a destination number, and all starting points perform patrol planning and analysis on this destination (forward starting point patrol method)

[0257] A certain end point is exhausted one by one by all the starting points, and the OD paths formed by the starting point sequence number are exhausted one by one until the flow residual value of the end point is zero. If the flow of the end point is not zero after one round, a new round of patrol with the same OD and different paths is carried out. And so on, until the flow residual value of the end point is zero.

[0258] 2.2.2.2) End point deduction path analysis (reverse method)

[0259] According to the path formed by a certain end point to all starting points, patrol according to the sequence number of the starting point (reverse sequence method)

[0260] The endpoints can be operated in sequence according to the sequence number or in a set order;

[0261] From a certain end point to all the starting points, the paths formed by the starting point sequence numbers are exhausted one by one until the flow residual value of the end point is zero. If the flow of the end point is not zero after one round, a new round of patrol with the same OD and different paths is carried out. And so on, until the flow residual value of the end point is zero.

[0262] The sequence numbers of the starting points can also be planned and set in order according to specific rules.

[0263] O1(a1)→I1(b1)Trajectory chain 1......Trajectory chain m1

[0264] O1(a1)→I2(b2)Trajectory chain 1.......Trajectory chain m2 ......

[0266] O1(a1)→In(bn)Trace chain 1.......Trace chain mn

[0267] O2(a2)→I1(b1)Trajectory chain 1.......Trajectory chain m1

[0268] O2(a2)→I2(b2)Trajectory chain 1.......Trajectory chain m2 ......

[0270] O2(a2)→In(bn)Trace chain 1.......Trace chain mn ......

[0272] On(an)→I1(b1)Trace chain 1.......Trace chain m1

[0273] On(an)→I2(b2)Trace chain 1.......Trace chain m2 ......

[0275] On(an)→In(bn)Trace chain 1.......Trace chain mn

[0276] Similar to the sorting method in the starting point path deduction and analysis in 2.2.2.1), the end point can also be subjected to path planning deduction and analysis in various corresponding ways.

[0277] 2.2.2.3) Graphics recognition, deduction and analysis

[0278] In the topology map, for the flow path nodes with flow residual values, identifiable structure or color directional vector graphics are set. Based on this, the program follows the set path traversal rules and directly patrols the flow path until the flow residual values ​​of all starting points and end points, as well as the flow residual values ​​of all flow nodes in the road network are zero.

[0279] 2.2.3) Graphics-assisted analysis

[0280] In the topology map, the structural graph of all flow nodes with flow residual values ​​is highlighted, and the calculation and analysis are manually assisted based on the topology map data until the flow residual values ​​of all starting points and end points, as well as the flow residual values ​​of all flow nodes in the road network are zero.

[0281] 2.2.4) Completeness analysis of regional road network traffic path distribution

[0282] 2.2.4.1) The flow paths at the edge of the road network are sorted first, and the flow paths within the road network are sorted later

[0283] First solve the traffic flow path at the road network boundary, then solve the remaining traffic flow path inside the road network; first complete the traffic flow analysis at the start and end points of the road network area boundary, and the sign of the completion of the analysis is that the residual traffic value at the start point of the regional road network boundary and the residual traffic value at the end point are both 0. The remaining road network traffic is the traffic flow path formed by the traffic between parking lots inside the regional road network, and then plan the sorting solution.

[0284] The sign of complete analysis is that all flow residual values ​​of the road network boundary flow nodes, boundary section nodes and road network internal flow nodes and internal section nodes are 0.

[0285] The complete analysis method can be fully programmed execution; it can also be manual operation; or it can be a combination of programming and manual operation.

[0286] 2.2.4.2) Unified sorting and analysis of traffic paths at the road network boundary and parking lot traffic paths within the network

[0287] The flow paths at the boundary of the road network and the flow paths inside the road network are uniformly sorted and planned, and parsed in the sorted order; the sign of the completion of the parsing is that the flow residual values ​​of all road section nodes and flow nodes at the boundary and inside of the regional road network are 0.

[0288] 2.3) Analysis planning method and analysis rules

[0289] 2.3.1) Sequence number marking and patrol sequence planning rules for the starting port and the end port;

[0290] Adjacent ports are planned with the same number; relative ports are planned with the same number; intersections close to trunk road intersections are planned with priority; the patrol order is trunk first, then secondary trunk, then branch line, and finally auxiliary road.

[0291] 2.3.2) Traffic distribution and traffic path marking planning rules;

[0292] 2.3.2.1) Traffic distribution marking planning rules;

[0293] 2.3.2.1.1) Direct labeling of detection data: direct flow data labeling of road section nodes and flow nodes based on equipment detection and manual detection data;

[0294] 2.3.2.1.2) The detection data is planned and labeled in combination with the traffic distribution model. When the detection data is incomplete, after the detection data is labeled, the remaining data is used to derive the traffic nodes of each section and each intersection according to the traffic distribution model, and the starting point (input end) and end point (output end) traffic of one or two intersections are reserved for fine-tuning the final port traffic value, thereby correcting the balance of total input / output traffic.

[0295] 2.3.2.2) Path planning rules

[0296] First, find the shortest path, and then deduce the patrol in order of path length;

[0297] Manual planning: planning the starting and ending points in the order of trunk, secondary trunk, branch and auxiliary roads;

[0298] 2.3.2.3) Path length rule

[0299] According to the intersection number method, if the number of end-to-end intersections is small, the length is defined as short;

[0300] In the segment length method, if the total length of the end-to-end segment is short, it is defined as short;

[0301] The hybrid method of the number of intersections and the length of road sections first compares the number of intersections, and prioritizes the paths with fewer intersections; the end-to-end lengths are compared between paths with the same number of intersections.

[0302] Note: End-to-end refers to the input and output ends

[0303] 2.3.3) Rules and methods for selecting traffic node codes,

[0304] The method for obtaining the flow nodes in the flow path is as follows:

[0305] 2.3.3.1) Direct value method, that is, directly extracting from the topological structure graph;

[0306] Directly obtain the flow node trajectory based on the flow nodes with non-zero residual values ​​in the topology graph.

[0307] In the regional road network digital traffic topology diagram, according to the structural distribution state of the residual flow nodes and the basic rules of flow trajectory formation, the flow path structure is fitted and extracted, and the traffic flow value of the trajectory is obtained according to the flow calculation method in the flow trajectory. The flow value calculation method in the flow trajectory can be completed by a program calculation method.

[0308] 2.3.3.2) Rule-based logic method, i.e. based on coding rules, using digital logic operations and rule-based value extraction methods;

[0309] Based on the coding rules of the above-mentioned types of nodes, the segment node codes in the segment node trajectory can be obtained from the intersection node codes in the intersection trajectory nodes. The flow node codes in the flow node trajectory can be obtained from the segment node codes in the segment trajectory nodes. The acquisition method can be obtained by programming using the digital logic operation method; it can also be obtained by programming using the logic based on the coding rules.

[0310] 2.3.3.2.1) Methods of digital logic operations;

[0311] The description of obtaining the node code, source direction code (incoming code), and driving direction code of the traffic node by using Boolean operation is as follows.

[0312] The node code and the travel direction code of the traffic node code can be obtained through a value-taking algorithm that performs Boolean operations on two adjacent road section codes.

[0313] The driving direction code of the traffic node code is calculated by Boolean operation between the upstream and downstream road section codes to obtain the digital code of the driving direction, and then the letter code of the driving direction is obtained through the relationship rules between the digital code and the letter code.

[0314] 2.3.3.2.2) Methods for encoding rule logic;

[0315] The node code and incoming code in the traffic node code are extracted from the downstream node code and the incoming code of the corresponding section code.

[0316] The driving direction code in the traffic node code is obtained by using the value-taking rules of the digital direction codes encoded by the two adjacent road section nodes to obtain a new digitized driving direction code of the traffic node. The digitized driving direction code is also composed of the same number of digits as the road section direction code.

[0317] According to the digital combination of the new driving direction code and the regular relationship between the digital combination and the letter code, the letter code of the driving direction code of the traffic node can be derived.

[0318] Upstream section node source direction code + downstream section node destination direction code → driving direction code;

[0319] 2.3.3.3) Hybrid value method, that is, the three attribute encodings in the traffic nodes in the traffic path are partially based on the rule logic method and partially based on the direct value method.

[0320] 2.3.3.4) Table lookup method: According to the intersection node trajectory, the section node trajectory and the flow node trajectory as well as the residual value corresponding to the flow at each node are obtained by looking up the flow distribution database.

[0321] 2.3.3.5) Graphic method: The trajectory and residual value of the traffic node are obtained by combining the topology diagram and table lookup.

[0322] Model effect verification and application

[0323] The simulation calculation process is run according to the simulation calculation tool provided by the "Road Traffic Integrated Control Simulation Optimization Decision System". In the simulation calculation of the target area road network traffic scene reconstruction process, the flow data of each intersection and section obtained by simulation calculation is compared and evaluated with the actual flow data collected. The deviation of the flow data at each intersection and section is less than 10%, which meets the requirements.

[0324] When the modeling tool of "Road Traffic Integrated Control Simulation Optimization Decision System" is used to complete the reconstruction of the road network traffic scene in the target area, a basic sample comprehensive traffic parameter database of the traffic scene that is consistent with the actual traffic process in the target area and target period is formed.

[0325] Based on the sample traffic simulation data of the present invention, the optimization tool of the "Road Traffic Comprehensive Control Simulation Optimization Decision System" can be used to optimize the road structure, traffic organization, signal timing, and facility adjustment of the target area road network. There is no limit on the number of optimizations, the optimization method, and the source of optimization data (it can be optimized through the system's internal tools or directly input external optimization data). Optimization iterations are performed, and through continuous comparison and evaluation, until the optimal solution is found, the optimal solution mining decision for comprehensive traffic control management under sample conditions is achieved.

[0326] It should be understood that those skilled in the art can make improvements or changes based on the above description, and all these improvements and changes should fall within the scope of protection of the appended claims of the present invention.

Claims

1. A method for modeling a regional road network traffic flow distribution structure model, characterized in that: The following steps are involved: 1) Construct a regional road network topology diagram based on the regional road network GIS map or a third-party structure diagram; The regional road network topology structure obtained based on the GIS map of the regional road network contains the key data of the road network traffic flow, encodes the road network topology structure and defines the data relationship to obtain the regional road network topology structure diagram; The regional road network topology is a simplified vector structure of a GIS map or a standard vector structure of lines and nodes, which contains basic structural physical data; 2) Establish a comprehensive parameter database of traffic scenarios in the target area road network period; The comprehensive parameter database of traffic scenarios in target area road network and target time period is used to store various types of traffic parameter data detected and obtained in the traffic operation scenarios of target area road network in each time period; The traffic parameter data include: vehicle traffic flow, average speed, queue length, congestion index, signal timing plan, traffic organization plan, and road network structure data related to each intersection, road section, lane, and parking lot in the target area road network; 3) Associating the traffic flow data in the database with the lines and positions of the lanes at the corresponding intersections and sections in the regional road network topology diagram and the traffic flow signs, completing the preliminary digital construction of the real traffic scene at the target time period of the target regional road network; 4) Coding: Use digital and alphabetic coding to encode the road network topology structure to form a digital topology structure and lay the digital topology foundation of the model; 5) Define the data structure relationship between the traffic flow identification codes of the intersection sections in the topological structure, and lay the foundation for the data structure relationship of the multi-type traffic flow trajectories of the model; The trajectory of the traffic flow path is composed of intersection nodes, road section nodes and traffic flow direction nodes respectively; after the coding definition of each type of node is completed, the trajectory of the traffic flow path is structurally described by the path composed of the coding chain of each type of node; 6) Establish a regional road network traffic flow distribution structure model, and obtain the traffic trajectory and traffic flow distribution data of the target regional road network in any target time period based on the model, that is, the trajectory data and the corresponding traffic data.

2. The method for modeling a regional road network traffic flow distribution structure model according to claim 1, characterized in that: In the step 1), the regional road network topology diagram includes the following digital topology: 1.1) Road network intersection node topology structure; including the following: Intersection nodes include the structural sidelines, centerlines and traffic logic lines of the related one-way / two-way sections of the intersection; structural dimension data; section direction identification; signal identification; intersection traffic parameter data; intersection node number; intersection ID code; Lane direction signs at intersections, including straight ahead, right turn, left turn, U-turn, fork, loop out, and loop in; the fork refers to the other intersection directions outside the four phase direction intersections; Traffic flow direction signs at intersections: multiple lane direction signs in the same direction are equivalent to one traffic flow direction sign in the same direction; The intersection traffic node identifier is composed of the intersection traffic direction identifier and the corresponding associated traffic node number; The intersection traffic node is composed of a traffic identifier and the corresponding associated traffic node traffic data; the traffic data of the traffic node includes the initial value of the intersection traffic node, including the detection value, the estimated value and the derived value; and the residual value of the flow node; The input and output sections of the intersection direction section refer to the section of a certain direction of the intersection divided into the input section of the traffic flow and the output section of the traffic flow; including the ID code of the intersection direction section, the section node code, the section node I / O identifier, the section flow initial value and the section flow residual value; 1.2) Road network segment node topology structure; including: Road network section nodes, including structural sidelines, centerlines, and traffic logic lines of single / bidirectional sections; structural dimension data; section length; section direction identification; section traffic parameter data; section node number; section ID code; section traffic direction identification; section flow initial value; section flow residual value; the section refers to a single-direction section with different directions between two intersections; two single-direction sections with different directions constitute a bidirectional section; 1.3) Regional road network boundary section topology structure; including: The regional road network boundary section includes the structural sideline, center line, traffic logic line, structural dimension data, section length, section direction mark, section traffic parameter data, section node number, section ID code, section I / O number, section traffic direction mark, section flow initial value, and section flow residual value of the single / bidirectional section; the regional road network boundary section refers to a single-direction section with different directions from the regional road network boundary intersection to the boundary; two single-direction sections with different directions constitute a bidirectional section; 1.4) Regional road network parking lot I / O channel section topology; The parking lot I / O channel section includes the structural side lines, center lines, traffic logic lines, structural dimension data of the single / bidirectional section; section length; section direction identification; section traffic parameter data; section node number; section ID code; section I / O number; section traffic direction identification; section flow initial value; section flow residual value; the parking lot I / O channel section refers to the single-direction section in two different directions between the parking lot intersection and the parking lot, and the single-direction section in two different directions constitutes a bidirectional section; 1.5) Traffic nodes; The traffic node includes the intersection traffic direction node identification, traffic node code and traffic data; The traffic flow direction node identifiers include straight ahead, right turn, left turn, U-turn, fork, loop out, and loop in; where loop out and loop in refer to the traffic flow direction of the roundabout; The flow nodes include flow nodes in the input direction and flow nodes in the output direction of the relevant road sections of the intersection; The flow node code is the flow node number corresponding to the lane direction mark; the flow node code has three attribute codes: intersection code, traffic flow source direction code, and traffic flow turning code; The flow data includes the initial value of the flow node and the residual value of the flow node; the initial value of the flow node includes the detection value, the estimated value and the derived value; the residual value of the traffic node in the intersection direction is the residual value of the traffic flow.

3. The method for modeling a regional road network traffic flow distribution structure model according to claim 1, characterized in that: In the step 4), the encoding is as follows: 4.1) Intersection node coding The intersection node code is a digital identifier for numbering all the intersections in the selected target area road network. The digits of the intersection node code are one or more integers; 4.2) Section node coding The road segment node code is a digital identifier for the one-way road segment between the upstream and downstream intersections. It contains the attributes that define the direction of traffic flow in the one-way road segment. The encoding method is as follows: The road section node codes include: upstream intersection code, downstream intersection code and road section direction code; The road section direction code includes: the incoming direction code and the outgoing direction code; 4.3) Traffic node encoding; Traffic node encoding, the encoding method is as follows: The traffic node code includes: intersection node code and flow direction code; The flow direction code includes: source direction code and turn code; 4.4) The start and end codes of the section node path; The start / end code of the segment node path, i.e., the segment code of the input / output end of the segment formed in the planned regional road network boundary or at the entrance and exit of the parking lot; The start / end code of the segment node path is encoded as follows: The start point code / end point code of the section node path includes: associated intersection code 1, associated intersection code 2 and traffic direction code; 4.5) The start / end node coding of the intersection node and the traffic node path is as follows: The starting point code is: the starting point code I plus the sequence number n, that is, (In) as the input node code; The terminal code is: the terminal code O plus the sequence number m, that is, (Om) as the output node code; In the intersection node path and flow node path, the intersection node code and flow node code are regarded as the same, and are identified by the starting point In(x) / end point Om(y); Among them, x is the residual flow value of the starting node, and y is the residual flow value of the terminal node; 4.6) Intersection direction coding Intersection direction code, i.e. intersection traffic source direction code, or section traffic output direction code; two-digit code is used to indicate the direction; 4.7) The relationship between the road section direction code and the turn code is coded; Set the relationship corresponding code for the direction combination code in the road section code and the turn code in the traffic node code; The relationship includes: the corresponding relationship rules between the digital sequence of the road section direction combination code and the turning code of going straight, turning right, turning left, turning around, looping in, looping out and entering the fork road.

4. The method for modeling a regional road network traffic flow distribution structure model according to claim 1, characterized in that: In the step 6), the details are as follows: Based on the regional road network topology diagram, relevant data, modeling comprehensive rule tools and traffic flow analysis methods, a regional road network traffic flow distribution structure model is created; the model includes: The data foundation includes the regional road network traffic topology diagram and the comprehensive parameter database of traffic scenarios in the target road network period; The basic part of the model includes a regional road network digital traffic topology diagram, a road network traffic topology node relationship database, and an algorithm library; the algorithm library includes a starting point deduction path algorithm; an end point deduction path algorithm; a sequence algorithm set according to special planning; a sequence algorithm planned according to the nature of trunk lines, branch lines, and auxiliary roads; a graphic recognition deduction algorithm; a graphic-assisted parsing algorithm; a regional road network flow path distribution completeness algorithm; and a large flow path priority algorithm. The model application part includes a road network traffic topology flow distribution structure database and a comprehensive database of road network traffic multi-type node path flow trajectory; Based on this model, the traffic trajectory and traffic flow distribution data of the target area road network at any time period are obtained, as follows: 6.1) Construct a node relationship database of the road network traffic topology structure; The topological node relationship database is based on the road network traffic topology structure and describes the upstream and downstream relationships between nodes at each intersection, that is, the relationship between adjacent intersections associated with each intersection; This database is used for path planning of intersection node trajectories. 6.2) Create a comprehensive database of traffic flow trajectories of multiple types of nodes in the road network, and complete the extraction of traffic flow path trajectory flow data during the target period of the target area road network; Multi-type node flow trajectory, including a database of flow node path flow trajectory, section node path flow trajectory, and intersection node path flow trajectory; the comprehensive database of multi-type node path flow trajectory of road network traffic is a comprehensive database containing these three types of node trajectories; wherein, the section node flow trajectory is generated from the intersection node flow trajectory through coding calculation; the flow node path flow trajectory is generated from the section node flow trajectory; the comprehensive database of multi-type node path flow trajectory of road network traffic is a relational database used for calculating the above three types of node trajectories; 6.3) Establish a road network traffic topology flow distribution structure database; The road network traffic topology flow distribution structure database is as follows: The road network traffic topology flow distribution structure database includes various types of node codes of the road network traffic topology structure, including intersection node codes, section node codes, flow node codes, I / O node codes and intersection direction codes, related ID codes and node-related flow residual values, initial values, and a database of section length data; wherein the initial value is a fixed value and the residual value is a variable value; The road network traffic topology flow distribution structure database is used to calculate the traffic flow values ​​corresponding to each node and node trajectory in the flow node trajectory, section node trajectory, and intersection node trajectory using the road network traffic flow distribution analysis algorithm according to the above data and coding rules; 6.4) Based on the traffic flow analysis method in the regional road network traffic flow distribution structure model, the analysis process of the target regional road network traffic flow trajectory is completed by using program design and manual graphics operation, or a combination of program and manual operation, and the flow trajectory data of each type of node path is obtained.

5. The method for modeling a regional road network traffic flow distribution structure model according to claim 1, characterized in that: In step 6.2), the road network traffic multi-type node path flow trajectory comprehensive database is established as follows: According to the road network traffic topology structure node relationship database and the road network traffic topology flow distribution structure database, a road intersection node path flow trajectory database based on traffic flow analysis methods and rules is constructed; The intersection node path flow trajectory database contains the following data: the starting intersection node code; each intermediate intersection node code, all intermediate two adjacent node direction codes, all intermediate two adjacent node section lengths, and the terminal intersection node code; the flow value of the flow trajectory; According to the intersection node path flow trajectory database, a section node path flow trajectory database is constructed; The road section node path flow trajectory database includes the following data: the starting section node code, all intermediate section node codes, the end section node code, all section node section lengths, and the flow value of the flow trajectory; all section node codes include adjacent intersection node attributes and section direction attributes; According to the section node path flow trajectory database, a flow node path flow trajectory database is constructed; The traffic node path traffic trajectory database, i.e., the traffic node database, includes the following data: the starting traffic node code, the starting traffic node traffic residual value; each intermediate traffic node code and the traffic residual value corresponding to each intermediate traffic node; The terminal flow node code, the terminal flow node flow residual value, and the flow value of the flow node trajectory; Based on the intersection, road section, traffic node path flow trajectory database and the road network traffic topology flow distribution structure database, a comprehensive database of road network traffic multi-type node path flow trajectory is constructed; The road network traffic multi-type node path flow trajectory comprehensive database is a tool for calculating the flow value of the relevant path flow trajectory based on the intersection, road section, flow node path flow trajectory database and the road network traffic topology flow distribution structure database; By filling the path flow value, the section node residual value, and the flow node residual value into the data attribute fields of each database with relevant data attributes, the flow value of the relevant path flow trajectory can be calculated; Then, the flow value of the obtained path flow trajectory is filled into the flow trajectory flow value field of the intersection, road section, and flow node path flow trajectory database for standby use.

6. The method for modeling a regional road network traffic flow distribution structure model according to claim 1, characterized in that: The step 6.4) is characterized in that it supports the use of program modules to complete the analysis process of the traffic flow trajectory of the target area road network, specifically: based on the model structure, through program coding calculation, the section node trajectory is generated from the intersection node trajectory, the traffic flow direction node trajectory is generated from the section node trajectory, and the flow value is calculated; the node trajectory comprehensive database is a relational database used for the calculation of three types of node trajectories.

7. The method for modeling a regional road network traffic flow distribution structure model according to claim 1, characterized in that: In the step 6.4), it is supported to use manual graphic operation to complete the analysis process of the traffic flow trajectory of the target area road network, specifically: according to the digital traffic topology structure diagram of the regional road network in the model structure, directly generate the traffic flow direction flow node path flow trajectory, and calculate the flow value of the corresponding trajectory; at the same time, generate the intersection node, section node path flow trajectory and its flow value.

8. The method for modeling a regional road network traffic flow distribution structure model according to claim 1, characterized in that: In the step 6.4), it is supported to use a combination of program mode and manual graphic operation to complete the analysis process of the target area road network traffic flow trajectory. Specifically, after the program calculation is completed, for some road section nodes and flow nodes in the regional road network digital traffic topology structure diagram and the road network traffic topology flow distribution structure database, if there are still residual values, the nodes with residual flow values ​​can be generated into various types of node path flow trajectories and their flow values ​​through the calculation method of manual trajectory planning graphic operation, and added to the relevant database until the residual values ​​of all road section nodes and flow nodes in the regional road network digital traffic topology structure diagram and the road network traffic topology flow distribution structure database are zero.

9. An electronic device, characterized in that: include: one or more processors; as well as a storage device for storing one or more programs, When the one or more programs are executed by the one or more processors, the one or more processors are caused to perform the method according to any one of claims 1 to 8.

10. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the method according to any one of claims 1 to 8 is implemented.

Images