A photovoltaic field area cable path optimization method based on directional scanning method

Abstract

The application discloses a photovoltaic field area cable path optimization method based on a directional scanning method and belongs to the technical field of cable laying. s The application discloses a photovoltaic field area cable path optimization method based on a directional scanning method and belongs to the technical field of cable laying. xl The application discloses a photovoltaic field area cable path optimization method based on a directional scanning method and belongs to the technical field of cable laying. x S2, the number of box transformers on a single cable path is set as G, the box transformers are traversed from far to near with the step-up station as a base point, the starting box transformer on the cable path is determined, the box transformers on the cable path are determined by using the directional scanning method according to the set G, and the optimization of the key point coordinates on the path is completed; and S3, the inflection point coordinates are inserted between the adjacent key point coordinates of the path, the adjacent coordinate points on the path are connected, and the cable path graph is formed. The application realizes the optimization scheme from the massive cable path design schemes quickly, greatly improves the work efficiency and provides strong support for the design of actual projects.

Description

TECHNICAL FIELD

[0001] The application belongs to the technical field of cable laying, and particularly relates to a photovoltaic field area cable path optimization method based on a directional scanning method. BACKGROUND

[0002] With the rapid development of economy, the demand for energy is becoming more and more urgent, and solar energy as a clean and renewable new energy is widely used. With the continuous maturity of photovoltaic technology, large-scale ground grid-connected photovoltaic power stations have ushered in an unprecedented construction boom.

[0003] In the design of a photovoltaic power station, a large number of box transformers are sporadically distributed in the field area, and the cable path scheme of connecting the box transformers to the booster station is thousands of times, and increases exponentially with the increase in the number of box transformers. The so-called path laying is to connect the box transformers to the booster station through cables, and the number of box transformers connected on each cable is the same.

[0004] However, the workload of manually designing the cable path is large and inefficient, and therefore there is an urgent need for a method capable of automatically and quickly optimizing the cable path. SUMMARY

[0005] The technical problem to be solved by the application is to provide a method capable of automatically and quickly optimizing the cable path.

[0006] To solve the above technical problem, the technical solution adopted by the application is:

[0007] A photovoltaic field area cable path optimization method based on a directional scanning method, comprising the following steps:

[0008] S1, identifying a booster station in an AutoCAD drawing and obtaining a center coordinate P s , identifying a box transformer set in the AutoCAD drawing and obtaining a center coordinate set P xl , and obtaining a box transformer number C x ;

[0009] S2, setting a box transformer number G on a single cable path, traversing the box transformers from far to near with the booster station as a base point, determining a starting box transformer on the cable path, determining the box transformers on the cable path according to the set G by using a directional scanning method, and completing the optimization of the key point coordinates on the path;

[0010] S3, inserting a turning point coordinate between adjacent key point coordinates of the path, connecting adjacent coordinate points on the path, and forming a cable path graph.

[0011] The further improvement of the technical solution of the application is that the optimization of the key point coordinates on the path in S2 is completed by using a directional scanning method, and specifically comprises the following steps:

[0012] S2.1, arrange the center coordinates of the box transformer in descending order according to the sum of the horizontal and vertical distances from the center coordinates of the box transformer to the center coordinates of the booster station P s , to obtain the sorted center coordinates of the box transformer P xl ; l

[0013] S2.2, according to the number of box transformers G on a single cable path and the number of box transformers C x , construct a set Lg of the number of box transformers contained in the cable path g , then the total number of cable paths to be searched C = round up (Cx ÷ G); set M as the remainder of C x ÷G, if M = 0, then the value of each item in the set Lg is G; if M ≠ 0, then the values of all items in the set Lg except the last two items are G, and the values of the last two items are the average of the remaining number of box transformers;

[0014] S2.3, start the cable path optimization, set the search range of the box transformer as R, the initial value of R is the total set of box transformers P l ; set the key point set of the cable path as X l , and the current searched is the Ith cable path;

[0015] S2.4, take out the first two box transformers in R, respectively calculate the sum of the horizontal and vertical distances of the two box transformers from other box transformers in P l , take the box transformer X with smaller distance sum as the box transformer on the current path I, add X to X l [I], and remove X from R and P l ;

[0016] S2.5, calculate the vector V of the box transformer X to the booster station, calculate the horizontal component V x and the vertical component V y of V, and perform directional scanning in the interval of V x and V y with the box transformer X as the vertex, filter the box transformers in P l in the interval, and construct a new box transformer set R;

