A traffic engineering route segmentation method and system based on double linked list

Abstract

The present invention belongs to the field of digital application of traffic engineering, and specifically relates to a method and system for dividing traffic engineering routes into sections based on a double linked list. The method for dividing traffic engineering routes into sections based on a double linked list is characterized in that it includes the following steps: Step 1, structurally processing the traffic engineering line data to obtain constraint parameters; Step 2, segmenting the constraint parameters based on the linked list nodes to obtain segmented sections; establishing associations between the sections through the endpoint pointers in the linked list nodes; and the sections are used for structural decomposition of traffic engineering design information. After the route of the strip traffic engineering is obtained, the method of the present invention can automatically divide the sections without manual division, thereby improving efficiency and providing accurate batch data for subsequent engineering structure decomposition.

Description

Technical Field

[0001] The invention relates to the field of digital application of traffic engineering, and in particular to a method and system for dividing a traffic engineering route into sections based on a double linked list. Background Art

[0002] In traffic engineering, especially in the field of digital application of strip traffic engineering, the position is generally expressed by pile number, and the route setting also supports the expression of pile number. The description of the location of the structure is generally done by specifying the starting pile number and the ending pile number of the route. Due to the above expression method, the route is often divided into multiple sections, and the application of the route also needs to be specific to the section. For example, in the process of EBS or WBS roadbed division, it should first be divided according to the construction contract section, and then according to the interchange, bridges, tunnels and other structures, the divided sections should be refined. At this time, the divided sections are called natural sections. If the natural section is too large, it needs to be divided according to the specified length according to the standard.

[0003] In the current EBS or WBS division process, the division of paragraphs is mainly done manually. The patent publication number CN112685804A, "A WBS automatic construction method and system based on highway engineering design information", mentions the idea of ​​automatic division, but does not specifically mention the paragraph division method.

[0004] Patent publication number CN118036126A, "A method for segmenting roads for reconstruction and expansion based on binary division", uses binary division to segment routes. The route is segmented according to the distance relationship between the two routes, which solves the problem of line segmentation to a certain extent. However, there is no specific introduction to the segmentation of complex structures within the route.

[0005] The traditional manual route segmentation method is inefficient and has poor maintainability. Although automatic segmentation has been mentioned, there is no public systematic introduction. Summary of the invention

[0006] By rationally organizing multiple routes of belt-shaped traffic engineering, the route segmentation is automatically realized based on line division, section interval, structure interval, fixed length segmentation, etc. A method and system for segmentation of traffic engineering route based on double linked list is proposed.

[0007] In order to achieve the above objectives, the following technical solutions are proposed:

[0008] A method for dividing a traffic engineering route into sections based on a double linked list comprises the following steps:

[0009] Step 1: Structural processing of traffic engineering line data to obtain constraint parameters;

[0010] Step 2: segment the constraint parameters based on the linked list nodes to obtain segmented sections; the sections are used for structural decomposition of traffic engineering design information.

[0011] As a preferred solution, the types of constraint parameters include routes, branch lines and sections, and the sections include contract work sections, interchanges, service areas, parking areas, and structures;

[0012] The constraint parameters of the route include route ID, route name, route type, starting stake number, end stake number, broken link management, driving direction, horizontal and vertical information;

[0013] The constraint parameters of the branch line include the branch line ID, branch line name, route ID, separated route ID, branch line starting point stake number, and branch line end point stake number;

[0014] The constraint parameters of the section include interval ID, interval name, interval type, route ID, starting pile number, and end pile number.

[0015] As a preferred solution, the parameters in the linked list node include a preceding linked list node, a following linked list node, a route ID, a starting point stake number, an end point stake number, an interval type, and a partition object ID.

[0016] As a preferred solution, step 2 specifically includes the following steps: constructing a linked list node; using the linked list node to divide the constraint parameter, and the division interval is the distance between the starting pile number and the end pile number in the current linked list node, wherein,

