Coordinated planning method, device, terminal equipment and storage medium for power supply and fault current limiter

Abstract

The present invention discloses a method, apparatus, terminal device, and storage medium for coordinated planning of power supplies and fault current limiters. The method solves the coordinated planning problem of power supplies and fault current limiters as a main problem to generate an initial planning solution set. A first sub-problem is then used to eliminate all infeasible solutions in the initial planning solution set to generate a first planning solution set. A second sub-problem and a third sub-problem are used to analyze the stability and cost of the first planning solution set to generate a second planning solution set. A fourth sub-problem is used to analyze the relaxation error of the second planning solution set to ultimately generate an optimal planning solution. Therefore, the present invention decomposes the coordinated planning problem of power supplies and fault current limiters into several problems for solution, and through cyclic iterative solutions, the problem solution set is continuously converged and gradually approaches the optimal solution, ultimately generating an optimal planning solution, effectively solving a key problem in the field of GEP.

Description

Technical Field

[0001] The present invention relates to the technical field of power generation expansion planning, and in particular to a method, device, terminal equipment and storage medium for coordinated planning of a power supply and a fault current limiter. Background Art

[0002] The addition of new generators to a power system creates a generation expansion planning (GEP) problem, which increases fault currents and can cause the SC currents of power system components to exceed their permissible ratings. One solution is to upgrade these components, but this requires significant capital investment and may not be cost-effective. A more cost-effective solution is to observe the SC currents of the busbars in the GEP problem and install SFCLs in the generators to limit fault currents. However, SFCLs are expensive, so SFCL optimal planning (SOP) is needed to determine the optimal locations for the fewest SFCLs possible to minimize investment costs.

[0003] To simplify the GEP problem, most current research, both domestically and internationally, either fails to model the power network or uses a DC network model. From the perspectives of voltage and reactive power, DC network models are not feasible. Therefore, addressing the key challenges of GEP by coordinating power supply and fault current limiter planning and determining their optimal installation locations and timing has become a pressing issue. Summary of the Invention

[0004] The embodiments of the present invention provide a method, apparatus, terminal device and storage medium for coordinated planning of power supplies and fault current limiters. The method decomposes the coordinated planning problem of power supplies and fault current limiters into several small problems for solution, and continuously converges the problem solution set and gradually approaches the optimal solution through cyclic iterative solution, and finally generates the required optimal planning scheme, determines the optimal installation location and optimal installation time of the power supply and fault current limiter, and effectively solves the key problems in the GEP field.

[0005] An embodiment of the present invention provides a method for coordinated planning of a power supply and a fault current limiter, characterized by comprising:

[0006] Obtaining the line parameters, fault current limit value, planning period, equipment costs of the power supply and fault current limiter, and equipment parameters of the power supply and fault current limiter of the power system;

[0007] Constructing a main problem for generating a planning scheme, a first subproblem for feasibility analysis, a second subproblem for steady-state analysis, a third subproblem for cost analysis, and a fourth subproblem for relaxation error analysis based on the line parameters, the fault current limit value, the planning period, the equipment cost, and the equipment cost;

[0008] Solving the main problem to generate an initial planning solution set consisting of a number of initial planning solutions;

[0009] Solving and analyzing the initial planning solution set through the first sub-problem, and when the initial planning solution set is infeasible, generating a plurality of first constraints of the main problem, resolving the main problem, and generating a first planning solution set consisting of a plurality of feasible first planning solutions;

[0010] Solving and analyzing the first planning solution set in sequence through the second sub-problem and the third sub-problem to generate a plurality of second constraints and a plurality of third constraints for the main problem, and resolving the main problem to generate a second planning solution set;

[0011] The second planning solution set is composed of a plurality of second planning solutions that maximize the transient stability of the power system and minimize the operation and maintenance cost;

[0012] Solving and analyzing the second planning solution set through the fourth sub-problem, and when a relaxation error exists in the second planning solution set, generating a fourth constraint condition for the third sub-problem, resolving the third sub-problem, and generating an optimal planning solution;

[0013] The optimal planning scheme includes: a first installation time and a first installation location of each power supply, and a second installation time and a second installation location of each fault current limiter.

[0014] Furthermore, the initial planning solution set is solved and analyzed by the first sub-problem, and when the initial planning solution set is infeasible, several first constraints of the main problem are generated, and the main problem is solved again to generate a first planning solution set consisting of several feasible first planning solutions, including:

[0015] Convert the first sub-problem into a linear programming problem;

[0016] Repeating the feasibility analysis operation according to the linear programming problem and the initial planning solution set until a first planning solution set is generated;

[0017] The feasibility analysis operation includes:

[0018] Obtaining a solution set of a scheme to be evaluated that includes a plurality of schemes to be evaluated; wherein, initially, the solution set of the scheme to be evaluated is an initial planning solution set, and the scheme to be evaluated is an initial planning solution;

[0019] Analyzing the power balance of the power system after implementation of each scheme to be evaluated through the linear programming problem, and generating a first dual variable and a first objective function value of the first subproblem;

[0020] When it is determined that the first objective function value is not equal to 0, determining that there is a solution to be evaluated that causes power imbalance in the power system in the solution set of the planning scheme to be evaluated, and determining that the solution set of the planning scheme to be evaluated is infeasible;

[0021] generating a first infeasibility cutting plane as a first constraint condition according to the first dual variable, and adding the first constraint condition to a constraint condition set preset in the main problem;

[0022] Re-solving the main problem according to the constraint condition set to generate a set of solutions to be evaluated required for the next round of feasibility analysis operation;

[0023] When it is determined that the first objective function value is equal to 0, it is determined that there is no scheme to be evaluated in the solution set of the planning scheme to be evaluated that causes power imbalance in the power system, then it is determined that the solution set of the planning scheme to be evaluated is feasible, and the solution set of the planning scheme to be evaluated is used as the first planning scheme solution set, and the scheme to be evaluated is used as the first planning scheme in the first planning scheme solution set.

[0024] Furthermore, the first planning solution set is solved and analyzed in sequence by the second subproblem and the third subproblem to generate a plurality of second constraints and a plurality of third constraints of the main problem, and the main problem is solved again to generate a second planning solution set, including:

[0025] Repeating the solution set convergence operation according to the second sub-problem, the third sub-problem, and the first planning solution set until a second planning solution set is generated;

[0026] The solution set convergence operation includes:

[0027] Acquire a solution set to be converged consisting of a plurality of solutions to be converged; initially, the solution set to be converged is the first planning solution set, and the solution to be converged is the first planning solution;

[0028] Solving the transient stability index of each of the to-be-converged solutions through the second subproblem, and generating a second objective function value and a second dual variable of the second subproblem according to the transient stability index;

[0029] generating a second infeasibility cutting plane as a second constraint condition according to the second objective function value and the second dual variable, and adding the second constraint condition to the constraint condition set of the main problem;