[0017] S2.6, loop steps S2.4 and S2.5 until the cable path I finds the required number of box transformers or the number of box transformer set P l is 0; if the former is met, it means that the required number of box transformers is found, and the cable path is determined; if only the latter is met, it means that the required number of box transformers is not found, then place the found box transformers on this path to the standby box transformer set P s , and go to step S2.8 for further searching;

[0018] ​S2.7, let I=I+1, find the transformer substation on the next cable path, execute steps S2.3 and S2.6 in a loop, if the number of the transformer substation set P l is 0, it represents that all the transformer substations have been traversed, and step 2.8 is entered;

[0019] S2.8, if the set P s is empty, step S3.1 is executed, otherwise, the transformer substations in the set P s need to continue to be optimized in the path, and step S2.9 is entered;

[0020] S2.9, the center coordinate set P s of the transformer substations is arranged in descending order according to the sum of the horizontal and vertical distances from the center coordinate of the transformer substation to the center coordinate P s of the transformer substation, and the sorted center coordinate set P s of the transformer substations is obtained;

[0021] S2.10, start the second cable path optimization, and set the current searched as the Jth cable path;

[0022] S2.11, take the first transformer substation in P s as the starting transformer substation of the cable path J and remove it from P s , and the searching method of other transformer substations on the path is as follows: if there is only one transformer substation in P sp , the transformer substation is selected, otherwise, the first two transformer substations are taken out from P sp , if the distance from the second transformer substation to the previous transformer substation is more than 1.5 times of the distance from the first transformer substation to the previous transformer substation, the first transformer substation is selected, otherwise, the sum of the horizontal and vertical distances of the two transformer substations from the coordinates of other transformer substations in P sp is calculated respectively, the transformer substation with smaller distance sum is selected, the selected transformer substation is removed from P sp , and the selected transformer substation is put into X l [J];

[0023] S2.12, execute steps S2.10 and S2.11 in a loop until the transformer substations of the cable path J are searched to meet the requirement;

[0024] S2.13, find the transformer substation on the next cable path, execute steps S2.10 and S2.12 in a loop, if the number of the transformer substation set P sp is 0, it represents that all the transformer substations have been selected into the corresponding cable path, and the path key point optimization is completed.

[0025] The further improvement of the technical scheme of the application is that the cable path map formed in S3 specifically comprises the following steps:

[0026] S3.1, start to traverse the key point set Xl inserting a corner point between every two key points (P1, P2) on the path in sequence, and the corner point coordinates are [P1.X, P2.Y];

[0027] S3.2, the center coordinate point of the booster station is added at the end of each path;

[0028] S3.3, the points on each path are connected in sequence by straight lines, and the cable routing map is drawn in the AutoCAD drawing by using the secondary development technology of AutoCAD.

[0029] Due to the adoption of the above technical scheme, the technical progress achieved by the application is:

[0030] The photovoltaic field area cable path optimization method based on the directional scanning method disclosed in the application considers the grouping number of box transformers on the cable path, and takes the length of the path as the key factor of the algorithm, which conforms to the actual engineering design; Through the method of the application, the optimized scheme is quickly determined from a large number of cable path design schemes, greatly improving the work efficiency and providing strong support for the design of actual engineering. BRIEF DESCRIPTION OF DRAWINGS

[0031] Figure 1 is a schematic diagram of the directional scanning method;

[0032] Figure 2 is a schematic diagram of the photovoltaic field area cable path optimization of the embodiment of the application;

[0033] Figure 3 is a schematic diagram of the case of meeting the directional scanning method;

[0034] Figure 4 is a schematic diagram of the case of not meeting the directional scanning method.

[0035] 1, box transformer, ①②③④⑤⑥⑦⑧⑨⑩ is the number of the box transformer after sorting according to the distance from the booster station. DETAILED DESCRIPTION

[0036] The application will be further described in detail below in combination with the embodiments:

[0037] The directional scanning method is to find the box transformer connected to the same cable in the same direction interval each time: the starting box transformer is the farthest box transformer from the booster station among the remaining available box transformers, then the horizontal vector and the vertical vector of the vector formed by connecting the booster station position with the current box transformer are taken each time, and the range contained by the horizontal vector and the vertical vector is the interval that needs to be scanned, and then the box transformer closest to the current box transformer is found in this interval. As shown in Figure 1 .

[0038] A photovoltaic field area cable path optimization method based on directional scanning method, comprising the following steps:

