Distributed security-constrained economic dispatch method, device, equipment and medium

Abstract

The application relates to the technical field of power system economic dispatch, in particular to a distributed security-constrained economic dispatch method, device, equipment and medium, wherein the method comprises the following steps: acquiring key network topology parameters according to a power transmission network topology; acquiring optimal output and optimal power flow under reactive power constraints according to unit cost parameters; and generating a security-constrained economic dispatch strategy according to target key network topology parameters and the optimal output and optimal power flow under non-constraint conditions. Therefore, the method does not depend on step parameter adjustment, can improve the operation efficiency of the distributed security-constrained economic dispatch, and improves the economy and security of power system operation.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of power system economic dispatch, in particular to a distributed security constrained economic dispatch method, device, equipment and medium. BACKGROUND

[0002] With the increasing importance of distributed energy in the energy internet, the operation optimization of massive distributed energy faces huge computing power pressure and communication pressure. Distributed algorithms can provide algorithm support for edge computing, realize operation optimization through communication between adjacent nodes, and reduce the threat of single point failure, high computing pressure, communication congestion and the like.

[0003] The existing distributed economic dispatch algorithm is divided into node-level distributed algorithm and regional-level distributed algorithm according to the range of real-time operation information exchange. Among them, the node-level distributed algorithm is most suitable for the cooperation characteristics of massive distributed energy, but the convergence rate is often related to the step length parameter, which needs to be adjusted to achieve effective convergence. On the other hand, for the security constrained economic dispatch problem, due to the complexity of the constraints, the current node-level distributed algorithm has much lower operation efficiency than the simple economic dispatch problem, making it difficult to apply the node-level distributed algorithm to the security constrained economic dispatch problem.

[0004] APPLICATION CONTENT

[0005] The present application provides a distributed security constrained economic dispatch method, device, equipment and medium, which does not depend on step length parameter adjustment, can improve the operation efficiency of distributed security constrained economic dispatch, and improve the economy and safety of power system operation.

[0006] The first aspect embodiment of the present application provides a distributed security constrained economic dispatch method, comprising the following steps:

[0007] obtaining key network topology parameters according to the power transmission network topology;

[0008] obtaining optimal output and optimal power flow under no reactive power constraints according to the unit cost parameters; and

[0009] generating a security constrained economic dispatch strategy according to the target key network topology parameters and the optimal output and optimal power flow under no constraints.

[0010] The distributed security constrained economic dispatch method according to the embodiments of the present application can obtain key network topology parameters according to the power transmission network topology, obtain optimal output and optimal power flow under no constraints according to unit cost parameters, and realize security constrained economic dispatch according to key network topology parameters, optimal output and optimal power flow under no constraints, which can eliminate the dependence on step length parameter adjustment, improve the operation efficiency of distributed security constrained economic dispatch, and improve the economy and safety of power system operation.

[0011] Optionally, the acquiring the key network topology parameter according to the power transmission network topology comprises:

[0012] acquiring the line reactance connected by each node and calculating the directed graph weight;

[0013] generating the node virtual injection power and initializing the node virtual exchangeable power;

[0014] making the adjacent nodes transmit to each other according to the directed graph weight and updating the node virtual exchangeable power until convergence; and

[0015] acquiring the key network topology parameter based on the converged node virtual exchangeable power.

[0016] Optionally, the acquiring the optimal output and optimal power flow under the reactive power constraint according to the unit cost parameter comprises:

[0017] acquiring the unit cost parameter;

[0018] calculating the optimal output under the unconstraint according to the unit cost parameter;

[0019] acquiring the injection power according to the optimal output under the unconstraint and initializing the node virtual exchangeable power;

[0020] making the adjacent nodes transmit to each other according to the directed graph weight and updating the node virtual exchangeable power until convergence; and

[0021] acquiring the optimal power flow under the unconstraint according to the node virtual exchangeable power.

[0022] Optionally, the generating the security-constrained economic dispatch strategy according to the target key network topology parameter and the optimal output and optimal power flow under the unconstraint comprises:

[0023] acquiring the latest active constraint set according to the optimal output and optimal power flow;

[0024] calculating the optimal output and optimal power flow under the current active constraint set according to the active constraint set;

[0025] detecting whether the current optimal output and optimal power flow meet the termination condition, and if the termination condition is not met, re-acquiring the latest active constraint set until the termination condition is met;

[0026] making each unit perform actual output according to the optimal output and optimal power flow at the time of cycle termination.

[0027] Optionally, the calculating the optimal output and optimal power flow under the current active constraint set according to the active constraint set comprises:

[0028] obtaining a power out-of-limit amount and a coefficient matrix of a node observation according to the current active constraint set;

[0029] obtaining a Lagrange multiplier according to the power out-of-limit amount and the coefficient matrix;

