Wind power plant road line selection method, system, medium, program product and equipment

Abstract

The invention belongs to the technical field of wind power generation. The invention provides a wind power plant road line selection method and system, a medium, a program product and equipment, and the method comprises the steps: inserting a plurality of vertexes between a starting point and a target point according to the map data of a target wind power plant to obtain a plurality of road sections; according to the road construction cost, the road longitudinal slope coefficient, the road longitudinal slope gradient, the road turning radius coefficient, the road earthwork cost coefficient, the filling amount, the excavation amount, the unit excavation cost and the unit filling cost of each road section, an objective function of the weighted road construction total cost is constructed; and performing optimization by minimizing the objective function to obtain a wind power plant road optimal line selection result. According to the method, under the constraint conditions of the maximum gradient, the minimum turning radius and the like, line selection arrangement is automatically carried out by taking the total construction cost of the wind power plant road as an optimization target, and the optimal scheme of the wind power plant road can be obtained more efficiently and more precisely.

Description

Technical Field

[0001] The present invention relates to the technical field of wind power generation, and in particular to a method for selecting a road line in a wind farm, a system for selecting a road line in a wind farm, a computer device, a computer-readable storage medium and a computer program product. Background Art

[0002] The statements in this section merely provide background art related to the present invention and do not necessarily constitute prior art.

[0003] With the vigorous development of wind power technology, the construction areas of onshore wind farms have gradually transitioned from flat areas to mountainous areas. The capacity of wind farms and the capacity of single units have increased year by year, and the difficulty of road line selection has gradually increased. For example, the mountainous terrain is undulating and full of gullies, which brings huge challenges to the road line selection of wind farms. Designers need to fully consider the terrain factors to ensure the rationality and safety of road line selection. Moreover, when building wind farms in mountainous areas, the difficulty of transportation is greatly increased due to the complex terrain, narrow roads and many bends. Blades that are nearly 100 meters long require special equipment and measures to ensure safety during transportation. In the existing wind farm road line selection technology, there is a general over-reliance on the design experience of designers. This approach has the following problems: (1) Over-reliance on designers’ experience. Over-reliance on designers’ personal experience and intuition during road line selection may lead to subjectivity and uncertainty in line selection results. Since everyone has different experience and judgment criteria, different designers may come up with different line selection plans, making it difficult to ensure the scientificity and rationality of the line selection results. (2) It is time-consuming and inefficient. The manual line selection process is cumbersome and requires manual insertion of machine locations and comparison of schemes in a table format to complete the line selection operation. This method is not only time-consuming but also inefficient. As the scale and complexity of wind farm construction expands, the difficulty and time consumption of manual line selection will further increase. (3) Insufficient data processing and analysis capabilities. Manual line selection has limitations in data processing and analysis. Faced with a large amount of topographic, geological, meteorological and other data, manual processing is not only time-consuming and labor-intensive, but also difficult to ensure the accuracy and completeness of the data. This may result in the line selection results not fully reflecting the actual situation, increasing the risks and costs of later construction. (4) Lack of scientific decision-making mechanism. The manual line selection process may lack the support of scientific decision-making mechanism. The determination of line selection schemes often relies on the personal judgment and experience of designers, but lacks scientific evaluation and verification. This may lead to the line selection results being unable to fully meet the needs and requirements of wind farm construction, increasing the risks and costs of later construction and operation. Summary of the invention

[0004] In order to address the deficiencies in the prior art, the present invention provides a method, system, medium, program product and equipment for selecting a wind farm road route. Under constraints such as the maximum slope and the minimum turning radius, the total cost of wind farm road construction is taken as the optimization target, and the route selection and layout are automatically performed, so that the optimal solution for wind farm roads can be obtained more efficiently and accurately.

[0005] In order to achieve the above object, the present invention adopts the following technical solution: In a first aspect, the present invention provides a method for selecting a road line in a wind farm.

[0006] A method for selecting a road line for a wind farm includes the following steps: According to the target wind farm map data, multiple vertices are inserted between the starting point and the target point to obtain multiple road sections; According to the road construction cost of each road section, the road longitudinal slope coefficient, the road longitudinal slope gradient, the road turning radius coefficient, the road earthwork cost coefficient, the filling volume, the excavation volume, the unit excavation cost and the unit filling cost, an objective function of the weighted total road construction cost is constructed, and the optimal route result of the wind farm road is obtained by optimizing with the minimum of the objective function.

