IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/178193.html
   My bibliography  Save this article

Security-Constrained Unit Commitment Based on a Realizable Energy Delivery Formulation

Author

Listed:
  • Hongyu Wu
  • Qiaozhu Zhai
  • Xiaohong Guan
  • Feng Gao
  • Hongxing Ye

Abstract

Security-constrained unit commitment (SCUC) is an important tool for independent system operators in the day-ahead electric power market. A serious issue arises that the energy realizability of the staircase generation schedules obtained in traditional SCUC cannot be guaranteed. This paper focuses on addressing this issue, and the basic idea is to formulate the power output of thermal units as piecewise-linear function. All individual unit constraints and systemwide constraints are then reformulated. The new SCUC formulation is solved within the Lagrangian relaxation (LR) framework, in which a double dynamic programming method is developed to solve individual unit subproblems. Numerical testing is performed for a 6-bus system and an IEEE 118-bus system on Microsoft Visual C# .NET platform. It is shown that the energy realizability of generation schedules obtained from the new formulation is guaranteed. Comparative case study is conducted between LR and mixed integer linear programming (MILP) in solving the new formulation. Numerical results show that the near-optimal solution can be obtained efficiently by the proposed LR-based method.

Suggested Citation

  • Hongyu Wu & Qiaozhu Zhai & Xiaohong Guan & Feng Gao & Hongxing Ye, 2012. "Security-Constrained Unit Commitment Based on a Realizable Energy Delivery Formulation," Mathematical Problems in Engineering, Hindawi, vol. 2012, pages 1-22, February.
    • Handle: RePEc:hin:jnlmpe:178193
    DOI: 10.1155/2012/178193
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2012/178193.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2012/178193.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2012/178193?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:178193. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.