Mixed Integer Quadratic Programming Based Scheduling Methods for Day-Ahead Bidding and Intra-Day Operation of Virtual Power Plant

Abstract

As distributed energy resources (DERs) proliferate power systems, power grids face new challenges stemming from the variability and uncertainty of DERs. To address these problems, virtual power plants (VPPs) are established to aggregate DERs and manage them as single dispatchable and reliable resources. VPPs can participate in the day-ahead (DA) market and therefore require a bidding method that maximizes profits. It is also important to minimize the variability of VPP output during intra-day (ID) operations. This paper presents mixed integer quadratic programming-based scheduling methods for both DA market bidding and ID operation of VPPs, thus serving as a complete scheme for bidding-operation scheduling. Hourly bids are determined based on VPP revenue in the DA market bidding step, and the schedule of DERs is revised in the ID operation to minimize the impact of forecasting errors and maximize the incentives, thus reducing the variability and uncertainty of VPP output. The simulation results verify the effectiveness of the proposed methods through a comparison of daily revenue.