[0030] obtaining the optimal output and optimal power flow under the current active constraint set according to the Lagrange multiplier. The second aspect embodiment of the application provides a distributed security constrained economic dispatch device, comprising:

[0031] a preprocessing module configured to obtain a key network topology parameter according to a power transmission network topology;

[0032] an initialization module configured to obtain an optimal output and optimal power flow without a power constraint according to a unit cost parameter; and

[0033] a dispatch module configured to generate a security constrained economic dispatch strategy according to the target key network topology parameter and the optimal output and optimal power flow without the constraint.

[0034] The distributed security constrained economic dispatch device according to the embodiment of the application obtains a key network topology parameter according to a power transmission network topology, obtains an optimal output and optimal power flow without a constraint according to a unit cost parameter, and implements security constrained economic dispatch according to the key network topology parameter, the optimal output and optimal power flow without the constraint, which can break the dependence on step parameter adjustment, improve the operation efficiency of distributed security constrained economic dispatch, and improve the economy and security of power system operation.

[0035] Optionally, the preprocessing module is specifically configured to:

[0036] obtain a transmission line reactance connected to each node and calculate a directed graph weight;

[0037] generate a node virtual injection power and initialize a node virtual exchangeable power;

[0038] cause adjacent nodes to send to each other according to the directed graph weight, and update the node virtual exchangeable power until convergence; and

[0039] obtain the key network topology parameter based on the converged node virtual exchangeable power.

[0040] Optionally, the initialization module is specifically configured to:

[0041] obtain the unit cost parameter;

[0042] calculating the optimal output under the no-constraint according to the unit cost parameters;

[0043] obtaining an injection power according to the optimal output under the no-constraint, and initializing the node virtual exchangeable power;

[0044] making the adjacent nodes send to each other according to the directed graph weight, and updating the node virtual exchangeable power until convergence; and

[0045] obtaining the optimal power flow under the no-constraint according to the node virtual exchangeable power.

[0046] Optionally, the scheduling module is specifically configured to:

[0047] obtaining a latest active constraint set according to the optimal output and the optimal power flow;

[0048] calculating the optimal output and the optimal power flow under the current active constraint set according to the active constraint set;

[0049] detecting whether the current optimal output and the optimal power flow meet a termination condition, and if not, re-obtaining the latest active constraint set until the termination condition is met;

[0050] making each unit perform actual output according to the optimal output and the optimal power flow at the time of cycle termination.

[0051] Optionally, the scheduling module is specifically configured to:

[0052] obtaining a power out-of-limit amount and a coefficient matrix observed by a node according to the current active constraint set;

[0053] obtaining a Lagrange multiplier according to the power out-of-limit amount and the coefficient matrix;

[0054] obtaining the optimal output and the optimal power flow under the current active set according to the Lagrange multiplier.

[0055] The third aspect embodiment of the present application provides an electronic device, comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, and the processor executes the program to implement the distributed security-constrained economic dispatch method as described in the above embodiments.

[0056] The fourth aspect embodiment of the present application provides a computer readable storage medium, which stores a computer program executable by a processor to implement the distributed security-constrained economic dispatch method as claimed in any one of claims 1-5.

[0057] Additional aspects and advantages of the present application will be made apparent by the following description and the accompanying drawings. BRIEF DESCRIPTION OF DRAWINGS

[0058] The above and / or additional aspects and advantages of the present application will become apparent and be more readily understood through consideration of the following description, taken in conjunction with the accompanying drawings, in which:

[0059] Figure 1 a flow chart of a distributed security-constrained economic dispatch method according to an embodiment of the present application;

[0060] Figure 2 a flow chart of a distributed security-constrained economic dispatch method according to an embodiment of the present application;

[0061] Figure 3 an example diagram of a distributed security-constrained economic dispatch apparatus according to an embodiment of the present application;

[0062] Figure 4 an example diagram of an electronic device according to an embodiment of the present application. DETAILED DESCRIPTION

[0063] Embodiments of the present application are described in detail below with reference to the accompanying drawings, in which like or similar elements are denoted by the same or similar reference signs, and the embodiments described below are examples for explaining the present application and are not intended to limit the present application.

[0064] A distributed security-constrained economic dispatch method, apparatus, device and medium of an embodiment of the present application are described below with reference to the accompanying drawings. The present application provides a distributed security-constrained economic dispatch method, in which a key network topology parameter is obtained according to a power transmission network topology, optimal output and optimal power flow in an unconstrained case are obtained according to a unit cost parameter, and a security-constrained economic dispatch is implemented according to the key network topology parameter, the optimal output and the optimal power flow in the unconstrained case, which can eliminate the dependence on step parameter adjustment, improve the operation efficiency of the distributed security-constrained economic dispatch, and improve the economy and security of power system operation.

[0065] Specifically, Figure 1 A flow chart of a distributed security-constrained economic dispatch method according to an embodiment of the present application is shown in FIG. 1.

