4.4 Article

Two-stage chance-constrained unit commitment based on optimal wind power consumption point considering battery energy storage

Journal

IET GENERATION TRANSMISSION & DISTRIBUTION
Volume 14, Issue 18, Pages 3738-3749

Publisher

INST ENGINEERING TECHNOLOGY-IET
DOI: 10.1049/iet-gtd.2019.1492

Keywords

optimisation; iterative methods; wind power plants; power generation dispatch; power generation scheduling; power consumption; battery energy storage; wind power generation; low carbon emissions; wind energy; day-ahead energy; reserve schedules; optimal wind power consumption; optimality-check-only bilinear Benders decomposition; wind utilisation level; two-stage chance-constrained unit commitment; large-scale mixed-integer programming; six-bus system; IEEE 118-bus system; IEEE 236-bus system

Funding

  1. National Key R&D Program of China [2016YFB0900100]
  2. State Key Program of National Natural Science Foundation of China [51537010]
  3. State Grid Corporation of China Project [52110418000T]
  4. Shandong University
  5. fifth youth talent promotion project of CSEE

Ask authors/readers for more resources

Wind power generation has developed rapidly in recent decades due to low carbon emissions. However, the significant uncertainty makes it uneconomic or even unreliable to be consumed, which hinders the development of wind energy. To guarantee the minimum wind utilisation level without jeopardising system reliability and cost-effectiveness, this study proposes a concept of optimal wind power consumption point. Based on that, a two-stage chance-constrained unit commitment model is presented to co-optimise the day-ahead energy and reserve schedules, which achieves a reasonable trade-off between robustness and costs. The battery energy storage is also investigated to enhance system flexibility and promote wind consumption. The joint chance constraint is dealt with through a sample average approximation method in bilinear forms. The resulting large-scale mixed-integer programming is decomposed into the master and subproblem formulations and then solved iteratively by the developed bilinear Benders decomposition (BBD) method. To achieve computational tractability, several techniques are used to enhance the convergence property of BBD and accelerate the solution process, with a novel optimality-check-only bilinear Benders decomposition method proposed. Case studies on six-bus, IEEE 118-bus and 236-bus systems demonstrate the effectiveness of the proposed model and algorithm.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.4
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available