[0007] As a further limitation of the first aspect of the present invention, the acquisition of the target wind farm map data includes: Export the target wind farm map data from the map in .kmz or .kml format according to the wind farm boundary range, prohibited construction area, determined machine site, road access point (i.e. starting point) and road exit point (i.e. target point).

[0008] As a further limitation of the first aspect of the present invention, an approximate geodesic method is used to divide the area between the starting point A and the target point E into multiple sections, the starting point A and the target point E are projected onto the horizontal ground to generate points A' and E', multiple points B', C', D'···M', N' are inserted into the line connecting the two points A'E', and then the points B, C, E···M, N projected onto the actual terrain by B', C', D'···M' are calculated, and the path length between points AE is approximately converted into the sum of the Euclidean distances between AB, BC, CD, DE···MN.

[0009] As a further limitation of the first aspect of the present invention, the objective function of the weighted total road construction cost is: ;in, ; ; ; ; ; xi, yi, zi Respectively i Points x coordinate, y Coordinates and elevation,xi+1, yi+1, zi+1 Respectively i+ The x-coordinate, y-coordinate and elevation of a point, Ct is the weighted total road construction cost; Ci is the construction cost of the i-th road section; αi For the i Longitudinal slope coefficient of section road; si For the i The longitudinal slope of the road section; βi For the i Turning radius coefficient of road section; Ei , Fi , Vi , , Respectively i The earthwork cost coefficient, filling volume, excavation volume, unit excavation cost and unit filling cost of the road section.

[0010] As a further limitation of the first aspect of the present invention, the optimization to obtain the most preferred line of the wind farm road by minimizing the objective function includes: Create a queue dis 1[] records the vertex list to be expanded, which is initially an empty set; Road access point t0 Join the queue as a starting point dis 1[ t0 ]; Create a queue dis 2[], record the minimum weighted total cost of road construction from the starting point to all points; Assigning road access points t0 The total cost of the minimum weighted road construction to itself is 0, and the total cost of the road construction to other machine locations is 0. t1 , t2 , t3 , …, tn And road delivery point tn+1 The minimum weighted total cost of road construction is positive infinity, so dis 2[0, +∞, +∞, …, +∞]; When the queue dis When 1[] is not empty, let the queue dis 1[] Squadron First Point t0 Dequeue and enumerate with t0 Perform relaxation operations on the endpoints of all edges of the starting point. t1 , t2 exist dis The corresponding minimum weighted total road construction cost in 2[] is reduced; Order the original queue dis 1[] does not have a point in the list. dis 1[ t1 ,t2 ]; Respectively dis 1[] as the first point, repeat as queue dis 1[] steps when non-empty; When the queue dis When 1[] is an empty set again, the loop stops. dis 2[] is the minimum weighted total cost of road construction from the road access point to each vertex, thereby obtaining the optimal line of the wind farm road.

[0011] In a second aspect, the present invention provides a wind farm road route selection system.

[0012] A wind farm road selection system, comprising: The road segment division unit is configured to: insert a plurality of vertices between a starting point and a target point according to the target wind farm map data to obtain a plurality of road segments; The optimal line generation unit is configured to construct an objective function of the weighted total road construction cost according to the road construction cost of each road section, the road longitudinal slope coefficient, the road longitudinal slope gradient, the road turning radius coefficient, the road earthwork cost coefficient, the filling volume, the excavation volume, the unit excavation cost and the unit filling cost, and optimize the optimal line result of the wind farm road by minimizing the objective function.