[0066] As shown in FIG. 1, the distributed security-constrained economic dispatch method includes the following steps: Figure 1

[0067] In step S101, a key network topology parameter is obtained according to a power transmission network topology. ​

[0068] Optionally, the key network topology parameters are acquired according to the power transmission network topology, comprising: acquiring the line reactance connected to each node and calculating the directed graph weight; generating the node virtual injection power and initializing the node virtual exchangeable power; enabling the adjacent nodes to send to each other according to the directed graph weight and updating the node virtual exchangeable power until convergence; and acquiring the key network topology parameters based on the converged node virtual exchangeable power.

[0069] In step S102, the optimal output and optimal power flow under the reactive power constraint are acquired according to the unit cost parameters.

[0070] Optionally, the optimal output and optimal power flow under the reactive power constraint are acquired according to the unit cost parameters, comprising: acquiring the unit cost parameters; calculating the optimal output under no constraint according to the unit cost parameters; acquiring the injection power according to the optimal output under no constraint and initializing the node virtual exchangeable power; enabling the adjacent nodes to send to each other according to the directed graph weight and updating the node virtual exchangeable power until convergence; and acquiring the optimal power flow under no constraint according to the node virtual exchangeable power.

[0071] In step S103, the security-constrained economic dispatch strategy is generated according to the target key network topology parameters and the optimal output and optimal power flow under no constraint.

[0072] Optionally, the security-constrained economic dispatch strategy is generated according to the target key network topology parameters and the optimal output and optimal power flow under no constraint, comprising: acquiring the latest active constraint set according to the optimal output and optimal power flow; calculating the optimal output and optimal power flow under the current active constraint set according to the active constraint set; detecting whether the current optimal output and optimal power flow meet the termination condition, and if not, re-acquiring the latest active constraint set until the termination condition is met; and enabling each unit to perform actual output according to the optimal output and optimal power flow at the end of the cycle.

[0073] Optionally, the optimal output and optimal power flow under the current active constraint set are calculated according to the active constraint set, comprising: acquiring the power out-of-limit amount and the coefficient matrix observed by the node according to the current active constraint set; acquiring the Lagrange multiplier according to the power out-of-limit amount and the coefficient matrix; and obtaining the optimal output and optimal power flow under the current active set according to the Lagrange multiplier.

[0074] To make the skilled in the art further understand the distributed security-constrained economic dispatch method of the embodiments of the present application, the embodiments are described in detail below with reference to the specific embodiments shown in the accompanying drawings. Figure 2

[0075] ​First, in this embodiment of the application, each node obtains key network topology parameters based on the power transmission network topology, including four steps: obtaining the reactance of the power transmission lines connected to each node and calculating the directed graph weights; generating virtual injected power for the nodes and initializing the virtual exchangeable power of the nodes; adjacent nodes sending and updating the virtual exchangeable power of the nodes according to the directed graph weights until convergence; and obtaining key network topology parameters based on the converged virtual exchangeable power of the nodes.

[0076] (1-1) Obtain the reactance of the transmission lines connected to each node and calculate the weight of the directed graph.

[0077] In this embodiment of the application, the physical model is defined as follows:

[0078]

[0079]

[0080]

[0081] Bθ=P inj =PL; (4)

[0082]

[0083]

[0084]

[0085] Where N is the number of nodes, N B The number of transmission lines is represented by k, where k represents the line number, or the starting node number of the transmission line. With the endpoint node number ordered pairs This represents the transmission line. In the discussion of the embodiments of this invention, for the sake of simplicity, k is equivalent to... However, in actual distributed solutions, each node cannot obtain the global transmission line number; therefore, the global information a node obtains about the transmission line is only ordered pairs of numbers. However, this does not affect the solution. Equations (1) and (2) indicate that the objective is to minimize the power generation cost of each unit, Equation (3) indicates the power balance constraint, Equation (4) is the DC power flow equation, Equation (5) is the power flow calculation formula, Equation (6) represents the upper and lower limits of generator output constraint, and Equation (7) represents the power flow active transmission limit constraint, referred to as power flow constraint.

[0086] In the embodiments of the present application, the communication model is agreed as follows: it is considered that the nodes connected by transmission lines can communicate with each other, which is referred to as the nodes being adjacent to each other. The set of nodes adjacent to node i is defined as D(i). Node i can send information to all adjacent nodes, and the information path can be described as the edge of the communication directed graph G. The directed graph node can be defined to send information to itself, that is, the node necessarily has a self-loop. The directed graph G can be described by an adjacency matrix A, which is defined as follows:

[0087] A = [a ij ] N×N ; (8)

[0088]

[0089] The weight is assigned to the edge of the directed graph, and the weighted directed graph can be formed, which can be described by a transition matrix Q, which is defined as follows:

