Skip to content
naulon
Not checkedNot checked for notices yet.

Day-Ahead Optimal Dispatch for Active Distribution Network Considering Probability Model of Controllable Distributed Generation

Jianxi Wang, Shida Zhang, Yonghui Sun and 3 more

Frontiers in Energy Research · 2022

doi:10.3389/fenrg.2021.814850 (opens in a new tab)

We email you when a new notice or a question about this paper appears.

Abstract

In this paper, the probabilistic model of the controllable distributed generation in active distribution network is developed and applied to the daily stochastic optimal dispatch. The probabilistic characteristics of photovoltaic power generation system with active control capability are explored, and the relationship between the reference value of active power and its cumulative distribution function and mean value is obtained. The active power probability model of wind power generation system is improved according to the actual wind speed power curve. By fully utilizing the inverter capacity and coordinating active power, the reactive power of distributed generation is actively controlled under the constraint of power factor. Then considering the chance constraints, a daily optimal scheduling model for active distribution network with the goal of minimizing the operating cost of distribution network is developed, and the constraints that can calculate the charge and discharge times of the energy storage system are designed. The chance constrained programming is solved by the heuristic method, and the deterministic optimization steps are solved by the second-order cone programming method, respectively. The probabilistic power flow method based on stochastic response surface method is utilized to test chance constraints. Finally, the modified IEEE33 node distribution system example shows that the obtained models and algorithms are correct and can meet the requirements of safe and economic operation.

Abstract licence: CC BY

References24

    24 more references, whose wording the paper’s licence keeps private.

    Reads

    Read by people on this page

    None yet.

    Checked or read by AI through naulon

    None yet.

    A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

    Are you an author?

    Is this your paper?

    Claim it to add your note and be paid when agents cite it. Free.