IDEAS home Printed from https://ideas.repec.org/a/eee/appene/v395y2025ics0306261925008001.html
   My bibliography  Save this article

Robust stability-constrained optimization for load restoration with uncertain dynamic loads

Author

Listed:
  • Xie, Dunjian
  • Xu, Yan
  • Nadarajan, Sivakumar
  • Viswanathan, Vaiyapuri
  • Gupta, Amit Kumar

Abstract

This paper proposes a robust optimization method for stability-constrained load restoration of a post-event power system considering uncertain dynamic loads. The loads are modeled by a composite of both static and dynamic components with uncertain compositions. A robust optimization model is formulated to maximize the total restored load while ensuring system stability under the worst-case realization of load composition. The resulting restoration strategy satisfies both stability constraints—including transient frequency and voltage limits—and static security constraints such as line flow and bus voltage bounds for all admissible uncertainty scenarios. To efficiently solve the resulting robust optimization problem, an efficient iterative solution method is developed based on trajectory sensitivity analysis and the Column-and-Constraint Generation (C&CG) algorithm. The effectiveness of the proposed method is demonstrated through numerical studies on the modified IEEE 39-bus New England test system.

Suggested Citation

  • Xie, Dunjian & Xu, Yan & Nadarajan, Sivakumar & Viswanathan, Vaiyapuri & Gupta, Amit Kumar, 2025. "Robust stability-constrained optimization for load restoration with uncertain dynamic loads," Applied Energy, Elsevier, vol. 395(C).
    • Handle: RePEc:eee:appene:v:395:y:2025:i:c:s0306261925008001
    DOI: 10.1016/j.apenergy.2025.126070
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0306261925008001
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.apenergy.2025.126070?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:eee:appene:v:395:y:2025:i:c:s0306261925008001. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/405891/description#description .

    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.