A special network construction method for comprehensive transportation network

Abstract

The present invention discloses a method for constructing a special network for an integrated transportation network, comprising: (1) reading basic information of the integrated transportation network; (2) extracting a highway network in the integrated transportation network; (3) screening hub nodes in each transportation community, and constructing a comparison table of transportation community numbers and hub node numbers; (4) screening highway connecting sections in the integrated transportation network according to the comparison table of transportation community numbers and hub node numbers; (5) outputting extracted section information, extracted node information, extracted topological relationship information between nodes, and extracted transportation community information to construct a special network. The present invention is based on the idea of ​​multimodal transport under the background of integrated transportation, and connects transportation communities that do not contain special transportation modes to special networks through highways, effectively solving the problem that the analysis of special transportation demand under the background of integrated transportation is only oriented to a single mode of road network and cannot cover all transportation communities, resulting in low analysis accuracy.

Description

Technical Field

[0001] The present invention relates to the field of integrated transportation, and in particular to a special network construction method for an integrated transportation network. Background Art

[0002] After long-term development, my country has built a complete transportation infrastructure system, but each mode of transportation is self-contained and lacks an interconnected coordination mechanism. In order to break the original independent development model of each mode of transportation and promote the coordinated and integrated development of comprehensive transportation, the transportation mode will shift from a single mode of transportation to multimodal coordinated transport.

[0003] Traditional special transportation demand analysis only focuses on a single transportation network. For example, railway demand analysis only covers the railway network, which has problems such as small analysis scope and poor analysis accuracy. In fact, there is also a demand for special transportation in transportation communities that do not include special transportation modes. It is necessary to build a comprehensive transportation special network covering all transportation communities. Summary of the invention

[0004] Purpose of the invention: In view of the above problems, the purpose of the present invention is to provide a special network construction method for an integrated transportation network.

[0005] Technical solution: A special network construction method for a comprehensive transportation network of the present invention comprises the following steps:

[0006] (1) Read the basic information of the integrated transportation network, including node information, road section information, topological relationship information between nodes, and transportation community information;

[0007] (2) Extract the highway network in the comprehensive transportation network based on the basic information;

[0008] (3) Select the hub nodes in each traffic zone and construct a comparison table between traffic zone numbers and hub node numbers;

[0009] (4) Select the highway connecting sections in the comprehensive transportation network according to the comparison table of transportation community numbers and hub node numbers;

[0010] (5) Output the extracted road section information, extracted node information, extracted topological relationship information between nodes, and extracted traffic community information to build a special network:

[0011] (51) Filter each road section in the comprehensive transportation network according to the road section type. If the road section type is the special road section type to be extracted, or the unordered array consisting of the road section start point number and the end point number belongs to the road connection network section start point and end point number set, extract the corresponding road section information, and record the corresponding road section start point and end point numbers into the special network segment endpoint number set; otherwise, read the next road section for judgment until all road sections are traversed;

[0012] (52) Filter each node according to the recorded start and end point numbers of the road segment. If the node number belongs to the special network segment endpoint number set, extract the corresponding node information; if the condition is not met, read the next node for judgment until all nodes are traversed;

[0013] (53) Regenerate the topological relationship information between nodes based on the extracted node information and road section information;

[0014] (54) Extract traffic community information and complete the special network construction of the comprehensive transportation network.

[0015] Furthermore, the node information includes the total number of nodes and the number and coordinates of each node;

[0016] The road section information includes the total number of road sections, the starting and ending point numbers of each road section, and basic attributes;

[0017] The topological relationship information between the nodes includes the node number of the current node, the number of nodes connected to the current node, and the numbers of each node connected to the current node;

[0018] The traffic cell information includes the total number of traffic cells, traffic cell numbers, node numbers corresponding to the centroids of the traffic cells, traffic cell adjacency relationships, and nodes included in each traffic cell.

[0019] Furthermore, the basic attributes in the road section information include road section type and road section impedance, wherein the road section type includes highway, railway, waterway, air route, and pipeline;

[0020] The traffic cell adjacency relationship includes the number of the current cell, the number of cells connected to the current cell, and the numbers of cells connected to the current cell.

[0021] Furthermore, the highway network extracted from the comprehensive transportation network in step (2) includes:

[0022] (21) Filter each road section according to the road section type. If the road section type is a highway, extract the corresponding road section information and record the corresponding road section start and end point numbers into the highway network segment endpoint number set; if the road section type is not a highway, read the next road section for judgment until all road sections are traversed;