[0017] If the end stake number of the interval corresponding to the current constraint parameter is smaller than the start stake number of the current linked list node, the interval is divided backwards in the direction of increasing stake numbers;

[0018] If the starting stake number of the interval corresponding to the current constraint parameter is greater than the ending stake number of the current linked list node, the interval is divided forward in the direction of decreasing stake numbers;

[0019] As a preferred solution, the node of the pre-order linked list is a pre-order pointer, and the node of the post-order linked list is a post-order pointer. The pre-order pointer and the post-order pointer are used to mark the endpoint pile numbers of the paragraphs for paragraph division.

[0020] As a preferred solution, it also includes: if the interval corresponding to the current constraint parameter is between the starting point number and the ending point number of the current linked list node, dividing the current node interval into three intervals to form a new linked list;

[0021] If the interval corresponding to the current constraint parameter intersects with the interval corresponding to the starting pile number and the ending pile number of the current linked list node, and the interval corresponding to the current constraint parameter is not between the starting pile number and the ending pile number of the current linked list node, the interval corresponding to the current constraint parameter will not be divided into paragraphs.

[0022] As a preferred solution, it also includes storing multiple routes in the form of an array and dividing the multiple routes into sections.

[0023] As a preferred solution, the types of structural decomposition of the traffic engineering design information include EBS and WBS.

[0024] As a preferred solution, multiple storage formats are also used for the segmented paragraphs, including Excel, JSON, XML, and RestFullApi.

[0025] Based on the same concept, a traffic engineering route segmentation system based on a double linked list is also proposed, including at least one processor and a memory communicatively connected to the at least one processor; the memory stores instructions executable by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute any of the above-mentioned methods for dividing a traffic engineering route segment based on a double linked list.

[0026] Compared with the prior art, the present invention has the following beneficial effects: after obtaining the route of the belt transportation project, the method of the present invention can automatically divide the sections according to the preset intervals, and no manual division is needed, which improves the efficiency and provides accurate batch data for the subsequent engineering structure decomposition. BRIEF DESCRIPTION OF THE DRAWINGS

[0027] Figure 1 It is a flow chart of a method for dividing a traffic engineering route into sections based on a double linked list in Example 1;

[0028] Figure 2 is a flow chart of the paragraph segmentation algorithm in Example 1;

[0029] Figure 3 It is a schematic diagram of the storage structure of the linked list data stored after the segmentation in Example 2;

[0030] Figure 4 It is a schematic diagram of expressing paragraph data through the user linked list access device in Example 2. DETAILED DESCRIPTION

[0031] The present invention is further described in detail below in conjunction with test examples and specific implementation methods. However, this should not be understood as the scope of the above subject matter of the present invention being limited to the following embodiments, and all technologies realized based on the content of the present invention belong to the scope of the present invention.

[0032] Example 1

[0033] In the field of traffic engineering, especially in the field of digital application of strip traffic engineering, the definition and application of routes are generally of great significance. The general location description is expressed by route + stake number (route [starting stake number, ending stake number]). For example, the definition of the bridge location is generally expressed in the following way: {left span: main line [1000, 1100], right span: main line [1010, 1110]}. The information contained in this expression mainly includes: ① The bridge is the left span of the main line; ② The starting and ending stake numbers of the left span are 1000 and 1100 respectively, with a length of 100 meters; ③ The starting and ending stake numbers of the right span are 1010 and 1110 respectively, with a length of 100 meters.

[0034] At present, in the process of construction of strip transportation projects, all projects are generally divided into EBS or WBS according to the division specifications. At this time, it is required to divide the route into reasonable sections that can be used for project management according to different rules. There are many rules for constraining division, mainly including: line division section, contract section section, interchange section, service area section, parking area section, structure section, etc. During the construction process, in order to limit the construction length of the unit project, the maximum length limit is generally also set for longer roadbed projects. Based on the above needs, it is very necessary to develop an automatic route section division device based on different agreed conditions.

