CN115133524A - Transformer substation partition power supply intelligent division method based on current situation power grid - Google Patents

Transformer substation partition power supply intelligent division method based on current situation power grid Download PDF

Info

Publication number
CN115133524A
CN115133524A CN202210654847.6A CN202210654847A CN115133524A CN 115133524 A CN115133524 A CN 115133524A CN 202210654847 A CN202210654847 A CN 202210654847A CN 115133524 A CN115133524 A CN 115133524A
Authority
CN
China
Prior art keywords
load
power supply
access
loads
partition
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
Application number
CN202210654847.6A
Other languages
Chinese (zh)
Other versions
CN115133524B (en
Inventor
马继明
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hangzhou Youth Information Technology Co ltd
Original Assignee
Hangzhou Youth Information Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Hangzhou Youth Information Technology Co ltd filed Critical Hangzhou Youth Information Technology Co ltd
Priority to CN202210654847.6A priority Critical patent/CN115133524B/en
Publication of CN115133524A publication Critical patent/CN115133524A/en
Application granted granted Critical
Publication of CN115133524B publication Critical patent/CN115133524B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00Circuit arrangements for ac mains or ac distribution networks
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Systems or methods specially adapted for specific business sectors, e.g. utilities or tourism
    • G06Q50/06Electricity, gas or water supply
    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00Circuit arrangements for ac mains or ac distribution networks
    • H02J3/003Load forecast, e.g. methods or systems for forecasting future load demand
    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2203/00Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
    • H02J2203/10Power transmission or distribution systems management focussing at grid-level, e.g. load flow analysis, node profile computation, meshed network optimisation, active network management or spinning reserve management
    • HELECTRICITY
    • H02GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02JCIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2203/00Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
    • H02J2203/20Simulating, e g planning, reliability check, modelling or computer assisted design [CAD]

Abstract

The invention relates to a transformer substation partition power supply intelligent division method based on a current situation power grid, which comprises the following steps of: generating a power supply unit according to the load of the land; abstracting a power supply unit into a virtual load, and calculating the distance cost of the virtual load accessed to every two substations; according to the virtual load of the power supply unit, determining the number of large subareas, the connected two substations and the capacity by adopting a line segment aggregation method when the large subareas are accessed; and solving convex hulls of all substations, dividing the inclusion relation between the actual load and the convex hulls into an external load and an internal load, calculating the shortest distance from the load to the convex hulls, sequencing the loads from large to small according to the distance, and sequentially accessing the loads to the nearest large subarea. The number, the combination of every two stations and the distribution of the large partitions are adaptively adjusted according to the load distribution predicted by the block load, and an optimization scheme considering the access cost is provided for subsequent line access.

Description

Transformer substation partition power supply intelligent division method based on current situation power grid
Technical Field
The invention belongs to the technical field of power grid planning, and particularly relates to a transformer substation partition power supply intelligent partitioning method based on a current situation power grid.
Background
In the power distribution network planning stage, power supply partitions need to be divided for plots in a planning area, and grid planning is performed on the basis of the divided power supply areas. The rationality of the power supply zoning determines the scientificity and economy of the subsequent gridding planning result.
At present, most of the division of power supply subareas depends on manual experience, and the relationship between the accessible capacity of each transformer substation and the access load of the power supply subareas cannot be distributed reasonably; the small part of the power supply partitions automatically divided by using a computer informatization means often does not consider the grid structure and corridor resources of the existing power grid, and various resources of the existing power grid cannot be fully utilized; the two modes can cause that the subsequent planning result can not meet the requirement of considering both the economy on the basis of accurate and reasonable consideration.
Disclosure of Invention
The invention aims to provide a substation subarea power supply intelligent division method based on a current power grid, overcomes the defects of the prior art, generates large subareas on the basis of an algorithm of using point aggregation and line segment aggregation, has the characteristic of continuous generation of the large subareas, can adaptively adjust the number, the station combination and the distribution of the large subareas according to the load distribution predicted by block loads, and provides an optimization scheme considering the access cost for subsequent line access.
In order to solve the problems, the technical scheme adopted by the invention is as follows:
a transformer substation partition power supply intelligent division method based on a current situation power grid comprises the following steps:
step one, generating a power supply unit by adopting a method of polymerizing load center points according to the load of a land parcel;
abstracting the power supply unit into a virtual load on the basis of the generated power supply unit, and calculating the distance cost of the virtual load accessing into every two substations; determining the number of large subareas, the connected pairwise substations and the capacity by adopting a line segment aggregation method when the large subareas are accessed according to the virtual load of the power supply unit;
and step three, solving convex hulls of all substations, dividing the inclusion relation between the actual load and the convex hulls into external load and internal load, calculating the shortest distance from the load to the convex hulls, sequencing the loads from large to small according to the distance, and finally accessing the loads to the nearest large partition in sequence, and accessing the next-nearest large partition if the nearest large partition is full until all loads are accessed to the large partition.
Further, the specific steps of the first step include:
(1) the total load demand value for predicting the block load in the planning area is recorded as Ld General assembly Capacity value of power supply unit in planning area, denoted as SU cap Calculating the number k of power supply units in the planning area as Ld General assembly /SU cap
(2) Taking the gravity center formed by all loads in a planning area as a center, scanning the loads of the plot by rays of 360 degrees, accumulating the scanned loads, and taking the gravity center formed by the loads as the position of an initial power supply unit when the accumulated load value meets the capacity of the power supply unit;
(3) calculating the linear distance from each load to the gravity center of each power supply unit, and accessing the power supply units according to the global nearest principle;
(4) after all the loads are connected into the power supply units, each power supply unit recalculates the gravity center of the load according to the connected loads and moves the position of the power supply unit to the gravity center;
(5) calculating the offset value of the load gravity center of each power supply unit, and recalculating the difference value between the load gravity center and the gravity center of each power supply unit from each load;
(6) and taking the maximum value of the deviation values of the k power supply units as a convergence value, judging whether the convergence value is larger than a threshold value, if so, circularly entering (4), and if not, entering the next step.
Further, the specific steps of the second step include:
(1) obtaining a topology island communicated among the feeders through topology analysis, obtaining a feeder communicated trunk section set through topology analysis in the communicated topology island according to a contact switch, and obtaining a large branch set connected from the trunk section through topology analysis on the basis of the feeder communicated trunk section to form an alternative access island set;
(2) using a connecting line between every two stations as the position of the initial convergence line segment of the large partition;
(3) the two ends of the convergent line segment are used as the positions of the large-partition access stations, and the center of the convergent line is used as the center of gravity;
(4) the power supply units form a virtual load set whenFront set access index Idx load =0;
(5) Extracting virtual load L from virtual load set cur =L[Idx load ];
(6) Finding out 4 transformer substation sets closest to the virtual load, forming a convex hull area together with the virtual load, and finding out all passage island sets in the range of the convex hull area or with intersection from the alternative passage island sets;
(7) calculating an access cost set of each island access substation set in the virtual load utilization current path island set, and recording a corresponding access path set;
(8) calculating an access cost set of a virtual load new line access transformer substation set, and recording a corresponding access path set;
(9) obtaining all access cost sets of the virtual load, corresponding access path sets, and establishing a mapping relation M between the virtual load and all the access cost sets and the access path sets L-C-P And calculating Idx load =Idx load +1;
(10) Determination of Idx load If the number of the power supply units is smaller than the number k of the power supply units in the planning area, entering (5) if the number is positive, and entering (11) if the number is negative;
(11) recording the lowest cost of all virtual load access large partitions as 0, and judging M L-C-P If the value is empty, entering (17) if the value is empty, and entering (12) if the value is not empty;
(12) from the mapping relation M L-C-P Finding out the load with the minimum access cost in all the virtual loads, and obtaining a path, cost and two transformer substations corresponding to the minimum cost;
(13) trying to access the load with the minimum access cost into every two substations, recalculating the accessible capacity of every two substations, judging whether the accessible capacity is smaller than 0, if so, entering (13), and if not, entering (16);
(14) deleting all access cost records belonging to every two substations from the load with the minimum access cost, and circularly entering (12);
(15) accessing the load with the minimum access cost into every two substations, and updating the lowest cost and the accessible capacity of the virtual load access large partition; updating the path island to which the path corresponding to the minimum cost belongs, and forming a new path island after removing the path corresponding to the minimum cost by the path island;
(16) recording the load with the minimum access cost from the mapping relation M L-C-P Deleted from the mapping relation M L-C-P Finding out the virtual load of which the access path contains the path with the minimum cost in all the virtual loads, recalculating the access cost according to the new access island, and circularly entering (11)
(17) After all the virtual loads are accessed into the large subareas, recalculating the load gravity center of each large subarea according to the accessed loads, and translating the center of the convergent line segment to the gravity center;
(18) and (3) calculating the offset value of the gravity center of each large partition, taking the maximum value in the offset value of each large partition as a convergence value, judging whether the convergence value is larger than a threshold value, if so, circularly entering the step (3), and if not, entering the next step.
Further, the third step specifically comprises:
(1) obtaining a convex hull polygon with the minimum envelope according to the position coordinates of the transformer substation with the prior accessible capacity >0, and dividing each load into an external load and an internal load according to the inclusion relation between the loads and the convex hull polygon;
(2) calculating the shortest distance from each load to the convex hull polygon as the distance for accessing the large subarea, sequencing all the loads according to the access distances from large to small, and accessing the loads with large distances preferentially;
(3) sequentially accessing the loads to the large subarea with the nearest load, if the accessible capacity of the transformer substation of the large subarea is less than 0, skipping, and removing the accessed loads from the load array;
(4) and (3) after the access of the large partition is finished, removing the connecting line of every two stations associated with the large partition from the closed graph, judging whether all the large partitions or the load are connected, if so, finishing outputting the result, and if not, circularly entering (1).
Compared with the prior art, the invention has the following beneficial effects:
1. the large partitions generated on the basis of the algorithm of point aggregation and line segment aggregation have the characteristic of generating continuous large partitions, the number of the large partitions, the combination of every two stations and the distribution can be adaptively adjusted according to the load distribution predicted by the land load, and an optimization scheme considering the access cost is provided for subsequent line access.
2. The invention ensures that the efficiency and the convergence of large-partition aggregation generation are better, and the convergence is improved by about 30 percent compared with the traditional iterative algorithm; compared with artificially generated large partitions, the efficiency is improved by about 10 times.
Drawings
Fig. 1 is a flow diagram of a transformer substation partition power supply intelligent partitioning method based on a present-state power grid.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As shown in fig. 1, the method for intelligently dividing power supply in a transformer substation partition based on the present power grid includes the following steps:
generating a power supply unit by adopting a method of load center point polymerization according to the load of a land parcel;
the method comprises the following specific steps:
(1) the total load demand value of the block load forecast in the planning area is marked as Ld General assembly Capacity value of power supply unit in planning area, denoted as SU cap Calculating the number k of power supply units in the planning area as Ld General (1) /SU cap
(2) Taking the gravity center formed by all loads in a planning area as a center, scanning the loads of the plot by rays of 360 degrees, accumulating the scanned loads, and taking the gravity center formed by the loads as the position of an initial power supply unit when the accumulated load value meets the capacity of the power supply unit;
(3) calculating the linear distance from each load to the gravity center of each power supply unit, and accessing the power supply units according to the global nearest principle;
(4) after all the loads are connected into the power supply units, each power supply unit recalculates the gravity center of the load according to the connected loads and moves the position of the power supply unit to the gravity center;
(5) calculating the offset value of the load gravity center of each power supply unit, and recalculating the difference value between the load gravity center and the gravity center of each power supply unit from each load;
(6) and taking the maximum value of the deviation values of the k power supply units as a convergence value, judging whether the convergence value is larger than a threshold value, if so, circularly entering (4), and if not, entering the next step.
Step two, abstracting the power supply unit into a virtual load on the basis of the generated power supply unit, and calculating the distance cost of the virtual load accessing to every two substations; determining the number of large subareas, the connected pairwise substations and the capacity by adopting a line segment aggregation method when the large subareas are accessed according to the virtual load of the power supply unit;
the method comprises the following specific steps:
(1) obtaining a topology island communicated among the feeders through topology analysis, obtaining a feeder communicated trunk section set through topology analysis in the communicated topology island according to a contact switch, and obtaining a large branch set connected from the trunk section through topology analysis on the basis of the feeder communicated trunk section to form an alternative access island set;
(2) using a connecting line between every two stations as the position of the initial convergence line segment of the large partition;
(3) the two ends of the convergent line segment are used as the positions of the large-partition access stations, and the center of the convergent line is used as the center of gravity;
(4) the power supply unit forms a virtual load set, and the current set access index Idx load =0;
(5) Extracting virtual load L from virtual load set cur =L[Idx load ];
(6) Finding out 4 transformer substation sets closest to the virtual load, forming a convex hull area together with the virtual load, and finding out all passage island sets in the range of the convex hull area or with intersection from the alternative passage island sets;
(7) calculating an access cost set (combination of two stations, C) of each island in a virtual load utilization current path island set accessing a transformer substation set 4 2 Seed) recording the length of a power grid line as 0 by using the current situation, recording the distance from a virtual load to the nearest node of a passage island and the distance from the end point of a two-station convergence line segment to the nearest node of the passage island, and recording a corresponding access path set;
(8) calculating the access cost set of the virtual load new line access transformer substation set (two-station combination, C) 4 2 Seed), the sum of the distances from the virtual load to the end points of the two convergent line segments, and recording a corresponding access path set;
(9) obtaining all access cost sets of the virtual load, corresponding access path sets, and establishing a mapping relation M between the virtual load and all the access cost sets and the access path sets L-C-P And calculating Idx load =Idx load +1;
(10) Determining Idx load Whether the number of the power supply units is less than the number k of the power supply units in the planning area is judged, if yes, the step is carried out (5), and if not, the step is carried out (11);
(11) recording the lowest cost of all virtual load accessing large partition as 0, and judging M L-C-P If the value is empty, entering (17) if the value is empty, and entering (12) if the value is not empty;
(12) from the mapping relation M L-C-P Finding out the load with the minimum access cost in all the virtual loads, and obtaining a path, cost and two transformer substations corresponding to the minimum cost;
(13) trying to access the load with the minimum access cost into every two substations, recalculating the accessible capacity of every two substations, judging whether the accessible capacity is smaller than 0, if so, entering (13), and if not, entering (16);
(14) deleting all access cost records belonging to every two substations from the load with the minimum access cost, and circularly entering (12);
(15) accessing the load with the minimum access cost into every two substations, and updating the lowest cost and the accessible capacity of the virtual load access large partition; updating the path island to which the path corresponding to the minimum cost belongs, and forming a new path island after removing the path corresponding to the minimum cost by the path island;
(16) recording the load with the minimum access cost from the mapping relation M L-C-P Deleted from the mapping relation M L-C-P Finding out the virtual load of which the access path contains the path with the minimum cost in all the virtual loads, recalculating the access cost according to the new access island, and circularly entering (11)
(17) After all the virtual loads are accessed into the large subareas, recalculating the load gravity center of each large subarea according to the accessed loads, and translating the center of the convergent line segment to the gravity center;
(18) and (3) calculating the offset value of the gravity center of each large partition, taking the maximum value in the offset value of each large partition as a convergence value, judging whether the convergence value is larger than a threshold value, if so, circularly entering the step (3), and if not, entering the next step.
Thirdly, solving convex hulls of all substations, dividing the inclusion relation between actual loads and the convex hulls into external loads and internal loads, calculating the shortest distance from the loads to the convex hulls (the distance of the internal loads takes a negative value) and sequencing according to the distance from large to small, and finally sequentially accessing the loads to the nearest large partition;
the method comprises the following specific steps:
(1) obtaining a convex hull polygon with minimum envelope according to position coordinates of the transformer substation with the existing accessible capacity >0, and dividing each load into an external load and an internal load according to the inclusion relation between the loads and the convex hull polygon;
(2) calculating the shortest distance from each load to the convex hull polygon as the distance for accessing the large subarea, sequencing all the loads according to the access distances from large to small, and accessing the loads with large distances preferentially;
(3) sequentially accessing the loads to the large subarea with the nearest load, if the accessible capacity of the transformer substation of the large subarea is less than 0, skipping, and removing the accessed loads from the load array;
(4) and (3) after the access of the large partition is finished, removing the connecting line of every two stations associated with the large partition from the closed graph, judging whether all the large partitions or the load are connected, if so, finishing outputting the result, and if not, circularly entering (1).
In summary, according to the substation partition power supply intelligent partitioning method based on the present power grid, the large partitions generated on the basis of the point-of-use aggregation and line segment aggregation algorithm have the characteristic of generating continuous large partitions, the number, the station combination and the distribution of the large partitions can be adaptively adjusted according to the load distribution predicted by the block load, and an optimization scheme considering the access cost is provided for subsequent line access.
The method has the advantages that the efficiency and the convergence of large partition aggregation generation are better, and the convergence is improved by about 30% compared with the traditional iterative algorithm; compared with artificially generated large partitions, the efficiency is improved by about 10 times.
When the actual load is connected into a large subarea, the distance between the internal load and the external load is distinguished by adopting a dynamic closed graphic convex hull formed by large subarea connecting lines, and the load is connected into the large subarea firstly, so that the condition that a land is far away from a large subarea transformer substation when the final load is connected is avoided, and the connection is uneconomical. Finally, when a large partition is generated, the existing power grid is fully utilized as an alternative path, the utilization rate of subsequent line wiring is greatly improved, and the investment and construction cost of the power distribution network can be greatly saved by more than 40% compared with the existing large partition algorithm without considering the existing power grid.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof. The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference sign in a claim should not be construed as limiting the claim concerned.