[0023] (22) Filter each node from the recorded start and end point numbers of the road segment. If the node number belongs to the set of endpoint numbers of the highway network segment, extract the corresponding node information; if the condition is not met, read the next node for judgment until all nodes are traversed;

[0024] (23) Regenerate the topological relationship information between nodes based on the extracted road section information and node information;

[0025] (24) Check whether the centroid points of each traffic zone in the comprehensive transportation network are connected to the highway. If not, modify the centroid point of the corresponding traffic zone to a node connected to the highway. After modifying all the centroid points of the traffic zones, extract the traffic zone information;

[0026] (25) According to the type of special network to be constructed, determine whether the construction of the special network is completed. If only the highway network needs to be extracted, the construction is completed and the extracted highway special network information is output; if a non-highway network needs to be constructed, continue to execute downward.

[0027] Furthermore, the hub node is a node that simultaneously connects the special road section that needs to be extracted and the highway.

[0028] Furthermore, step (4) screens the highway connecting sections in the comprehensive transportation network including:

[0029] (41) judging whether the traffic zone contains a hub node according to the comparison table of traffic zone numbers and hub node numbers: if a hub node is contained, counting all hub nodes in the traffic zone to obtain a hub node set of the traffic zone; if there is no hub node, counting the hub nodes in all adjacent zones of the current traffic zone according to the adjacent relationship of the traffic zones to obtain a hub node set of the traffic zone;

[0030] (42) Find the shortest path between the centroid of each traffic zone and each hub node in the hub node number of the traffic zone on the special highway network, count the starting point number and the end point number of each section included in the path, and record them in the form of an unordered array to the starting and ending point number set of the highway connection network section.

[0031] Further, in step (41), for a traffic cell k without a hub node, all adjacent cells of the traffic cell k are searched. If no hub node exists in any adjacent cell, the secondary adjacent cells of the traffic cell k are searched according to the cell adjacency relationship, and so on, until an adjacent cell containing a hub node is found;

[0032] If a hub node is found in a certain n-level adjacent cell, the hub nodes in all n-level adjacent cells of the current traffic cell are counted to obtain the hub node set of the traffic cell k.

[0033] Beneficial effects: Compared with the prior art, the present invention has the following significant advantages:

[0034] 1. The present invention is based on the idea of ​​multimodal transport under the background of comprehensive transportation, and connects the traffic areas without special transportation modes through roads and special networks, which effectively solves the problem that the special transportation demand analysis under the background of comprehensive transportation is only oriented to a single mode road network and cannot cover all traffic areas, resulting in low analysis accuracy;

[0035] 2. The present invention ensures that the different special networks constructed cover the same traffic area, laying a foundation for the subsequent comparative analysis of the requirements of various special networks;

[0036] 3. The construction method proposed in the present invention is highly advanced and can improve the constructed special network by changing the impedance of the road section, introducing the node transfer impedance, adding multiple connecting paths, etc., so as to effectively improve the accuracy of the comprehensive transportation special demand analysis. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] Figure 1 is a flow chart of the method of the present invention;

[0038] Figure 2 This is a schematic diagram of the step-by-step search mechanism for hub nodes;

[0039] Figure 3 is the original road network diagram in the embodiment;

[0040] Figure 4 is a schematic diagram of the traffic cell range corresponding to the original road network in the embodiment;

[0041] Figure 5 is a highway network diagram in the embodiment;

[0042] Figure 6 It is the railway special road network diagram in the embodiment;

[0043] Figure 7 It is a schematic diagram of the scope of the traffic community corresponding to the railway special road network in the embodiment. DETAILED DESCRIPTION

[0044] In order to make the objectives, technical solutions and advantages of the present application more clearly understood, the present application is further described in detail below in conjunction with the accompanying drawings and embodiments.

[0045] The present embodiment describes a method for constructing a special network for an integrated transportation network, the flow chart of which is as follows: Figure 1 As shown, the method comprises the following steps:

[0046] (1) Read the basic information of the integrated transportation network, including node information, road section information, topological relationship information between nodes, and transportation community information;

[0047] The node information includes the total number of nodes n and the number and coordinates of each node. The coordinates include the horizontal coordinate and the vertical coordinate, which are expressed as:

[0048] v i =(node i , x i ,y i )

