Multi-Objective Robust Scheduling Optimization Model of Wind, Photovoltaic Power, and BESS Based on the Pareto Principle

2019 
With the increasing proportion of distributed power supplies connected to the power grid, the application of a battery energy storage system (BESS) to a power system leads to new ideas of effectively solving the problem of distributed power grid connections. There is obvious uncertainty involved in distributed power output, and these uncertainties must be considered when optimizing the scheduling of virtual power plants. In this context, scene simulation technology was used to manage the uncertainty of wind power and photovoltaic output, forming a classic scenario. In this study, to reduce the influence of the uncertainty of wind and photovoltaic power output on the stable operation of the system, the time-of-use (TOU) prices and BESS were incorporated into the optimal scheduling problem that is inherent in wind and photovoltaic power. First, this study used the golden section method to simulate the wind and photovoltaic power output; second, the day-ahead wind and photovoltaic power output were used as the random variables; third, a wind and photovoltaic power BESS robust scheduling model that considers the TOU price was constructed. Finally, this paper presents the Institute of Electrical and Electronics Engineers (IEEE) 30 bus system in an example simulation, where the solution set is based on the Pareto principle, and the global optimal solution can be obtained by the robust optimization model. The results show that the cooperation between the TOU price and BESS can counteract wind and photovoltaic power uncertainties, improve system efficiency, and reduce the coal consumption of the system. The example analysis proves that the proposed model is practical and effective. By accounting for the influence of uncertainty of the optimal scheduling model, the actual operating cost can be reduced, and the robustness of the optimization strategy can be improved.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    18
    References
    6
    Citations
    NaN
    KQI
    []