[0030] Solving the operation and maintenance cost of each of the to-be-converged solutions through the third subproblem, and generating a third objective function value and a third dual variable of the third subproblem according to the operation and maintenance cost;

[0031] generating a feasibility cutting plane as a third constraint condition according to the third objective function value and the third dual variable, and adding the third constraint condition to the constraint condition set of the main problem;

[0032] Solving the main problem according to the constraint condition set, generating a tentative planning solution set, and evaluating whether the tentative planning solution set converges;

[0033] If not, the tentative planning solution set is used as the unconverged solution set required for the next round of solution set convergence operation;

[0034] If so, the tentative planning solution set is used as the second planning solution set.

[0035] Furthermore, solving the main problem according to the constraint condition set, generating a tentative planning solution set, and evaluating whether the tentative planning solution set converges, includes:

[0036] Solving the main problem according to the constraint condition set to generate a main objective function value of the main problem and a tentative planning solution set;

[0037] Calculating the convergence degree of the solution set of the tentative planning scheme according to the value of the main objective function and the value of the third objective function;

[0038] When the convergence degree is greater than a preset convergence index, determining that the solution set of the provisional planning scheme is not converged;

[0039] When the convergence degree is not greater than the convergence index, it is determined that the solution set of the provisional planning scheme converges.

[0040] Furthermore, the step of solving and analyzing the second planning solution set through the fourth sub-problem and, when a relaxation error exists in the second planning solution set, generating a fourth constraint condition for the third sub-problem, resolving the third sub-problem, and generating an optimal planning solution includes:

[0041] Repeating the error elimination operation according to the fourth sub-problem and the second planning solution set until an optimal planning solution is generated;

[0042] The error elimination operation includes:

[0043] Obtaining a solution set of solutions to be optimized that includes a plurality of solutions to be optimized; wherein, initially, the solution set of solutions to be optimized is the second planning solution set, and the solution to be optimized is the second planning solution;

[0044] Calculating the relaxation error of each to-be-optimized solution according to the fourth subproblem, and calculating the fourth objective function value and the fourth dual variable of the fourth subproblem according to the relaxation error;

[0045] When the fourth objective function value is not equal to 0, determining that a solution to be optimized in the solution set to be optimized has a relaxation error;

[0046] generating a third infeasibility cutting plane as a fourth constraint function of the third subproblem based on the fourth objective function value and the fourth dual variable, and resolving the third subproblem to generate a solution set to be optimized required for the next round of error elimination operation;

[0047] When the fourth objective function value is equal to 0, it is determined that the solution to be optimized in the solution set to be optimized is the optimal planning solution without relaxation error.

[0048] Another embodiment of the present invention provides a coordinated planning device for a power supply and a fault current limiter, comprising:

[0049] A parameter acquisition module, used to obtain line parameters of the power system, fault current limit value, planning period, equipment costs of power supply and fault current limiter, and equipment parameters of power supply and fault current limiter;

[0050] a problem construction module, configured to construct, based on the line parameters, the fault current limit value, the planning period, the equipment cost, and the equipment cost, a main problem for generating a planning solution, a first sub-problem for feasibility analysis, a second sub-problem for steady-state analysis, a third sub-problem for cost analysis, and a fourth sub-problem for relaxation error analysis;

[0051] A main problem solving module, configured to solve the main problem and generate an initial planning solution set consisting of a plurality of initial planning solutions;

[0052] a first sub-problem solving module, configured to solve and analyze the initial planning solution set using the first sub-problem, and, if the initial planning solution set is infeasible, generate a plurality of first constraints for the main problem, re-solve the main problem, and generate a first planning solution set consisting of a plurality of feasible first planning solutions;

[0053] a second sub-problem solving module, configured to solve and analyze the first planning solution set in sequence through the second sub-problem and the third sub-problem, generate a plurality of second constraints and a plurality of third constraints for the main problem, and re-solve the main problem to generate a second planning solution set; wherein the second planning solution set is composed of a plurality of second planning solutions that maximize the transient stability of the power system and minimize the operation and maintenance cost;

[0054] A solution generation module is used to solve and analyze the second planning solution set through the fourth sub-problem, and when there is a relaxation error in the second planning solution set, generate the fourth constraint condition of the third sub-problem, re-solve the third sub-problem, and generate an optimal planning solution; wherein, the optimal planning solution includes: a first installation time and a first installation location of each power supply, and a second installation time and a second installation location of each fault current limiter.

[0055] Furthermore, the first sub-problem solving module solves and analyzes the initial planning solution set using the first sub-problem, and when the initial planning solution set is infeasible, generates several first constraints for the main problem, re-solves the main problem, and generates a first planning solution set consisting of several feasible first planning solutions, including:

[0056] Convert the first sub-problem into a linear programming problem;

[0057] Repeating the feasibility analysis operation according to the linear programming problem and the initial planning solution set until a first planning solution set is generated;

[0058] The feasibility analysis operation includes:

[0059] Obtaining a solution set of a scheme to be evaluated that includes a plurality of schemes to be evaluated; wherein, initially, the solution set of the scheme to be evaluated is an initial planning solution set, and the scheme to be evaluated is an initial planning solution;

[0060] Analyzing the power balance of the power system after implementation of each scheme to be evaluated through the linear programming problem, and generating a first dual variable and a first objective function value of the first subproblem;

[0061] When it is determined that the first objective function value is not equal to 0, determining that there is a solution to be evaluated that causes power imbalance in the power system in the solution set of the planning scheme to be evaluated, and determining that the solution set of the planning scheme to be evaluated is infeasible;

[0062] generating a first infeasibility cutting plane as a first constraint condition according to the first dual variable, and adding the first constraint condition to a constraint condition set preset in the main problem;

[0063] Re-solving the main problem according to the constraint condition set to generate a set of solutions to be evaluated required for the next round of feasibility analysis operation;

[0064] When it is determined that the first objective function value is equal to 0, it is determined that there is no scheme to be evaluated in the solution set of the planning scheme to be evaluated that causes power imbalance in the power system, then it is determined that the solution set of the planning scheme to be evaluated is feasible, and the solution set of the planning scheme to be evaluated is used as the first planning scheme solution set, and the scheme to be evaluated is used as the first planning scheme in the first planning scheme solution set.

[0065] Furthermore, the second sub-problem solving module sequentially solves and analyzes the first planning solution set through the second sub-problem and the third sub-problem, generates a plurality of second constraints and a plurality of third constraints for the main problem, and re-solves the main problem to generate a second planning solution set, including:

[0066] Repeating the solution set convergence operation according to the second sub-problem, the third sub-problem, and the first planning solution set until a second planning solution set is generated;

[0067] The solution set convergence operation includes:

[0068] Acquire a solution set to be converged consisting of a plurality of solutions to be converged; initially, the solution set to be converged is the first planning solution set, and the solution to be converged is the first planning solution;

[0069] Solving the transient stability index of each of the to-be-converged solutions through the second subproblem, and generating a second objective function value and a second dual variable of the second subproblem according to the transient stability index;