[0035] By clarifying the relationship between route divisions, defining the data structure of the separation interval, and using the segmentation algorithm based on a linked list, a traffic engineering route segmentation method based on a double linked list is implemented. The flow chart is as follows: Figure 1 As shown, it mainly includes the following steps:

[0036] Step 1: Structural processing of traffic engineering line data to obtain constraint parameters;

[0037] Step 2: segment the constraint parameters based on the linked list nodes to obtain segmented sections; the sections are used for structural decomposition of traffic engineering design information.

[0038] Step one is mainly to initialize parameters, which is closely related to route relationships (dividing line sections), contract work section sections, interchange sections, service area sections, parking area sections, structure areas, and the maximum section division information.

[0039] In order to realize the automatic division of route sections, the route needs to be structured before starting, which requires the ability to clearly express key information such as ① route division relationship; ② route starting and ending pile numbers; ③ contract section interval; ④ interchange interval; ⑤ service area interval; ⑥ parking area interval; ⑦ structure interval. The present invention defines a clear storage structure for constraint parameters, which are specifically defined as follows:

[0040] route:[{

[0041] Id: route ID,

[0042] Name: route name,

[0043] LineType: route type, / / mainly includes: main line, left line, ramp, diversion

[0044] StartStation: starting station number,

[0045] EndStation: the end station number,

[0046] AlignStationManager: Broken link management,

[0047] XingCheType: driving direction,

[0048] Geo: horizontal and vertical information,

[0049] }]

[0050] Line: [{

[0051] Id: branch line ID,

[0052] Name: branch line name,

[0053] AlignId: alignment ID,

[0054] SplitAlignId: ID of the split alignment.

[0055] SplitStartStation: the starting station number of the split line.

[0056] SplitEndStation: the end station number of the split line.

[0057] }]

[0058] Contract sections, interchanges, service areas, parking areas, structures: [{

[0059] Id: interval ID,

[0060] Name: interval name,

[0061] Type: interval type,

[0062] AlignId: alignment ID,

[0063] StartStation: starting station number,

[0064] EndStation: the end station number,

[0065] }]

[0066] In the above definition, the route part is stored in the form of an array, which supports the simultaneous storage of multiple routes. Each route includes route ID, route name, route type, starting pile number, ending pile number, broken chain management, driving direction, horizontal and vertical information, etc. These contents not only store the basic information such as ID and name of route identification, but also store the geometric line element information and broken chain information expressed by the route. The line division setting also stores multiple line division relationships in the form of an array. Each relationship clearly identifies the starting and ending pile number information of the divided route. Based on this information, it is relatively easy to count the line division intervals of a single route. The contract section, interchange, service area, parking area, structure and other intervals are defined in a unified structure, and the results are uniformly stored in the array. The specific type of the interval is distinguished by the interval type field. Based on the above information, it is also relatively convenient to count the interval division of a single route.

[0067] The main idea of ​​step 2 is to use linked list segmentation to realize the division of route intervals. The main idea is to use the starting and ending pile numbers of the route to initialize a node A in the linked list before starting, use node A to traverse the separation interval B (which may be a dividing line interval, interchange, service area, parking area or structure), and use B to divide A into sections, which mainly includes the definition of linked list nodes and the linked list segmentation algorithm.

[0068] In this algorithm, in order to better serve route segmentation, a double linked list method is adopted, and the data part is defined as follows:

[0069] Link list node: {

[0070] Head: pre-order linked list node,

[0071] Rear: post-order linked list node,

[0072] AlignId: alignment ID,

[0073] StartStation: starting station number,

[0074] EndStation: end station number,

[0075] Type: interval type,

[0076] RefId: partition object ID

[0077] }

