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

Multi-source shared operation optimization strategy for multi-virtual power plants based on distributionally robust chance constraint

Author

Listed:
  • Wen, Jiaxing
  • Jia, Rong
  • Cao, Ge
  • Guo, Yi
  • Jiao, Yang
  • Li, Wei
  • Li, Peihang

Abstract

In order to effectively utilize the structural differences within multiple virtual power plants (VPP), tap the spatial complementarity of energy among multiple entities, and achieve economic, low-carbon, and reliable operation of the multi-VPP system. This study proposes a multi-source shared operation optimization strategy for multi-VPP based on distributionally robust chance constraint. First, the multi-VPP cooperative operation framework was built, which considered the two-stage carbon trading model including electric vehicle quotas to realize peer-to-peer electricity-heat-carbon quota trading between different VPPs. Secondly, the distributed robust chance constraint based on Waserstein distance is used to deal with the uncertainty of source-load power, and the proposed robust model is converted into a linear programming problem based on dual transformation and conditional risk value approximation. Thirdly, considering the contribution of each VPP in different dimensions, the asymmetric Nash negotiation mechanism based on the comprehensive contribution rate is designed to allocate the cooperation benefits of each VPP. Finally, the alternating direction multiplier method is used to ensure the information privacy of each subject. The case results show that the proposed method can improve the robustness, economy and low-carbon of the system, and achieve fair and reasonable revenue distribution for each VPP.

Suggested Citation

  • Wen, Jiaxing & Jia, Rong & Cao, Ge & Guo, Yi & Jiao, Yang & Li, Wei & Li, Peihang, 2025. "Multi-source shared operation optimization strategy for multi-virtual power plants based on distributionally robust chance constraint," Energy, Elsevier, vol. 322(C).
  • Handle: RePEc:eee:energy:v:322:y:2025:i:c:s0360544225014033
    DOI: 10.1016/j.energy.2025.135761
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0360544225014033
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.energy.2025.135761?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:energy:v:322:y:2025:i:c:s0360544225014033. 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.journals.elsevier.com/energy .

    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.