[0049] where v iRepresents the i-th node, i≤n, i is a positive integer, node i Indicates the node number, x i and i Represents the horizontal and vertical coordinates of the node respectively. All node information is stored as a set V, and the set size is equal to n.

[0050] The road section information includes the total number of road sections m, the start and end point numbers of each road section, and basic attributes. The basic attributes include the road section type and road section impedance. The road section information is expressed as:

[0051] e j =(f j , t j , mode j , r j ,)

[0052] Among them, e j represents the jth road section, j≤m, j is a positive integer, f j and t j They represent the node number of the starting point of the road section and the node number of the end point of the road section respectively, j is the section impedance; mode j Indicates the type of road segment, including five comprehensive transportation modes: highway, railway, water transport, aviation, and pipeline. When the road segment type is highway, mode j =1; when the section type is railway, mode j =2; when the section type is waterway, mode j =3; when the road segment type is aviation, mode j =4; when the section type is pipeline, mode j =5. All road section information is stored as a set E, e j ∈E, the set size is equal to m.

[0053] The topological relationship information between nodes includes the node number of the current node, the number of nodes connected to the current node, and the numbers of each node connected to the current node. For the i-th node, the topological relationship is expressed as:

[0054] toponode i =(node i ,tpn i ,tpV i )

[0055] Among them, node i is the node number, tpn i is the number of nodes connected to the current node, tpV i It is the set of node numbers connected to the current node, and the set size is equal to tpn iAll node topology information is stored as a set topoV, and the set size is equal to n.

[0056] Traffic cell information includes the total number of traffic cells tzn, traffic cell number, node number corresponding to the centroid of the traffic cell, traffic cell adjacency relationship, and nodes contained in each traffic cell. Traffic cell adjacency relationship includes the number of the current cell, the number of cells connected to the current cell, and the number of cells connected to the current cell. Traffic cell information is expressed as:

[0057] t k =(tz k ,tzc k , adjtzn k , adjTz k ,tzV k )

[0058] Where t k represents the kth traffic zone, k≤tz, k is a positive integer, tz k is the traffic zone number, tzc k is the node number of the current cell centroid, adjtzn k is the number of traffic cells adjacent to the current cell, adjTz k It is the set of traffic cell numbers adjacent to the current cell, and the set size is equal to adjtzn k ,tzV k is the set of node numbers in the current cell. All traffic cell information is stored as a set T, and the set size is equal to tzn.

[0059] (2) Based on the basic information, extract the highway network in the comprehensive transportation network and filter the road segment type mode j =1;

[0060] (21) Filter each road section according to the road section type. If the road section type is highway, extract the corresponding road section information and assign the corresponding road section starting point number f j , end point number t j Record the endpoint number set V of the highway network segment ft , the extracted road section information is stored as a set E1, and the set size is equal to the total number of highway sections m1; if the road section type is not a highway, the next road section is read for judgment until all road sections are traversed;

[0061] (22) Filter each node v from the recorded start and end numbers of the road section i , v i ∈V, if the node number is node i The endpoint number set V that belongs to the highway network segment ft, extract the corresponding node information, and store the extracted node information as a set V1, the size of which is equal to the total number of road nodes n1; if the condition is not met, read the next node for judgment until all nodes are traversed;

[0062] (23) Based on the extracted road section information and node information, regenerate the topological relationship between nodes toponode i The extracted topological relationship information between nodes is stored as a set topoV1, and the size of the set is equal to the total number of highway nodes n1.

[0063] (24) Check whether the centroid points of each traffic zone in the comprehensive transportation network are connected to the highway. If not, modify the centroid point of the corresponding traffic zone to a node connected to the highway. After modifying all the centroid points of the traffic zones, extract the traffic zone information;

[0064] Modify the traffic cell information of the basic network. For each traffic cell t k , t k ∈T, if the centroid is not connected to the road, modify tzc k Number the nodes of other connected roads. After checking and modifying all the traffic zone centroids, extract the traffic zone information. For each traffic zone t k , if tzV k The nodes contained in tzV are not extracted. k Delete the corresponding node number. The extracted traffic cell information is stored as a set T1, and the size of the set is equal to the total number of cells tzn.