Claims (4)

1. A transformer substation partition power supply intelligent division method based on a current situation power grid is characterized by comprising the following steps: the method comprises the following steps:
generating a power supply unit by adopting a method of load center point polymerization according to the load of a land parcel;
abstracting the power supply unit into a virtual load on the basis of the generated power supply unit, and calculating the distance cost of the virtual load accessing into every two substations; according to the virtual load of the power supply unit, determining the number of large subareas, the connected two substations and the capacity by adopting a line segment aggregation method when the large subareas are accessed;
and thirdly, solving convex hulls of all substations, dividing the inclusion relation between the actual load and the convex hulls into external load and internal load, calculating the shortest distance from the load to the convex hulls, sequencing the loads according to the decreasing distance, and finally accessing the loads to the nearest large partition in sequence, and accessing the next nearest large partition if the nearest large partition is full until all the loads are accessed to the large partition.
2. The intelligent partition method for substation partition power supply based on the present power grid according to claim 1, characterized in that: the specific steps of the first step comprise:
(1) the total load demand value for predicting the block load in the planning area is recorded as Ld General assembly Capacity value of power supply unit in planning area, denoted as SU cap Calculating the number k of power supply units in the planning area as Ld General assembly /SU cap
(2) Taking the gravity center formed by all loads in a planning area as a center, scanning the loads of the plot by rays of 360 degrees, accumulating the scanned loads, and taking the gravity center formed by the loads as the position of an initial power supply unit when the accumulated load value meets the capacity of the power supply unit;
(3) calculating the linear distance from each load to the gravity center of each power supply unit, and accessing the power supply units according to the global nearest principle;
(4) after all the loads are connected into the power supply units, each power supply unit recalculates the gravity center of the load according to the connected loads and moves the position of the power supply unit to the gravity center;
(5) calculating the deviation value of the gravity center of the load of each power supply unit, and recalculating the difference value between the gravity center of the load and the gravity center of each power supply unit from each load;
(6) and taking the maximum value of the deviation values of the k power supply units as a convergence value, judging whether the convergence value is larger than a threshold value, if so, circularly entering (4), and if not, entering the next step.
3. The intelligent partition method for substation partition power supply based on the present power grid according to claim 2, characterized in that: the second step comprises the following specific steps:
(1) obtaining a topology island communicated among the feeders through topology analysis, obtaining a feeder communicated trunk section set through topology analysis in the communicated topology island according to a contact switch, and obtaining a large branch set connected from the trunk section through topology analysis on the basis of the feeder communicated trunk section to form an alternative access island set;
(2) using a connecting line between every two stations as the position of the initial convergence line segment of the large partition;
(3) the two ends of the convergent line segment are used as the positions of the large-partition access stations, and the center of the convergent line is used as the center of gravity;
(4) the power supply unit forms a virtual load set, and the current set access index Idx load =0;
(5) Extracting virtual load L from virtual load set cur =L[Idx load ];
(6) Finding out 4 transformer substation sets closest to the virtual load, forming a convex hull region together with the virtual load, and finding out all passage island sets in the range of the convex hull region or with intersection from the alternative passage island sets;
(7) calculating an access cost set of each island in the virtual load utilization current path island set for accessing the transformer substation set, and recording a corresponding access path set;
(8) calculating an access cost set of a virtual load newly-built line access substation set, and recording a corresponding access path set;
(9) obtaining all access cost sets of the virtual load, corresponding access path sets, and establishing a mapping relation M between the virtual load and all the access cost sets and the access path sets L-C-P And calculating Idx load =Idx load +1;
(10) Determination of Idx load If the number of the power supply units is smaller than the number k of the power supply units in the planning area, entering (5) if the number is positive, and entering (11) if the number is negative;
(11) recording the lowest cost of all virtual load access large partitions as 0, and judging M L-C-P If the value is empty, entering (17) if the value is empty, and entering (12) if the value is not empty;
(12) slave mapping relation M L-C-P Finding out the load with the minimum access cost in all the virtual loads, and obtaining a path, cost and pairwise transformer substations corresponding to the minimum cost;
(13) trying to access the load with the minimum access cost into every two substations, recalculating the accessible capacity of every two substations, judging whether the accessible capacity is smaller than 0, if so, entering (13), and if not, entering (16);
(14) deleting all access cost records belonging to every two substations from the load with the minimum access cost, and circularly entering (12);
(15) accessing the load with the minimum access cost into every two substations, and updating the lowest cost and the accessible capacity of the virtual load access large partition; updating the path island to which the path corresponding to the minimum cost belongs, and forming a new path island after removing the path corresponding to the minimum cost by the path island;
(16) recording the load with the minimum access cost from the mapping relation M L-C-P Deleted from the mapping relation M L-C-P Finding out the virtual load of which the access path includes the path with the minimum cost in all the virtual loads, recalculating the access cost according to the new access island, and circularly entering (11)
(17) After all the virtual loads are accessed into the large subareas, recalculating the load gravity center of each large subarea according to the accessed loads, and translating the center of the convergent line segment to the gravity center;
(18) and (3) calculating the offset value of the gravity center of each large partition, taking the maximum value in the offset value of each large partition as a convergence value, judging whether the convergence value is larger than a threshold value, if so, circularly entering the step (3), and if not, entering the next step.
4. The intelligent partition method for substation partition power supply based on the present power grid according to claim 3, characterized in that: the third step comprises the following specific steps:
(1) obtaining a convex hull polygon with the minimum envelope according to the position coordinates of the transformer substation with the prior accessible capacity >0, and dividing each load into an external load and an internal load according to the inclusion relation between the loads and the convex hull polygon;
(2) calculating the shortest distance from each load to the convex hull polygon as the distance for accessing the large subarea, sequencing all the loads according to the access distances from large to small, and accessing the loads with large distances preferentially;
(3) sequentially accessing the loads to the large subarea with the nearest load, if the accessible capacity of the transformer substation of the large subarea is less than 0, skipping, and removing the accessed loads from the load array;
(4) and (3) after the access of the large partition is finished, removing the connecting line of every two stations associated with the large partition from the closed graph, judging whether all the large partitions or the load are connected, if so, finishing outputting the result, and if not, circularly entering (1).
CN202210654847.6A 2022-06-10 2022-06-10 Transformer substation partition power supply intelligent division method based on current situation power grid Active CN115133524B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210654847.6A CN115133524B (en) 2022-06-10 2022-06-10 Transformer substation partition power supply intelligent division method based on current situation power grid

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210654847.6A CN115133524B (en) 2022-06-10 2022-06-10 Transformer substation partition power supply intelligent division method based on current situation power grid

