CN115425637A - Floyd-MPSO algorithm-based island power grid emergency reconstruction method - Google Patents

Floyd-MPSO algorithm-based island power grid emergency reconstruction method Download PDF

Info

Publication number
CN115425637A
CN115425637A CN202210865655.XA CN202210865655A CN115425637A CN 115425637 A CN115425637 A CN 115425637A CN 202210865655 A CN202210865655 A CN 202210865655A CN 115425637 A CN115425637 A CN 115425637A
Authority
CN
China
Prior art keywords
starting
algorithm
path
floyd
island
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.)
Pending
Application number
CN202210865655.XA
Other languages
Chinese (zh)
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.)
Wuhan Tianfuhai Technology Development Co ltd
Original Assignee
Wuhan Tianfuhai Technology Development 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 Wuhan Tianfuhai Technology Development Co ltd filed Critical Wuhan Tianfuhai Technology Development Co ltd
Priority to CN202210865655.XA priority Critical patent/CN115425637A/en
Publication of CN115425637A publication Critical patent/CN115425637A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00—Circuit arrangements for ac mains or ac distribution networks
    • H02J3/001—Methods to deal with contingencies, e.g. abnormalities, faults or failures
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00—Circuit arrangements for ac mains or ac distribution networks
    • H02J3/007—Arrangements for selectively connecting the load or loads to one or several among a plurality of power lines or power sources
    • H02J3/0073—Arrangements for selectively connecting the load or loads to one or several among a plurality of power lines or power sources for providing alternative feeding paths between load and source when the main path fails, e.g. transformers, busbars
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J3/00—Circuit arrangements for ac mains or ac distribution networks
    • H02J3/38—Arrangements for parallely feeding a single network by two or more generators, converters or transformers
    • H02J3/381—Dispersed generators
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
    • H02J2203/10—Power 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
    • H—ELECTRICITY
    • H02—GENERATION; CONVERSION OR DISTRIBUTION OF ELECTRIC POWER
    • H02J—CIRCUIT ARRANGEMENTS OR SYSTEMS FOR SUPPLYING OR DISTRIBUTING ELECTRIC POWER; SYSTEMS FOR STORING ELECTRIC ENERGY
    • H02J2203/00—Indexing scheme relating to details of circuit arrangements for AC mains or AC distribution networks
    • H02J2203/20—Simulating, e g planning, reliability check, modelling or computer assisted design [CAD]

Landscapes

  • Engineering & Computer Science (AREA)
  • Power Engineering (AREA)
  • Supply And Distribution Of Alternating Current (AREA)

Abstract

The invention discloses an island power grid emergency reconstruction method based on Floyd-MPSO algorithm, which comprises the following steps: dividing the island power distribution network to obtain loads of different important levels and all distributed generators DG; according to a preset starting sequence of the distributed power DGs, constructing a minimum starting path model of the distributed power DGs based on a Floyd algorithm, and generating a plurality of DG starting paths; screening from a plurality of DG starting sequences by adopting an MPSO (modified particle swarm optimization) algorithm to obtain a minimum starting path of a DG of a distributed power supply; and completing self-healing reconstruction of the island power distribution network according to the minimum starting path of the distributed power supply DG. According to the method, after the island power grid fails, the optimal starting sequence can be quickly found out to obtain the optimal recovery path.

Description

