CN111488663A - Solving method for optimal division scheme of power distribution network cells - Google Patents
Solving method for optimal division scheme of power distribution network cells Download PDFInfo
- Publication number
- CN111488663A CN111488663A CN202010303077.1A CN202010303077A CN111488663A CN 111488663 A CN111488663 A CN 111488663A CN 202010303077 A CN202010303077 A CN 202010303077A CN 111488663 A CN111488663 A CN 111488663A
- Authority
- CN
- China
- Prior art keywords
- cells
- cell
- load points
- division scheme
- scheme
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 25
- 230000032823 cell division Effects 0.000 claims abstract description 44
- 238000011156 evaluation Methods 0.000 claims abstract description 26
- 238000005457 optimization Methods 0.000 claims description 12
- 238000000638 solvent extraction Methods 0.000 claims description 7
- 238000005192 partition Methods 0.000 claims description 5
- 238000004364 calculation method Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 238000011158 quantitative evaluation Methods 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 238000012935 Averaging Methods 0.000 description 1
- 230000001174 ascending effect Effects 0.000 description 1
- 239000012141 concentrate Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000005259 measurement Methods 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
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
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/06—Energy or water supply
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2113/00—Details relating to the application field
- G06F2113/04—Power grid distribution networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y04—INFORMATION OR COMMUNICATION TECHNOLOGIES HAVING AN IMPACT ON OTHER TECHNOLOGY AREAS
- Y04S—SYSTEMS INTEGRATING TECHNOLOGIES RELATED TO POWER NETWORK OPERATION, COMMUNICATION OR INFORMATION TECHNOLOGIES FOR IMPROVING THE ELECTRICAL POWER GENERATION, TRANSMISSION, DISTRIBUTION, MANAGEMENT OR USAGE, i.e. SMART GRIDS
- Y04S10/00—Systems supporting electrical power generation, transmission or distribution
- Y04S10/50—Systems or methods supporting the power network operation or management, involving a certain degree of interaction with the load-side end user applications
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- Economics (AREA)
- Health & Medical Sciences (AREA)
- Geometry (AREA)
- Mathematical Analysis (AREA)
- Water Supply & Treatment (AREA)
- Evolutionary Computation (AREA)
- General Engineering & Computer Science (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Optimization (AREA)
- Computational Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Public Health (AREA)
- Computer Hardware Design (AREA)
- General Health & Medical Sciences (AREA)
- Human Resources & Organizations (AREA)
- Marketing (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses a solving method of an optimal division scheme of power distribution network cells, which comprises the following steps: step 1, determining an evaluation method for the advantages and disadvantages of a power distribution network cell division scheme, and considering that the more concentrated the load points in the cells are, the more excellent the division scheme with fewer boundary lines of roads, railways, rivers and the like crossed by the cells is; step 2, dividing load points which are close to each other into the same cell by adopting a clustering algorithm according to a given distribution network area needing cell division and a given cell division number, and determining an initial cell division scheme according to the load points; step 3, adjusting the initial cell division scheme, reducing the number of times that the cells cross the boundary as much as possible, and ensuring the relative concentration of the load points in the cells, wherein the specific method is to find out sub-areas divided by the boundary in each cell, and if the load points in the sub-areas are less, the load points are considered to be classified into other cells nearby, so as to reduce the number of times that the cells cross the boundary; and 4, further optimizing the preliminarily adjusted cell division scheme, and if the load points in a certain cell are not concentrated any more, classifying the load points which are far away from the geometric center of the load points in the cell into the nearby cells.
Description
Technical Field
The invention relates to generation of an optimal division scheme of power distribution network cells, and belongs to the field of power distribution network planning.
Background
The power distribution network planning work is reasonably carried out, and the method has great significance for guaranteeing economic, safe and reliable operation of a power grid, meeting power load development requirements and rationalizing resource allocation. The traditional power distribution network lacks unified planning and construction, so that the line power supply range is fuzzy, the contact relation is complex, phenomena such as roundabout power supply and overlong power supply radius occur, and the problem of power supply bottleneck is more and more prominent.
Aiming at the problem, students at home and abroad carry out extensive research on the distribution network planning problem. Because the domestic power distribution network is not provided with a high-reliability grid structure and a perfect fine power supply unit planning in developed countries, the domestic power distribution network at present mainly adopts a unit system planning, namely all load points in the power distribution network are divided into a plurality of unit grids. The high-quality cell division scheme is to concentrate the load points in each cell as much as possible so as to reduce the average power supply radius of the 110kV distribution transformer and avoid the situation that the cells cross the boundary lines of roads, railways, rivers and the like as much as possible. At present, a method for solving an optimal scheme for dividing the cells of the power distribution network is still lacked in related research results, so that the problems of strong subjectivity and low dividing efficiency exist in the division of the cells of the power distribution network. Therefore, an algorithm for solving the optimal cell division scheme according to the given distribution network and the number of the cells is needed to be provided, so that the rationality of the distribution network cell division is improved.
Disclosure of Invention
The purpose of the invention is as follows: according to the basic principle of distribution network cell division, a method capable of generating an optimal cell division scheme according to the distribution of load points in a given distribution network and the positions of boundary lines such as roads, railways and rivers and the like and the set number of cells is provided, so that the problems of time and labor waste and strong subjectivity in manual cell division are solved, and the division rationality and the division efficiency of the distribution network cells are improved.
The technical scheme is as follows: in order to achieve the purpose, the invention provides a solving method of an optimal division scheme of a power distribution network cell, which adopts the following technical scheme:
a method for solving an optimal division scheme of power distribution network cells comprises the following steps:
step 1: determining an evaluation method for the advantages and disadvantages of the division schemes of the cells of the power distribution network, and considering that the more concentrated the load points in the cells are, the more excellent the division schemes with fewer boundary lines of roads, railways, rivers and the like crossed by the cells are;
step 2: according to a given distribution network area needing cell division and a given number of cell divisions, dividing load points which are close to each other into the same cell by adopting a clustering algorithm, and determining an initial cell division scheme according to the load points;
and step 3: adjusting an initial cell division scheme, reducing the number of times that the cells cross the boundary as much as possible, and ensuring the relative concentration of load points in the cells at the same time, wherein the specific method is to find out sub-areas divided by the boundary in each cell, and if the number of load points contained in the sub-areas is less, the load points are considered to be classified into other cells nearby so as to reduce the number of times that the cells cross the boundary;
and 4, step 4: and further optimizing the cell division scheme, and if the load points in a certain cell are not concentrated any more, classifying the load points which are far away from the geometric center of the load points in the cell into the nearby cells under the condition of not crossing the boundary.
In the technical scheme, the evaluation method for the advantages and disadvantages of the distribution network cell division scheme comprehensively considers two factors of the concentration degree of load points in the cells and the number of times of crossing the boundary of the cells. Firstly, measuring the quality of each cell, measuring the concentration degree of load points by using the distance average value from the geometric center of all load points in each cell to each load point, and weighting and averaging the distance average value in each cell and the number of times of crossing a boundary to obtain a comprehensive evaluation value of the cell, wherein the smaller the value is, the better the cell is divided; the sum of squares of the overall evaluation values of all the cells is used as the overall evaluation value of the entire division scheme, and the lower the evaluation value, the more excellent the division scheme.
In the above technical solution, the initial cell division scheme is determined by a clustering algorithm, and first, initial centers that are the same as the number of cells to be divided are determined, and then all load points are associated with the centers closest to the initial centers, so that all load points are divided into groups that are the same as the number of cells to be divided, then the geometric centers of the load points in each group are found, and the above load point grouping and center position updating operations are repeated until the center positions are not changed. According to the principle that load points with similar positions are in the same group, the load points are divided into groups with the same number as the cells needing to be divided, and the groups are the initial cell division scheme.
In the above technical solution, the method for adjusting the initial partitioning scheme includes: firstly, finding out an area which is cut out by a boundary line and contains less than 3 load points in each cell; then, for each region, after all the load points are classified into other cells nearest to the region, the comprehensive evaluation value of the division scheme is obtained, and whether the adjusted division scheme is more optimal than before is compared, so that whether the adjustment is accepted is determined; and finally, recalculating the geometric center of the load point of each cell according to the new cell division scheme.
In the above technical solution, the method for further optimizing the adjusted partitioning scheme is as follows: firstly, the average distance from all load points to the geometric center of the load points in each cell is calculated, and the cells with overlarge distance (larger than the average value of all the cells and the difference between the average value and the standard deviation is larger than 3 times) are screened out; then, in the cells, trying to classify the load points with the distance to the geometric center larger than the average value into other cells which are nearest to the load points and do not need to cross a boundary, calculating a comprehensive evaluation value of a classification scheme obtained by optimizing each formed optimization scheme, and selecting the optimal optimization scheme for optimization according to the comprehensive evaluation value; and finally, according to the new cell division scheme, recalculating the geometric center of each cell.
Has the advantages that: the method provided by the invention can solve the optimal cell division scheme taking the load point concentration degree and the number of times of crossing the boundary of the cells as the measurement standard, thereby improving the accuracy of cell division in the power distribution network cell system planning and saving the time and labor required by manual cell division.
Drawings
FIG. 1 is a flow chart for merging closely located load points using a clustering algorithm;
FIG. 2 is a schematic diagram illustrating adjustment of cells to which a small number of load points cut out by boundaries belong;
fig. 3 is a schematic diagram for further optimizing the case where the load point in the divided cell is farther from the geometric center.
Detailed Description
The present invention will be described in detail below with reference to the accompanying drawings.
1. Firstly, evaluating the quality of the cell division scheme from two angles of the concentration degree of the load points in the cells and the number of times of cutting the cells by the boundary lines, and carrying out quantitative evaluation by the following specific steps:
(1) calculating the geometric centers of all load points in each cell, and calculating the average value from each load point to the geometric center, wherein the specific method comprises the following steps:
let m load points in the ith cell and the coordinates of the jth load point be (x)j,yj) Then the geometric center coordinates of all the load points in the ith cell are
The average value of the distances from each point in the ith cell to the geometric center is
(2) Counting the cutting times of each cell by the boundary, and the method comprises the following specific steps:
① find the range of the abscissa of all the load points in the ith cell, which is denoted as [ x ]min,xmax]；
② on the abscissa x ∈ [ x ]min,xmax]Is carried out within the range ofSearching and finding out the minimum and maximum load points of the ordinate in all the load points with the abscissa of x.
③ connecting all the load points with the smallest ordinate found in step ② in turn according to the ascending order of the abscissa;
④ connecting all the load points with the largest vertical coordinate found in step ② in turn according to the sequence of the horizontal coordinate from small to large;
⑤ with a connection abscissa of xminLoad points with minimum and maximum ordinate; connecting abscissa of xmaxThe ordinate is the minimum and maximum load point. Thereby forming a complete cell boundary connected by line segments.
⑥ obtaining the number of intersections of the boundary line of the jth boundary line and the boundary line of the ith cell according to the analytic geometric equation corresponding to each line segment on the cell boundary line, dividing the number of intersections by 2 to obtain the number t of times that the jth boundary line cuts the ith cellij；
⑦ set a total of l boundary lines, the statistic result of the ith cell is
(3) Calculating the respective comprehensive evaluation value of each unit cell as
ci＝w1ai+w2bi
In the formula, w1And w2Weights for reflecting the importance of two factors, namely the load concentration degree and the cutting frequency of the cell, are respectively set according to actual requirements;
(4) calculating the sum of squares of the comprehensive evaluation values of each cell in the division scheme as the comprehensive evaluation value of the whole division scheme, namely the comprehensive evaluation value of the whole division scheme is
The lower the overall evaluation value is, the more excellent the partitioning scheme is. The influence caused by unreasonable cell division can be fully reflected by adopting the calculation method.
2. Then, a clustering algorithm is adopted to perform preliminary cell division according to the given number of the cells to be divided and the positions of the load points, and the specific steps are as follows:
(1) note that the number of cells to be divided is n. First, the positions of n initial cluster centers are determined. The distribution density of the initial centers should coincide with the load points, i.e. the more dense the load points are, the more densely the initial cluster centers should be placed; at the same time, too close a distance of the cluster centers to each other should also be avoided. Therefore, the following method can be taken to set the position of the initial cluster center:
① randomly selecting 1 point from the load points as the 1 st initial clustering center;
② selecting the load point farthest from the 1 st initial cluster center as the 2 nd initial cluster center;
③ selecting the load point with the largest distance from the nearest initial cluster center among all the residual load points as the next initial cluster center;
④ repeat step ③ until the number of initial cluster centers is reached.
(2) And respectively associating all the load points to the nearest cluster centers. Thereby dividing all load points into n groups;
(3) solving the geometric center of each group of load points, and taking the n geometric centers as new n clustering centers;
(4) and (5) repeating the steps (2) and (3) until the position of the cluster center is not changed any more.
3. Then, since the initial partition scheme obtained by the clustering algorithm does not consider the influence of the boundary, the cell partition scheme needs to be adjusted according to the position of the boundary, and the adjustment method is described by taking fig. 2 as an example:
(1) finding out the area which is cut out by the boundary and contains less than 3 load points in each cell, for example, the area which is cut out by the boundary on the left side of the blue cell in FIG. 2 only contains 2 load points;
(2) the 2 load points are classified as nearby to other cells as shown by arrows in fig. 2;
(3) after the two load points are classified into other cells, the "average distance between load points and geometric center" index of the cells (red cells and green cells) receiving the two load points is increased, and the "average distance between load points and geometric center" index of the cells (blue cells) sending the two load points and the "number of times the cells cross the boundary" are decreased. And comparing the comprehensive evaluation values of the cell division schemes before and after adjustment. If the adjusted partitioning scheme is more excellent, performing the adjustment;
(4) after all necessary adjustments are made, the geometric center of the load point in each cell is recalculated.
4. Finally, since the load points in some cells are not concentrated after adjustment, the partitioning scheme can be further optimized:
(1) finding out the cells with no concentrated load points, and screening the cells as follows:
① average distance between all load points in each cell and the geometric center of the load points, and the calculation method is the same as that for quantitative evaluation of the cell division schemei；
② calculating the mean value
And standard deviation of
③ calculating the difference between the calculated result and the average value of each cell, if it is more than three times the standard deviation, that is, the difference is
This cell is considered to be a cell in which the load points are no longer concentrated.
(2) Taking the situation shown in fig. 3 as an example to specifically explain the further optimization method for the cell division scheme proposed by the present invention, in the initial division scheme, the load points 1 and 2 belong to the blue cell, but after the cell division scheme is adjusted according to the position of the boundary, the load points 1 and 2 are assigned to the green cell, so that the load points in the blue cell are no longer concentrated. Load points 3, 4 are selected by comparing the distance from each load point in the blue cell to the geometric center, and then grouped into other cells in their immediate vicinity without crossing the boundary. Although the load points 3, 4 are closest to the geometric center of the purple cell, they should be classified as nearby to the red cell because of the existence of the borderlines between the load points 3, 4 and the purple cell. Accordingly, 3 optimization schemes are formed:
①, classifying the load point 3 into a red cell, wherein the cells of other load points are unchanged;
② classifying the load point 4 into red cells, and keeping the cells of other load points unchanged;
③ classify the load points 3 and 4 into red cells, and the cells to which the other load points belong are not changed.
And comparing the original cell division scheme with the comprehensive evaluation value of the optimized cell division scheme according to the three optimization schemes, and receiving the optimal optimization scheme.
After the further optimization of the cell division scheme is completed, the geometric center of each cell needs to be recalculated according to the new cell division scheme.
Claims (5)
1. A solving method for an optimal division scheme of power distribution network cells is characterized by comprising the following steps:
step 1: determining an evaluation method for the advantages and disadvantages of the division schemes of the cells of the power distribution network, and considering that the more concentrated the load points in the cells are, the more excellent the division schemes with fewer boundary lines of roads, railways, rivers and the like crossed by the cells are;
step 2: according to a given distribution network area needing cell division and a given number of cell divisions, dividing load points which are close to each other into the same cell by adopting a clustering algorithm, and determining an initial cell division scheme according to the load points;
and step 3: adjusting an initial cell division scheme, reducing the number of times that the cells cross the boundary as much as possible, and ensuring the relative concentration of load points in the cells at the same time, wherein the specific method is to find out sub-areas divided by the boundary in each cell, and if the number of load points contained in the sub-areas is less, the load points are considered to be classified into other cells nearby so as to reduce the number of times that the cells cross the boundary;
and 4, step 4: and further optimizing the cell division scheme, and if the load points in a certain cell are not concentrated any more, classifying the load points which are far away from the geometric center of the load points in the cell into the nearby cells under the condition of not crossing the boundary.
2. The method for evaluating the advantages and disadvantages of the power distribution network cell division scheme according to claim 1, wherein the load point concentration degree in the cells and the number of times that the cells cross the boundary are comprehensively considered, the advantages and disadvantages of each cell are firstly measured, and then the advantages and disadvantages of the whole division scheme are evaluated on the basis of the measured advantages and disadvantages, and the specific process is as follows:
step 11: and measuring the concentration degree of the load points by using the average value of the distances from the geometric centers of all the load points in the cells to each load point. Weighted average is carried out on the distance average value in each cell and the number of times of crossing the boundary to obtain a comprehensive evaluation value of the cell, and the smaller the value is, the better the cell is divided;
step 12: in order to reflect the influence of the cells with higher evaluation values (less divided), the sum of squares of the overall evaluation values of all the cells is used as the overall evaluation value of the entire division scheme, and the lower the evaluation value, the more excellent the division scheme is.
3. The initial cell partition scheme determination of claim 1, wherein a clustering algorithm is used to partition similar load points into the same cell, and the specific process is as follows:
step 21: determining m initial centers which are the same as the number of the cells needing to be divided;
step 22: associating all load points to the nearest center thereof, thereby dividing all load points into m groups of the same number as the centers;
step 23: solving the geometric center of the load point in each group as new m centers;
step 24: steps 22, 23 are repeated until the grouping situation does not change any more.
Step 25: and calculating a comprehensive evaluation value of the obtained initial division scheme.
4. The adjusting of the initial partitioning scheme as claimed in claim 1, wherein the specific process is as follows:
step 31: finding out the area which is cut out by the boundary and contains less than 3 load points in each cell;
step 32: for each such area, after all the load points are classified into other cells closest thereto, the overall evaluation value of the division scheme is found, and whether the adjusted division scheme is more optimal than before is compared. If the adjusted partitioning scheme is more optimal, the adjustment is accepted.
Step 33: and according to the new cell division scheme, recalculating the geometric center of each cell.
5. Further optimization of the adapted cell partition scheme according to claim 1, characterized by the specific procedure as follows:
step 41: calculating the average distance from all load points in each cell to the geometric center of the load points, and selecting the cells with overlarge distance (larger than the average value of all the cells and the difference between the average value and the standard deviation is larger than 3 times);
step 42: in such cells, attempts are made to classify load points that are more distant from the geometric center than the average to other cells that are closest thereto and do not need to cross the borderlines. If there are m such load points in a cell, 2 can be formedm-1 optimization scheme;
step 43: and calculating the comprehensive evaluation value of the division scheme optimized according to each optimization scheme, and receiving the optimal optimization scheme.
Step 44: and recalculating the geometric center of the load point of each cell according to the new cell division scheme.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010303077.1A CN111488663B (en) | 2020-04-17 | 2020-04-17 | Solving method for optimal division scheme of power distribution network cells |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010303077.1A CN111488663B (en) | 2020-04-17 | 2020-04-17 | Solving method for optimal division scheme of power distribution network cells |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111488663A true CN111488663A (en) | 2020-08-04 |
| CN111488663B CN111488663B (en) | 2022-07-08 |
Family
ID=71797880
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010303077.1A Active CN111488663B (en) | 2020-04-17 | 2020-04-17 | Solving method for optimal division scheme of power distribution network cells |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111488663B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109829602A (en) * | 2018-12-11 | 2019-05-31 | 国网浙江杭州市富阳区供电有限公司 | A kind of medium-Voltage Distribution network planning method based on four step formula grid chains |
| CN110717644A (en) * | 2019-08-08 | 2020-01-21 | 国网江苏省电力有限公司泰州供电分公司 | Power distribution network cell division and rationality evaluation method |
-
2020
- 2020-04-17 CN CN202010303077.1A patent/CN111488663B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109829602A (en) * | 2018-12-11 | 2019-05-31 | 国网浙江杭州市富阳区供电有限公司 | A kind of medium-Voltage Distribution network planning method based on four step formula grid chains |
| CN110717644A (en) * | 2019-08-08 | 2020-01-21 | 国网江苏省电力有限公司泰州供电分公司 | Power distribution network cell division and rationality evaluation method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111488663B (en) | 2022-07-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107484209B (en) | Network load balancing vertical switching method considering user QoS | |
| CN105634593B (en) | A kind of indoor visible light communication LED array layout optimization method based on genetic algorithm | |
| CN112016175B (en) | Water supply pipe network pressure measuring point optimal arrangement method based on tree hierarchical clustering | |
| CN109492874B (en) | Decision-making method of investment decision-making system of three-layer grading power grid | |
| CN106056252B (en) | Shale gas field well group division three-level optimization method | |
| CN109886468A (en) | Charging station planing method based on improved self-adapted genetic algorithm | |
| CN104731916A (en) | Optimizing initial center K-means clustering method based on density in data mining | |
| CN105956663A (en) | Parallel stock layout optimization method of special shaped part blanking | |
| CN108647843A (en) | A kind of region trade power consumption influence factor judgment method based on grey correlation analysis | |
| CN104427505A (en) | Method and device for partitioning cell scene | |
| CN109961229A (en) | A kind of power source planning comprehensive estimation method | |
| CN108388726A (en) | A kind of mechanical structure Robust Optimal Design method considering multiple target multiple constraint balancing performance | |
| CN113011652A (en) | Site selection optimization method and system for electric vehicle charging station | |
| CN115496301A (en) | Land utilization and traffic collaborative evaluation method oriented to homeland space planning | |
| CN109754123B (en) | Rotation center line distance weighting alternative positioning method for feeder line power supply range division | |
| CN111488663B (en) | Solving method for optimal division scheme of power distribution network cells | |
| CN110717644A (en) | Power distribution network cell division and rationality evaluation method | |
| CN109711727A (en) | Electronic product processing technology combination evaluation system and its evaluation method | |
| CN104268640A (en) | Pilot designating method | |
| CN105977968B (en) | A kind of power quality monitor Optimal Configuration Method of ring-type multiple source power distribution net | |
| CN114492617A (en) | Pipe network partition and trans-regional water quantity allocation method based on clustering | |
| CN115186882A (en) | Clustering-based controllable load spatial density prediction method | |
| CN106817691A (en) | A kind of PCI distribution method and device | |
| CN108520087A (en) | A kind of the robustness measurement and balance optimizing design method of mechanical structure foreign peoples multiple target performance | |
| CN111340370A (en) | Model-based power distribution network gridding evaluation management and control method |
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 |