[0090] Q = [q ij ] N×N ; (10)

[0091]

[0092]

[0093] wherein α is a real number between 0 and 1, and in the embodiments of the present application, α = 0.75.

[0094] (1-2) Generating node virtual injection power and initializing node virtual exchangeable power.

[0095] For node i, the node virtual injection power row vector The jth component is defined as follows:

[0096]

[0097] The virtual exchangeable power row vector of node i is initialized as an N-dimensional zero vector.

[0098]

[0099] (1-3) Adjacent nodes send and update node virtual exchangeable power according to the weight of the directed graph until convergence.

[0100] Node i multiplies the node virtual exchangeable power of itself by the weight q ij of the adjacent edge of the directed graph, and then sends the power vector along the direction of the edge of the directed graph. After receiving the power vector sent by the adjacent node, the virtual exchangeable power of node i is updated as follows:

[0101]

[0102] where n ref represents the number of reference nodes. In the embodiment of the present application, the termination criterion of iteration is as follows:

[0103]

[0104] (1-4) Obtain the key network topology parameters according to the converged node virtual exchangeable power.

[0105] After convergence, the node n obtains the key network topology parameters X n where the mth component is calculated as follows:

[0106]

[0107] Secondly, in the embodiment of the present application, the optimal output and optimal power flow under the unconstrained condition are obtained according to the unit cost parameters, including the following five steps: obtaining the unit cost parameters; obtaining the optimal output under the unconstrained condition according to the unit cost parameters; obtaining the injection power and initializing the node virtual exchangeable power according to the optimal output under the unconstrained condition; the adjacent nodes send and update the node virtual exchangeable power according to the directed graph weight of claim 2 until convergence; and obtaining the optimal power flow under the unconstrained condition according to the node virtual exchangeable power.

[0108] (2-1) Obtain the unit cost parameters. In the embodiment of the present application, the unit cost function can be set as a quadratic function as formula (2), and the marginal cost function is defined as follows:

[0109]

[0110] where p i is the unit output, W i (p i ) is the unit output cost function, λ i (p i ) is the marginal cost function, α i , β i , γ i are all parameters in the unit output cost function, where γ i is the imaginary minimum cost of the unit, β i is the marginal increase rate of the marginal cost with respect to the unit output, and α i is the imaginary unit output under zero marginal cost obtained by linear extrapolation.

[0111] (2-2) Obtain the optimal output under the unconstrained condition according to the unit cost parameters. The obtaining process is as follows:

[0112] The node i initializes the equivalent power shortage and quantity-price sensitivity as follows:

[0113]

[0114]

[0115] where L i is the load of node i.

[0116] Subsequently, node i multiplies its equivalent power shortage by the weight of the adjacent edges of the directed graph and sends them along the direction of the edges of the directed graph. After receiving the power sent by the adjacent nodes, the equivalent power shortage and the quantity-price sensitivity of node i are updated as follows:

[0117]

[0118]

[0119] Here. The transition matrix is composed of which can be any column stochastic matrix, and in this application, we use

[0120] The marginal cost is defined as

[0121] In this application, the convergence condition is:

[0122]

[0123] After convergence, the unconstrained optimal output of each unit is obtained as:

[0124]

[0125] (2-3) Obtain the injection power according to the optimal output under no constraints and initialize the node virtual exchangeable power.

[0126] For node i, the injection power is obtained as:

[0127]

[0128] The initialized node virtual exchangeable power is

[0129] (2-4) Adjacent nodes send to each other according to the weight of the directed graph and update the node virtual exchangeable power.

[0130] Node i multiplies its node virtual exchangeable power by the weight of the adjacent edges of the directed graph ij , and sends the product along the direction of the edges of the directed graph. After receiving the data sent by the adjacent nodes, the virtual exchangeable power of node i is updated as follows:

[0131]

[0132] Where, n ref The reference node number is used. In this embodiment of the invention, the termination criterion for iteration is as follows:

[0133]

[0134] (5) Obtain the optimal power flow under unconstrained conditions based on the converged node virtual exchangeable power. Specifically, calculate the optimal power flow under unconstrained conditions. The method is as follows.

[0135]

[0136] Furthermore, in this application, a safety-constrained economic scheduling is achieved based on key network topology parameters, optimal output under unconstrained conditions, and optimal power flow, comprising four steps: obtaining the latest effective constraint set based on the latest optimal output and optimal power flow; obtaining the optimal output and optimal power flow under the current effective constraint set based on the effective constraint set; checking whether the current optimal output and optimal power flow meet the termination condition, and if not, returning to the "obtain the latest effective constraint set" step, looping until the termination condition is met; and each unit performing actual output according to the optimal output scheme at the time of loop termination, thereby achieving distributed safety-constrained economic scheduling of output.

[0137] (3-1) Obtain the latest set of effective constraints based on the latest optimal output and optimal power flow.

