IDEAS home Printed from https://ideas.repec.org/a/spr/infosf/v26y2024i1d10.1007_s10796-022-10335-9.html
   My bibliography  Save this article

Scenario-Based Distributionally Robust Unit Commitment Optimization Involving Cooperative Interaction with Robots

Author

Listed:
  • Xuanning Song

    (Nanjing University)

  • Bo Wang

    (Nanjing University)

  • Pei-Chun Lin

    (Feng Chia University)

  • Guangyu Ge

    (Jiangsu Second Normal University)

  • Ran Yuan

    (Nanjing University)

  • Junzo Watada

    (Waseda University)

Abstract

With the increasing penetration of renewable energy, uncertainty has become the main challenge of power systems operation. Fortunately, system operators could deal with the uncertainty by adopting stochastic optimization (SO), robust optimization (RO) and distributionally robust optimization (DRO). However, choosing a good decision takes much experience, which can be difficult when system operators are inexperienced or there are staff shortages. In this paper, a decision-making approach containing robotic assistance is proposed. First, advanced clustering and reduction methods are used to obtain the scenarios of renewable generation, thus constructing a scenario-based ambiguity set of distributionally robust unit commitment (DR-UC). Second, a DR-UC model is built according to the above time-series ambiguity set, which is solved by a hybrid algorithm containing improved particle swarm optimization (IPSO) and mathematical solver. Third, the above model and solution algorithm are imported into robots that assist in decision making. Finally, the validity of this research is demonstrated by a series of experiments on two IEEE test systems.

Suggested Citation

  • Xuanning Song & Bo Wang & Pei-Chun Lin & Guangyu Ge & Ran Yuan & Junzo Watada, 2024. "Scenario-Based Distributionally Robust Unit Commitment Optimization Involving Cooperative Interaction with Robots," Information Systems Frontiers, Springer, vol. 26(1), pages 9-23, February.
  • Handle: RePEc:spr:infosf:v:26:y:2024:i:1:d:10.1007_s10796-022-10335-9
    DOI: 10.1007/s10796-022-10335-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10796-022-10335-9
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10796-022-10335-9?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:spr:infosf:v:26:y:2024:i:1:d:10.1007_s10796-022-10335-9. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.