[0013] As a further limitation of the second aspect of the present invention, in the optimal line generation unit, optimizing the optimal line result of the wind farm road by minimizing the objective function includes: Create a queue dis 1[] records the vertex list to be expanded, which is initially an empty set; Road access point t0 Join the queue as a starting point dis 1[ t0 ]; Create a queue dis 2[], record the minimum weighted total cost of road construction from the starting point to all points; Assigning road access points t0 The total cost of the minimum weighted road construction to itself is 0, and the total cost of the road construction to other machine locations is 0. t1 , t2 , t3 , …, tn And road delivery point tn+1 The minimum weighted total cost of road construction is positive infinity, so dis 2[0, +∞, +∞, …, +∞]; When the queue dis When 1[] is not empty, let the queue dis 1[] Squadron First Point t0 Dequeue and enumerate witht0 Perform relaxation operations on the endpoints of all edges of the starting point. t1 , t2 exist dis The corresponding minimum weighted total road construction cost in 2[] is reduced; Order the original queue dis 1[] does not have a point in the list. dis 1[ t1 , t2 ]; Respectively dis 1[] as the first point, repeat as queue dis 1[] steps when non-empty; When the queue dis When 1[] is an empty set again, the loop stops. dis 2[] is the minimum weighted total cost of road construction from the road access point to each vertex, thereby obtaining the optimal line of the wind farm road.

[0014] In a third aspect, the present invention provides a computer device, comprising: a processor and a computer-readable storage medium; a processor adapted to execute a computer program; A computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, and when the computer program is executed by the processor, the method for selecting a road line in a wind farm as described in the first aspect of the present invention is implemented.

[0015] In a fourth aspect, the present invention provides a computer-readable storage medium storing a computer program, wherein the computer program is suitable for being loaded by a processor and executing the method for selecting a road line in a wind farm as described in the first aspect of the present invention.

[0016] In a fifth aspect, the present invention provides a computer program product, the computer program product comprising a computer program, and when the computer program is executed by a processor, the method for selecting a road line for a wind farm as described in the first aspect of the present invention is implemented.

[0017] Compared with the prior art, the present invention has the following beneficial effects: 1. The present invention takes the road turning radius, maximum longitudinal slope, prohibited construction area, existing road access point and delivery point as constraint conditions, and proposes a wind farm road line selection method with the minimum total road construction cost as the optimization goal, so as to quickly and efficiently obtain the wind farm road line selection optimization plan, and promote the standardization process of wind farm road line selection.

[0018] 2. The present invention innovatively proposes an implementation strategy for optimizing the optimal wind farm road line by minimizing the objective function. dis When 1[] is an empty set again, the loop stops.dis 2[] is the minimum weighted total road construction cost from the road access point to each vertex, thereby obtaining the optimal line of the wind farm road, which can more accurately screen out the optimal route and improve the line selection accuracy.

[0019] Advantages of additional aspects of the present invention will be given in part in the following description, and in part will become obvious from the following description, or will be learned through practice of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS

[0020] The accompanying drawings in the specification, which constitute a part of the present invention, are used to provide a further understanding of the present invention. The exemplary embodiments of the present invention and their descriptions are used to explain the present invention and do not constitute improper limitations on the present invention.

[0021] Figure 1 The process of the method for selecting a wind farm road line provided in Example 1 of the present invention is as follows: Figure 1 ; Figure 2 The process of the method for selecting a wind farm road line provided in Example 1 of the present invention is as follows: Figure 2 ; Figure 3 Schematic diagram of the method for calculating approximate geodesic distance provided by Embodiment 1 of the present invention; Figure 4 This is a schematic diagram of a wind farm road line selection system provided by Embodiment 2 of the present invention; Figure 5 This is a schematic diagram of a computer device provided in Example 3 of the present invention. DETAILED DESCRIPTION

[0022] The present invention will be further described below in conjunction with the accompanying drawings and embodiments.

[0023] It should be noted that the following detailed descriptions are exemplary and are intended to provide further explanation of the present invention. Unless otherwise specified, all technical and scientific terms used herein have the same meanings as those commonly understood by those skilled in the art to which the present invention belongs.

[0024] In the absence of conflict, the embodiments of the present invention and the features of the embodiments may be combined with each other.

[0025] Embodiment 1: This implementation proposes a method for selecting a wind farm road route. Under the constraints of maximum slope, minimum turning radius, etc., the total cost of wind farm road construction is taken as the optimization target. The route selection and layout are automatically performed through a computer algorithm to quickly and efficiently obtain the optimal solution for the wind farm road.

