Two-stage stochastic robust optimal scheduling of virtual power plants considering source load uncertainty

preprint OA: closed
View at publisher
AI-generated summary by claude@2026-07, 2026-07-16

This paper presents a two-stage stochastic robust optimization method using WGAN-GP and K-medoids to determine VPP scheduling that minimizes operating costs under worst-case source-load uncertainty scenarios.

One-sentence paraphrase of the abstract; not a substitute for reading it. No clinical advice. How this works

Abstract

Aim: ing at the optimal scheduling problem of virtual power plant ( VPP ) with multiple uncertainties on the source-load side, this paper proposes a two-stage stochastic robust optimal scheduling method considering the uncertainty of the source-load side. This method combines the characteristics of robust optimization and stochastic optimization to model the source-load uncertainty differentiation. The Wasserstein generative adversarial network with gradient penalty ( WGAN-GP ) is used to generate electric and thermal load scenarios, and then K-medoids clustering is used to obtain several typical scenarios. The min-max-min two-stage stochastic robust optimization model is constructed, and the column constraint generation ( C & CG ) algorithm and dual theory are used to solve the problem, and the scheduling scheme with the lowest operating cost in the worst scenario is obtained.

My notes (saved in your browser only)

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-06-13T06:42:57.164913+00:00