[0070] generating a second infeasibility cutting plane as a second constraint condition according to the second objective function value and the second dual variable, and adding the second constraint condition to the constraint condition set of the main problem;

[0071] Solving the operation and maintenance cost of each of the to-be-converged solutions through the third subproblem, and generating a third objective function value and a third dual variable of the third subproblem according to the operation and maintenance cost;

[0072] generating a feasibility cutting plane as a third constraint condition according to the third objective function value and the third dual variable, and adding the third constraint condition to the constraint condition set of the main problem;

[0073] Solving the main problem according to the constraint condition set, generating a tentative planning solution set, and evaluating whether the tentative planning solution set converges;

[0074] If not, the tentative planning solution set is used as the unconverged solution set required for the next round of solution set convergence operation;

[0075] If so, the tentative planning solution set is used as the second planning solution set.

[0076] Another embodiment of the present invention provides a terminal device, including a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein when the processor executes the computer program, it implements a method for coordinated planning of a power supply and a fault current limiter as described in any one of the embodiments.

[0077] Another embodiment of the present invention provides a storage medium, characterized in that the storage medium includes a stored computer program, wherein when the computer program is running, the device where the storage medium is located is controlled to execute a coordinated planning method for a power supply and a fault current limiter as described in any one of the above embodiments.

[0078] The following beneficial effects are achieved by implementing the present invention:

[0079] The present invention discloses a method, apparatus, terminal device and storage medium for coordinated planning of power supply and fault current limiter. The method defines the coordinated planning problem of power supply and fault current limiter as a main problem for solving, generates an initial planning solution set, then eliminates all infeasible solutions in the initial planning solution set through a first sub-problem to generate a first planning solution set, analyzes the stability and cost of the first planning solution set through a second sub-problem and a third sub-problem, so that the first planning solution converges to generate a second planning solution set, and analyzes the relaxation error of the second planning solution set through a fourth sub-problem to finally generate an optimal planning solution. Therefore, the present invention decomposes the coordinated planning problem of power supply and fault current limiter into several small problems for solving, and continuously makes the problem solution set converge and gradually approach the optimal solution through cyclic iterative solving, finally generates the required optimal planning solution, determines the optimal installation position and optimal installation time of the power supply and fault current limiter, and effectively solves the key problems in the field of GEP. BRIEF DESCRIPTION OF THE DRAWINGS

[0080] Figure 1 The figure is a flow chart of a method for coordinated planning of a power supply and a fault current limiter provided in one embodiment of the present invention.

[0081] Figure 2 It is a structural diagram of a coordinated planning device for a power supply and a fault current limiter provided by one embodiment of the present invention.

[0082] Figure 3 It is a schematic diagram of the optimal planning scheme and other planning schemes provided by an embodiment of the present invention.

[0083] Figure 4 This is a comparison chart of planning results of the optimal planning scheme provided by an embodiment of the present invention and other planning schemes.

[0084] Figure 5 This is a comparison chart of CCT results of the optimal planning scheme provided by an embodiment of the present invention and other planning schemes. DETAILED DESCRIPTION

[0085] To make the objectives, technical solutions, and advantages of this application more clear, the technical solutions in this application will be clearly and completely described below in conjunction with the accompanying drawings in the embodiments of this application. Obviously, the described embodiments are only part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making any creative efforts are within the scope of protection of this application.

[0086] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by those skilled in the art to which this application belongs; the terms used herein are only for the purpose of describing specific embodiments and are not intended to limit this application; the terms "including" and "having" and any variations thereof in the specification and claims of this application and the above-mentioned figure descriptions are intended to cover non-exclusive inclusions.

[0087] In the description of the embodiments of this application, the technical terms "first" and "second" are used only to distinguish different objects and should not be understood to indicate or imply relative importance or implicitly specify the quantity, specific order, or primary and secondary relationship of the indicated technical features. In the description of the embodiments of this application, the meaning of "plurality" is more than two, unless otherwise clearly and specifically defined.

[0088] References herein to "embodiments" mean that a particular feature, structure, or characteristic described in connection with the embodiments may be included in at least one embodiment of the present application. The appearance of this phrase in various places in the specification does not necessarily refer to the same embodiment, nor does it constitute an independent or alternative embodiment that is mutually exclusive of other embodiments. It is understood, both explicitly and implicitly, by those skilled in the art that the embodiments described herein may be combined with other embodiments.

[0089] See also Figure 1 , is a flow chart of a method for coordinated planning of a power supply and a fault current limiter provided by an embodiment of the present invention, including:

[0090] S1. Obtaining line parameters, fault current limit value, planning period, equipment costs of power supply and fault current limiter, and equipment parameters of power supply and fault current limiter of the power system;

[0091] In a preferred embodiment of the present invention, the line parameters of an IEEE 118 bus test system are input. The system has 186 branches, 19 generators, and 99 loads. An annual load growth rate of 5%, a discount rate of 10%, a minimum reserve margin of 15%, and a planning period of 10 years are assumed. The circuit breaker current at 220 kV is assumed to be 35 kA, the fixed cost and resistance cost of the SFCLs are $1.5 million / Ω and $0.6 million / Ω, respectively, and a 250 MW generator set is selected as the backup generator. Two faults, F1 and F2, are considered, with probabilities of 0.0068 and 0.0033, respectively, making them credible faults.

[0092] S2. Constructing a main problem for generating a planning scheme, a first subproblem for feasibility analysis, a second subproblem for steady-state analysis, a third subproblem for cost analysis, and a fourth subproblem for relaxation error analysis based on the line parameters, the fault current limit value, the planning period, the equipment cost, and the equipment cost;

[0093] S3. Solve the main problem to generate an initial planning solution set consisting of several initial planning solutions;

[0094] In a preferred embodiment of the present invention, in step S2, the main problem is constructed as a mixed integer linear programming problem:

[0095]

[0096] Among them, where: represents a generator; Indicates a backup generator; Indicates the planning period (year); is the investment cost of the standby generator δ; C I is the investment cost, including the cost of the new generator Fixed costs of SFCLs on existing and new generators and the resistor cost of SFCLs is the SFCL fixed cost of generator g; is the SFCL resistance cost of generator g; is the lower limit of SFCL resistance of generator g; is the upper limit of the SFCL resistance of generator g; χ is the investment discount rate; φ g,t Indicates whether the generator g is installed at time t, if yes, it is 1, otherwise it is 0; Indicates whether the SFCL of generator g is installed at time t, which is 1 if yes and 0 otherwise; is the effective SFCL resistance of generator g at time t.

[0097] Furthermore, in this embodiment, the master problem is iteratively solved, and the generator and superconducting fault current limiter (SFCL) are added in each iteration, and the value of the critical cut-off time (CCT) is updated. It can be understood that several initial planning schemes are generated during the iterative solution of the master problem, and when the iteration is completed, the feasibility cutting plane of the master problem and the lower bound of the Benders decomposition (BD), that is, the value of the main objective function, are determined based on the several initial planning schemes:

