CN116644538B - Photovoltaic subarray cable confluence path calculation method, computer equipment and storage medium - Google Patents
Photovoltaic subarray cable confluence path calculation method, computer equipment and storage medium Download PDFInfo
- Publication number
- CN116644538B CN116644538B CN202310397101.6A CN202310397101A CN116644538B CN 116644538 B CN116644538 B CN 116644538B CN 202310397101 A CN202310397101 A CN 202310397101A CN 116644538 B CN116644538 B CN 116644538B
- Authority
- CN
- China
- Prior art keywords
- photovoltaic
- subgroup
- subarray
- group
- string
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000004364 calculation method Methods 0.000 title claims abstract description 49
- 238000000034 method Methods 0.000 claims abstract description 43
- 230000005484 gravity Effects 0.000 claims description 33
- 238000005457 optimization Methods 0.000 claims description 9
- 238000012163 sequencing technique Methods 0.000 claims description 5
- 238000004891 communication Methods 0.000 claims description 2
- 238000010586 diagram Methods 0.000 description 5
- 230000006978 adaptation Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000004070 electrodeposition Methods 0.000 description 1
- 238000010248 power generation Methods 0.000 description 1
- 238000010845 search algorithm Methods 0.000 description 1
- 238000000638 solvent extraction Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F30/00—Computer-aided design [CAD]
- G06F30/10—Geometric CAD
- G06F30/18—Network design, e.g. design based on topological or interconnect aspects of utility systems, piping, heating ventilation air conditioning [HVAC] or cabling
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0283—Price estimation or determination
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2113/00—Details relating to the application field
- G06F2113/16—Cables, cable trees or wire harnesses
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Development Economics (AREA)
- Strategic Management (AREA)
- Finance (AREA)
- Geometry (AREA)
- Accounting & Taxation (AREA)
- Mathematical Analysis (AREA)
- Computational Mathematics (AREA)
- Evolutionary Computation (AREA)
- Computer Hardware Design (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Optimization (AREA)
- Entrepreneurship & Innovation (AREA)
- General Engineering & Computer Science (AREA)
- Game Theory and Decision Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Economics (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Supply And Distribution Of Alternating Current (AREA)
Abstract
The invention discloses a photovoltaic subarray cable confluence path calculation method, computer equipment and a storage medium, wherein the method comprises the following steps: dividing a field group string into a plurality of subarrays; calculating the position of each sub-array box type transformer; dividing each subarray into a plurality of photovoltaic group strings, and calculating the optimal position of an inverter in each group by taking the lowest total price of the cable as a target; further calculating the path and length of the cable between the group string and the inverter in the group string subgroup and between the inverter and the box-type transformer to obtain the total price of the cable; and finally, deriving the length and price list of each type of cable in the post-field region after calculation, subarray division information and corresponding box-type transformer positions, and string group information and corresponding combiner box coordinates in each subarray. The invention effectively reduces the cable consumption under the condition of definite arrangement of the photovoltaic strings, saves the power station cost and improves the design efficiency.
Description
Technical Field
The invention relates to the technical field of photovoltaic power generation, and particularly discloses a photovoltaic subarray cable confluence calculation method, computer equipment and a storage medium.
Background
In the design of a photovoltaic power station, a plurality of photovoltaic group strings are connected to an inverter through photovoltaic cables, and then the inverter is connected to a box-type transformer with a fixed position through the photovoltaic cables, and the process is also called group string convergence. In the whole power station, the serial type, arrangement, inverter type and quantity, the box-type transformer type and quantity can be calculated and determined in advance, and the cost is fixed, so that the consumption of the photovoltaic cable and the low-voltage cable greatly influences the cost of the power station.
When a photovoltaic power station is arranged, the photovoltaic strings in the photovoltaic power station are divided into groups, the strings in the same group are connected to the same inverter, then a plurality of inverters are connected to the same box-type transformer, and the strings connected to the same box-type transformer form a subarray. Currently, designers typically group the internal strings of the power station according to experience or by adopting some search algorithm, but the positions of the inverters connected with the same internal string after the group are not accurately calculated, so that the internal strings of the group are connected with the inverters, and the sum of the prices of two cables of the inverter connected with the box-type transformer is the lowest. Therefore, the position of the inverter connected with the group string in the photovoltaic power station is optimally calculated, the cable consumption is reduced, the method has great significance on saving the cost of the photovoltaic power station, and meanwhile, the design efficiency can be improved.
Disclosure of Invention
In view of the above, the present invention provides a photovoltaic string cable junction calculation method to optimize the positions of inverters to which strings are connected, and by calculating the optimal positions of the inverters, the path of each string to a photovoltaic cable between the corresponding inverter and a low-voltage cable between the inverter and a box-type transformer is calculated so that the total price of the photovoltaic cable and the low-voltage cable is minimized.
In order to achieve the above purpose, the invention adopts the following technical scheme:
in a first aspect, the present invention provides a method for calculating a photovoltaic sub-array cable confluence path, including:
dividing a field photovoltaic group string into a plurality of subarrays, wherein each subarray is a collection of the photovoltaic group string and comprises a vertex collection describing the shape of each subarray and information of the photovoltaic group string contained in each subarray;
traversing all subarrays, and calculating the position of a box-type transformer in each subarray;
traversing all subarrays, dividing each subarray into a plurality of initial photovoltaic group string subgroups, carrying out grouping optimization on the initial photovoltaic group string subgroups based on a grouping optimization algorithm to obtain final photovoltaic group string subgroups, and calculating the optimal position of an inverter in each final photovoltaic group string subgroup by taking the lowest total price of a cable as a target;
traversing all subarrays, calculating the shortest paths and lengths of cables between the strings in each string subgroup in each subarray and the inverter and between the inverter and the box-type transformer, and calculating the total price of the cables in all subarrays according to the unit price of the cables;
and (3) deriving the cable length and price list required by the calculated field, subarray division information and corresponding box-type transformer positions, and carrying out calculation on group string group information and corresponding combiner box coordinates in each subarray.
Further, dividing each subarray into a plurality of photovoltaic group strings, and calculating the optimal position of the inverter in each group by taking the lowest total price of the cable as a target comprises the following steps:
traversing all subarrays in sequence to obtain all information of the subarrays to be calculated currently, wherein the information comprises vertex sets of the outer boundaries of the subarrays and all photovoltaic group string information contained in the subarrays;
according to the preset group number of the photovoltaic group string subgroups required to be divided by the current subarray, calculating the number of the photovoltaic group strings contained in each subgroup according to an equipartition method, and dividing the subarray into a plurality of initial photovoltaic group string subgroups;
obtaining an outer boundary vertex set of each initial photovoltaic group string subgroup, constructing and recording the affiliation between each initial photovoltaic group string subgroup and the photovoltaic group strings in the subgroup, and the number of group strings contained in each initial photovoltaic group string subgroup;
repartitioning each initial photovoltaic group string subgroup in the current subarray and the photovoltaic group strings contained in the groups by adopting a K-means method to obtain grouping information after optimizing the photovoltaic group strings in the current subarray, namely a final photovoltaic group string subgroup;
calculating the optimal position of the inverter in each group by taking the lowest total price of the cables in each photovoltaic group string group as a target;
and calculating the next subarray according to the steps until the position calculation of the corresponding inverter of each group string subgroup in all subarrays is completed, and storing the calculated positions in the corresponding group string subgroup.
Further, the K-means method is adopted to repartition each initial photovoltaic group string subgroup in the current subarray and the photovoltaic group strings contained in the group, and the method comprises the following steps:
calculating the barycenter coordinates of each photovoltaic group string subgroup in the subarray to obtain the barycenter of each subgroup in the subarray, and relieving the subordinate relations between all subgroups and the photovoltaic group strings contained in the subgroups;
traversing each subgroup to obtain the gravity centers of the current subgroup, calculating the distances between all the photovoltaic group strings in the whole subarray and the gravity centers of the photovoltaic group strings, re-dividing the corresponding number of the photovoltaic group strings closest to the gravity centers of the photovoltaic group strings into the current subgroup according to the number of the photovoltaic group strings contained in each subgroup, traversing the next subgroup, selecting the photovoltaic group strings closest to the subgroup from the photovoltaic group strings which do not have the subordinate relation in the subarray by adopting the same method, and dividing the corresponding number of the photovoltaic group strings into the next subgroup until the subordinate calculation of all the subgroups is completed;
and acquiring an outer boundary vertex set of each newly divided subgroup, calculating the gravity centers of each subgroup, returning to the first step if the new gravity center and the original gravity center change value exceed a threshold value alpha, and continuing the next iterative calculation until the change value is smaller than or equal to the threshold value alpha, and finishing the calculation.
Further, the method for calculating the optimal position of the inverter in each group by taking the lowest total price of the cables in each photovoltaic group string group as a target comprises the following steps:
traversing each photovoltaic group string subgroup to obtain the number n of the photovoltaic group strings in the subgroup to be calculated currently, and obtaining the coordinate values of the positive electrode and the negative electrode of each photovoltaic group string in the subgroup
According to the range formed by maximum value and minimum value of positive and negative electrode coordinate values of all photovoltaic strings in the subgroup, the positions (x 0 ,y 0 ) Classifying the relationship;
sequencing each group string in the photovoltaic group in the x and y directions to obtain sequencing numbers of each group string in the x and y directions;
according to the cable model of the selected group string connected to the inverter and the inverter connected to the box-type transformer, the price per unit length of the two cables is obtained and is recorded as p 1 And p 2 The string number of the inverter in the group that should be closest in the x and y directions is calculated using the following formula:
the x and y values of the inverter's optimal position are calculated using:
and finishing the calculation of the current subgroup, and continuing the calculation of the next subgroup until the calculation of the inverter positions in all subgroups is finished.
Further, according to the range formed by the maximum value and the minimum value of the positive and negative coordinate values of all the photovoltaic strings in the group, the positions (x 0 ,y 0 ) Relationships are classified into eight cases: (1) X is x max <x 0 And y is 0 <y min ；(2)x max <x 0 And y is min ≤y 0 ≤y max ；(3)x max <x 0 And y is max <y 0 ；(4)x min <x 0 <x max And y is max <y 0 ；(5)x 0 <x min And y is max <y 0 ；(6)x 0 <x min And y is min ≤y 0 ≤y max ；(7)x 0 <x min And y is 0 <y min ；(8)x min <x 0 <x max And y is 0 <y min 。
In a second aspect, the present invention also provides a computer, including a memory and a processor, where the memory and the processor are communicatively connected to each other, and the memory stores computer instructions, and the processor executes the computer instructions, so as to execute the method for calculating the photovoltaic sub-array cable bus paths according to the first aspect.
In a third aspect, the present invention also provides a computer readable storage medium, the storage medium including a stored program, wherein the computer readable storage medium stores computer instructions for causing a computer to perform the photovoltaic subarray cable busing path calculation method according to the first aspect. The photovoltaic subarray cable confluence calculation method provided by the invention can be used for completing subarray division calculation in a photovoltaic power station, calculating the optimal position of the inverter in the subarray and the connection path of the cable, so that the sum of the total prices of the photovoltaic cable of the inverter connected with the group and the low-voltage cable of the box-type transformer connected with the inverter is minimum, the cost of the photovoltaic power station is effectively saved, and the design efficiency is improved.
Drawings
Fig. 1 is a flow chart of an embodiment of a method for calculating a photovoltaic sub-array cable confluence path according to the present invention.
Fig. 2 is a schematic diagram of dividing a field photovoltaic string into a plurality of subarrays according to an embodiment of the present invention.
Fig. 3 is a schematic diagram of determining the position of a box transformer within a single subarray in an embodiment of the present invention.
Fig. 4 is a schematic diagram of dividing a single subarray into photovoltaic string subgroups in an embodiment of the present invention.
Fig. 5 is a schematic diagram of calculating the position of the combiner box in the photovoltaic panel according to the embodiment of the present invention.
Fig. 6 is a schematic diagram of calculating the photovoltaic string-to-inverter and inverter-to-box transformer cable paths in an embodiment of the present invention.
Detailed Description
The invention will now be described in further detail with reference to the drawings and the accompanying examples. It will be apparent that the described embodiments are some, but not all, embodiments of the invention. All other embodiments, which can be made by a person skilled in the art without creative efforts, based on the described embodiments of the present invention fall within the protection scope of the present invention. Unless defined otherwise, technical or scientific terms used herein should be given the ordinary meaning as understood by one of ordinary skill in the art to which this invention belongs.
Referring to fig. 1, in an example of the present invention, a method for calculating a photovoltaic sub-array cable junction path includes the following steps:
step S1: the field photovoltaic string is divided into a plurality of subarrays. Each subarray is a collection of photovoltaic group strings and contains information describing the vertex collection of the subarray shape and the photovoltaic group strings contained in the subarray.
And (3) dividing a certain number of photovoltaic group strings in the field region into subarrays, obtaining a vertex set capable of describing the shape of the subarrays according to the coordinates of the photovoltaic group strings contained in the subarrays, constructing the subordinate relation between the contained photovoltaic group strings and the subarrays, and completing the creation of one subarray. The photovoltaic group string comprises common information in the photovoltaic, including positive and negative electrode positions, boundary vertex coordinates of the photovoltaic module and the like. And then a certain number of photovoltaic group strings are marked into the next subarray from the rest group strings in the field, the creation of the next subarray is completed, and the process is repeated until all the photovoltaic group strings in the field are marked, so that the whole field is divided into a plurality of subarrays. Referring now to fig. 2, a sub-array partitioning and creation process is illustrated.
Selecting a certain number of photovoltaic group strings in a field region, as shown in fig. 2, drawing the photovoltaic group strings in a black solid line square frame into the same subarray, calculating the coordinates of each vertex containing the outer boundary of all the selected photovoltaic group strings to obtain a vertex coordinate set of the subarray shape, namely points A, B, C and J in fig. 2, and sequentially connecting the points to obtain the vertex set describing the subarray shape, as shown by black dotted lines in fig. 2. And then, sequentially establishing the subordinate relation between the photovoltaic group strings and the subarrays in the black dotted line boxes, namely indicating that the group strings belong to the subarrays, thereby completing the creation of one subarray.
Step S2: and traversing all subarrays, and calculating the position of the box-type transformer in each subarray.
The box transformer is typically placed at the center or boundary of the subarray. In this embodiment, the calculation method is that, when the sub-array is placed at the center of gravity of the outer boundary shape of the sub-array:
according to the vertex set of the subarray outer boundary shape obtained in the step S1, taking the first point in the set as a basic point, respectively obtaining two subsequent points according to the sequence in the set, forming a triangle with the basic point, and calculating the gravity center g of the triangle 1 (x, y) and area value A 1 . When the sequence of the three points is clockwise, the value is positive, and when the sequence of the three points is anticlockwise, the value is negative, so that the first triangle calculation is completed; then taking a point behind the basic point as a new basic point, acquiring two points behind the new basic point in the set, forming a triangle with the new basic point, and calculating the gravity center g according to the same method 2 (x, y) and area value A 2 Sequentially reciprocating until the last point in the vertex set is taken as a basic point, and forming a last triangle together with the last point and the first point in the vertex set to obtain the gravity center g of each triangle i (x, y) and area value A i And calculating the gravity center position of the whole subarray by using the following formula:
and n is the number of triangles, so that the positions of the subarray box type transformers are obtained, and then the positions of the box type transformers are calculated for other subarrays in sequence until all subarray calculation is completed.
It should be noted that the calculation of the position of the box transformer is not limited to the method described in this embodiment, and the position may be manually determined or may be placed at the centroid, at the midpoint of a certain boundary, or at the vertex of an outer boundary, which is only an example.
A specific calculation process of a subarray is described below with reference to fig. 3.
The subarray vertex set shown in fig. 3 is { a, B, C, & gt, J }, with the point a as the base point, two points after the point a is obtained in the order in the set are B and C, and the triangle is% ABC Calculate the area as S ABC And the gravity center is g ABC The order of ABC three points is clockwise, so the value is positive; then taking the second point B as the basic point, taking the two points after the point B in the set as C and D, and calculating delta BCD Area S of (2) BCD And center of gravity g BCD Since BCD three-point order is clockwise, its value is also positive. When E is taken as a base point, the two subsequent points are F and G, and the triangle is formed as delta EFG Area S EFG The gravity center is g EFG At this time, the EFG three-point sequence is counterclockwise, and its value is negative. Sequentially calculating until I is taken as a base point, and forming delta of the last triangle with the vertexes J and A IJA Calculate its area S IJA And center of gravity g IJA Since the three points IJA are anticlockwise, S IJA The value is negative. And (3) completing calculation of each triangle, and finally calculating the gravity center position of the whole subarray as the position of the box-type transformer:
step S3: traversing all subarrays, dividing each subarray into a plurality of initial photovoltaic group string subgroups, carrying out grouping optimization on the initial photovoltaic group string subgroups based on a grouping optimization algorithm to obtain final photovoltaic group string subgroups, and calculating the optimal position of an inverter in each final photovoltaic group string subgroup by taking the lowest total price of a cable as a target; the method comprises the following specific steps:
step S301: traversing all subarrays in sequence to obtain all information of the subarrays to be calculated currently, namely vertex sets of the outer boundaries of the subarrays and all photovoltaic group string information contained in the subarrays;
step S302: calculating the number of photovoltaic group strings contained in each subgroup according to the group number of the photovoltaic group string subgroups required to be divided by the subarrays according to an equipartition method, wherein the number of the subgroups divided by each subarray is known information as described above;
step S303: dividing the subarrays into a plurality of photovoltaic group string subgroups, obtaining an outer boundary vertex set of each photovoltaic group string subgroup, constructing and recording the subordinate relations between the photovoltaic group string subgroups and the photovoltaic group strings in the subgroups, and calculating in the step S302 to obtain the number of group strings which each photovoltaic group string subgroup should contain; the step is basically the same as that in the step S1, a photovoltaic group string in an area is selected as a subgroup, the subarrays are divided into a plurality of photovoltaic group string subgroups, and the subordinate relation between each photovoltaic group string subgroup and the photovoltaic group strings contained in the subarrays is recorded to obtain the subgroup group condition of each photovoltaic group string;
step S304: the K-means method is adopted as a grouping optimization algorithm to re-divide each subgroup in the subarray and the photovoltaic group strings contained in the subgroup, and grouping information of the photovoltaic group strings in the final subarray is obtained, and the method comprises the following specific steps:
step S3041: calculating the barycenter coordinates of each photovoltaic group string subgroup in the subarray to obtain barycenters in each subgroup in the subarray, and relieving the subordinate relations between all subgroups and the photovoltaic group strings contained in the subgroups;
step S3042: traversing each subgroup to obtain the gravity centers of the current subgroup, calculating the distances between all the photovoltaic group strings in the whole subarray and the gravity centers of the photovoltaic group strings, and re-dividing the photovoltaic group strings with the closest distance to the gravity centers into the current subgroup according to the number of the photovoltaic group strings contained in each subgroup; traversing the next subgroup, adopting the same method, selecting the photovoltaic group strings with the nearest distance from which no subordinate relation is constructed in the subarrays, and dividing the corresponding number of photovoltaic group strings into the next subgroup until all subgroup subordinate calculations are completed;
step S3043: and (3) acquiring an outer boundary vertex set of each newly divided subgroup, calculating the center of gravity of each subgroup, returning to the step (S3041) if the change of the new center of gravity and the original center of gravity exceeds a threshold value alpha, continuing the next iterative calculation, if the change of the new center of gravity and the original center of gravity is smaller than or equal to the threshold value alpha, indicating that the calculation is completed, exiting the calculation, and entering the step (S305).
The above steps will now be described in detail with reference to fig. 4. The initially divided photovoltaic group string subgroups are shown in fig. 4 (a), 46 photovoltaic group strings are shared in the figure, group string numbers are divided into 1, 2, 3, … and 46, the group string subgroups are divided into 4 photovoltaic group string subgroups, subgroup numbers are marked as (1), (2), (3) and (4), the gravity center position of each subgroup is shown as (1), (2), (3) and (4), each subgroup comprises group string numbers in black boxes, the group string numbers are in subordinate relation, and the group string numbers of each subgroup are respectively 11,12 and 12.
The initial dependence of the group and each group string is relieved, the distances between all the group strings and the center of gravity of the group strings are calculated, the group strings are arranged according to the distance from small to large, the distance arrangement results are 4,5,3,6,2, … and 35, the first 11 photovoltaic group strings are selected according to the arrangement results and are divided into the group strings (1) to serve as a new group (1), the dependence between the new group (1) and the divided group strings is constructed, the group strings which are not divided into the group strings except the group strings contained in the new group (1) at this time are other group strings except the group strings contained in the new group, the distances between the remaining group strings which are not divided into and the center of gravity of the group (2) are calculated, the group strings which are not divided into the group strings are arranged according to the distance from small to large, the first 11 photovoltaic groups are selected according to the number of the group strings (2), the remaining group strings which are not divided into the group strings are calculated, and the new groups (3) and (4) are calculated successively by the same method, so that each group string which is contained in the group strings is obtained.
The new barycenter positions of all the subgroups are recalculated, as shown in fig. 4 (b), the sub-group and group string relationships are continuously re-divided by adopting the same method of the previous section, a new grouping result is obtained, until the distance between the barycenters of the original subgroup of the last new subgroup barycenter position is smaller than a threshold value alpha, the grouping is considered to be completed, the final result is as shown in fig. 4 (c), and the grouping of other sub-groups is continuously completed.
It should be noted that the above only shows an example of using the K-means method as the packet optimization algorithm. In other embodiments of the present invention, the optimization may also be performed using a gaussian blur algorithm, a DBSCAN algorithm, or the like, which is not particularly limited herein.
Step S305: and calculating the optimal position of the inverter in each group by taking the lowest total price of the cables in each group as a target, wherein the calculation method is as follows:
step S3051: traversing each subgroup to obtain the number n of photovoltaic group strings in the subgroup to be calculated currently, and obtaining the coordinate value of the positive electrode of each photovoltaic group string in the subgroup
Step S3052: according to the maximum value and minimum value range of the positive and negative electrode coordinate values of all the photovoltaic strings in the subgroup, the positions (x 0 ,y 0 ) The relationship is divided into eight cases: (1) X is x max <x 0 And y is 0 <y min ；(2)x max <x 0 And y is min ≤y 0 ≤y max ；(3)x max <x 0 And y is max <y 0 ；(4)x min <x 0 <
x max And y is max <y 0 ；(5)x 0 <x min And y is max <y 0 ；(6)x 0 <x min And y is min ≤y 0 ≤y max ；(7)
x 0 <x min And y is 0 <y min ；(8)x min <x 0 <x max And y is 0 <y min ；
Step S3053: and sequencing each group string in the photovoltaic group in the x and y directions to obtain the sequence number of each group string in the x and y directions. The specific method comprises the following steps:
a. in the x direction, for cases (5) to (7) in step S3052, the group strings in the group are ordered from large to small according to the x value; in other cases, the group strings in the group are ordered from small to large according to the value of x;
b. in the y direction, for cases (2) to (6) in step S3052, the group strings in the group are ordered from small to large according to the y value; in other cases, the group strings in the group are ordered from big to small according to the y value;
c. when the x values are the same in the x direction sorting, distinguishing by referring to a sorting method in the y direction; the same applies to the y-direction.
Step S3054: according to the cable model of the selected group string connected to the inverter and the inverter connected to the box transformer, the price per unit length of the two cables is obtained and is recorded as p 1 And p 2 The string number of the inverter in the group that should be closest in the x and y directions is calculated using the following formula:
step S3055: the x and y values of the inverter's optimal position are calculated using:
step S3056: and finishing the calculation of the current subgroup, and continuing the calculation of the next subgroup until the calculation of the inverter positions in all subgroups is finished.
The above calculation process will now be described with reference to fig. 5. As shown in fig. 5 (a), a subarray, a group to be calculated, strings a group gray area, and the maximum and minimum coordinates of the group satisfy the condition (1) in step S3052, so that the x direction is ordered from small to large and the y direction is ordered from large to small, and as a result, as shown in fig. 5 (b), where n=11, if p is taken 2 ＝5p 1 The position of the inverter is calculated according to steps S3054 and S3055, and finally the coordinates of the inverter are obtained as shown in fig. 5 (c). And similarly, calculating the positions of the corresponding inverters for other groups of strings by adopting the same method.
Step S306: returning to step S302, calculating the next subarray until the position calculation of the inverter corresponding to each group string subgroup in all subarrays is completed, and storing the calculated positions in the corresponding group string subgroup.
Step S4: traversing all subarrays, calculating the shortest path and the length of the cables between the group strings and the inverter and between the inverter and the box-type transformer in each group string subgroup in each subarray, and calculating the total price of the two cables in all subarrays according to the unit price of the cables.
Traversing each subarray in turn to obtain a group string subgroup in each subarray, further obtaining each group string in the group string subgroup, calculating Hamiltonian distance between cable connection points of positive and negative poles of the group string and coordinates of the corresponding inverter of the group, and obtaining a sum l of cable lengths between all group strings and the inverters after the cable lengths and paths of all group strings and the inverters in the subgroup are calculated as the cable paths and lengths between the group strings and the inverters 1 Calculating Hamiltonian distance between the inverter and the sub-array box transformer as the cable path and length l of the group of inverters and box transformers 2 The method comprises the steps of carrying out a first treatment on the surface of the Repeating the step until all the group string groups in the subarrays are calculated, and obtaining the sum of the lengths of the two cables in the subarrays: l (L) 1 And L 2 . Finally repeating the steps for each sub-array to obtain the sum of the lengths of the two cables in each sub-array, and further obtaining the sum of the two cables in the whole field region: l (L) c And L l The corresponding unit price is multiplied respectively to obtain the total price p of the cable in the whole field area 1 ×L c And p 2 ×L l 。
The calculation process is described below with reference to fig. 6.
In the group serial group numbers shown in fig. 6 (a), the positive and negative poles of the group serial numbers 1 and 23 are shown in the figure, the shortest path of the cable connected with the positive and negative poles of the group serial number 1 to the inverter is shown by a black double-headed arrow dot-dash line in the figure, the paths of other group serial groups of the group to the inverter can be obtained similarly, the path is easy to calculate, no special algorithm is needed, and the sum l of the lengths of the cables of the groups serial to the inverter in the group 1 The method can be calculated as follows:
similarly, the cable length of the group inverter to the box transformer:
l 2 ＝|x reverse direction -x o |+|x Reverse direction -y o |
As shown in fig. 6 (b), the black double-headed arrow dash-dot line in the figure is the cable path from the inverter to the box-type transformer, and the same calculation method is adopted for other groups in the subarray to obtain the total length L of the two cables in the subarray 1 And L 2 And repeating the steps to obtain the total lengths of two cables of all subarrays, and finally obtaining the paths of the inverters of all group strings in the whole field, the total lengths of the cables between the group strings and the inverters in the field, the total lengths of the cables of the box-type transformer connected with the inverters and the total price of all the cables in the field.
Step S5: and (3) deriving the length and price list of each type of cable in the field after calculation, subarray dividing information and corresponding box-type transformer positions, and carrying out calculation by using group string group information and corresponding combiner box coordinates in each subarray.
The embodiment of the invention also provides a computer, which comprises a memory and a processor, wherein the memory and the processor are in communication connection, the memory stores computer instructions, and the processor executes the computer instructions, so that the photovoltaic subarray cable confluence path calculation method disclosed by the embodiment of the invention is executed.
Embodiments of the present invention also provide a computer-readable storage medium including a stored program, wherein the computer-readable storage medium stores computer instructions for causing a computer to execute the photovoltaic sub-array cable junction path calculation method shown in the foregoing embodiments when the computer is run.
It will be apparent to those skilled in the art that the modules or steps of the invention may be implemented in a general purpose computing device, and they may be centralized on a single computing device, or distributed across a network of computing devices. Alternatively, they may be implemented in program code executable by a computing device, such that they are stored in a storage device for execution by the computing device, and in some cases, the steps shown or described may be performed in a different order than what is shown or described, or they may be separately fabricated into individual integrated circuit modules, or a plurality of modules or steps in them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
The above description of the embodiments is only for aiding in the understanding of the method of the present invention and its core ideas. It should be noted that it will be apparent to those skilled in the art that various modifications and adaptations of the invention can be made without departing from the principles of the invention and these modifications and adaptations are intended to be within the scope of the invention as defined in the following claims.
Claims (6)
1. The calculation method of the photovoltaic subarray cable confluence path is characterized by comprising the following steps of:
dividing a field photovoltaic group string into a plurality of subarrays, wherein each subarray is a collection of the photovoltaic group string and comprises a vertex collection describing the shape of each subarray and information of the photovoltaic group string contained in each subarray;
traversing all subarrays, and calculating the position of a box-type transformer in each subarray;
traversing all subarrays, dividing each subarray into a plurality of initial photovoltaic group string subgroups, carrying out grouping optimization on the initial photovoltaic group string subgroups based on a grouping optimization algorithm to obtain final photovoltaic group string subgroups, and calculating the optimal position of an inverter in each final photovoltaic group string subgroup by taking the lowest total price of a cable as a target, wherein the method comprises the following steps of:
traversing each final photovoltaic group string subgroup to obtain the number n of the photovoltaic group strings in the current subgroup to be calculated, and obtaining the coordinate values of the positive electrode and the negative electrode of each photovoltaic group string in the subgroup；
According to the range formed by maximum value and minimum value of positive and negative electrode coordinate values of all photovoltaic strings in the subgroup, the positions (x 0 , y 0 ) Classifying the relationship;
sequencing each group string in the photovoltaic group in the x and y directions to obtain sequencing numbers of each group string in the x and y directions;
according to the cable model of the selected group string connected to the inverter and the inverter connected to the box-type transformer, the price per unit length of the two cables is obtained and is recorded as p 1 And p 2 The string number of the inverter in the group that should be closest in the x and y directions is calculated using the following formula:
the x and y values of the inverter's optimal position are calculated using:
completing the calculation of the current subgroup, and continuing the calculation of the next subgroup until the calculation of the positions of the inverters in all subgroups is completed;
traversing all subarrays, calculating the shortest paths and lengths of cables between the strings in each string subgroup in each subarray and the inverter and between the inverter and the box-type transformer, and calculating the total price of the cables in all subarrays according to the unit price of the cables;
and (3) deriving the cable length and price list required by the calculated field, subarray division information and corresponding box-type transformer positions, and carrying out calculation on group string group information and corresponding combiner box coordinates in each subarray.
2. The method for calculating the cable confluence paths of the photovoltaic subarrays according to claim 1, wherein the step of dividing each subarray into a plurality of photovoltaic group strings and calculating the optimal position of the inverter in each group with the aim of minimizing the total price of the cable comprises the following steps:
traversing all subarrays in sequence to obtain all information of the subarrays to be calculated currently, wherein the information comprises vertex sets of the outer boundaries of the subarrays and all photovoltaic group string information contained in the subarrays;
according to the preset group number of the photovoltaic group string subgroups required to be divided by the current subarray, calculating the number of the photovoltaic group strings contained in each subgroup according to an equipartition method, and dividing the subarray into a plurality of initial photovoltaic group string subgroups;
obtaining an outer boundary vertex set of each initial photovoltaic group string subgroup, constructing and recording the affiliation between each initial photovoltaic group string subgroup and the photovoltaic group strings in the subgroup, and the number of group strings contained in each initial photovoltaic group string subgroup;
repartitioning each initial photovoltaic group string subgroup in the current subarray and the photovoltaic group strings contained in the groups by adopting a K-means method to obtain grouping information after optimizing the photovoltaic group strings in the current subarray, namely a final photovoltaic group string subgroup;
calculating the optimal position of the inverter in each group by taking the lowest total price of the cables in each photovoltaic group string group as a target;
and calculating the next subarray according to the steps until the position calculation of the corresponding inverter of each group string subgroup in all subarrays is completed, and storing the calculated positions in the corresponding group string subgroup.
3. The method of photovoltaic subarray cable buss path computation of claim 2, wherein repartitioning each initial photovoltaic string subgroup within the current subarray and the photovoltaic string contained within the group using the K-means method comprises the steps of:
calculating the barycenter coordinates of each photovoltaic group string subgroup in the subarray to obtain the barycenter of each subgroup in the subarray, and relieving the subordinate relations between all subgroups and the photovoltaic group strings contained in the subgroups;
traversing each subgroup to obtain the gravity centers of the current subgroup, calculating the distances between all the photovoltaic group strings in the whole subarray and the gravity centers of the photovoltaic group strings, re-dividing the corresponding number of the photovoltaic group strings closest to the gravity centers of the photovoltaic group strings into the current subgroup according to the number of the photovoltaic group strings contained in each subgroup, traversing the next subgroup, selecting the photovoltaic group strings closest to the subgroup from the photovoltaic group strings which do not have the subordinate relation in the subarray by adopting the same method, and dividing the corresponding number of the photovoltaic group strings into the next subgroup until the subordinate calculation of all the subgroups is completed;
and acquiring an outer boundary vertex set of each newly divided subgroup, calculating the gravity centers of each subgroup, returning to the first step if the new gravity center and the original gravity center change value exceed a threshold value alpha, and continuing the next iterative calculation until the change value is smaller than or equal to the threshold value alpha, and finishing the calculation.
4. The method for calculating a cable-confluence path of a photovoltaic sub-array according to claim 1, wherein the positions (x 0 , y 0 ) Relationships are classified into eight cases: (1)x max < x 0 And y is 0 < y min ；（2）x max < x 0 And is also provided withy min ≤ y 0 ≤ y max ；（3）x max < x 0 And is also provided withy max < y 0 ；（4）x min < x 0 < x max And is also provided withy max < y 0 ；（5）x 0 < x min And is also provided withy max < y 0 ；（6）x 0 < x min And is also provided withy min ≤ y 0 ≤ y max ；（7）x 0 < x min And y is 0 < y min ；（8）x min < x 0 < x max And y is 0 < y min 。
5. A computer comprising a memory and a processor in communication with each other, the memory having stored therein computer instructions, the processor executing the method of photovoltaic sub-array cable buss path computation as claimed in any one of claims 1-4 by executing the computer instructions.
6. A computer-readable storage medium comprising a stored program, wherein the computer-readable storage medium stores computer instructions for causing a computer to perform the photovoltaic sub-array cable junction path calculation method of any one of claims 1-4 when the computer is run.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310397101.6A CN116644538B (en) | 2023-04-11 | 2023-04-11 | Photovoltaic subarray cable confluence path calculation method, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310397101.6A CN116644538B (en) | 2023-04-11 | 2023-04-11 | Photovoltaic subarray cable confluence path calculation method, computer equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116644538A CN116644538A (en) | 2023-08-25 |
| CN116644538B true CN116644538B (en) | 2024-04-05 |
Family
ID=87617707
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310397101.6A Active CN116644538B (en) | 2023-04-11 | 2023-04-11 | Photovoltaic subarray cable confluence path calculation method, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116644538B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110266055A (en) * | 2019-07-31 | 2019-09-20 | 合肥阳光新能源科技有限公司 | A kind of photovoltaic power station arrangement method, device and photovoltaic plant |
| CN110955970A (en) * | 2019-11-27 | 2020-04-03 | 合肥阳光新能源科技有限公司 | Photovoltaic power station layout method and device |
| CN211981762U (en) * | 2020-04-15 | 2020-11-20 | 协鑫能源工程有限公司 | Inverter mounting bracket and inverter system |
| CN212435640U (en) * | 2020-05-27 | 2021-01-29 | 协鑫能源工程有限公司 | Photovoltaic array and photovoltaic power generation system |
| CN113098054A (en) * | 2021-03-31 | 2021-07-09 | 天津大学 | Photovoltaic system direct current side layout and route optimization method |
| CN113534854A (en) * | 2021-09-15 | 2021-10-22 | 江苏中信博新能源科技股份有限公司 | Photovoltaic tracking support matrix position generation method and system |
| CN114169281A (en) * | 2021-12-07 | 2022-03-11 | 阳光新能源开发股份有限公司 | Method, device and equipment for dividing convergence area and storage medium |
| CN114218734A (en) * | 2022-02-23 | 2022-03-22 | 浙江华东工程数字技术有限公司 | Optimal path planning and calculating method for cable |
| CN114460404A (en) * | 2022-01-27 | 2022-05-10 | 国家电投集团杭州新能源生产运营有限公司 | Inverter efficiency monitoring method and system based on photovoltaic module level Internet of things |
| CN115147597A (en) * | 2021-03-31 | 2022-10-04 | 华为数字能源技术有限公司 | Positioning method and device of photovoltaic module and electronic equipment |
| CN115438451A (en) * | 2022-09-21 | 2022-12-06 | 阳光新能源开发股份有限公司 | Photovoltaic module serial line arrangement determining method and device and electronic equipment |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110829427B (en) * | 2019-11-26 | 2023-09-26 | 远景智能国际私人投资有限公司 | String connection method, device and equipment of photovoltaic module and storage medium |
-
2023
- 2023-04-11 CN CN202310397101.6A patent/CN116644538B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110266055A (en) * | 2019-07-31 | 2019-09-20 | 合肥阳光新能源科技有限公司 | A kind of photovoltaic power station arrangement method, device and photovoltaic plant |
| CN110955970A (en) * | 2019-11-27 | 2020-04-03 | 合肥阳光新能源科技有限公司 | Photovoltaic power station layout method and device |
| CN211981762U (en) * | 2020-04-15 | 2020-11-20 | 协鑫能源工程有限公司 | Inverter mounting bracket and inverter system |
| CN212435640U (en) * | 2020-05-27 | 2021-01-29 | 协鑫能源工程有限公司 | Photovoltaic array and photovoltaic power generation system |
| CN113098054A (en) * | 2021-03-31 | 2021-07-09 | 天津大学 | Photovoltaic system direct current side layout and route optimization method |
| CN115147597A (en) * | 2021-03-31 | 2022-10-04 | 华为数字能源技术有限公司 | Positioning method and device of photovoltaic module and electronic equipment |
| CN113534854A (en) * | 2021-09-15 | 2021-10-22 | 江苏中信博新能源科技股份有限公司 | Photovoltaic tracking support matrix position generation method and system |
| CN114169281A (en) * | 2021-12-07 | 2022-03-11 | 阳光新能源开发股份有限公司 | Method, device and equipment for dividing convergence area and storage medium |
| CN114460404A (en) * | 2022-01-27 | 2022-05-10 | 国家电投集团杭州新能源生产运营有限公司 | Inverter efficiency monitoring method and system based on photovoltaic module level Internet of things |
| CN114218734A (en) * | 2022-02-23 | 2022-03-22 | 浙江华东工程数字技术有限公司 | Optimal path planning and calculating method for cable |
| CN115438451A (en) * | 2022-09-21 | 2022-12-06 | 阳光新能源开发股份有限公司 | Photovoltaic module serial line arrangement determining method and device and electronic equipment |
Non-Patent Citations (4)
| Title |
|---|
| A comprehensive and fully predictive discrete methodology for volumetric solar receivers: application to a functional parabolic dish solar collector system;Jorge E.P. Navalho;Applied Energy;20200408;第1-17页 * |
| 充电站的储能优化配置研究;陈鑫;中国优秀硕士论文电子期刊网;20220315;第C034-1451页 * |
| 基于改进聚类算法的光伏电站电缆优化布置;王敏;王鹤梅;蒋克勇;耿照江;许建;;自动化与仪器仪表;20170225(02);第155-158页 * |
| 黄勇.分布式光伏系统优化设计软件的研究.第C042-1491页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116644538A (en) | 2023-08-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112650248B (en) | Routing inspection robot path planning method and system based on improved genetic algorithm | |
| US20230298237A1 (en) | Data processing method, apparatus, and device and storage medium | |
| CN111371402B (en) | Layout method, device and equipment of converging equipment in photovoltaic power station and storage medium | |
| CN116644538B (en) | Photovoltaic subarray cable confluence path calculation method, computer equipment and storage medium | |
| CN108614889B (en) | Moving object continuous k nearest neighbor query method and system based on Gaussian mixture model | |
| CN116976057A (en) | Automatic arrangement method for device layout | |
| CN110705650A (en) | Metal plate layout method based on deep learning | |
| CN115438451A (en) | Photovoltaic module serial line arrangement determining method and device and electronic equipment | |
| CN112861293B (en) | Power transmission network wiring diagram generation method and device and electronic equipment | |
| CN115526267A (en) | Power distribution network operation scene extraction method and device | |
| CN114722547A (en) | Photovoltaic module serial line arrangement determining method and device, electronic equipment and storage medium | |
| CN115456268A (en) | Guide roller manufacturing resource optimal allocation method, device, equipment and medium | |
| CN112231939A (en) | Ant colony sequencing positioning method for circular layout in cable processing | |
| CN107529638B (en) | Accelerated method, storage database and the GPU system of linear solution device | |
| CN116417995A (en) | Method, device, equipment and medium for calculating generated energy | |
| CN115221103A (en) | Computing device, data processing method and related product | |
| CN111753391B (en) | Power transmission line design method and system based on maximum field intensity of surface of split conductor | |
| US11973662B1 (en) | Intelligent mapping method for cloud tenant virtual network based on reinforcement learning model | |
| CN111651863B (en) | Overhead transmission line design method and system based on split conductor equivalent radius | |
| CN115618542B (en) | GIS single line diagram-based power distribution network ring network diagram generation method and system | |
| CN116579288B (en) | Analog integrated circuit layout method and system | |
| CN115470176B (en) | Computing device, method for implementing convolution operation by utilizing computing device and related product | |
| Ariffin et al. | Transformation of DCG onto DAG for task assignment problem | |
| CN106161638A (en) | A kind of power system load discharging method | |
| CN115357383A (en) | Calculation task mapping method and device in digital-analog hybrid simulation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |