Abstract

The stochastic economic dispatch problem of power system with multiple wind farms and pumped-storage hydro stations is formulated as a specific stochastic dynamic programming (DP) model, i.e. stochastic storage model, it is impossible to obtain an accurate solution due to the curse of dimensionality. Based on the approximate DP (ADP) method, the stochastic storage model can be transformed into a series of mixed-integer linear programming (MILP) models by describing the approximate value functions (AVFs) as convex piecewise linear functions in post-decision states. The AVFs are first initialised using the results of the deterministic model under a forecast scenario of wind farm output and then trained by scanning stochastic sampling scenarios consecutively with the successive projective approximation routine algorithm. To obtain a near-optimal day-ahead dispatch scheme, the forecast scenario is substituted into the MILP models expressed by the trained AVFs and is solved forward through each time interval. The network constraints are incorporated by the while-loop detection of critical lines. Test results on an actual provincial power system and the modified IEEE 39-bus system, including the comparison among the ADP, DP, scenario-based and chance-constrained programming methods, demonstrate the feasibility and efficiency of the proposed model and algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call