[0026] like Figure 1 and Figure 2 As shown, the following process is included: S1: Obtain the map data of the target wind farm; export the area where the topographic map needs to be generated from the Aowei map in .kmz or .kml format according to the boundary range of the wind farm, the prohibited construction area, the determined machine site, the road access point and the road delivery point; import the obtained .kmz or .kml format file into Global Mapper, modify the contour interval value to 10, generate the topographic map and extract the horizontal and elevation data.

[0027] S2: For the acquired map data, the approximate geodesic method is used to calculate the distance between two points. Specifically, firstly, the two points A and E are projected to the ground to generate points A' and E', and multiple points B', C', D'...M', N' are inserted into the line connecting the two points A'E'. Then, the three points projected to the points B, C, E...M, N on the actual terrain are calculated. The path length between the two points AE is approximately converted into the sum of the Euclidean distances between AB, BC, CD, DE...MN. The distance calculation formula between any two points is as follows: (1); in xA , yA , zA They are A The coordinates and elevation of the point, B Similarly, Figure 3 The example shown is for inserting three points.

[0028] S3: Establish a weighted road construction total cost function model, specifically: (2); (3); (4); (5); (6); (7); in, Ct is the weighted total road construction cost; Ci For the i Cost of road construction; αi For the i Longitudinal slope coefficient of section road; si For the i The longitudinal slope of the road section; βi For the i Turning radius coefficient of road section; Ei , Fi , Vi , , Respectively iThe earthwork cost coefficient, filling volume, excavation volume, unit excavation cost and unit filling cost of the road section. The optimization goal is to minimize the total weighted road construction cost. minCt .

[0029] S4: Based on the determined unit coordinates and road access points and delivery points, the minimum weighted total road construction cost is optimized, including: S4.1: Establish a queue dis 1[] records the vertex list to be expanded (vertices include road access points, road exit points and inserted points), which is initially an empty set; S4.2: Connect road access points t0 Join the queue as a starting point dis 1[ t0 ]; S4.3: Establish a queue dis 2[], record the minimum weighted total cost of road construction from the starting point to all points; S4.4: Assign road access points t0 The total cost of the minimum weighted road construction to itself is 0, and the total cost of the road construction to other machine locations is 0. t1 , t2 , t3 , …, tn And road delivery point tn+1 The minimum weighted total cost of road construction is positive infinity, so dis 2[0, +∞, +∞, …, +∞]; S4.5: When the queue dis When 1[] is not empty, let the queue dis 1[] Squadron First Point t0 Dequeue and enumerate with t0 The endpoints of all edges of the starting point (assuming t1 , t2 ) to perform relaxation operation, t1 , t2 exist dis The corresponding minimum weighted total road construction cost in 2[] is reduced; S4.6: Make the original queue dis 1[] does not have a point in the list. dis 1[ t1 , t2 ]; S4.7: Separately dis 1[] as the first point, repeat S5-S6; S4.8: When the queue dis When 1[] is an empty set again, the loop stops. dis 2[] is the minimum weighted total cost of road construction from the road access point to each vertex, thereby obtaining the optimal line of the wind farm road.

[0030] This implementation method takes the road turning radius, maximum longitudinal slope, prohibited construction area, existing road access point and delivery point as constraints, and proposes a wind farm road line selection method based on the SPFA algorithm with the minimum total road construction cost as the optimization goal. It can quickly and efficiently obtain the wind farm road line selection optimization plan, and to a certain extent promote the standardization process of wind farm road line selection.

[0031] Embodiment 2: like Figure 4 As shown, this implementation provides a wind farm road line selection system, including: The road segment division unit is configured to: insert a plurality of vertices between a starting point and a target point according to the target wind farm map data to obtain a plurality of road segments; The optimal line generation unit is configured to construct an objective function of the weighted total road construction cost according to the road construction cost of each road section, the road longitudinal slope coefficient, the road longitudinal slope gradient, the road turning radius coefficient, the road earthwork cost coefficient, the filling volume, the excavation volume, the unit excavation cost and the unit filling cost, and optimize the optimal line result of the wind farm road by minimizing the objective function.

