A distributed dynamic optimal power flow method for active distribution network with multi-source agents

Abstract

The invention discloses a distributed dynamic optimal power flow method for an active distribution network with multiple sources and subjects. The method includes the following steps: S100. Determine optimization objectives and constraints, and establish a DOPF for an active distribution network with multiple sources and subjects model; S200, linearly approximate the power flow equation in the DOPF model of the active distribution network, and convert the original nonlinear programming problem into a quadratic programming problem; S300, use the distribution network, distributed power supply and energy storage device as The independent subject converts the active distribution network DOPF model into an active distribution network D-DOPF model; S400, using the auxiliary problem principle to solve the active distribution network D-DOPF model, and the active distribution network D-DOPF model The solution of is decomposed into the solution of multiple independent agent quadratic programming submodels. The method of the invention is used to solve the D-DOPF model, which not only satisfies the privacy protection among various stakeholders, but also realizes the global optimum in the optimization process.

Description

technical field [0001] The invention relates to the technical field of distribution networks, in particular to a distributed dynamic optimal power flow method for an active distribution network with multiple sources and multiple subjects. Background technique [0002] As distributed power sources (such as photovoltaic power sources, controllable generator sets) and energy storage devices are widely connected to the distribution network, the physical characteristics of the distribution network have changed from purely passive to active, and its regulation and control capabilities have been significantly enhanced. Due to the high ratio of resistance and reactance of distribution lines, it is difficult to decouple active power and reactive power, so its optimal scheduling problem is essentially a dynamic optimal power flow (Dynamic Optimal Power Flow, DOPF) problem, which belongs to a 96-time Optimal power flow problem for cross-section coupling. At present, the centralized op...

AI Technical Summary

Problems solved by technology

[0005] From the modeling methods and solution algorithms of the above three D-OPF problems, it can be seen that the modeling accuracy of the first type is high, but the dual decomposition algorithm cannot guarantee its convergence and obtain a non-convex nonlinear programming model. global optimal solution

Although the model established by the second method is very suitable for solving by dual decomposition algorithms, it ignores the coupling between active power and reactive power in the active distribution network, and the accuracy is not high

However, there is still a lack of research on the high-precision linearization of the D-DOPF problem including energy storage devices, which is generally described as a mixed integer linear programming model or a non-convex nonlinear programming model

Images