[0098]

[0099] Where: is the objective function value of MP, and W is the feasibility cutting plane.

[0100] S4. Solving and analyzing the initial planning solution set using the first sub-problem, and if the initial planning solution set is infeasible, generating a plurality of first constraints for the main problem, resolving the main problem, and generating a first planning solution set consisting of a plurality of feasible first planning solutions;

[0101] Preferably, the step of solving and analyzing the initial planning solution set through the first sub-problem and, when the initial planning solution set is infeasible, generating several first constraints of the main problem, resolving the main problem, and generating a first planning solution set consisting of several feasible first planning solutions includes:

[0102] S41. Convert the first sub-problem into a linear programming problem;

[0103] S42, repeating the feasibility analysis operation according to the linear programming problem and the initial planning solution set until a first planning solution set is generated;

[0104] The feasibility analysis operation includes:

[0105] S421. Obtain a solution set of schemes to be evaluated that includes a plurality of schemes to be evaluated; wherein, initially, the solution set of schemes to be evaluated is an initial planning solution set, and the scheme to be evaluated is an initial planning solution;

[0106] S422. Analyze the power balance of the power system after implementation of each scheme to be evaluated through the linear programming problem, and generate a first dual variable and a first objective function value of the first subproblem;

[0107] S423: When it is determined that the first objective function value is not equal to 0, determining that there is a solution to be evaluated that causes power imbalance in the power system in the solution set of the planning scheme to be evaluated, and determining that the solution set of the planning scheme to be evaluated is infeasible;

[0108] S424: Generate a first infeasibility cut plane as a first constraint condition based on the first dual variable, and add the first constraint condition to a constraint condition set preset for the main problem;

[0109] S425, re-solving the main problem according to the constraint condition set to generate a set of solutions to be evaluated required for the next round of feasibility analysis operation;

[0110] S426. When it is determined that the first objective function value is equal to 0, it is determined that there is no scheme to be evaluated in the solution set of the planning scheme to be evaluated that causes power imbalance in the power system, then it is determined that the solution set of the planning scheme to be evaluated is feasible, and the solution set of the planning scheme to be evaluated is used as the first planning scheme solution set, and the scheme to be evaluated is used as the first planning scheme in the first planning scheme solution set.

[0111] In a preferred embodiment of the present invention, the nonlinear form of the first sub-problem SP1 constructed in step S2 is as follows:

[0112]

[0113]

[0114] γ i,j,d,t =V i,d,t V j,d,t sinθ i,j,d,t ;

[0115] θ i,j,d,t =θ i,d,t -θ j,d,t ;

[0116] Where: Indicates busbar; Indicates a branch; Indicates the level of demand; is the slack variable used for active power balancing in SP1; is the slack variable used for reactive power balancing in SP1; Indicates whether the generator g is on the bus i, if yes, it is 1, otherwise it is 0; Indicates whether line l is connected from bus i to bus j, if yes, it is 1, otherwise 0; σ l,i Indicates whether line l is connected to bus i, if yes, it is 1, otherwise it is 0; are the active and reactive loads of bus i at demand level d and period t; is the parallel conductance and susceptance of busbar i; V i L ,V i Uare the upper and lower limits of the bus i voltage amplitude; are the upper and lower limits of the active power of generator g; are the upper and lower limits of the reactive power of generator g; is the upper limit of the angle difference across the line ij; is the reactance of the standby generator; is the upper limit of the short-circuit current at busbar i; is the minimum storage in time period t; the variables in the above formula are fixed to the optimal values ​​obtained from the main problem; the symbol → represents the stored dual value of the equation. i,δ and ν i,g When the generator Gρ and the SFCL connected in series with the generator Gg are added, ΔX ii The slope of the linear part (i.e. sensitivity). ii,0 and X ii,t Represents the beginning of the planning layer and the t-th year Z BUS Reactance of diagonal element ii. is the current rating of bus i; P is the active and reactive power of generator g at demand level d and time period t; l,d,t ,Q l,d,t are the active and reactive power flows of line l at demand level d and time period t; ω i,d,t , and γ i,j,d,t are all slack variables.

[0117] Furthermore, the first subproblem SP1 is transformed into a linear programming problem and calculated using McCormick relaxation:

[0118]

[0119] β i,j,d,t ,β i,j,d,t +γ i,j,d,t ,γ i,j,d,t =ω i,d,t ,ω j,d,t ;

[0120] Where: x,y≈xy represents McCormick relaxation.

[0121] Furthermore, in this embodiment, the feasibility of the scheme to be evaluated is solved (the first sub-problem SP1), and the first objective function value is calculated. To judge, if It means that all power imbalances are eliminated. If the first objective function value is When , the first infeasibility cutting plane of the first sub-problem SP1 is generated and added to the constraint set of the main problem to eliminate the power imbalance in the solution set of the main problem. The first infeasibility cutting plane is as follows:

[0122]

[0123] S5. Solve and analyze the first planning solution set in sequence by using the second sub-problem and the third sub-problem to generate a plurality of second constraints and a plurality of third constraints for the main problem, and solve the main problem again to generate a second planning solution set;

[0124] The second planning solution set is composed of a plurality of second planning solutions that maximize the transient stability of the power system and minimize the operation and maintenance cost;

[0125] Preferably, the step of sequentially solving and analyzing the first planning solution set through the second subproblem and the third subproblem to generate a plurality of second constraints and a plurality of third constraints for the main problem, and resolving the main problem to generate a second planning solution set includes:

[0126] S51, repeatedly performing a solution set convergence operation according to the second sub-problem, the third sub-problem, and the first planning solution set until a second planning solution set is generated;

[0127] The solution set convergence operation includes:

[0128] S511, obtaining a to-be-converged solution set consisting of a plurality of to-be-converged solutions; initially, the to-be-converged solution set is the first planning solution set, and the to-be-converged solution is the first planning solution;

[0129] S512. Solve the transient stability index of each of the to-be-converged solutions through the second subproblem, and generate a second objective function value and a second dual variable of the second subproblem according to the transient stability index;

[0130] S513: Generate a second infeasibility cut plane as a second constraint condition according to the second objective function value and the second dual variable, and add the second constraint condition to the constraint condition set of the main problem;

[0131] In a preferred embodiment of the present invention, the optimal transient stability index (second sub-problem SP2) is solved to maximize the transient stability index CCT under reliable faults, and its infeasibility cutting plane is generated and added to the constraint set of the main problem:

[0132]

[0133] Where: is the probability of a credible fault k occurring in period t; ΔCCT k,tis the change in CCT for each credible fault in each planning year for a given fault scenario k, t relative to the base case (before adding new generators and SFCLs); constrain ΔCCT k,t > 0 to ensure that CCT does not deteriorate relative to the base case during planning. When the cost is minimized, CCT is maximized via the second subproblem SP2 without the need for multi-objective programming.

[0134] The second infeasibility cutting plane of SP2 for the second subproblem:

[0135]