Floyd-MPSO algorithm-based island power grid emergency reconstruction method
Technical Field
The invention relates to the field of power grid system fault processing, in particular to an island power grid emergency reconstruction method based on Floyd-MPSO algorithm.
Background
Due to the high requirements on the total power demand and the reliability, and if a submarine cable is used for networking with the continents, the submarine cable is laid at a higher cost in the aspects of technology and economy due to the limited maximum load, the long transmission distance and the narrow island area, and therefore, the development of a clean and reliable island flood energy combined micro-grid around renewable energy sources is needed. Due to the influences of factors such as unstable weather of islands, impact load and the like, the risk of large-area fault power failure is increased, and the problem caused by the large-area fault power failure on the island reef with important geographical position is more serious, so that the research significance on black start is great. At present, the black start technology of the power transmission network is relatively mature, and the black start technology of the micro-grid is relatively less researched.
In an island power network, when a power failure accident occurs due to a power failure, the power generation capacity of an existing Distributed Generation (DG) in the power network cannot meet the recovery of all loads, and therefore, in this case, the power distribution network needs to be optimally reconstructed according to the starting and operating characteristics of the DG and the distribution condition of important loads on the basis of power balance. The influence of the distributed power supply on the fault recovery of the power distribution network is embodied in the following two aspects:
1) The distributed power supply improves the power supply reliability of a power distribution system for island operation, and IEEE is out of service and solves the problem of island in standard IEEE1547-2003. The conscious islanding is no longer prohibited in this standard, but rather the power supplier and the user are encouraged to achieve islanding operation by technical means as much as possible, and to achieve consensus on economic aspects. Therefore, when a fault of the power distribution network is recovered, if the main network cannot completely recover the power loss load, the Black-start DG (BDG) unit in the Controllable DG (CDG) should be used as much as possible to perform isolated island operation, so as to recover the power loss load to the maximum extent.
2) The renewable energy is utilized to the maximum extent. When the fault of the distribution network is recovered, the Renewable energy unit DG (Renewable energy-DG, RDG) in the stable output power type DG (stable DG, SDG) is ensured to generate power on the internet to the maximum extent.
Disclosure of Invention
The method is mainly characterized in that important load recovery is taken as a main target, minimum network loss is taken as a secondary target, the shortest path between DGs is searched and stored in advance by using the shortest path algorithm, and then the shortest path is optimized and participated in path optimization by using an intelligent algorithm, so that the operation difficulty and time are greatly reduced and shortened, plan reconstruction can be performed in advance according to an actual microgrid framework in actual application, and an optimal recovery scheme is obtained.
The invention provides an island power grid emergency reconstruction method based on Floyd-MPSO algorithm, which comprises the following steps:
s1, dividing an island power distribution network to obtain loads of different important levels and all distributed generators DG;
s2, according to a preset starting sequence of the distributed generation DGs, constructing a minimum starting path model of the distributed generation DGs based on a Floyd algorithm, and generating a plurality of DG starting paths;
s3, screening from the plurality of DG starting sequences by adopting an MPSO (modified particle swarm optimization) algorithm to obtain a minimum starting path of the DG of the distributed power supply;
and S4, completing self-healing reconstruction of the island power distribution network according to the minimum starting path of the distributed power supply DG.
The beneficial effects provided by the invention are as follows: after the island power grid fails, the method can quickly find the optimal starting sequence to obtain the optimal recovery path.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention;
FIG. 2 is a simplified schematic diagram of the partitioning of a power distribution network;
figure 3 is a schematic diagram of a local power supply network;
FIG. 4 is a flow chart of the MPSO algorithm;
FIG. 5 is a schematic diagram of an IEEE33 node improvement;
FIG. 6 is a diagram illustrating algorithm fitness convergence curves.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, embodiments of the present invention will be further described with reference to the accompanying drawings.
Before proceeding with a formal description, the purpose of this patent will be briefly described.
In the patent, the main purpose of island emergency power grid fault recovery is to recover more important loads as far as possible, and on the premise of ensuring that the important loads recover power supply, the power grid fault recovery cost is considered. The load capacity in the microgrid obtained by fault recovery of the patent does not exceed the power generation capacity and the power supply capacity of the DGs in the microgrid is fully exerted.
Referring to FIG. 1, FIG. 1 is a schematic flow chart of a method according to the present invention; an island power grid emergency reconstruction method based on Floyd-MPSO algorithm comprises the following steps:
s1, dividing an island power distribution network to obtain loads of different important levels and all distributed generators DG;
referring to fig. 2, fig. 2 is a simplified schematic diagram of the power distribution network division. The description is briefly made by taking fig. 2 as an example. With the purposes of meeting the balance between load capacity and power generation capacity in the microgrid and at least one DG capable of realizing black-start operation capacity as a condition and recovering important loads to the maximum extent, carrying out depth-first search on the power distribution network to obtain a division scheme shown in fig. 2;
in fig. 2, loads at different levels are divided into important levels, and all distributed power sources DG in the power distribution network are also acquired (for convenience of generation, all of which are described as DG hereinafter);
it should be noted that after the distribution network is divided, the next problem to be solved is to reasonably plan the starting sequence of the DGs.
Influence through analyzing different kinds of DGs to island reef distribution network fault recovery, the principle that this patent should follow when planning DG start sequence has:
(1) DGs meeting the BDG and the SDG are started preferentially. Considering saving the generated power at the initial stage of the black start, the NBDG start should be arranged finally.
(2) The DG with large capacity is started preferentially. The initial stage can provide more starting power for the system, and is beneficial to system establishment and stable recovery.
(3) DG that is physically close to an important load starts as preferentially as possible.
(4) After a fault occurs, the power distribution network is divided into a class 1 load, a class 2 load and a class 3 load according to the importance degree of the load in the system in the process of recovering the power distribution network.
(5) The DGs with better FM and PM capabilities are started preferentially.
(6) The DG can operate in an island with load only by having certain frequency modulation and voltage regulation capacity, and the voltage and the frequency of the system are kept stable.
(7) The scheme with short unit path is preferentially implemented. The path index of the unit is based on the number of path switches for providing energy for the unit from the outside.
S2, according to a preset starting sequence of the distributed power DGs, constructing a minimum starting path model of the distributed power DGs based on a Floyd algorithm, and generating a plurality of DG starting paths;
it should be noted that in order to ensure safe and stable operation of the island power distribution network, a looped network is adopted to design radial operation, and in a power grid, one or more restoration paths between any two DGs may exist, so that the restoration paths need to be solved.
The method adopts a Floyd algorithm in a shortest-path algorithm to determine the shortest path of any two DGs.
For convenience of explanation, please refer to fig. 3, fig. 3 is a schematic diagram of a local power supply network;
in fig. 3, nodes 1,2, 5, 6, 7, and 9 are important loads, and it can be seen that there are 6 schemes for restoration sequence of DG, and there are multiple restoration paths between every 2 DG.
2 schemes are arbitrarily selected:
when D is present a = { DG1, DG2, DG3}, the restoration path is: DG1-1-9-DG2-10-5-6-DG3, the recovered important loads are 1, 5, 6 and 9;
when D is present b The = { DG1, DG2, DG3} restoration path is: DG2-9-DG1-1-2-3-4-5-6-DG3, the recovered important loads are 1,2, 5, 6 and 9. It can be seen that the DG start sequence directly affects the important load to be recovered last; it can be seen that the DG start sequence directly affects the important load that is finally recovered.
In the present application, a minimum start path (sequence) needs to be obtained;
assuming that after failure, all DGs are
Figure BDA0003758949690000051
And all can work normally.
In the early stages of startup, the goal of restoration is to restore more important loads in the shortest time with as little path cost as possible.
Figure BDA0003758949690000052
In the formula: omega j The weighted value of the jth starting path; c m Is the number of path edges; s Ni The input state of the ith load is shown, the value is 0 or 1,0 shows that the load is not input, and 1 shows that the load is input; f. of Ni For load weight, in the patent, 1,2-level load is taken as 1,2-level load, 0.1,3-level load is taken as 0.01; c n Is the load number; c n Is the number of loads.
S3, screening from the plurality of DG starting sequences by adopting an MPSO (modified particle swarm optimization) algorithm to obtain a minimum starting path of the DG of the distributed power supply;
the starting sequence of DG determines the final recovery scheme, and the adaptive particle size grouping algorithm is adopted to optimize the scheme.
The Modified Particle Swarm Optimization (MPSO) is described as follows: the conventional Particle Swarm Optimization (PSO) can better optimize the continuous problem. In the process of solving by using the improved particle swarm algorithm, the position of the particle represents a DG starting sequence scheme, and the particle is set as
Figure BDA0003758949690000061
The index value of the particle position represents the number of each DG, for x i (i∈[1,N G ]) And performing ascending sequencing, setting the result as a DG starting sequence under the scheme, and obtaining a global optimal particle, namely an optimal recovery path scheme after the iterative optimization is finished.
Wherein G is j Representing the maximum number of iterations, g represents the current number of iterations, the inertia factor w = (w) ini -w end )(G j -g)/G j +w end ，
The fitness function determined by this patent is
Figure BDA0003758949690000062
In the formula: x is the number of BDGs; y is the number of NBDGs; theta 1 And theta 2 Indicates the sequential interval state quantities of BDG and NBDG. Theta.theta. 1 1 represents that the starting sequence of the BDG is between 1 and x, and 0 represents that the starting sequence of the BDG is between x and x + y; theta.theta. 2 1 represents that the starting sequence of the NBDG is between x and x + y, and 0 represents that the starting sequence of the NBDG is between 1 and x; inf is an infinite positive number.
Therefore, the particle with the minimum adaptation value is the optimal DG starting sequence, and the obtained path is the optimal recovery scheme.
Referring to fig. 4, fig. 4 is a flowchart of the MPSO algorithm, and the specific steps of solving are as follows:
step 1: and calling a Floyd algorithm by the simplified power distribution network architecture to search the shortest recovery path for the contained DGs and the load nodes, and storing the shortest recovery path as a path matrix (namely a plurality of starting paths in the step S2) to wait for calling.
Step 2: initializing all parameters of the MPSO algorithm, including iteration times, population number, initial position, initial speed and the like. When the initial particles are generated, the DG1 is started as the first DG, and compared with other DGs, the DG1 has the advantages of being high in anti-interference capacity, high in communication controllability, capable of being stably loaded and capable of being automatically started in a black mode, so that the positions of the particles in the initial population and the global optimal solution can be shortened, and the optimal solution can be obtained more quickly.
And step 3: after obtaining the particles, carrying out increasing sequencing treatment, and then obtaining a DG starting sequence.
And 4, step 4: and substituting the obtained DG starting sequence into the result in the step 1 to obtain a recovery path scheme under the starting sequence.
And 5: and judging whether constraint conditions are met, if so, calculating the adaptive value of the particles in the population, and updating the speed and the position of the particles.
Step 6: and judging whether the set iteration times are reached, if so, ending the search, and outputting an optimal path scheme.
Wherein the constraint conditions in step 5 are as follows:
Figure BDA0003758949690000071
Figure BDA0003758949690000072
Figure BDA0003758949690000073
V i min ≤V i ≤V i max ,i∈N D
in the formula:
Figure BDA0003758949690000074
i∈C n N G is the number of DGs;
Figure BDA0003758949690000075
DG capacity for startup;
Figure BDA0003758949690000076
and
Figure BDA0003758949690000077
represents the lower limit and the upper limit of the active power emitted by the kth DG;
Figure BDA0003758949690000078
and Q Gk max A lower limit and an upper limit of reactive power issued for the kth DG; v i max 、V i min The maximum value and the minimum value of the node voltage are obtained; n is a radical of D The number of nodes; p Bi The power of the ith branch;
Figure BDA0003758949690000079
the maximum allowed power for branch i.
And S4, completing self-healing reconstruction of the island power distribution network according to the minimum starting path of the distributed power supply DG.
As an embodiment, the present patent improves IEEE33 nodes, and assumes that the division is completed, and a DG is accessed to a part of the nodes, as shown in fig. 5, and the DG parameters are shown in table 1. In fig. 5, the left side is an IEEE33 node map before modification, and the right side is an IEEE33 node map after modification of the present application. After improvement, the shortest path algorithm in the patent utilizes the edge weight of the connected graph, so that the edges of the undirected graph of the power distribution network need to be weighted.
And taking the impedance between each node as the path index of the line.
After the weight of the power distribution network is set, all nodes and edges in the simplified power distribution network are counted and numbered, and a complex power distribution network with a ring network structure is searched by using a Floyd algorithm to obtain a shortest path numerical matrix among DGs.
The loads in the system are classified by importance in fig. 5: the primary load nodes are 2, 4, 6, 8, 9, 13, 14, 16, 18, 19, 20, 21, 31, 32 and 33;
the secondary load nodes are 3, 5, 7, 10, 11, 12, 15, 17, 22, 23, 24, 25, 27, 28, 30;
the tertiary loads are 26 and 29.
TABLE 1 DG parameters
Figure BDA0003758949690000081
The method adopts an IEEE33 node system for verification, utilizes an MPSO algorithm to generate an optimal DG starting sequence, and sets a learning factor c 1 ,c 2 1.49445, maximum number of iterations Maxgen =20, population number Sizepop =5, speed V e [ -4,4]Initial inertia weight w ini =0.9, inertia weight w when iterating to maximum number of times end =0.4, wherein the load power is much smaller than the power generated by the unit at the initial recovery stage, and therefore DG1 is set as a balance node and the others are set as PQ nodes in the load flow calculation, and 50% of the maximum output is taken in the calculation process.
The algorithm fitness convergence curve is shown in fig. 6.
As can be seen from the figure, the global optimal solution can be basically obtained about 6 times of iteration, and the adaptive value is-0.7625. The result of invoking step 1 can search for the optimal recovery path as shown in table 2.
Table 2 optimal restoration path list
Figure BDA0003758949690000091
The obtained optimal path is analyzed to find that: DG5 has the largest capacity, has the anti-interference capability and can be used as a 2 nd starting unit. According to the principle of starting BDG and NBDG, DG2 and DG3 are recovered, more important loads are recovered under the condition that the path weight is minimum, DG2 is better than DG3 to be started, and finally the capacity of DG4 is larger than that of DG6, so that stable operation of the power distribution network is facilitated, and therefore DG4 is started before DG 6. And after the load flow calculation and verification, the power out-of-limit does not occur, and an optimal recovery path is obtained.
The method performs optimal recovery on planned island operation after the microgrid has failed through DG black start, meets the conditions of power balance and minimum path cost through the comparison of the start and operation characteristics of DG, and reasonably arranges the start sequence and the recovery path of DG under the aim of recovering more important loads as far as possible. The method adopts a Floyd algorithm and an MPSO algorithm to optimize the method, firstly, the Floyd algorithm is used for searching and storing the shortest path among DGs as a path matrix, secondly, the MPSO algorithm is used for optimizing the DG starting sequence, wherein inertia factors in a standard PSO algorithm are adaptively adjusted, so that the weight is changed along with the change of iteration times, the particles are prevented from falling into local optimization in the solving process, and the method is proved to be capable of quickly finding the optimal starting sequence to obtain the optimal recovery path through a calculation example.
The invention has the beneficial effects that: after the island power grid fails, the method can quickly find the optimal starting sequence to obtain the optimal recovery path.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents, improvements and the like that fall within the spirit and principle of the present invention are intended to be included therein.