[0065] (25) According to the type of special network net_type to be constructed, determine whether the special network construction is completed. If only the highway network needs to be extracted, the construction is completed and the extracted highway special network information, including E1, V1, topoV1, and T1, is output; if a non-highway network needs to be constructed, continue with step (3). Among them, net_type = 1 means that a comprehensive transportation highway network needs to be extracted, net_type = 2 means that a comprehensive transportation railway network needs to be extracted, net_type = 3 means that a comprehensive transportation water transport network needs to be extracted, net_type = 4 means that a comprehensive transportation aviation network needs to be extracted, and net_type = 5 means that a comprehensive transportation pipeline network needs to be extracted.

[0066] (3) Select the hub nodes in each traffic zone and construct a comparison table between traffic zone numbers and hub node numbers.

[0067] For each traffic zone t k The node set tzV contained k, filter the roads and hub nodes that are connected at the same time, generate the comparison table of the zone number and the hub node number HubInZone, the kth row of HubInZone can be expressed as (tz k , hubV k ). Among them, tz k is the cell number, hubV k It is a set of hub node numbers in the community. The hub node is the node that connects the special road section and the highway to be extracted.

[0068] (4) Select the highway connecting sections in the comprehensive transportation network according to the comparison table of transportation community numbers and hub node numbers;

[0069] (41) According to the comparison table of traffic zone numbers and hub node numbers, determine whether the traffic zone contains a hub node, and select the hub node set corresponding to the zone. If it contains a hub node, count all the hub nodes in the traffic zone to obtain the hub node set of the traffic zone, which is represented by tzhub k =hubV k ; If there is no hub node, read dajTz level by level according to the adjacency relationship of the traffic area k The hub nodes hubV contained in all adjacent cells in the node are taken as the hub node set of the current cell, namely tzhub k =∑hubV;

[0070] For a traffic cell k without a hub node, search for all adjacent cells of the traffic cell k. If no hub node exists in any adjacent cell, search for the secondary adjacent cells of the traffic cell k according to the cell adjacency relationship, and so on, until an adjacent cell containing a hub node is found;

[0071] If a hub node is found in a certain n-level adjacent cell, the hub nodes in all n-level adjacent cells of the current traffic cell are counted to obtain the hub node set of the traffic cell k.

[0072] by Figure 2 As an example, the step-by-step search mechanism for hub nodes is further explained: for traffic cells without hub nodes, they are marked as 0, and all adjacent cells of the current cell are searched and marked as 1. If there are no hub nodes in all adjacent cells, the second-level adjacent cells of the cell are searched according to the cell adjacency relationship, that is, one cell apart, marked as 2; and so on, until an adjacent cell containing a hub node is found. Assuming that a hub node is found in a third-level adjacent cell, all third-level adjacent cells, that is, hub nodes with an interval of two cells and marked as 3, are counted and recorded in the hub node number set of the current cell.

[0073] (42) Find the shortest path between the centroid of each traffic zone and each hub node in the hub node number of the traffic zone on the special highway network, count the starting point number and the end point number of each section included in the path, and record them in the form of an unordered array to the starting and ending point number set of the highway connection network section.

[0074] For each traffic zone t k (t k ∈T1), with the centroid point tzc k The hub node set tzhub that is connected to the starting point and the current cell k To reach the node set, find the shortest path on the highway special network and count the starting point numbers of each section included in the path. j , end point number t j , recorded in the highway connection network start and end number set EV. Each element of EV is an unordered array (f, t).

[0075] (5) Output the extracted road section information, extracted node information, extracted topological relationship information between nodes, and extracted traffic community information to build a special network:

[0076] (51) Filter each road section in the comprehensive transportation network according to the road section type. If the road section type is the special road section type to be extracted, or the unordered array consisting of the road section start point number and the end point number belongs to the road connection network section start point and end point number set, extract the corresponding road section information, and record the corresponding road section start point and end point numbers into the special network segment endpoint number set; otherwise, read the next road section for judgment until all road sections are traversed;

[0077] For each road segment e j (e j ∈E), screening mode j =net_type or unordered array (f j , t j )∈EV, extract the corresponding road section information, and record the corresponding starting point number f j , end point number t j To the dedicated network segment endpoint number set V ft ′. The extracted road section information is stored as a set E net_type , the set size is equal to the total number of special network segments m net_type .

[0078] (52) Filter each node according to the recorded start and end point numbers of the road segment. If the node number belongs to the special network segment endpoint number set, extract the corresponding node information; if the condition is not met, read the next node for judgment until all nodes are traversed;