[0032] In the optimal line generation unit, the optimal line result of the wind farm road is obtained by optimizing with the minimum objective function, including: Create a queue dis 1[] records the vertex list to be expanded, which is initially an empty set; Road access point t0 Join the queue as a starting point dis 1[ t0 ]; Create a queue dis 2[], record the minimum weighted total cost of road construction from the starting point to all points; Assigning road access points t0 The total cost of the minimum weighted road construction to itself is 0, and the total cost of the road construction to other machine locations is 0. t1 , t2 , t3 , …, tn And road delivery point tn+1 The minimum weighted total cost of road construction is positive infinity, so dis 2[0, +∞, +∞, …, +∞]; When the queue dis When 1[] is not empty, let the queue dis 1[] Squadron First Point t0 Dequeue and enumerate with t0 Perform relaxation operations on the endpoints of all edges of the starting point. t1 , t2 existdis The corresponding minimum weighted total road construction cost in 2[] is reduced; Order the original queue dis 1[] does not have a point in the list. dis 1[ t1 , t2 ]; Respectively dis 1[] as the first point, repeat as queue dis 1[] steps when non-empty; When the queue dis When 1[] is an empty set again, the loop stops. dis 2[] is the minimum weighted total cost of road construction from the road access point to each vertex, thereby obtaining the optimal line of the wind farm road.

[0033] The specific working process of each of the above units is described in Example 1 and will not be repeated here.

[0034] It is understandable that the above-mentioned units can be separately or completely combined into one or several other units to constitute, or one (some) of the units can be further divided into multiple functionally smaller units to constitute, which can achieve the same operation without affecting the realization of the technical effects of the embodiments of the present application. The above-mentioned units are divided based on logical functions. In actual applications, the function of one unit can also be implemented by multiple units, or the functions of multiple units can be implemented by one unit. In other embodiments of the present application, the wind farm road selection system can also include other units. In actual applications, these functions can also be implemented with the assistance of other units, and can be implemented by the collaboration of multiple units.

[0035] According to another embodiment of the present application, the system described in this embodiment can be constructed, and the wind farm road selection method of the embodiment of the present application can be implemented by running a computer program (including program code) capable of executing the steps involved in the corresponding method described in Example 1 on a general computing device such as a computer including processing elements and storage elements such as a central processing unit (CPU), random access memory (RAM), and read-only memory (ROM). The computer program can be recorded on, for example, a computer-readable recording medium, and loaded into the above-mentioned computing device through the computer-readable recording medium and run therein.

[0036] Embodiment 3: like Figure 5As shown, this implementation provides an electronic device, which includes a processor 1001, a communication interface 1002, and a computer-readable storage medium 1003. The processor 1001, the communication interface 1002, and the computer-readable storage medium 1003 may be connected via a bus or other means.

[0037] Among them, the communication interface 1002 is used to receive and send data, the computer-readable storage medium 1003 can be stored in the memory of the electronic device, the computer-readable storage medium 1003 is used to store a computer program, the computer program includes program instructions, and the processor 1001 is used to execute the program instructions stored in the computer-readable storage medium 1003.

[0038] The processor 1001 (or CPU (Central Processing Unit)) is the computing core and control core of the electronic device, which is suitable for implementing one or more instructions, and specifically suitable for loading and executing one or more instructions to implement corresponding method processes or corresponding functions.

[0039] The processor 1001 is configured to execute the following process: According to the target wind farm map data, multiple vertices are inserted between the starting point and the target point to obtain multiple road sections; According to the road construction cost of each road section, the road longitudinal slope coefficient, the road longitudinal slope gradient, the road turning radius coefficient, the road earthwork cost coefficient, the filling volume, the excavation volume, the unit excavation cost and the unit filling cost, an objective function of the weighted total road construction cost is constructed, and the optimal route result of the wind farm road is obtained by optimizing with the minimum of the objective function.