[0078] In this definition, Head and Rear are the pre-order pointer and post-order pointer of the linked list, so that the linked list can be called recursively; the three parameters AlignId, StartStation, and EndStation express the size of the interval, which can accurately describe the size of the paragraph, and when a new segmented interval is inserted, it is convenient to calculate the relationship between the segmented interval and the existing interval; AlignId is the unique identifier of the current route, which is used to identify whether the current route and the segmented interval belong to the same route. If they belong to the same route, they have a separation relationship. If they are not the same route, they do not have a separation relationship. Type and RefId express the detailed information of the reference object of the interval division. Through RefId, detailed information such as contract sections, interchanges, service areas, parking areas, structures, etc. can also be obtained. Type is used to characterize the current segmentation type: roadbed, bridge or tunnel, etc. AlignId, Type, and RefId are designed using foreign key references in the database. Through foreign keys, detailed information of the corresponding objects can be obtained in their corresponding tables.

[0079] The flow chart of interval segmentation algorithm is as follows Figure 2 is shown and described as:

[0080] ① Initialize the linked list nodes using the starting and ending pile numbers of the route;

[0081] ② Obtain segmentation intervals from line divisions, interchanges, parking areas, service areas, structures, and user-defined minimum segmentation intervals;

[0082] ③ Recursively link the list and use the current node to compare with the partition interval. Since the intervals in the linked list are linked from small to large, if the end number of the current partition interval is smaller than the starting number of the current linked list node interval, the linked list will look for a node backward until the end of the linked list is found;

[0083] ④ Recursively link the list and use the current node to compare with the partition interval. If the starting point of the partition interval is greater than the ending point of the current linked list node interval, the linked list will look for a node forward until the head of the linked list is found.

[0084] ⑤ Recursively link the list and compare the current node with the partition interval. If the partition interval is a subset of the current linked list node, divide the current node interval into 3 intervals to form a new linked list.

[0085] ⑥ Recursively link the list and compare the current node with the partition. If the partition interval intersects with the current linked list node and does not meet ⑤, this special case will be recorded and the current linked list will not be modified.

[0086] ⑦ Repeat step ② to find the next segmentation interval until the end.

[0087] By rationally organizing multiple routes of belt-shaped traffic engineering, the route sections are automatically divided based on the principles of line division, section interval, structure interval, fixed length segmentation, etc. Divide natural sections, give priority to natural sections, and some places are divided according to roadbed, bridge, and tunnel. Originally, they were divided manually according to the terrain conditions. WBS requires continuous division without omission. There are only isolated data and no association between the parts. Therefore, it is necessary to manually input the data in advance, establish the association, and then divide it manually. This embodiment provides a traffic engineering route section division method based on a double linked list, which is conducive to the batch import of data into WBS and improves the efficiency of later processing.

[0088] Example 2

[0089] Compared with Example 1, Example 2 further adds a linked list access method and device.

[0090] The main function of the linked list access device is to provide different access functions for the interval division results, so that users can use the data. The main access methods include: Excel result export, JSON result export, XML result export and RestFullApi interface call.

[0091] The divided interval data is stored in a database table. The interval storage table uses Head and Rear to record the pointers of the preceding and succeeding nodes of the linked list, and uses AlignId, StartStation, and EndStation to record the starting and ending station number intervals of the interval. Type and RefId point to the detailed data source information of the divided interval. The storage structure is defined as follows: Figure 3 shown.

[0092] The storage of the division results is realized by using the database storage method. Based on the data, the user linked list access device is used to realize different expressions of the data. The schematic diagram is shown in FIG. Figure 4 The linked list access device mainly includes: Excel generation device, JSON generation device, XML generation device and RestFullApi generation device.

[0093] By entering the basic information of multiple routes, as well as the basic information of branch lines, interchanges, structures, and minimum interval division units in the project, the automatic interval division is realized by using the linked list method. The linked list access device is developed to realize the use of different expressions of the divided intervals.

[0094] Finally, it should be noted that the embodiments described in detail above are only the best practices of the invention and cannot be used to limit the scope of rights of the invention. Equivalent replacement of the technical solutions recorded in the aforementioned embodiments does not make the essence of the corresponding technical solutions deviate from the scope of the technical solutions of the embodiments of the invention, and they should all be included in the scope of the claims and description of the invention.