Publications (2)

Publication Number Publication Date
CN115133524A true CN115133524A (en) 2022-09-30
CN115133524B CN115133524B (en) 2023-02-07

Family

ID=83378885

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210654847.6A Active CN115133524B (en) 2022-06-10 2022-06-10 Transformer substation partition power supply intelligent division method based on current situation power grid

Country Status (1)

Country Link
CN (1) CN115133524B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104281892A (en) * 2014-10-15 2015-01-14 国家电网公司 New construction and reconstruction planning cooperative optimization method for main equipment in power distribution network
CN108429257A (en) * 2018-03-26 2018-08-21 东北电力大学 The distribution network structure planing method of subregion and meter and geographic factor is clustered based on load point
CN111967715A (en) * 2020-07-15 2020-11-20 中国能源建设集团天津电力设计院有限公司 Load partitioning method based on geographic information
CN112668129A (en) * 2020-12-24 2021-04-16 福建永福电力设计股份有限公司 Power distribution network multi-level grid intelligent division method based on space load clustering
US20210203159A1 (en) * 2019-12-27 2021-07-01 North China Electric Power University Power load forecasting method in multi-energy coupling mode
CN113222472A (en) * 2021-06-04 2021-08-06 国网宁夏电力有限公司银川供电公司 Power distribution network grid optimization division method and system based on load clustering algorithm
CN114595986A (en) * 2022-03-15 2022-06-07 天津大学合肥创新发展研究院 Substation planning method and device considering hierarchical distribution

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104281892A (en) * 2014-10-15 2015-01-14 国家电网公司 New construction and reconstruction planning cooperative optimization method for main equipment in power distribution network
CN108429257A (en) * 2018-03-26 2018-08-21 东北电力大学 The distribution network structure planing method of subregion and meter and geographic factor is clustered based on load point
US20210203159A1 (en) * 2019-12-27 2021-07-01 North China Electric Power University Power load forecasting method in multi-energy coupling mode
CN111967715A (en) * 2020-07-15 2020-11-20 中国能源建设集团天津电力设计院有限公司 Load partitioning method based on geographic information
CN112668129A (en) * 2020-12-24 2021-04-16 福建永福电力设计股份有限公司 Power distribution network multi-level grid intelligent division method based on space load clustering
CN113222472A (en) * 2021-06-04 2021-08-06 国网宁夏电力有限公司银川供电公司 Power distribution network grid optimization division method and system based on load clustering algorithm
CN114595986A (en) * 2022-03-15 2022-06-07 天津大学合肥创新发展研究院 Substation planning method and device considering hierarchical distribution

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
WANG WEIZHOU 等: "The Correction Technology of Abnormal Power Based on Arbitrary Division of Power Grid", 《IEEE》 *
陈哲 等: "中压配电网规划中计及多因素影响的供电分区划分方法", 《电网技术》 *