[0079] For each node vi , if the node number is node i Belongs to the special network segment endpoint number set V ft ', extract the corresponding node information. The extracted node information is stored as a set V net_type , the set size is equal to the total number of nodes in the special network n net_type .

[0080] (53) Regenerate the topological relationship information between nodes based on the extracted node information and road section information;

[0081] According to the extracted e j and v i , regenerate the topological relationship between nodes toponode i The topological relationship information between the extracted nodes is stored as a set topoV net_type , the set size is equal to the total number of nodes in the special network n net_type .

[0082] (54) Extract traffic community information and complete the special network construction of the comprehensive transportation network.

[0083] For each traffic zone t k , if tzV k The nodes contained in tzV are not extracted. k Delete the corresponding node number. The extracted traffic zone information is stored as a set T net_type , the set size is equal to the total number of cells tzn. Finally, output E net_type 、V net_type 、topoV net_type 、T net_type , complete the construction of the special network.

[0084] In order to verify the effectiveness of the method of the present invention, a method for constructing a railway-specific network for a comprehensive transportation network is taken as an example for further explanation.

[0085] In this embodiment, the railway special network is extracted as an example. First, the basic network information is determined through step 1, with 448 nodes, 1228 sections, and 12 traffic communities; the three modes of transportation are highway, railway, and waterway.

[0086] The basic network geometry is as follows Figure 3 As shown in the figure, the solid black line represents the highway, the thick black and white lines represent the railway, and the dotted black line represents the waterway; the scope of the traffic zone is as follows Figure 4 As shown, the numbers in the black box represent the node numbers of the cell centroid points.

[0087] The road network is extracted through step 2. The road network geometry is as follows Figure 5 As shown, there are 437 nodes, 1060 road sections and 12 traffic zones.

[0088] Through step 3, the railway hub nodes are screened, and the intersection of highway and railway is taken as the hub node, and the comparison table of traffic community and hub node number is obtained, as shown in Table 1. Among them, the traffic communities with community numbers 2 and 5 do not contain hub nodes.

[0089] Table 1 Comparison table of traffic zones and hub node numbers

[0090] Cell number The number of hub nodes included in the cell 1 297 415 2 3 111 153 154 4 60 64 79 262 270 276 5 6 92 96 281 348 369 374 376 378 417 7 54 69 70 72 282 283 284 290 291 343 346 8 321 322 324 325 9 32 34 232 234 237 239 313 320 10 11 12 15 193 11 14 16 204 205 206 212 429 12 109 181 183 192 196 427 431

[0091] The highway connecting sections are selected through step 4. First, according to Table 1, it is determined whether the community contains a hub node: if there is a hub node in the community, all hub nodes in the community are counted as the hub node set of the current community; if there is no hub node in the community, the hub nodes in all adjacent communities of the current community are counted as the hub node set of the current community. The traffic community and the corresponding hub node set are shown in Table 2.

[0092] Table 2 Traffic zones and corresponding hub node sets

[0093] Cell number Cell centroid The hub node set corresponding to the community 1 800 [297,415] 2 504 [297,415,111,153,154] 3 335 [111,153,154] 4 281 [60,64,79,262,270,276] 5 506 [111,153,154,14,16,204,205,206,212,429] 6 730 [92,96,281,348,369,374,376,378,417] 7 293 [54,69,70,72,282,283,284,290,291,343,346] 8 241 [321,322,324,325] 9 677 [32,34,232,234,237,239,313,320] 10 599 [11,12,15,193] 11 200 [14,16,204,205,206,212,429] 12 559 [109,181,183,192,196,427,431]

[0094] For each traffic community, the shortest path from the centroid to each node in the hub node set of the current community is found on the highway special network according to Table 2. The road segments included in each path are the highway connecting sections.

[0095] The railway network is extracted through step 5. The final extracted comprehensive transportation railway network is as follows: Figure 6 As shown in Figure 2, the number of nodes is 255 and the number of road sections is 614. The scope of the traffic zone is as follows: Figure 7 As shown, it can be seen that the comprehensive transportation railway network can cover all 12 transportation communities.

Claims