Claims

1. A method for dividing traffic engineering route sections based on a double linked list, characterized in that: The following steps are involved: Step 1: Structural processing of traffic engineering line data to obtain constraint parameters; Step 2: segment the constraint parameters based on the linked list nodes to obtain segmented paragraphs; The association between each paragraph is established through the endpoint pointer in the linked list node; the paragraph is used for the structural decomposition of the traffic engineering design information; The types of constraint parameters include routes, line divisions and sections, and the sections include contract work sections, interchanges, service areas, parking areas and structures; The constraint parameters of the route include route ID, route name, route type, starting stake number, end stake number, broken link management, driving direction and horizontal and vertical information; The constraint parameters of the branch line include the branch line ID, branch line name, route ID, separated route ID, branch line starting point stake number and branch line end point stake number; The constraint parameters of the section include interval ID, interval name, interval type, route ID, starting pile number and end pile number; The parameters in the chain list node include a pre-order chain list node, a post-order chain list node, a route ID, a starting point stake number, an end point stake number, an interval type, and a partition object ID; Step 2 specifically includes the following steps: ① Initialize the linked list nodes using the starting and ending stake numbers of the route; ② Obtain segmentation intervals from line divisions, interchanges, parking areas, service areas, structures, and custom minimum segmentation intervals; ③ Recursively link the list and use the current node to compare with the partition interval. Since the intervals in the linked list are linked from small to large, if the end number of the current partition interval is smaller than the starting number of the current linked list node interval, the linked list will look for a node backward until the end of the linked list is found; ④ Recursively link the list and use the current node to compare with the partition interval. If the starting point of the partition interval is greater than the ending point of the current linked list node interval, the linked list will look for a node forward until the head of the linked list is found. ⑤ Recursively link the list and compare the current node with the partition interval. If the partition interval is a subset of the current linked list node, divide the current node interval into 3 intervals to form a new linked list. ⑥ Recursively link the list and compare the current node with the partition interval. If the partition interval intersects with the current linked list node and does not meet ⑤, this special case will be recorded and the current linked list will not be modified.

2. A method for dividing a traffic engineering route into sections based on a double linked list as claimed in claim 1, characterized in that: The node of the pre-order linked list is a pre-order pointer, and the node of the post-order linked list is a post-order pointer. The pre-order pointer and the post-order pointer are used to mark the endpoint pile numbers of the paragraphs for paragraph division.

3. A method for dividing a traffic engineering route into sections based on a double linked list as claimed in claim 1, characterized in that: Also includes: If the interval corresponding to the current constraint parameter is between the starting point and the ending point of the current linked list node, the current node interval is divided into three intervals to form a new linked list; If the interval corresponding to the current constraint parameter intersects with the interval corresponding to the starting pile number and the ending pile number of the current linked list node, and the interval corresponding to the current constraint parameter is not between the starting pile number and the ending pile number of the current linked list node, the interval corresponding to the current constraint parameter will not be divided into paragraphs.

4. A method for dividing a traffic engineering route into sections based on a double linked list as claimed in claim 1, characterized in that: It also includes storing multiple routes in the form of an array and dividing the multiple routes into sections.

5. A method for dividing a traffic engineering route into sections based on a double linked list as claimed in claim 1, characterized in that: The types of structural decomposition of the traffic engineering design information include EBS or WBS.

6. A method for dividing a traffic engineering route into sections based on a double linked list as described in any one of claims 1 to 4, characterized in that: It also includes multiple storage formats for the segmented paragraphs, including Excel, JSON, XML and RestFullApi.

7. A traffic engineering route segmentation system based on a double linked list, characterized in that: It includes at least one processor and a memory that is communicatively connected to the at least one processor; the memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute a traffic engineering route segment division method based on a double linked list as described in any one of claims 1 to 5.

Images