[0040] The optimal route of the wind farm road is obtained by optimizing the minimum objective function, including: Create a queue dis 1[] records the vertex list to be expanded, which is initially an empty set; Road access point t0 Join the queue as a starting point dis 1[ t0 ]; Create a queue dis 2[], record the minimum weighted total cost of road construction from the starting point to all points; Assigning road access points t0 The total cost of the minimum weighted road construction to itself is 0, and the total cost of the road construction to other machine locations is 0. t1 , t2 , t3 ,… 、tn And road delivery point tn+1 The minimum weighted total cost of road construction is positive infinity, so dis2[0, +∞, +∞, …, +∞]; When the queue dis When 1[] is not empty, let the queue dis 1[] Squadron First Point t0 Dequeue and enumerate with t0 Perform relaxation operations on the endpoints of all edges of the starting point. t1 , t2 exist dis The corresponding minimum weighted total road construction cost in 2[] is reduced; Order the original queue dis 1[] does not have a point in the list. dis 1[ t1 , t2 ]; Respectively dis 1[] as the first point, repeat as queue dis 1[] steps when non-empty; When the queue dis When 1[] is an empty set again, the loop stops. dis 2[] is the minimum weighted total cost of road construction from the road access point to each vertex, thereby obtaining the optimal line of the wind farm road.

[0041] The specific working process is described in Example 1 and will not be repeated here.

[0042] Embodiment 4: This implementation provides a computer-readable storage medium (Memory), which is a memory device in an electronic device for storing programs and data. It is understandable that the computer-readable storage medium here can include both built-in storage media in the electronic device and, of course, extended storage media supported by the electronic device. The computer-readable storage medium provides a storage space that stores the processing system of the electronic device.

[0043] In addition, the storage space also stores one or more instructions suitable for being loaded and executed by the processor, and these instructions may be one or more computer programs (including program codes). It should be noted that the computer-readable storage medium here may be a high-speed RAM memory, or a non-volatile memory, such as at least one disk memory; optionally, it may also be at least one computer-readable storage medium located away from the aforementioned processor.

[0044] In one embodiment, the computer-readable storage medium stores one or more instructions; the processor loads and executes the one or more instructions stored in the computer-readable storage medium to implement the following process: According to the target wind farm map data, multiple vertices are inserted between the starting point and the target point to obtain multiple road sections; According to the road construction cost of each road section, the road longitudinal slope coefficient, the road longitudinal slope gradient, the road turning radius coefficient, the road earthwork cost coefficient, the filling volume, the excavation volume, the unit excavation cost and the unit filling cost, an objective function of the weighted total road construction cost is constructed, and the optimal route result of the wind farm road is obtained by optimizing with the minimum of the objective function.

[0045] The optimal route of the wind farm road is obtained by optimizing the minimum objective function, including: Create a queue dis 1[] records the vertex list to be expanded, which is initially an empty set; Road access point t0 Join the queue as a starting point dis 1[ t0 ]; Create a queue dis 2[], record the minimum weighted total cost of road construction from the starting point to all points; Assigning road access points t0 The total cost of the minimum weighted road construction to itself is 0, and the total cost of the road construction to other machine locations is 0. t1 , t2 , t3 ,… tn And road delivery point tn+1 The minimum weighted total cost of road construction is positive infinity, so dis 2[0, +∞, +∞, …, +∞]; When the queue dis When 1[] is not empty, let the queue dis 1[] Squadron First Point t0 Dequeue and enumerate with t0 Perform relaxation operations on the endpoints of all edges of the starting point. t1 , t2 exist dis The corresponding minimum weighted total road construction cost in 2[] is reduced; Order the original queue dis 1[] does not have a point in the list. dis 1[ t1 , t2 ]; Respectively dis 1[] as the first point, repeat as queue dis 1[] steps when non-empty; When the queue dis When 1[] is an empty set again, the loop stops. dis2[] is the minimum weighted total cost of road construction from the road access point to each vertex, thereby obtaining the optimal line of the wind farm road.

[0046] The specific working process is described in Example 1 and will not be repeated here.

[0047] Embodiment 5: The present implementation provides a computer program product or a computer program, which includes computer instructions stored in a computer-readable storage medium. A processor of an electronic device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the electronic device performs the following process: According to the target wind farm map data, multiple vertices are inserted between the starting point and the target point to obtain multiple road sections; According to the road construction cost of each road section, the road longitudinal slope coefficient, the road longitudinal slope gradient, the road turning radius coefficient, the road earthwork cost coefficient, the filling volume, the excavation volume, the unit excavation cost and the unit filling cost, an objective function of the weighted total road construction cost is constructed, and the optimal route result of the wind farm road is obtained by optimizing with the minimum of the objective function.