[0136] Where: is the objective function value of the second subproblem SP2.

[0137] S514. Solve the operation and maintenance cost of each of the to-be-converged solutions through the third subproblem, and generate a third objective function value and a third dual variable of the third subproblem according to the operation and maintenance cost;

[0138] S515: Generate a feasibility cutting plane as a third constraint condition according to the third objective function value and the third dual variable, and add the third constraint condition to the constraint condition set of the main problem;

[0139] S516, solving the main problem according to the constraint condition set, generating a tentative planning solution set, and evaluating whether the tentative planning solution set converges;

[0140] Preferably, solving the main problem according to the constraint condition set, generating a tentative planning solution set, and evaluating whether the tentative planning solution set converges, includes:

[0141] S5161. Solve the main problem according to the constraint condition set to generate a main objective function value of the main problem and a tentative planning solution set;

[0142] S5162. Calculate the convergence degree of the solution set of the tentative planning scheme according to the value of the main objective function and the value of the third objective function;

[0143] S5163: When the convergence degree is greater than a preset convergence index, determining that the solution set of the provisional planning scheme is not converged;

[0144] S5164: When the degree of convergence is not greater than the convergence index, determine that the solution set of the provisional planning scheme converges.

[0145] S517: If not, use the tentative planning solution set as the to-be-converged solution set required for the next round of solution set convergence operation;

[0146] S518: If yes, use the tentative planning solution set as the second planning solution set.

[0147] In a preferred embodiment of the present invention, the optimal operation and maintenance cost (the third subproblem SP3) is solved and its feasibility cut plane is generated and added to the constraint set of the main problem. The BD upper bound is updated and the algorithm is judged to be convergent. If it is converged, the next step is carried out; otherwise, the main problem is solved again.

[0148] Specifically, the operation and maintenance costs of existing and new generators are converted into LP problems for optimization:

[0149]

[0150] Where: is the operation and maintenance cost of generator g; τ d is the duration of demand level d within the planning horizon.

[0151] Generate the feasibility cutting plane of the third subproblem SP3 and add it to the constraint set of the main problem so that the BD algorithm converges:

[0152]

[0153] Where: is the objective function value of SP3;

[0154] Furthermore, the convergence degree of the tentative planning solution set is calculated by the following formula:

[0155]

[0156] Among them, ε′ is the convergence degree of the solution set of the tentative planning scheme;

[0157] Furthermore, ε is a preset convergence indicator. When ε′>ε, it is determined that the tentative planning solution set has not converged, and the tentative planning solution set is used as the unconverged solution set required for the next round of solution set convergence operation. When ε′≤ε, it is determined that the tentative planning solution set has converged, and the tentative planning solution set is used as the second planning solution set.

[0158] S6. Solve and analyze the second planning solution set by using the fourth sub-problem, and if a relaxation error exists in the second planning solution set, generate a fourth constraint condition for the third sub-problem, re-solve the third sub-problem, and generate an optimal planning solution.

[0159] The optimal planning scheme includes: a first installation time and a first installation location of each power supply, and a second installation time and a second installation location of each fault current limiter.

[0160] Preferably, the step of solving and analyzing the second planning solution set by using the fourth sub-problem, and when a relaxation error exists in the second planning solution set, generating a fourth constraint condition for the third sub-problem, resolving the third sub-problem, and generating an optimal planning solution includes:

[0161] S61, repeatedly performing error elimination operations according to the fourth sub-problem and the second planning solution set until an optimal planning solution is generated;

[0162] The error elimination operation includes:

[0163] S611. Obtain a solution set of solutions to be optimized that includes a plurality of solutions to be optimized; wherein, initially, the solution set of solutions to be optimized is the second planning solution set, and the solution to be optimized is the second planning solution;

[0164] S612: Calculate the relaxation error of each solution to be optimized according to the fourth sub-problem, and calculate the fourth objective function value and the fourth dual variable of the fourth sub-problem according to the relaxation error;

[0165] S613: When the fourth objective function value is not equal to 0, determining that a solution to be optimized in the set of solutions to be optimized has a relaxation error;

[0166] S614: Generate a third infeasibility cut plane as a fourth constraint function of the third subproblem based on the fourth objective function value and the fourth dual variable, and re-solve the third subproblem to generate a solution set to be optimized required for the next round of error elimination operation;

[0167] S615: When the fourth objective function value is equal to 0, determine that the solution to be optimized in the solution set to be optimized is the optimal planning solution without relaxation error.

[0168] In a preferred embodiment of the present invention, the relaxation error in the third sub-problem SP3 (the fourth sub-problem SP4) is solved, and the fourth objective function value is calculated. To judge, if This means that all relaxation errors in the third subproblem SP3 are eliminated, and the optimal planning solution is output. Otherwise, the third infeasible cutting plane of the fourth subproblem SP4 is generated and added to the third subproblem SP3, and the solution returns to S5 to solve the third subproblem again.

[0169]

[0170]

[0171] Where: All are slack variables in SP4.

[0172] The infeasibility cutting plane of the fourth subproblem SP4 is:

[0173]

[0174] like Figure 3 As shown in FIG, the GEP-SOP scheme generated according to the data of step S1 in this embodiment is compared with the traditional GEP scheme that does not consider the SC constraint and transient stability constraint. Figure 3 As can be seen in the figure, the GEP solution builds eight generators from years 3 to 10 to respond to load growth. However, the SC currents on four buses (25, 40, 62, and 85) exceed the maximum permitted SC current (35kA) in different years. This indicates that the GEP solution is not practical from an SC current perspective. In contrast, the GEP-SOP solution effectively positions the generators and SFCLs so that the SC current on all buses is limited to 35kA. Although the total cost of the GEP-SOP solution is slightly higher than that of the GEP solution, the GEP solution requires significant additional expenditure for component upgrades and load shedding, resulting in a higher total cost.

[0175] like Figure 4 Figure 2 shows the CCT results of the IEEE 118 bus test system under the GEP and GEP-SOP schemes. It can be seen that under the GEP scheme, the CCT values ​​in most years are lower than the CCT values ​​of the base case, which means that the transient stability state deteriorates after planning and the stability of the power system cannot be guaranteed. However, the CCT values ​​provided by the proposed GEP-SOP scheme in all planning years are greater than the CCT values ​​under the general situation before planning and the CCT values ​​under the GEP scheme. This shows that even if the local relay protection device fails, the backup relay protection device can clear the fault and maintain system stability with sufficient stability margin. In other words, the transient stability provided by the GEP-SOP scheme is significantly better than that of the GEP scheme.

[0176] Figure 5 is the relaxation error under the GEP-SOP scheme. It can be seen that after 5 iterations between the fifth and sixth steps, the relaxation error finally disappears. This means that the solution obtained by the linearized model is the same as the solution of the original MINLP problem.

