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

Data-Driven interval robust optimization method of VPP Bidding strategy in spot market under multiple uncertainties

Author

Listed:
  • Ma, Ying
  • Li, Zhen
  • Liu, Ruyi
  • Liu, Bin
  • Yu, Samson S.
  • Liao, Xiaozhong
  • Shi, Peng

Abstract

The participation of Virtual Power Plants (VPPs) in the spot market enhances the flexibility of modern power systems as renewable energy penetration increases. However, multiple uncertainties on the market, load, and generation sides can significantly affect the bidding strategies and operational efficiency of VPPs. This paper employs interval numbers generated by a data-driven model to capture the uncertainty and correlation of electricity prices in the spot market. Additionally, uncertainty sets are utilized to represent the variability in the number of electric vehicles (EVs) and photovoltaic (PV) power generation. A two-stage interval robust optimization model considering arbitrage opportunity is established to optimize the bidding strategies of a VPP that includes gas turbines, energy storage, PV systems, and EVs. An improved column-and-constraint generation (C&CG) algorithm is developed to solve this model.

Suggested Citation

  • Ma, Ying & Li, Zhen & Liu, Ruyi & Liu, Bin & Yu, Samson S. & Liao, Xiaozhong & Shi, Peng, 2025. "Data-Driven interval robust optimization method of VPP Bidding strategy in spot market under multiple uncertainties," Applied Energy, Elsevier, vol. 384(C).
    • Handle: RePEc:eee:appene:v:384:y:2025:i:c:s0306261925000960
    DOI: 10.1016/j.apenergy.2025.125366
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0306261925000960
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.apenergy.2025.125366?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:384:y:2025:i:c:s0306261925000960. 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.