Claims (5)

1. An island power grid emergency reconstruction method based on a Floyd-MPSO algorithm is characterized by comprising the following steps: the method comprises the following steps:
s1, dividing an island power distribution network to obtain loads of different important levels and all distributed generators DG;
s2, according to a preset starting sequence of the distributed power DGs, constructing a minimum starting path model of the distributed power DGs based on a Floyd algorithm, and generating a plurality of DG starting paths;
s3, screening from the plurality of DG starting sequences by adopting an MPSO (modified particle swarm optimization) algorithm to obtain a minimum starting path of the DG of the distributed power supply;
and S4, completing self-healing reconstruction of the island power distribution network according to the minimum starting path of the distributed power supply DG.
2. The emergency reconstruction method for the island power grid based on the Floyd-MPSO algorithm according to claim 1, wherein the method comprises the following steps: in step S2, the minimum start path model of the distributed power supply DG specifically refers to: recovering the most important level load with the minimum starting path cost in the shortest time, wherein the solving target f of the model is as follows:
Figure FDA0003758949680000011
in the formula: omega j The weighted value of the jth starting path; c m Is the number of path edges; s Ni The input state of the ith load is shown, the value is 0 or 1,0 shows that the load is not input, and 1 shows that the load is input; f. of Ni Is the load weight; c n Is the number of loads.
3. The Floyd-MPSO algorithm-based island and reef power grid emergency reconstruction method according to claim 2, wherein the Floyd-MPSO algorithm-based island and reef power grid emergency reconstruction method comprises the following steps: the step S3 specifically includes:
s31, initializing parameters of the improved particle swarm MPSO algorithm, improving the positions of particles in the improved particle swarm MPSO algorithm, and representing the starting path of a distributed power supply DG; the index value of the particle position represents the number of each DG;
s33, generating an initial particle DG1, and taking the DG1 as a first starting DG;
s34: carrying out increasing sequencing on the initial particles DG1 to obtain a DG starting sequence;
s35: according to the generated DG starting sequence, finding a corresponding starting path from the step S2;
s36: judging whether the starting path meets the constraint condition, if so, calculating the adaptive value of the particles in the population, updating the speed and the position of the particles, and further performing iterative calculation according to the new speed and the new position of the particles;
s37: and judging whether the preset iteration times are reached, if so, ending the search and outputting the optimal path.
4. The Floyd-MPSO algorithm-based island and reef power grid emergency reconstruction method according to claim 3, wherein the Floyd-MPSO algorithm-based island and reef power grid emergency reconstruction method comprises the following steps: the constraint conditions of step S36 are:
Figure FDA0003758949680000021
Figure FDA0003758949680000022
Figure FDA0003758949680000023
V i min ≤V i ≤V i max ,i∈N D
in the formula:
Figure FDA0003758949680000024
N G is the number of DGs;
Figure FDA0003758949680000025
DG capacity for startup;
Figure FDA0003758949680000026
and
Figure FDA0003758949680000027
representing the lower limit and the upper limit of active power emitted by the kth DG;
Figure FDA0003758949680000028
and Q Gk max A lower limit and an upper limit of reactive power issued for the kth DG; v i max 、V i min The maximum value and the minimum value of the node voltage are obtained; n is a radical of D The number of nodes; p is Bi The power of the ith branch;
Figure FDA0003758949680000029
the maximum allowed power for branch i.
5. The Floyd-MPSO algorithm-based island and reef power grid emergency reconstruction method according to claim 4, wherein the Floyd-MPSO algorithm-based island and reef power grid emergency reconstruction method comprises the following steps: the calculation formula of the adaptive value in step S36 is as follows:
Figure FDA00037589496800000210
in the formula: x is the number of the black start distributed power sources BDG; y is the number of non-black start distributed power sources NBDG; theta 1 And theta 2 Representing sequential interval state quantities of the BDG and the NBDG; theta.theta. 1 1 represents that the starting sequence of the BDG is between 1 and x, and 0 represents that the starting sequence of the BDG is between x and x + y; theta 2 1 represents that the starting sequence of the non-black starting distributed power supply NBDG is between x and x + y, and 0 represents that the starting sequence of the non-black starting distributed power supply NBDG is between 1 and x; inf is an infinite positive number.
CN202210865655.XA 2022-07-22 2022-07-22 Floyd-MPSO algorithm-based island power grid emergency reconstruction method Pending CN115425637A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210865655.XA CN115425637A (en) 2022-07-22 2022-07-22 Floyd-MPSO algorithm-based island power grid emergency reconstruction method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210865655.XA CN115425637A (en) 2022-07-22 2022-07-22 Floyd-MPSO algorithm-based island power grid emergency reconstruction method