[0177] This embodiment provides a method for coordinated planning of power supply and fault current limiter, which defines the coordinated planning problem of power supply and fault current limiter as a main problem for solution, generates an initial planning solution set, then eliminates all infeasible solutions in the initial planning solution set through a first sub-problem to generate a first planning solution set, analyzes the stability and cost of the first planning solution set through a second sub-problem and a third sub-problem, so that the first planning solution converges to generate a second planning solution set, and analyzes the relaxation error of the second planning solution set through a fourth sub-problem to finally generate an optimal planning solution. Therefore, the present invention decomposes the coordinated planning problem of power supply and fault current limiter into several small problems for solution, and continuously makes the problem solution set converge and gradually approach the optimal solution through cyclic iterative solution, finally generates the required optimal planning solution, determines the optimal installation position and optimal installation time of the power supply and fault current limiter, and effectively solves the key problems in the field of GEP.

[0178] See also Figure 2 , is a schematic structural diagram of a coordinated planning device for a power supply and a fault current limiter provided in one embodiment of the present invention, comprising:

[0179] A parameter acquisition module, used to obtain line parameters of the power system, fault current limit value, planning period, equipment costs of power supply and fault current limiter, and equipment parameters of power supply and fault current limiter;

[0180] a problem construction module, configured to construct, based on the line parameters, the fault current limit value, the planning period, the equipment cost, and the equipment cost, a main problem for generating a planning solution, a first sub-problem for feasibility analysis, a second sub-problem for steady-state analysis, a third sub-problem for cost analysis, and a fourth sub-problem for relaxation error analysis;

[0181] A main problem solving module, configured to solve the main problem and generate an initial planning solution set consisting of a plurality of initial planning solutions;

[0182] a first sub-problem solving module, configured to solve and analyze the initial planning solution set using the first sub-problem, and, if the initial planning solution set is infeasible, generate a plurality of first constraints for the main problem, re-solve the main problem, and generate a first planning solution set consisting of a plurality of feasible first planning solutions;

[0183] a second sub-problem solving module, configured to solve and analyze the first planning solution set in sequence through the second sub-problem and the third sub-problem, generate a plurality of second constraints and a plurality of third constraints for the main problem, and re-solve the main problem to generate a second planning solution set; wherein the second planning solution set is composed of a plurality of second planning solutions that maximize the transient stability of the power system and minimize the operation and maintenance cost;

[0184] A solution generation module is used to solve and analyze the second planning solution set through the fourth sub-problem, and when there is a relaxation error in the second planning solution set, generate the fourth constraint condition of the third sub-problem, re-solve the third sub-problem, and generate an optimal planning solution; wherein, the optimal planning solution includes: a first installation time and a first installation location of each power supply, and a second installation time and a second installation location of each fault current limiter.

[0185] Preferably, the first sub-problem solving module solves and analyzes the initial planning solution set through the first sub-problem, and when the initial planning solution set is infeasible, generates several first constraints of the main problem, re-solves the main problem, and generates a first planning solution set consisting of several feasible first planning solutions, including:

[0186] Convert the first sub-problem into a linear programming problem;

[0187] Repeating the feasibility analysis operation according to the linear programming problem and the initial planning solution set until a first planning solution set is generated;

[0188] The feasibility analysis operation includes:

[0189] Obtaining a solution set of a scheme to be evaluated that includes a plurality of schemes to be evaluated; wherein, initially, the solution set of the scheme to be evaluated is an initial planning solution set, and the scheme to be evaluated is an initial planning solution;

[0190] Analyzing the power balance of the power system after implementation of each scheme to be evaluated through the linear programming problem, and generating a first dual variable and a first objective function value of the first subproblem;

[0191] When it is determined that the first objective function value is not equal to 0, determining that there is a solution to be evaluated that causes power imbalance in the power system in the solution set of the planning scheme to be evaluated, and determining that the solution set of the planning scheme to be evaluated is infeasible;

[0192] generating a first infeasibility cutting plane as a first constraint condition according to the first dual variable, and adding the first constraint condition to a constraint condition set preset in the main problem;

[0193] Re-solving the main problem according to the constraint condition set to generate a set of solutions to be evaluated required for the next round of feasibility analysis operation;

[0194] When it is determined that the first objective function value is equal to 0, it is determined that there is no scheme to be evaluated in the solution set of the planning scheme to be evaluated that causes power imbalance in the power system, then it is determined that the solution set of the planning scheme to be evaluated is feasible, and the solution set of the planning scheme to be evaluated is used as the first planning scheme solution set, and the scheme to be evaluated is used as the first planning scheme in the first planning scheme solution set.

[0195] Preferably, the second sub-problem solving module sequentially solves and analyzes the first planning solution set through the second sub-problem and the third sub-problem, generates a plurality of second constraints and a plurality of third constraints for the main problem, and re-solves the main problem to generate a second planning solution set, including:

[0196] Repeating the solution set convergence operation according to the second sub-problem, the third sub-problem, and the first planning solution set until a second planning solution set is generated;

[0197] The solution set convergence operation includes:

[0198] Acquire a solution set to be converged consisting of a plurality of solutions to be converged; initially, the solution set to be converged is the first planning solution set, and the solution to be converged is the first planning solution;

[0199] Solving the transient stability index of each of the to-be-converged solutions through the second subproblem, and generating a second objective function value and a second dual variable of the second subproblem according to the transient stability index;

[0200] generating a second infeasibility cutting plane as a second constraint condition according to the second objective function value and the second dual variable, and adding the second constraint condition to the constraint condition set of the main problem;

[0201] Solving the operation and maintenance cost of each of the to-be-converged solutions through the third subproblem, and generating a third objective function value and a third dual variable of the third subproblem according to the operation and maintenance cost;

[0202] generating a feasibility cutting plane as a third constraint condition according to the third objective function value and the third dual variable, and adding the third constraint condition to the constraint condition set of the main problem;

[0203] Solving the main problem according to the constraint condition set, generating a tentative planning solution set, and evaluating whether the tentative planning solution set converges;

[0204] If not, the tentative planning solution set is used as the unconverged solution set required for the next round of solution set convergence operation;

[0205] If so, the tentative planning solution set is used as the second planning solution set.

[0206] It should be noted that the device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, they may be located in one place, or they may be distributed across multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the present embodiment. In addition, in the drawings of the device embodiments provided by the present invention, the connection relationship between the modules indicates that there is a communication connection between them, which may be specifically implemented as one or more communication buses or signal lines. A person of ordinary skill in the art can understand and implement the present invention without inventive effort.

[0207] Those skilled in the art will clearly understand that for the sake of convenience and brevity, the specific working process of the device described above can refer to the corresponding process in the aforementioned method embodiment, and will not be repeated here.

[0208] Another preferred embodiment of the present invention provides a terminal device, comprising a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein when the processor executes the computer program, the method for coordinated planning of a power supply and a fault current limiter as described in any one of the above embodiments is implemented.

[0209] The terminal device may be a computing device such as a desktop computer, a notebook computer, a PDA, a cloud server, etc. The terminal device may include, but is not limited to, a processor and a memory.