[0138] In this embodiment of the invention, the effective constraint can be represented by a set of numbers k. i (1≤i≤r b +r g The meaning is represented by ) , which means: the first Total r b The power flow of the transmission line overlaps, the first Total r g The generator output of each node is connected to the limit. Introducing m i (1≤i≤r b +r g This indicates whether these constraints are positively or negatively bounded, for example, the power flow value is T. max This is a positive boundary condition, with a value of -T. max This is a reverse connection. A forward connection is m. i =1, reverse boundary then m i =-1.

[0139] When the set of constraints is used as global information in a distributed solution, the path is actually represented by the start and end node numbers, and can be formatted as follows:

[0140]

[0141]

[0142] where, denotes the ordered pair of the start and end node numbers of the k i th transmission line.

[0143] On the basis of the above conventions, the following conditions are used to examine the active set:

[0144] η i+1 m i ≤0,1≤i≤r b +r g ; (31)

[0145] -T max ≤T≤T max ; (32)

[0146] P min ≤P≤P max ; (33)

[0147] where η i+1 (1≤i≤r b +r g ) correspond to the Lagrange multipliers of the r th power flow constraint and the unit output upper and lower limit constraints of the i th node in turn, and equation (31) indicates that the signs of the r b +r g th Lagrange multipliers are related to the boundary directions. When the unconstrained output and the unconstrained power flow are obtained for the first time after entering this step, η i+1 =0 (1≤i≤r b +r g ), so this constraint can be ignored. Equations (32) and (33) are the power flow constraints and the output constraints respectively.

[0148] If equation (31) is not satisfied, a constraint is removed from the active constraint set, and the removed constraint is denoted as k i . The determination of i is as follows:

[0149]

[0150] If the conditions of equations (32) and (33) are not satisfied, a constraint is added to the active constraint set, and the priority order is: power flow constraint is prior to power output upper and lower limit constraint; and the number is small, the number is large. At the same time, two principles need to be ensured to avoid generating redundant constraints: the boundary line does not form a loop; and for the adjacent line power flow of a node and the power output of the node, at least one is not adjacent. If the constraint to be added violates the two principles, the next optional constraint is found according to the priority order, and until the two principles are not violated, the constraint is selected as the added constraint.

[0151] The updating method of the active constraint set is not unique, and the above is only one optional scheme.

[0152] (3-2) Obtaining the optimal power output and optimal power flow under the current active constraint set according to the active constraint set, further comprising the following steps:

[0153] (a) obtaining the power boundary crossing amount observed by the node according to the current active set;

[0154] The power boundary crossing amount observed by the node n is represented by a (1+r b +r g ) dimensional vector b n , and the i-th component b n,i of the vector is defined as follows:

[0155]

[0156] Where x k represents the reactance of the transmission line k, represents the power flow value when the transmission line k is adjacent, if it is a positive adjacent, it takes T max,k , and if it is a negative adjacent, it takes -T max,k . represents the power output value when the generator k is adjacent, if it is a positive adjacent, it takes P max,k , and if it is a negative adjacent, it takes P min,k . represents the unconstrained power flow and power output. Alpha is a positive number, which is used to avoid the ill-conditioning of the coefficient matrix in subsequent calculations, and in the embodiment of the present application, the value is 0.1.

[0157] (b) obtaining the coefficient matrix observed by the node according to the current active set;

[0158] The coefficient matrix observed by the node n is represented by a (1+r b +r g )×(1+r b +r g ) matrix A n , and the calculation method is as follows:

[0159]

[0160] G n is a (1+r b +r g )-dimensional vector, whose i-th dimension component G n,i is defined as follows:

[0161]

[0162] (c) Obtain the Lagrange multipliers from the power out-of-bounds observed at the nodes and the coefficient matrix;

[0163] Based on the power out-of-bounds observed at the nodes and the coefficient matrix, perform the following distributed iteration until convergence:

[0164]

[0165]

[0166] After convergence, the Lagrange multipliers, i.e., a (1+r b +r g )-dimensional vector η, are obtained, and the calculation method is as follows:

[0167]

[0168] (d) Obtain the optimal power output and the optimal power flow under the current active set from the Lagrange multipliers.

[0169] The optimal power output of node n is calculated as follows:

[0170]

[0171] Subsequently, each node calculates the optimal power flow according to the obtained optimal power output The calculation steps are consistent with (2-3), (2-4), and (2-5), with the only difference being that in (2-3), the new optimal power output is used instead of the unconstrained optimal power output That is, formula (25) of (2-3) is changed to:

[0172]

[0173] (3-3) checks whether the current optimal power output and the optimal power flow meet the termination condition. If not, it jumps back to the step of "obtaining the latest active constraint set" and loops until the termination condition is met.

[0174] The termination condition is also the first checked condition in (3-1) "obtain the latest set of active constraints", that is, formulas (31), (32) and (33). If the termination condition exists in violation, jump back to (3-1) "obtain the latest set of active constraints", according to the specific termination condition violation, obtain the latest set of active constraints, and continue to execute; if all termination conditions are met, terminate the loop.

[0175] (3-4) Each unit performs actual output according to the optimal output scheme at the termination of the loop, to realize distributed security constrained economic dispatch of output.

[0176] According to the distributed security constrained economic dispatch method proposed in the embodiments of the present application, the key network topology parameters are obtained according to the power transmission network topology, the optimal output and optimal power flow under unconstrained conditions are obtained according to the unit cost parameters, and the security constrained economic dispatch is realized according to the key network topology parameters, the optimal output and optimal power flow under unconstrained conditions, which can get rid of the dependence on step parameter adjustment, improve the operation efficiency of distributed security constrained economic dispatch, and improve the economy and security of power system operation.

[0177] Secondly, the distributed security constrained economic dispatch device proposed according to the embodiments of the present application is described with reference to the accompanying drawings.

[0178] Figure 2 is a block schematic diagram of the distributed security constrained economic dispatch device of the embodiments of the present application.

[0179] As shown in Figure 2 , the distributed security constrained economic dispatch device 10 comprises a preprocessing module 100, an initialization module 200 and a dispatching module 300.

[0180] The preprocessing module 100 is configured to obtain key network topology parameters according to the power transmission network topology.

[0181] The initialization module 200 is configured to obtain optimal output and optimal power flow under no power constraint according to the unit cost parameters.

[0182] The dispatching module 300 is configured to generate a security constrained economic dispatch strategy according to the target key network topology parameters and the optimal output and optimal power flow under unconstrained conditions.

[0183] Optionally, the preprocessing module is specifically configured to:

[0184] obtain the reactance of the power transmission line connected to each node, and calculate the directed graph weight;

[0185] generate node virtual injection power, and initialize node virtual exchangeable power;

[0186] make the adjacent nodes transmit to each other according to the directed graph weight and update the node virtual exchangeable power until convergence; and

[0187] Based on the converged node virtual exchangeable power, obtain the key network topology parameters.

[0188] Optionally, the initialization module is specifically configured to:

[0189] Obtain the unit cost parameters;

[0190] Calculate the optimal output under no constraints according to the unit cost parameters;

[0191] Obtain the injection power according to the optimal output under no constraints, and initialize the node virtual exchangeable power;

[0192] make the adjacent nodes transmit to each other according to the directed graph weight and update the node virtual exchangeable power until convergence; and

[0193] Obtain the optimal power flow under no constraints according to the node virtual exchangeable power.

[0194] Optionally, the scheduling module is specifically configured to:

[0195] Obtain the latest active constraint set according to the optimal output and the optimal power flow;

[0196] Calculate the optimal output and the optimal power flow under the current active constraint set according to the active constraint set;

[0197] Detect whether the current optimal output and the optimal power flow meet the termination condition, and if not, re-obtain the latest active constraint set until the termination condition is met;

[0198] Make each unit perform actual output according to the optimal output and the optimal power flow at the end of the cycle.

[0199] Optionally, the scheduling module is specifically configured to:

[0200] Obtain the power out-of-bound amount and the coefficient matrix observed by the node according to the current active constraint set;

[0201] Obtain the Lagrange multiplier according to the power out-of-bound amount and the coefficient matrix;

[0202] Obtain the optimal output and the optimal power flow under the current active set according to the Lagrange multiplier.

[0203] It should be noted that the foregoing explanation and description of the embodiment of the distributed security constrained economic dispatch method also apply to the distributed security constrained economic dispatch device of this embodiment, which will not be described here.

[0204] According to the distributed security-constrained economic dispatch device provided by the embodiment of the application, the key network topology parameters are obtained according to the power transmission network topology, the optimal output and optimal power flow under the unconstrained condition are obtained according to the unit cost parameters, and the security-constrained economic dispatch is realized according to the key network topology parameters, the optimal output and optimal power flow under the unconstrained condition, so that the dependence on the step parameter adjustment can be eliminated, the operation efficiency of the distributed security-constrained economic dispatch is improved, and the economy and security of the power system operation are improved.

[0205] Figure 4 The structure schematic diagram of the electronic device provided by the embodiment of the application is provided. The electronic device can include:

[0206] The memory 401, the processor 402 and the computer program stored in the memory 401 and executable on the processor 402.

[0207] The processor 402 implements the distributed security-constrained economic dispatch method provided in the above embodiment when executing the program.

[0208] Further, the electronic device further includes:

[0209] The communication interface 403 is used for communication between the memory 401 and the processor 402.

[0210] The memory 401 is used for storing the computer program executable on the processor 402.

[0211] The memory 401 can include a high-speed RAM memory, and can also include a non-volatile memory, for example, at least one disk memory.

[0212] If the memory 401, the processor 402 and the communication interface 403 are independently implemented, the communication interface 403, the memory 401 and the processor 402 can be connected to each other through a bus and complete the communication between each other. The bus can be an Industry Standard Architecture (ISA) bus, a Peripheral Component (PCI) bus or an Extended Industry Standard Architecture (EISA) bus, etc. The bus can be divided into an address bus, a data bus, a control bus, etc. For the convenience of representation, Figure 4 Only one thick line is used in the figure, but it does not mean that there is only one bus or one type of bus.

[0213] Optionally, if the memory 401, the processor 402 and the communication interface 403 are integrated on a chip, the memory 401, the processor 402 and the communication interface 403 can complete the communication among each other through an internal interface.

[0214] The processor 402 can be a central processing unit (CPU) or an application specific integrated circuit (ASIC), or one or more integrated circuits configured to implement one or more embodiments of the present application.

[0215] The embodiment further provides a computer readable storage medium, which stores a computer program. The computer program is executed by a processor to implement the distributed security-constrained economic dispatch method as described above.

[0216] In the description of the present specification, the description of the terms "one embodiment", "some embodiments", "an example", "a specific example", or "some examples" means that the specific features, structures, materials or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the present application. In the present specification, the illustrative description of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any appropriate manner in one or N embodiments or examples. In addition, the person skilled in the art can combine and combine the different embodiments or examples described in the present specification and the features of the different embodiments or examples without contradiction.

[0217] In addition, the terms "first", "second" are only for descriptive purposes and cannot be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined with "first", "second" can explicitly or implicitly include at least one of the features. In the description of the present application, the meaning of "N" is at least two, for example, two, three, etc., unless otherwise specifically limited.

[0218] Any process or method descriptions in flow charts or described elsewhere herein can be understood as representing code modules, segments, or portions of code which include one or more executable instructions for implementing specific logic functions (or steps) in the process, and that the various embodiments of the preferred implementation include the use of hardware and software configured to implement the functions or steps described in the illustrated or discussed order, or in a different order, or in a substantially concurrent manner, or in a different manner, as will be understood by persons skilled in the art from the description of the preferred embodiments.

[0219] The logic and / or steps represented in the flowcharts and / or described herein, for example, can be considered as a sequence of executable instructions stored in a computer readable medium, which can be executed by an instruction execution system, apparatus or device, such as a computer-based system, a processor-based system, or other system that can fetch the instructions from the instruction execution system, apparatus or device and execute the instructions, or a combination of them. For the purposes of this specification, a "computer readable medium" can be any apparatus that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus or device. The computer readable medium can be a computer readable storage medium or a computer readable signal medium. The computer readable storage medium can include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a propagation medium. The computer readable signal medium can include, but is not limited to, a computer readable medium that can be a propagated data signal with the computer readable program code embodied therein, for example, in baseband or as part of a carrier wave of a data stream, for example, a propagated signal. The computer readable program code can be transmitted on a computer readable medium, for example, a propagated signal that is transmitted, for example, on a wired network or a wireless network. The computer readable medium can be any available medium or a combination of media that can be accessed by a general purpose or special purpose computer system. The computer readable medium can be a computer readable storage medium or a computer readable signal medium. By way of example, and not limitation, the computer readable medium can comprise: an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a propagation medium. The computer readable program code can comprise any suitable set of instructions, statements, or code, for example, that can be executed by a processor, that can be stored on the medium, that can be downloaded into a working memory, or that can be otherwise transferred into the processor. The computer readable program code can comprise machine instructions for implementing the steps of the methods described herein. The computer readable program code can comprise machine instructions for implementing the steps of the methods described herein.

[0220] It should be understood that aspects of the application can be implemented in hardware, software, firmware or combinations thereof. In the above embodiments, the N steps or methods can be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. As such, if implemented in hardware and in another embodiment, any of the following technologies, known in the art, or their combinations can be used: discrete logic circuitry having logic gates for implementing logic functions on data signals, application specific integrated circuits having appropriate combinational logic gates, programmable gate arrays (PGA), field programmable gate arrays (FPGA), and the like.

[0221] Those skilled in the art can understand that all or part of the steps carried out by the above-mentioned embodiments can be completed by programs instructing related hardware, and the programs can be stored in a computer readable storage medium. When the programs are executed, one or a combination of the steps of the method embodiments is included.

[0222] In addition, each of the functional units in the various embodiments of the present application can be integrated in one processing module, or each of the units can be physically present separately, or two or more units can be integrated in one module. The integrated module can be implemented in the form of hardware or in the form of a software functional module. When the integrated module is implemented in the form of a software functional module and sold or used as an independent product, it can also be stored in a computer readable storage medium.

[0223] The storage medium mentioned above can be a read-only memory, a magnetic disk or an optical disk, etc. Although the embodiments of the present application have been shown and described above, it should be understood that the above embodiments are exemplary and should not be construed as limiting the present application, and those skilled in the art can make changes, modifications, replacements and variations to the above embodiments within the scope of the present application.

Claims

1. A method for distributed security-constrained economic dispatch, the method comprising: The method comprises the following steps: obtaining key network topology parameters according to a power transmission network topology; obtaining optimal output and optimal power flow under reactive power constraints according to unit cost parameters; and generating a safe-constrained economic dispatch strategy according to the key network topology parameters and the optimal output and optimal power flow under reactive power constraints; the generating of the safe-constrained economic dispatch strategy according to the key network topology parameters and the optimal output and optimal power flow under reactive power constraints comprises: obtaining a latest active constraint set according to the optimal output and optimal power flow; calculating optimal output and optimal power flow under a current active constraint set according to the active constraint set; detecting whether the current optimal output and optimal power flow meet a termination condition, and if not, re-obtaining the latest active constraint set until the termination condition is met; causing each unit to perform actual output according to the optimal output and optimal power flow at the termination of the cycle; the calculating of the optimal output and optimal power flow under the current active constraint set according to the active constraint set comprises: obtaining a power out-of-limit amount and a coefficient matrix observed at a node according to the current active constraint set; obtaining a Lagrange multiplier according to the power out-of-limit amount and the coefficient matrix; obtaining the optimal output and optimal power flow under the current active set according to the Lagrange multiplier.

2. The method of claim 1, wherein, the obtaining of the key network topology parameters according to the power transmission network topology comprises: obtaining a transmission line reactance connected to each node and calculating a directed graph weight; generating a node virtual injection power and initializing a node virtual exchangeable power; causing adjacent nodes to transmit to each other according to the directed graph weight and updating the node virtual exchangeable power until convergence; and obtaining the key network topology parameters based on the converged node virtual exchangeable power.

3. The method of claim 2, wherein, the obtaining of the optimal output and optimal power flow under reactive power constraints according to unit cost parameters comprises: obtaining the unit cost parameters; calculating the optimal output under the reactive power constraints according to the unit cost parameters; obtaining an injection power according to the optimal output under the reactive power constraints and initializing the node virtual exchangeable power; causing the adjacent nodes to transmit to each other according to the directed graph weight and updating the node virtual exchangeable power until convergence; and obtaining the optimal power flow under the constraints according to the node virtual exchangeable power.

4. A device for distributed security constrained economic dispatch, characterized in that, comprise: a preprocessing module configured to obtain key network topology parameters according to a power transmission network topology; an initialization module configured to obtain optimal output and optimal power flow under reactive power constraints according to unit cost parameters; and a dispatch module configured to generate a safe-constrained economic dispatch strategy according to the key network topology parameters and the optimal output and optimal power flow under reactive power constraints; the dispatch module is specifically configured to: obtain a latest active constraint set according to the optimal output and optimal power flow; calculate optimal output and optimal power flow under a current active constraint set according to the active constraint set; detect whether the current optimal output and optimal power flow meet a termination condition, and if not, re-obtain the latest active constraint set until the termination condition is met; The units are caused to actually output according to the optimal output and optimal power flow at the end of the cycle; The scheduling module is further configured to: Obtain a power out-of-limit amount and a coefficient matrix of node observation according to the current active constraint set; Obtain a Lagrange multiplier according to the power out-of-limit amount and the coefficient matrix; Obtain optimal output and optimal power flow under the current active set according to the Lagrange multiplier.

5. The apparatus of claim 4, wherein, The preprocessing module is configured to: Obtain a transmission line reactance connected to each node and calculate a directed graph weight; Generate a node virtual injection power and initialize a node virtual exchangeable power; Cause adjacent nodes to transmit to each other according to the directed graph weight and update the node virtual exchangeable power until convergence; And Obtain the key network topology parameter based on the converged node virtual exchangeable power.

6. The apparatus of claim 5, wherein, The initialization module is configured to: Obtain the unit cost parameter; Calculate optimal output under the reactive power constraint according to the unit cost parameter; Obtain an injection power according to the optimal output under the reactive power constraint and initialize the node virtual exchangeable power; Cause the adjacent nodes to transmit to each other according to the directed graph weight and update the node virtual exchangeable power until convergence; And Obtain optimal power flow under the constraint according to the node virtual exchangeable power.

7. An electronic device, comprising: Comprise: A memory, a processor and a computer program stored on the memory and executable on the processor, the processor executing the program to implement the distributed security constrained economic dispatch method according to any one of claims 1-3.

8. A computer-readable storage medium having stored thereon a computer program, characterized in that, The program is executed by the processor to implement the distributed security constrained economic dispatch method according to any one of claims 1-3.

Images