Publications (1)

Publication Number Publication Date
CN115425637A true CN115425637A (en) 2022-12-02

Family

ID=84196951

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210865655.XA Pending CN115425637A (en) 2022-07-22 2022-07-22 Floyd-MPSO algorithm-based island power grid emergency reconstruction method

Country Status (1)

Country Link
CN (1) CN115425637A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117394353A (en) * 2023-12-08 2024-01-12 国网天津市电力公司电力科学研究院 Power distribution network load transferring and recovering method and device

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN117394353A (en) * 2023-12-08 2024-01-12 国网天津市电力公司电力科学研究院 Power distribution network load transferring and recovering method and device
CN117394353B (en) * 2023-12-08 2024-05-14 国网天津市电力公司电力科学研究院 Power distribution network load transferring and recovering method and device

Similar Documents

Publication Publication Date Title
CN106815657B (en) Power distribution network double-layer planning method considering time sequence and reliability
CN103532140B (en) A kind of method and system containing service restoration after the distribution network failure of distributed power source
CN104820865B (en) Intelligent distribution network fault recovery intelligent optimization method based on graph theory
CN110334862B (en) Power system partition optimization algorithm considering recovery time
CN111817345A (en) Reconstruction method for power distribution network with distributed power supply after serious fault
CN109120009A (en) The active distribution network fault recovery method that meter and distributed generation resource power output change at random
CN103971299A (en) Power distribution network islanding method based on harmonic algorithm
CN108616124B (en) Power distribution network reconstruction calculation method based on ordered binary decision diagram
CN115425637A (en) Floyd-MPSO algorithm-based island power grid emergency reconstruction method
CN108985561A (en) A kind of active power distribution network isolated island division methods based on chance constraint
Yang et al. A novel partitioning method for the power grid restoration considering the support of multiple LCC-HVDC systems
CN107359614B (en) Dynamic reconfiguration method for safe operation of power distribution network under high-permeability renewable energy condition
CN108376997A (en) A kind of probabilistic active power distribution network isolated island division methods of consideration distributed generation resource
CN105184383B (en) City moving emergency power supply optimal scheduling method based on intelligent optimization method
CN113239622B (en) Fault recovery reconstruction method for direct-current distribution network
CN116520084A (en) Fault positioning method, device and storage medium for source-containing power distribution network
CN104283214B (en) Network reconstruction method for power distribution network
CN110034585A (en) A kind of quick planing method of distributed generation resource
Xianchao et al. Service restoration of distribution system with distributed generation
CN114665481A (en) Urban power grid partitioning method and device based on power grid node vectorization
CN115549067A (en) Power distribution network sequence recovery optimization method considering area division, recovery path and power supply sequence cooperation
CN110492493B (en) Reactive compensation configuration optimization method for power system
CN104218546B (en) A kind of self-healing recovery control method of intelligent distribution network
Jamian et al. Reconfiguration distribution network with multiple distributed generation operation types using simplified artificial bees colony
CN112688366A (en) Optimal recovery path based on distributed power supply and black start strategy

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