Two-layer Progressive Hedging-Benders Decomposition Algorithm for Stochastic Unit Commitment
ID:392 View Protection:PUBLIC Updated Time:2022-05-24 21:05:34 Hits:1269 Poster Presentation

Start Time:Pending(Asia/Shanghai)

Duration:Pending

Session:No Session »

Abstract
With the large-scale development of renewable energy generation, the uncertainty of power system has increased significantly. In order to make proper day-ahead scheduling decisions, the stochastic unit commitment (SUC) problem considering reserve capacity and line power flow limit is studied, and multiple independent random scenarios are used to represent the uncertainty of load and renewable generation in the system. In order to solve this large-scale problem caused by too many scenarios, a two-layer PH-BD decomposition algorithm is designed to further improve the computing speed. The outer Progressive hedging (PH) algorithm is used to decompose the scenarios to realize parallel solution of the corresponding problems in each scenario. The inner Benders decomposition (BD) algorithm is used to decompose the corresponding problems of each scenario into the main problem without line constraints and the subproblem with line constraints. The calculation results of IEEE 118-bus system show that the calculation speed of the proposed algorithm is faster and the solution time is shorter than that of the traditional PH algorithm.
Keywords
stochastic unit commitment; independent random scenario; Progressive hedging; Benders; two-layer decomposition
Speaker
TianYe
student 山东大学电气工程学院

Submit Comment
Verify Code Change Another
All Comments
Important Date
  • Conference Date

    May 27

    2022

    to

    May 29

    2022

  • Feb 28 2022

    Draft paper submission deadline

  • May 29 2022

    Registration deadline

  • Jun 22 2022

    Contribution Submission Deadline

Sponsored By
IEEE Beijing Section
China Electrotechnical Society
Southeast University
Supported By
IEEE Industry Applications Society
IEEE Nanjing Section
Contact Information