1. A special network construction method for a comprehensive transportation network, characterized in that: The method comprises the following steps: (1) Read the basic information of the integrated transportation network, including node information, road section information, topological relationship information between nodes, and transportation community information; (2) Extract the highway network in the comprehensive transportation network based on the basic information; (3) Select the hub nodes in each traffic zone and construct a comparison table between traffic zone numbers and hub node numbers; (4) Select the highway connecting sections in the comprehensive transportation network according to the comparison table of transportation community numbers and hub node numbers; (5) Output the extracted road section information, extracted node information, extracted topological relationship information between nodes, and extracted traffic community information to build a special network: (51) Filter each road section in the comprehensive transportation network according to the road section type. If the road section type is the special road section type to be extracted, or the unordered array consisting of the road section start point number and the end point number belongs to the road connection network section start point and end point number set, extract the corresponding road section information, and record the corresponding road section start point and end point numbers into the special network segment endpoint number set; otherwise, read the next road section for judgment until all road sections are traversed; (52) Filter each node according to the recorded start and end point numbers of the road segment. If the node number belongs to the special network segment endpoint number set, extract the corresponding node information; if the condition is not met, read the next node for judgment until all nodes are traversed; (53) Regenerate the topological relationship information between nodes based on the extracted node information and road section information; (54) Extract traffic community information and complete the special network construction of the comprehensive transportation network.

2. The method for constructing a dedicated network according to claim 1, characterized in that: The node information includes the total number of nodes and the number and coordinates of each node; The road section information includes the total number of road sections, the starting and ending point numbers of each road section, and basic attributes; The topological relationship information between the nodes includes the node number of the current node, the number of nodes connected to the current node, and the numbers of each node connected to the current node; The traffic cell information includes the total number of traffic cells, traffic cell numbers, node numbers corresponding to the centroids of the traffic cells, traffic cell adjacency relationships, and nodes included in each traffic cell.

3. The dedicated network construction method according to claim 1, characterized in that: The basic attributes in the road section information include road section type and road section impedance, wherein the road section type includes highway, railway, waterway, air route, and pipeline; The traffic cell adjacency relationship includes the number of the current cell, the number of cells connected to the current cell, and the numbers of cells connected to the current cell.

4. The dedicated network construction method according to claim 1, characterized in that: The highway network extracted from the comprehensive transportation network in step (2) includes: (21) Filter each road section according to the road section type. If the road section type is a highway, extract the corresponding road section information and record the corresponding road section start and end point numbers into the highway network segment endpoint number set; if the road section type is not a highway, read the next road section for judgment until all road sections are traversed; (22) Filter each node from the recorded start and end point numbers of the road segment, and if the node number belongs to the set of endpoint numbers of the highway network segment, extract the corresponding node information; If the condition is not met, read the next node for judgment until all nodes are traversed; (23) Regenerate the topological relationship information between nodes based on the extracted road section information and node information; (24) Check whether the centroid points of each traffic zone in the comprehensive transportation network are connected to the highway. If not, modify the centroid point of the corresponding traffic zone to a node connected to the highway. After modifying all the centroid points of the traffic zones, extract the traffic zone information; (25) According to the type of special network to be constructed, determine whether the construction of the special network is completed. If only the highway network needs to be extracted, the construction is completed and the extracted highway special network information is output; if a non-highway network needs to be constructed, continue to execute downward.

5. The dedicated network construction method according to claim 1, characterized in that: The hub node is a node that connects both the special road section and the highway that need to be extracted.

6. The method for constructing a dedicated network according to claim 1, characterized in that: Step (4) screening the highway connecting sections in the comprehensive transportation network includes: (41) judging whether the traffic zone contains a hub node according to the comparison table of traffic zone numbers and hub node numbers: if a hub node is contained, counting all hub nodes in the traffic zone to obtain a hub node set of the traffic zone; if there is no hub node, counting the hub nodes in all adjacent zones of the current traffic zone according to the adjacent relationship of the traffic zones to obtain a hub node set of the traffic zone; (42) Find the shortest path between the centroid of each traffic zone and each hub node in the hub node number of the traffic zone on the special highway network, count the starting point number and the end point number of each section included in the path, and record them in the form of an unordered array to the starting and ending point number set of the highway connection network section.

7. The method for constructing a dedicated network according to claim 1, characterized in that: In step (41), for a traffic cell k without a hub node, all adjacent cells of the traffic cell k are searched. If no hub node exists in any adjacent cell, the secondary adjacent cells of the traffic cell k are searched according to the cell adjacency relationship, and so on, until an adjacent cell containing a hub node is found. If a hub node is found in a certain n-level adjacent cell, the hub nodes in all n-level adjacent cells of the current traffic cell are counted to obtain the hub node set of the traffic cell k.

Images