Also Published As

Publication number Publication date
CN115133524B (en) 2023-02-07

Similar Documents

Publication Publication Date Title
CN106503839B (en) Hierarchical planning method for offshore wind farm annular current collection network
CN105046363B (en) A kind of region distribution system single-line diagram layout and optimization method
CN114862047B (en) Year-by-year time sequence distribution method for power grid distant view grid frame construction
CN112837172B (en) Power distribution network post-disaster first-aid repair decision method considering information fusion of traffic network and power distribution network
CN109919350B (en) Multi-stage substation expansion planning method considering overall economy
CN109886468A (en) Charging station planing method based on improved self-adapted genetic algorithm
CN110188972B (en) 10kV power distribution network non-private line customer access method
CN112668129B (en) Space load clustering-based intelligent grid dividing method for power distribution network
CN112085280A (en) Power transmission channel path optimization method considering geographic factors
CN109190832B (en) Gravity center theory-based electric bus charging station site selection method
CN104331847A (en) Power supply zone partitioning method by use of Delaunay triangulation
CN115133524B (en) Transformer substation partition power supply intelligent division method based on current situation power grid
CN108649578B (en) Method and device for adjusting grid structure and optimizing networking mode of high and medium voltage urban network
CN113868812A (en) Medium voltage distribution network cable path planning method based on intelligent ant colony algorithm
CN110197302A (en) A kind of distribution network planning method considering Connection Mode topological constraints
CN109887260B (en) Method for splitting network topological structure of district electric energy meter
CN114336638B (en) Medium-voltage active power distribution network dynamic reconstruction method based on bubbling model
CN115483680A (en) Collaborative optimization construction method for residential electric vehicle charging facility and power distribution network
CN110445135A (en) Distribution network load transfer ability rank calculation methods based on electrical structure and parameter
CN115438451A (en) Photovoltaic module serial line arrangement determining method and device and electronic equipment
CN113158392A (en) Power distribution graphical monitoring and computing system
CN112084626A (en) Distributed photovoltaic access-based power distribution network reactive compensation configuration capacity calculation method
CN111429166A (en) Electric vehicle charging demand spatial distribution prediction method based on maximum contour clustering
CN116865264B (en) Intelligent distribution power supply method, system and storage medium for transformer substation
Cheng et al. Distribution Network Grid Planning and Automatic Routing Based on Cluster Analysis Algorithm

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