[0039] S1, identify the booster station in AutoCAD drawing and obtain the center coordinate P s , identify the box transformer set in AutoCAD drawing and obtain the center coordinate set P xl , obtain the number of box transformers C x ;

[0040] S2, set the number of box transformers G on a single cable path, and traverse the box transformers from far to near with the booster station as the base point to determine the starting box transformer on the cable path, and use the directional scanning method to determine the box transformer on the cable path according to the set G, and complete the optimization of the key point coordinates on the path;

[0041] S3, insert the inflection point coordinates between the adjacent key point coordinates of the path, connect the adjacent coordinate points on the path, and form the cable path graph.

[0042] The specific implementation is shown in Figures 2-4 .

[0043] As Figure 2 , the number of box transformers G on a single cable path is 5, the number of box transformers C x is 15, and the center coordinates of the booster station and the box transformers are obtained.

[0044] S2.1: Sort the box transformer 1 according to the distance from the booster station to obtain the sorted box transformer center coordinate set The sorting is to find the box transformer from far to near.

[0045] S2.2: Calculate the number of cable paths to be generated, the number of cable paths C=15÷5=3, because there is no remainder, so the number of cable paths is 3; if it cannot be evenly grouped, then the last two groups are evenly distributed, for example, 17 is divided into 5 groups, a total of 4 groups, and the number of each group is 5, 5, 4 and 3.

[0046] Start the first path optimization:

[0047] S2.3: Start cable path optimization, set the range of box transformers to be searched The current search is the I=1 cable path; R is dynamically changed, and each time it is the box transformer 1 within the sector area, P l is the set of box transformers that have been used.

[0048] S2.4: Take out the first two box transformers ① and ② in R, calculate the other box transformers l in P The total horizontal and vertical distances are 5033 and 5309 respectively, therefore, transformer ① is taken as the transformer on the current path 1, and transformer ① is moved from R to P. l Removed from the middle, after removal

[0049] S2.5: such as Figure 3 Calculate the vector V from transformer ① to the step-up substation, and calculate the horizontal component V of V. x and vertical component V y With the box-type transformer X as its vertex, in vector V x and V y Perform a directional scan within the specified interval to find the next transformer substation, and filter P. l In the context of this range, construct a new set of transformer substations.

[0050] S2.6: Repeat steps S2.4 and S2.5, as follows. Figure 2 The first cable path [①④⑥⑧⑩] has been found. If the transformer substations have been completely traversed or not enough transformer substations have been scanned within the sector area, a second optimization process must be initiated.

[0051] S2.7: Repeat steps S2.3 and S2.6. When I = 2, as follows... Figure 2 The second cable path was found. When I = 3, as Figure 4 Search range Due to the transformer substation Not in V x and V y Within the specified interval, the transformer substation found by the third path is only [missing information]. The quantity does not meet the requirements, and the search for the third path has failed.

[0052] S2.8: Since the search for the third path failed, therefore Enter the second path optimization process;

[0053] S2.9: Suppose that the current search is for the J=3rd cable path;

[0054] S2.10: Take P s The first transformer substation ③ in the diagram is the starting transformer substation for cable route 3. After removing ③... The method for finding other transformer substations along the path is as follows: Due to P s Since the quantity is greater than 1, the distance between ⑦ and ③ is calculated as d1 = 114. The distance to ③ is d2 = 275; and since d2 ÷ d1 = 2.41 > 1.5, the transformer substation ⑦ is selected as the second transformer substation on the path;

[0055] S2.11: Looping step S2.9 and S2.10 to find the box variables in turn Form the third path

[0056] S2.13: Since the number of set P s is 0 at this time, it represents that all box variables have been selected into the corresponding cable path, and the path key point optimization is completed.

[0057] The formation of the cable path map in S3 includes the following steps:

[0058] S3.1, start traversing the key point path optimized in S2, and insert inflection points between every two box variables on the path in order, such as the inflection points between ①, ④, ⑥, ⑧ in Figure 2 ;

[0059] S3.2, connect the last box variable on each path with the booster station, such as ⑩, Figure 2 respectively, with the booster station;

[0060] S3.3, as shown in Figure 2 , use the secondary development technology of AutoCAD to draw the cable routing map in the AutoCAD drawing.​

Claims