[0048] The optimal route of the wind farm road is obtained by optimizing the minimum objective function, including: Create a queue dis 1[] records the vertex list to be expanded, which is initially an empty set; Road access point t0 Join the queue as a starting point dis 1[ t0 ]; Create a queue dis 2[], record the minimum weighted total cost of road construction from the starting point to all points; Assigning road access points t0 The total cost of the minimum weighted road construction to itself is 0, and the total cost of the road construction to other machine locations is 0. t1 , t2 , t3 ,… 、tn And road delivery point tn+1 The minimum weighted total cost of road construction is positive infinity, so dis 2[0, +∞, +∞, …, +∞]; When the queue dis When 1[] is not empty, let the queue dis 1[] Squadron First Point t0 Dequeue and enumerate with t0 Perform relaxation operations on the endpoints of all edges of the starting point. t1 , t2 exist disThe corresponding minimum weighted total road construction cost in 2[] is reduced; Order the original queue dis 1[] does not have a point in the list. dis 1[ t1 , t2 ]; Respectively dis 1[] as the first point, repeat as queue dis 1[] steps when non-empty; When the queue dis When 1[] is an empty set again, the loop stops. dis 2[] is the minimum weighted total cost of road construction from the road access point to each vertex, thereby obtaining the optimal line of the wind farm road.

[0049] The specific working process is described in Example 1 and will not be repeated here.

[0050] A person skilled in the art can appreciate that the units and algorithm steps of each example described in conjunction with the embodiments disclosed in this application can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. A person skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered to be beyond the scope of this application.

[0051] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented using software, it can be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When the computer program instructions are loaded and executed on the computer, the process or function according to the embodiment of the present application is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable devices. The computer instructions can be stored in a computer-readable storage medium or transmitted through a computer-readable storage medium. The computer instructions can be transmitted from a website site, a computer, a server or a data center to another website site, a computer, a server or a data center by wired (e.g., coaxial cable, optical fiber, digital line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that can be accessed by the computer or a data processing device such as a server, a data center, etc. that includes one or more available media integrated. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state drive (SSD)), etc.

[0052] The above description is only a preferred embodiment of the present invention and is not intended to limit the present invention. For those skilled in the art, the present invention may have various modifications and variations. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present invention shall be included in the protection scope of the present invention.

Claims

1. A method for selecting a road line for a wind farm, characterized in that: The process includes: According to the target wind farm map data, multiple vertices are inserted between the starting point and the target point to obtain multiple road sections; According to the road construction cost of each road section, the road longitudinal slope coefficient, the road longitudinal slope gradient, the road turning radius coefficient, the road earthwork cost coefficient, the filling volume, the excavation volume, the unit excavation cost and the unit filling cost, an objective function of the weighted total road construction cost is constructed, and the optimal route result of the wind farm road is obtained by optimizing with the minimum of the objective function.

2. The method for selecting a road line for a wind farm according to claim 1, characterized in that: The acquisition of the target wind farm map data includes: Export the target wind farm map data from the map in .kmz or .kml format according to the wind farm boundary range, prohibited construction area, determined machine site, road access point and road delivery point.

3. The method for selecting a road line for a wind farm according to claim 1, characterized in that: The approximate geodesic method is used to divide the road between the starting point A and the target point E into multiple sections. The starting point A and the target point E are projected to the horizontal ground to generate points A' and E', and multiple points B', C', D'···M', N' are inserted into the line connecting the two points A'E'. Then, the points B, C, E···M, N projected to the actual terrain by B', C', D'···M' are calculated, and the path length between points AE is approximately converted into the sum of the Euclidean distances between AB, BC, CD, DE···MN.

4. The method for selecting a road line for a wind farm according to claim 1, characterized in that: The objective function of the weighted total road construction cost is: ;in, ; ; ; ; ; Ct is the weighted total road construction cost; Ci is the construction cost of the i-th road section; αi For the i Longitudinal slope coefficient of section road; si For the i The longitudinal slope of the road section; βi For the i Turning radius coefficient of road section; E , Fi , Vi , , Respectively i The earthwork cost coefficient, filling volume, excavation volume, unit excavation cost and unit filling cost of the road section.