[0210] The processor may be a central processing unit (CPU), other general-purpose processors, digital signal processors (DSP), application-specific integrated circuits (ASIC), field-programmable gate arrays (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or any conventional processor, etc. The processor is the control center of the terminal device, connecting various parts of the entire terminal device using various interfaces and lines.

[0211] The memory can be used to store the computer program, and the processor realizes various functions of the terminal device by running or executing the computer program stored in the memory and calling the data stored in the memory. The memory can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, at least one application required for a function, etc.; the data storage area can store data created based on the use of the mobile phone, etc. In addition, the memory can include a high-speed random access memory and can also include a non-volatile memory, such as a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash card (Flash Card), at least one disk storage device, a flash memory device, or other volatile solid-state storage device.

[0212] Another preferred embodiment of the present invention provides a storage medium, which is a computer-readable storage medium, and the computer program is stored in the computer-readable storage medium. When the computer program is executed by the processor, it can implement the steps of the above-mentioned various method embodiments. The computer program includes computer program code, and the computer program code can be in source code form, object code form, executable file or some intermediate form. The computer-readable medium may include: any entity or device that can carry the computer program code, a recording medium, a USB flash drive, a mobile hard disk, a magnetic disk, an optical disk, a computer memory, a read-only memory (ROM), a random access memory (RAM), an electrical carrier signal, a telecommunications signal, and a software distribution medium.

[0213] The above is a preferred embodiment of the present invention. It should be pointed out that for ordinary technicians in this technical field, several improvements and modifications can be made without departing from the principles of the present invention. These improvements and modifications are also considered to be within the scope of protection of the present invention.

Claims

1. A method for coordinated planning of power supplies and fault current limiters, characterized in that: include: Obtaining the line parameters, fault current limit value, planning period, equipment costs of the power supply and fault current limiter, and equipment parameters of the power supply and fault current limiter of the power system; Constructing a main problem for generating a planning scheme, a first sub-problem for feasibility analysis, a second sub-problem for steady-state analysis, a third sub-problem for cost analysis, and a fourth sub-problem for relaxation error analysis based on the line parameters, the fault current limit value, the planning period, the equipment cost, and the equipment parameters; Solving the main problem to generate an initial planning solution set consisting of a number of initial planning solutions; Solving and analyzing the initial planning solution set through the first sub-problem, and when the initial planning solution set is infeasible, generating a plurality of first constraints of the main problem, resolving the main problem, and generating a first planning solution set consisting of a plurality of feasible first planning solutions; Solving and analyzing the first planning solution set in sequence through the second sub-problem and the third sub-problem to generate a plurality of second constraints and a plurality of third constraints for the main problem, and resolving the main problem to generate a second planning solution set; The second planning solution set is composed of a plurality of second planning solutions that maximize the transient stability of the power system and minimize the operation and maintenance cost; Solving and analyzing the second planning solution set through the fourth sub-problem, and when a relaxation error exists in the second planning solution set, generating a fourth constraint condition for the third sub-problem, resolving the third sub-problem, and generating an optimal planning solution; The optimal planning scheme includes: a first installation time and a first installation location of each power supply, and a second installation time and a second installation location of each fault current limiter.

2. The coordinated planning method for power supply and fault current limiter according to claim 1, characterized in that: The method of solving and analyzing the initial planning solution set by using the first sub-problem and, when the initial planning solution set is infeasible, generating a plurality of first constraints of the main problem, resolving the main problem, and generating a first planning solution set consisting of a plurality of feasible first planning solutions includes: Convert the first sub-problem into a linear programming problem; Repeating the feasibility analysis operation according to the linear programming problem and the initial planning solution set until a first planning solution set is generated; The feasibility analysis operation includes: Obtaining a solution set of a scheme to be evaluated that includes a plurality of schemes to be evaluated; wherein, initially, the solution set of the scheme to be evaluated is an initial planning solution set, and the scheme to be evaluated is an initial planning solution; Analyzing the power balance of the power system after implementation of each scheme to be evaluated through the linear programming problem, and generating a first dual variable and a first objective function value of the first subproblem; When it is determined that the first objective function value is not equal to 0, determining that there is a solution to be evaluated that causes power imbalance in the power system in the solution set of the planning scheme to be evaluated, and determining that the solution set of the planning scheme to be evaluated is infeasible; generating a first infeasibility cutting plane as a first constraint condition according to the first dual variable, and adding the first constraint condition to a constraint condition set preset in the main problem; Re-solving the main problem according to the constraint condition set to generate a set of solutions to be evaluated required for the next round of feasibility analysis operation; When it is determined that the first objective function value is equal to 0, it is determined that there is no scheme to be evaluated in the solution set of the planning scheme to be evaluated that causes power imbalance in the power system, then it is determined that the solution set of the planning scheme to be evaluated is feasible, and the solution set of the planning scheme to be evaluated is used as the first planning scheme solution set, and the scheme to be evaluated is used as the first planning scheme in the first planning scheme solution set.

3. The coordinated planning method for power supply and fault current limiter according to claim 2, characterized in that: The step of sequentially solving and analyzing the first planning solution set through the second subproblem and the third subproblem to generate a plurality of second constraints and a plurality of third constraints for the main problem, and resolving the main problem to generate a second planning solution set includes: Repeating the solution set convergence operation according to the second sub-problem, the third sub-problem, and the first planning solution set until a second planning solution set is generated; The solution set convergence operation includes: Acquire a solution set to be converged consisting of a plurality of solutions to be converged; initially, the solution set to be converged is the first planning solution set, and the solution to be converged is the first planning solution; Solving the transient stability index of each of the to-be-converged solutions through the second subproblem, and generating a second objective function value and a second dual variable of the second subproblem according to the transient stability index; generating a second infeasibility cutting plane as a second constraint condition according to the second objective function value and the second dual variable, and adding the second constraint condition to the constraint condition set of the main problem; Solving the operation and maintenance cost of each of the to-be-converged solutions through the third subproblem, and generating a third objective function value and a third dual variable of the third subproblem according to the operation and maintenance cost; generating a feasibility cutting plane as a third constraint condition according to the third objective function value and the third dual variable, and adding the third constraint condition to the constraint condition set of the main problem; Solving the main problem according to the constraint condition set, generating a tentative planning solution set, and evaluating whether the tentative planning solution set converges; If not, the tentative planning solution set is used as the unconverged solution set required for the next round of solution set convergence operation; If so, the tentative planning solution set is used as the second planning solution set.

4. The coordinated planning method for power supply and fault current limiter according to claim 3, characterized in that: Solving the main problem according to the constraint condition set, generating a tentative planning solution set, and evaluating whether the tentative planning solution set converges, includes: Solving the main problem according to the constraint condition set to generate a main objective function value of the main problem and a tentative planning solution set; Calculating the convergence degree of the solution set of the tentative planning scheme according to the value of the main objective function and the value of the third objective function; When the convergence degree is greater than a preset convergence index, determining that the solution set of the provisional planning scheme is not converged; When the convergence degree is not greater than the convergence index, it is determined that the solution set of the provisional planning scheme converges.

5. The coordinated planning method of power supply and fault current limiter according to claim 4, characterized in that: Solving and analyzing the second planning solution set through the fourth sub-problem, and generating a fourth constraint condition for the third sub-problem when a relaxation error exists in the second planning solution set, resolving the third sub-problem, and generating an optimal planning solution, including: Repeating the error elimination operation according to the fourth sub-problem and the second planning solution set until an optimal planning solution is generated; The error elimination operation includes: Obtaining a solution set of solutions to be optimized that includes a plurality of solutions to be optimized; wherein, initially, the solution set of solutions to be optimized is the second planning solution set, and the solution to be optimized is the second planning solution; Calculating the relaxation error of each to-be-optimized solution according to the fourth subproblem, and calculating the fourth objective function value and the fourth dual variable of the fourth subproblem according to the relaxation error; When the fourth objective function value is not equal to 0, determining that a solution to be optimized in the solution set to be optimized has a relaxation error; generating a third infeasibility cutting plane as a fourth constraint function of the third subproblem based on the fourth objective function value and the fourth dual variable, and resolving the third subproblem to generate a solution set to be optimized required for the next round of error elimination operation; When the fourth objective function value is equal to 0, it is determined that the solution to be optimized in the solution set to be optimized is the optimal planning solution without relaxation error.

6. A coordinated planning device for power supply and fault current limiter, characterized in that: include: A parameter acquisition module, used to obtain line parameters of the power system, fault current limit value, planning period, equipment costs of power supply and fault current limiter, and equipment parameters of power supply and fault current limiter; a problem construction module, configured to construct, based on the line parameters, the fault current limit value, the planning period, the equipment cost, and the equipment parameters, a main problem for generating a planning solution, a first sub-problem for feasibility analysis, a second sub-problem for steady-state analysis, a third sub-problem for cost analysis, and a fourth sub-problem for relaxation error analysis; A main problem solving module, configured to solve the main problem and generate an initial planning solution set consisting of a plurality of initial planning solutions; a first sub-problem solving module, configured to solve and analyze the initial planning solution set using the first sub-problem, and, if the initial planning solution set is infeasible, generate a plurality of first constraints for the main problem, re-solve the main problem, and generate a first planning solution set consisting of a plurality of feasible first planning solutions; a second sub-problem solving module, configured to solve and analyze the first planning solution set in sequence through the second sub-problem and the third sub-problem, generate a plurality of second constraints and a plurality of third constraints for the main problem, and re-solve the main problem to generate a second planning solution set; wherein the second planning solution set is composed of a plurality of second planning solutions that maximize the transient stability of the power system and minimize the operation and maintenance cost; A solution generation module is used to solve and analyze the second planning solution set through the fourth sub-problem, and when there is a relaxation error in the second planning solution set, generate the fourth constraint condition of the third sub-problem, re-solve the third sub-problem, and generate an optimal planning solution; wherein, the optimal planning solution includes: a first installation time and a first installation location of each power supply, and a second installation time and a second installation location of each fault current limiter.

7. The coordinated planning device for power supply and fault current limiter according to claim 6, characterized in that: The first sub-problem solving module solves and analyzes the initial planning solution set using the first sub-problem, and when the initial planning solution set is infeasible, generates a plurality of first constraints for the main problem, solves the main problem again, and generates a first planning solution set consisting of a plurality of feasible first planning solutions, including: Convert the first sub-problem into a linear programming problem; Repeating the feasibility analysis operation according to the linear programming problem and the initial planning solution set until a first planning solution set is generated; The feasibility analysis operation includes: Obtaining a solution set of a scheme to be evaluated that includes a plurality of schemes to be evaluated; wherein, initially, the solution set of the scheme to be evaluated is an initial planning solution set, and the scheme to be evaluated is an initial planning solution; Analyzing the power balance of the power system after implementation of each scheme to be evaluated through the linear programming problem, and generating a first dual variable and a first objective function value of the first subproblem; When it is determined that the first objective function value is not equal to 0, determining that there is a solution to be evaluated that causes power imbalance in the power system in the solution set of the planning scheme to be evaluated, and determining that the solution set of the planning scheme to be evaluated is infeasible; generating a first infeasibility cutting plane as a first constraint condition according to the first dual variable, and adding the first constraint condition to a constraint condition set preset in the main problem; Re-solving the main problem according to the constraint condition set to generate a set of solutions to be evaluated required for the next round of feasibility analysis operation; When it is determined that the first objective function value is equal to 0, it is determined that there is no scheme to be evaluated in the solution set of the planning scheme to be evaluated that causes power imbalance in the power system, then it is determined that the solution set of the planning scheme to be evaluated is feasible, and the solution set of the planning scheme to be evaluated is used as the first planning scheme solution set, and the scheme to be evaluated is used as the first planning scheme in the first planning scheme solution set.

8. The coordinated planning device for power supply and fault current limiter according to claim 7, characterized in that: The second sub-problem solving module sequentially solves and analyzes the first planning solution set through the second sub-problem and the third sub-problem, generates a plurality of second constraints and a plurality of third constraints for the main problem, and re-solves the main problem to generate a second planning solution set, including: Repeating the solution set convergence operation according to the second sub-problem, the third sub-problem, and the first planning solution set until a second planning solution set is generated; The solution set convergence operation includes: Acquire a solution set to be converged consisting of a plurality of solutions to be converged; initially, the solution set to be converged is the first planning solution set, and the solution to be converged is the first planning solution; Solving the transient stability index of each of the to-be-converged solutions through the second subproblem, and generating a second objective function value and a second dual variable of the second subproblem according to the transient stability index; generating a second infeasibility cutting plane as a second constraint condition according to the second objective function value and the second dual variable, and adding the second constraint condition to the constraint condition set of the main problem; Solving the operation and maintenance cost of each of the to-be-converged solutions through the third subproblem, and generating a third objective function value and a third dual variable of the third subproblem according to the operation and maintenance cost; generating a feasibility cutting plane as a third constraint condition according to the third objective function value and the third dual variable, and adding the third constraint condition to the constraint condition set of the main problem; Solving the main problem according to the constraint condition set, generating a tentative planning solution set, and evaluating whether the tentative planning solution set converges; If not, the tentative planning solution set is used as the unconverged solution set required for the next round of solution set convergence operation; If so, the tentative planning solution set is used as the second planning solution set.

9. A terminal device, characterized in that: The method comprises a processor, a memory, and a computer program stored in the memory and configured to be executed by the processor, wherein when the processor executes the computer program, the method for coordinated planning of a power supply and a fault current limiter according to any one of claims 1 to 5 is implemented.

10. A storage medium, characterized in that: The storage medium includes a stored computer program, wherein when the computer program is running, the device where the storage medium is located is controlled to execute the coordinated planning method for a power supply and a fault current limiter according to any one of claims 1 to 5.

Images