1. A photovoltaic field area cable path optimization method based on a directed scan method, characterized in that Comprising the following steps: S1, identify the booster station in AutoCAD drawing and get the center coordinate P s , identify the box transformer set in AutoCAD drawing and get the center coordinate set P xl , get the number of box transformers C x ; S2, setting the number of box transformers G on a single cable path, starting from the far end and going to the near end, traversing the box transformer (1) at the step-up station, determining the starting box transformer (1) on the cable path, using the directional scanning method to determine the box transformer (1) on the cable path according to the set G, and completing the optimization of the coordinates of the key points on the path; The optimization of the coordinates of the key points on the path in S2 is completed by using the directional scanning method, and specifically includes the following steps: S2.1, according to the box transformer center coordinates to the center coordinates P of the booster station s The sum of the horizontal and vertical distances is arranged in descending order according to the center coordinates of the box transformer P xl The center coordinates of the box transformer P l ; S2.2, Based on the number of transformer substations G and C along a single cable path. x Construct the set L of the number of transformer substations included in the cable route. g The total number of cable paths that need to be found, C, is equal to (Cx ÷ G) rounded up; let M be C. x If the remainder of ÷G is M=0, then the value of each item in set Lg is G; if M≠0, then the value of all items in set Lg except the last two items is G, and the value of the last two items is the average of the remaining number of box transformers. S2.3, start cable path optimization, set the search range of the box transformer as R, the initial value of R is the whole set of box transformers P l ; set the key point set of the cable path as X l , the current search is the Ith cable path; S2.4, take out the first 2 bin variables (1) in R, respectively calculate the horizontal and vertical distance sum of the 2 bin variables (1) and P l other bin variables (1) in the middle, take the bin variable X with the smaller distance sum as the bin variable on the current path I, add X to X l [I], and remove X from R and P l ; S2.5, calculate the vector V of the box transformer X to the step-up station, calculate the horizontal component V x and the vertical component V y , take the box transformer X as the vertex, and perform directional scanning in the interval of the vectors V x and V y to find the next box transformer, screen the box transformers in the interval in P l , and construct a new box transformer set R; S2.6, steps S2.4 and S2.5 are executed cyclically until the cable path I finds a number of transformer substation that meets the requirements or the transformer substation set P l ; if the former is met, it means that a transformer substation that meets the condition is found, and the cable path is determined; if only the latter is met, it means that no transformer substation that meets the condition is found, and the transformer substation found on the path is placed into the standby transformer substation set P s , and step S2.8 is entered to continue searching. S2.7, let I = I + 1, find the next box transformer (1) on the cable path, execute steps S2.3 and S2.6 in a loop, if the number of box transformer set P l is 0, it means that all the box transformers are traversed, go to step 2.8; S2.8, if the set P s is empty, then step S3.1 is performed, otherwise the path optimization needs to be continued for the bins in the set P s , step S2.9 is entered. S2.9, start the second cable path optimization, and set the current search as the Jth cable path; S2.10, Take P s The first box in the middle becomes the starting box transformer of cable path J, and from P s The method for removing and finding other transformer substations along the path is as follows: If P s If there is only one transformer substation, select that substation; otherwise, select from P. s Take the first two transformer substations. If the distance from the second substation to the previous substation is more than 1.5 times the distance from the first substation to the previous substation, then select the first substation. Otherwise, calculate the distance between the two substations and P. s The sum of the horizontal and vertical distances of other transformer substation coordinates, selecting the transformer substation with the smaller distance, from P s Remove the selected transformer substation from the list and place the selected transformer substation into the X list. l [J]; S2.11, loop steps S2.9 and S2.10 until the cable path J finds the required number of box transformers; S2.12, find the next box transformer on the cable path, and execute steps S2.9 and S2.11 in a loop. If the number of box transformers in set P s is 0, it means that all the box transformers have been selected into the corresponding cable path, and the path key point optimization is completed. S3, inserting the inflection point coordinates between the adjacent key point coordinates of the path, connecting the adjacent coordinate points on the path, and forming a cable path map.

2. The photovoltaic field area cable path optimization method based on the directional scanning method according to claim 1, characterized in that: The cable path map in S3 specifically includes the following steps: S3.1, start traversing the key point set X optimized in S2 l , insert a turning point between every two key points (P1, P2) on the path in order, and the turning point coordinates are [P1.X, P2.Y]; S3.2, add the center coordinate point of the step-up station at the end of each path; S3.3, connect the points on each path in order with a straight line, and draw the cable routing map in the AutoCAD drawing using the secondary development technology of AutoCAD.

Images