5. The method for selecting a road line for a wind farm according to any one of claims 1 to 4, characterized in that: The optimal route of the wind farm road is obtained by optimizing the minimum objective function, including: Create a queue dis 1[] records the vertex list to be expanded, which is initially an empty set; Road access point t0 Join the queue as a starting point dis 1[ t0 ]; Create a queue dis 2[], record the minimum weighted total cost of road construction from the starting point to all points; Assigning road access points t0 The total cost of the minimum weighted road construction to itself is 0, and the total cost of the road construction to other machine locations is 0. t1 , t2 , t3 ,… 、 tn And road delivery point tn+1 The minimum weighted total cost of road construction is positive infinity, so dis 2[0, +∞, +∞, …, +∞]; When the queue dis When 1[] is not empty, let the queue dis 1[] Squadron First Point t0 Dequeue and enumerate with t0 Perform relaxation operations on the endpoints of all edges of the starting point. t1 , t2 exist dis The corresponding minimum weighted total road construction cost in 2[] is reduced; Order the original queue dis 1[] does not have a point in the list, so there is dis 1[ t1 , t2 ]; Respectively dis 1[] as the first point, repeat as queue dis 1[] steps when non-empty; When the queue dis When 1[] is an empty set again, the loop stops. dis 2[] is the minimum weighted total cost of road construction from the road access point to each vertex, thereby obtaining the optimal line of the wind farm road.

6. A wind farm road selection system, characterized in that: include: The road segment division unit is configured to: insert a plurality of vertices between a starting point and a target point according to the target wind farm map data to obtain a plurality of road segments; The optimal line generation unit is configured to construct an objective function of the weighted total road construction cost according to the road construction cost of each road section, the road longitudinal slope coefficient, the road longitudinal slope gradient, the road turning radius coefficient, the road earthwork cost coefficient, the filling volume, the excavation volume, the unit excavation cost and the unit filling cost, and optimize the optimal line result of the wind farm road by minimizing the objective function.

7. The wind farm road selection system according to claim 6, characterized in that: In the optimal line generation unit, the optimal line result of the wind farm road is obtained by optimizing with the minimum objective function, including: Create a queue dis 1[] records the vertex list to be expanded, which is initially an empty set; Road access point t0 Join the queue as a starting point dis 1[ t0 ]; Create a queue dis 2[], record the minimum weighted total cost of road construction from the starting point to all points; Assigning road access points t0 The total cost of the minimum weighted road construction to itself is 0, and the total cost of the road construction to other machine locations is 0. t1 , t2 , t3 , …, tn And road delivery point tn+1 The minimum weighted total cost of road construction is positive infinity, so dis 2[0, +∞, +∞, …, +∞]; When the queue dis When 1[] is not empty, let the queue dis 1[] Squadron First Point t0 Dequeue and enumerate with t0 Perform relaxation operations on the endpoints of all edges of the starting point. t1 , t2 exist dis The corresponding minimum weighted total road construction cost in 2[] is reduced; Order the original queue dis 1[] does not have a point in the list, so there is dis 1[ t1 , t2 ]; Respectively dis 1[] as the first point, repeat as queue dis 1[] steps when non-empty; When the queue dis When 1[] is an empty set again, the loop stops. dis 2[] is the minimum weighted total cost of road construction from the road access point to each vertex, thereby obtaining the optimal line of the wind farm road.

8. A computer device, characterized in that: include: A processor and a computer readable storage medium; a processor adapted to execute a computer program; A computer-readable storage medium, wherein a computer program is stored in the computer-readable storage medium, and when the computer program is executed by the processor, the method for selecting a road line for a wind farm according to any one of claims 1 to 5 is implemented.

9. A computer-readable storage medium, characterized in that: The computer-readable storage medium stores a computer program, and the computer program is suitable for being loaded by a processor and executing the method for selecting a road line in a wind farm according to any one of claims 1 to 5.

10. A computer program product, characterized in that The computer program product comprises a computer program, and when the computer program is executed by a processor, the method for selecting a road line in a wind farm is implemented.

Images