Optimal scheduling strategy for virtual power plants based on credibility theory

Abstract

The virtual power plant (VPP) is a new and efficient solution to manage the integration of distributed energy resources (DERs) into the power system. Considering the unpredictable output of stochastic DERs, conventional scheduling strategies always set plenty of reserve aside in order to guarantee the reliability of operation, which is too conservative to gain more benefits. Thus, it is significant to research the scheduling strategies of VPPs, which can coordinate the risks and benefits of VPP operation. This paper presents a fuzzy chance-constrained scheduling model which utilizes fuzzy variables to describe uncertain features of distributed generators (DGs). Based on credibility theory, the concept of the confidence level is introduced to quantify the feasibility of the conditions, which reflects the risk tolerance of VPP operation. By transforming the fuzzy chance constraints into their equivalent forms, traditional optimization algorithms can be used to solve the optimal scheduling problem. An IEEE 6-node system is employed to prove the feasibility of the proposed scheduling model. Case studies demonstrate that the fuzzy chance strategy is superior to conservative scheduling strategies in realizing the right balance between risks and benefits.

Introduction

Nowadays, due to the rising prices of fossil fuels and the threat of climate change caused by greenhouse gases, distributed energy resources (DERs) have drawn widespread attention because of their clean and renewable characteristics [1–3]. However, the output of DERs is fluctuating and unpredictable. As the penetration of intermittent renewables in the grids is increasing gradually, more technical challenges need to be addressed in the schedule and control of their operation [4–7]. Meanwhile, the liberalization of the electricity market makes DERs inevitable. However, the small capacity, intermittent output and the lack of appropriate interaction with the system operator are the biggest barriers ahead of DERs for participation in the electricity market. To solve these problems mentioned above, the DERs could be aggregated as an entity which can behave like a conventional generator, naming the virtual power plant (VPP) [8–10].

In [11, 12], a VPP is defined as a coalition of DERs including distributed generations (DGs), storage devices, and interruptible loads. Considering the characteristics of each DER and the impact of network, VPPs generate one unit portfolio which can be utilized to offer services to the system operator, and even to make contracts in the wholesale market. Therefore, by introducing the concept of the VPP, the visibility and controllability of DERs for system operators will be improved considerably, just the same as the conventional transmission–connected power plants.

To realize the concept of the VPP, scholars around the world have done lots of studies on VPPs in many aspects [13–17], including VPP modeling methods, negotiating behaviors in the market, bidding strategies, reliability evaluation, management systems, and so on. Among them, the optimal scheduling strategy of DERs in the VPP is a hot topic. Reference [18] proposed a non-equilibrium model which takes into account the supply and demand balancing constraint and security constraint of VPPs. On this basis, the strategy proposed in [19] considered the effect of reliability and determined the optimum hourly operating strategy of DERs by applying the Monte Carlo simulation method. However, these scheduling strategies are based on the deterministic market prices. Considering the uncertainties in prices, [20] developed a new risk constrained scheduling for VPPs to help the aggregator bid in the day-ahead market.

However, the optimal bidding strategy of those researches mainly focused on maximizing the VPP’s profit in different types of markets. With regard to reserve level, these methods spare large capacity as recovery to balance the supply and demand. Although the system stability can be guaranteed in this deterministic way, the obtained scheduling results are always inevitably conservative. Actually, more benefits can be gained via reducing the reserve capacity appropriately.

This paper proposes a fuzzy chance-constrained scheduling model to provide solutions for the optimal scheduling strategy for VPPs based on credibility theory. In this model, as the prediction errors of renewables are characterized as fuzzy parameters, the related constraints correspondingly contain fuzzy variables which need to be tackled properly. By introducing the concept of the confidence level, the feasibility of the conditions where the fuzzy chance constraints can be satisfied is quantified, so as to characterize the risk tolerance of VPPs. The proposed fuzzy chance model is difficult to solve due to the incorporation of fuzzy variables. By transforming the constraints containing fuzzy variables into their equivalent forms, the chance constraints are converted into deterministic constraints which consider the fuzzy risks (or reliability) as well. Then traditional optimization algorithms can be utilized to solve the optimal scheduling problem, in order to achieve a compromise between risks and benefits.

The rest of the paper is organized as follows: the theoretical basis of this paper is presented in Credibility theory and fuzzy chance-constrained programming, including credibility theory and fuzzy chance constrained programming; the proposed VPP scheduling strategy based on credibility theory is demonstrated in VPP scheduling strategy based on credibility theory; solution methods used in this paper are stated in Methods; case studies and discussion are given in Case study; and finally, the conclusion is drawn in Conclusions.

Credibility theory and fuzzy chance-constrained programming

Distinguished from the conventional power plants, the scheduling of VPPs is required to deal with a number of uncertain variables from renewables and loads. The common ways to process those uncertain variables are categorized into determinate and indeterminate methods. Determinate method is to set plenty of reserve aside in order to guarantee the reliability of operation. However, this approach is too conservative to coordinate the risks and benefits of VPP operation. More benefits can be obtained by ignoring the small probability events and making decisions within the scope of risk tolerance [21]. The fuzzy chance-constrained programming method proposed in this paper is one kind of indeterminate scheduling strategy.

In this approach, the decision result is allowed to violate the constraints which contain fuzzy variables, but the feasibility of satisfying the constraints should be no less than the preset confidence level. The confidence level is a concept which reflects the risk tolerance of the system, or the reliability requirements of the system when facing uncertain variables. In conclusion, the optimal fuzzy chance-constrained scheduling strategy is a compromise between risks and economic profits. Credibility theory provides theoretical support to solve the confidence level problem of the fuzzy chance strategy decision, which greatly contributes to the development and improvement of the fuzzy chance programming theory.

Credibility theory

The concept of the fuzzy set theory was initiated by Zadeh via the membership function [22]. In order to measure a fuzzy event, the possibility measure is proposed. Since then the possibility theory has been studied by many researchers. Although the possibility measure has been widely used, it does not possess the self-duality property. Thus, if the possibility measure equals one it does not mean the event will happen definitely, while the event may happen even though the possibility measure is zero. So the solution to the fuzzy decision problem has been a mathematical conundrum for a long time.

Credibility theory was propounded by Liu in 2004 as a branch of mathematics for studying the fuzzy behavior [23]. It establishes a complete axiomatic system which is parallel with probability theory in dealing with uncertainty. Based on five axioms mentioned in [23], a credibility measure is defined.

According to Liu [23], the following five axioms should hold to ensure that the number Cr(A) has certain mathematical properties.

Definition 2.1:

• Axiom 1: Cr{Θ} = 1;

• Axiom 2 :Cr is non-decreasing, i.e., if A ⊆ B, there is always Cr{A} ≤ Cr{B};

• Axiom 3: Cr is self-dual: ∀ A ∈ P(Θ), Cr{A} + Cr{A^c} = 1;

• Axiom 4: ∀ A _i  ∈ {A _i | Cr{A _i } ≤ 0.5}, there is $\mathrm{C}\mathrm{r}\left\{\underset{i}{\mathrm{U}}{\mathrm{A}}_i\right\}\wedge 0.5=\underset{i}{ \sup}\mathrm{C}\mathrm{r}\left\{{\mathrm{A}}_i\right\}$.

• Axiom 5: Let Θ ₁, Θ ₂, ..., Θ _n be the nonempty sets corresponding to that Cr₁, Cr₂, ..., Cr _n satisfy the axioms as respectively defined above, and let Θ = Θ ₁ × Θ ₂ ×...× Θ _n . Then, we have Cr{(θ ₁, θ ₂, ..., θ _n )} = Cr₁{θ ₁} ∧ Cr₂{θ ₂} ∧ ... ∧ Cr _n {θ _n } for each (θ ₁, θ ₂, ..., θ _n ) ∈ Θ _.

• where Θ is a nonempty set; P(Θ) is the possibility set of Θ _; the element of P(Θ) is a fuzzy event; A is the subset of Θ; Cr(A) is a non-negative number indicating the credibility of Event A which will occur; and ^ represents the minimal operator.

Accordingly, the credibility measure describes the credibility level of a fuzzy event; parallel with the confidence level in probability theory, it satisfies the self-duality. It means that the event whose credibility measure is 1 will definitely occur, and similarly, the event whose credibility measure is 0 will never happen. So credibility theory solves the confusion caused by a subordinate degree, and provides theoretical foundations for the fuzzy decision.

In the fuzzy decision of VPP scheduling, some definitions and theorems of credibility theory are utilized, as listed below:

Definition 2.2 (Membership Function): The membership function μ(x) of the fuzzy parameter ξ is defined as:

$$ \mu \left(\mathrm{x}\right)=\mathrm{P}\mathrm{o}\mathrm{s}\left\{\theta \in \varTheta \Big|\upxi \left(\theta \right)\le \mathrm{x}\right\} $$

(1)

Definition 2.3 (Credibility Measure): The credibility measure can be obtained from the membership function, which is named as the credibility inversion theorem:

$$ \mathrm{C}\mathrm{r}\left\{\upxi \in \mathrm{A}\right\}=\frac{ \sup \kern0.2em \upmu {\left(\mathrm{x}\right)}_{\mathrm{x}\in \mathrm{A}}+1- \sup \kern0.2em \upmu {\left(\mathrm{x}\right)}_{\mathrm{x}\in {\mathrm{A}}^{\mathrm{c}}}}{2} $$

(2)

Fuzzy chance-constrained programming

Fuzzy chance-constrained programming refers to a type of decision-making problem which contains fuzzy parameters. The forward-looking decision results of this problem may not satisfy the constraints with fuzzy parameters to some extent, but the possibility of satisfying the constraints should be no less than the pre-specified confidence level. The general form of the fuzzy chance-constrained programming problem is:

$$ \left\{\begin{array}{l} \max \kern0.1em \overline{\kern0.1em f}\\ {}\mathrm{C}\mathrm{r}\left\{f\left(\boldsymbol{x},\boldsymbol{\xi} \right)\ge \overline{f}\right\}\ge \alpha \\ {}\mathrm{C}\mathrm{r}\left\{{g}_i\left(\boldsymbol{x},\boldsymbol{\xi} \right)\le 0,i=1,2,\cdots, n\right\}\ge \beta \end{array}\right. $$

(3)

where x is the decision vector; ξ is the fuzzy parameter vector; g _i (x, ξ) ≤ 0 is the ith constraint; α is the confidence level of the object function; β is the confidence level of the fuzzy constraint. The decision vector x is feasible only when the credibility of g _i (x, ξ) ≤ 0 is no less than β. Additionally, the optimal solution can maximize the object function f at the confidence level of α.

VPP scheduling strategy based on credibility theory

Traditional VPP scheduling strategy

The primary objectives of the VPP optimal scheduling problem are various, such as minimizing the cost of producing energy, or maximizing the profits of VPPs. In this paper, the priority of VPP operation is to make use of the renewable energy resources (RES), and based on this, the objective function is to minimize the costs of conventional unit generation and the interruptible load.

$$ \min \kern0.2em f={\displaystyle \sum_{t=1}^T\left\{{\displaystyle \sum_{i=1}^{N_G}\left[{J}_{Gi}(t)+{u}_i\left(t-1\right){u}_i(t)S{U}_i(t)\right]}+{\displaystyle \sum_{j=1}^{N_{DR}}{J}_{DRj}(t)}\right\}} $$

(4)

$$ {J}_{Gi}(t)={u}_i(t)\left({a}_i{P_{Gi}}^2+{b}_i{P}_{Gi}+{c}_i\right) $$

(5)

$$ {J}_{DRj}(t)={d}_j{P}_{DRj}{u}_j(t) $$

(6)

where J _Gi (t) is the operational cost of unit i at time t; SU _i (t) is the start-up cost of the unit i at time t; a _i , b _i , c _i are the coefficients of the operational cost of the unit i;d _j is the coefficient of the cost by curtailing the load j; P _Gi is the output power of the unit i; P _DRj is the virtual generation via curtailing the load; u _i (t) is the binary state variable of the unit i at time t: it equals “1” if the unit i is on at time t, and equals “0” if the unit i is off at time t. Similarly, u _j (t) is the binary state variable of the load j at time t. N _G and N _DR are the numbers of conventional units and loads in the demand response respectively.

The constraints considered in this model are presented as follows:

• 1) Supply–demand balancing constraint

  $$ {\displaystyle \sum_{i=1}^{N_G}{P}_{Gi}(t)+{\displaystyle \sum_{j=1}^{N_{DR}}{P}_{DRj}(t)+{P}_{RES}(t)={P}_L(t)}} $$

  (7)

• 2) System reserve constraint

  $$ {\displaystyle \sum_{i=1}^{N_G}{P}_{Gi}^{\max }+{\displaystyle \sum_{j=1}^{N_{DR}}{P}_{DRj}^{\max }+{P}_{RES}(t)\ge {P}_L(t)}}+R(t) $$

  (8)

• 3) DG constraints

  $$ {u}_i(t){P}_{Gi}^{\min}\le {P}_{Gi}(t)\le {u}_i(t){P}_{Gi}^{\max } $$

  (9)
  $$ -R{D}_i\le {P}_{Gi}(t)-{P}_{Gi}\left(t-1\right)\le R{U}_i $$

  (10)

• 4) Interruptible load constraint

  $$ {u}_j(t){P}_{DRj}^{\min}\le {P}_{DRj}(t)\le {u}_j(t){P}_{DRj}^{\max } $$

  (11)

where P _RES (t) is the power generated by renewables at time t; P _L (t) is the total load at time t; R(t) is the reserve capacity for the fluctuation of load and renewables at time t; ${P}_{Gi}^{\min }$ and ${P}_{Gi}^{\max }$ are the minimum and the maximum output limit of the unit i respectively; RU _i and RD _i are the ramp-up rate and the ramp-down rate of the unit i; ${P}_{DRj}^{\min }$ and ${P}_{DRj}^{\max }$ are the minimum and maximum allowed curtailed value of the load j respectively.

Fuzzy chance-constrained VPP scheduling

The fuzzy parameters of VPP scheduling strategy come from the unpredictable output of renewables in VPPs [24]. Accurate mathematical expressions of those uncertain characteristics should be established, which are the foundations for the uncertain scheduling strategy. The main characterizing methods include modeling output of renewables and modeling their predicted errors. In this paper, the modeling of the forecast errors is considered to describe the fuzziness of renewables instead of modeling the output. The modeling of renewables output will make three constraints containing fuzzy variables, which are the supply–demand balance constraint, the spinning reserve constraint, and the static security constraint. If the predicted value is regarded as a deterministic value and the prediction error is utilized to describe the fuzziness of renewables, only the spinning reserve constraint should be considered.

The percentage of renewables prediction error is defined as

$$ \varepsilon \%=\frac{P_{RES}-{P}_{RES}^F}{P_{RES}^F}\times 100\% $$

(12)

where P _RES and ${P}_{RES}^F$ are the real value and the forecasted value of the output respectively.

The membership function of the prediction error is:

$$ \mu =\left\{\begin{array}{l}\frac{1}{1+\sigma {\left(\frac{\varepsilon }{E_{+}}\right)}^2},\kern0.5em \varepsilon >0\\ {}\frac{1}{1+\sigma {\left(\frac{\varepsilon }{E_{\hbox{-} }}\right)}^2},\kern0.5em \varepsilon \le 0\end{array}\right. $$

(13)

where E ₊ and E ₋ are the average values of positive and negative prediction errors obtained from statistics, respectively; σ is the weighting factor.

According to credibility theory, the credibility measure of the fuzzy parameter ξ can be expressed as:

$$ \mathrm{C}\mathrm{r}\left(\xi \le \varepsilon \right)=\left\{\begin{array}{l}1-\frac{1}{2\left[1+\sigma {\left(\frac{\varepsilon }{E_{+}}\right)}^2\right]},\kern0.5em \varepsilon >0\\ {}\frac{1}{2\left[1+\sigma \left(\frac{\varepsilon }{E_{-}}\right)\right]},\kern2em \varepsilon \le 0\end{array}\right. $$

(14)

Thus, according to credibility theory, the spinning reserve constraint of the traditional scheduling model should be changed into chance constraints containing fuzzy variables.

$$ \mathrm{C}\mathrm{r}\left\{{\displaystyle \sum_{i=1}^{N_G}{u}_i(t){P}_{Gi}^{\max }+{\displaystyle \sum_{j=1}^{N_{DR}}{u}_j(t){P}_{DRj}^{\max }+{P}_{RES}^F(t)\left(1+\xi \right)\ge }}\;{P}_L(t)+R(t)\right\}\ge \alpha $$

(15)

where α is the credibility level, which represents the reliability level of the reserve constraint. In the realistic problem, α should be more than 0.5.

According to the equivalent theorem of credibility theory, (15) can be transformed into an equivalent form as indicated in (16):

$$ \frac{P_L(t)+R(t)-{P}_{RES}^F(t)-{\displaystyle \sum_{i=1}^{N_G}{u}_i(t){P}_{Gi}^{\max }-{\displaystyle \sum_{j=1}^{N_{DR}}{u}_j(t){P}_{DRj}^{\max }}}}{P_{RES}^F(t)}\le {K}_{\alpha } $$

(16)

$$ {K}_{\alpha }= \inf \left\{K\Big|K={\mu}^{-1}\left(2\left(1-\alpha \right)\right)\right\},\forall \alpha \ge 0.5 $$

(17)

The equivalent form of the fuzzy chance constraint can be further deduced to the following forms:

$$ {\displaystyle \sum_{i=1}^{N_G}{u}_i(t){P}_{Gi}^{\max }+{\displaystyle \sum_{j=1}^{N_{DR}}{u}_j(t){P}_{DRj}^{\max }+\left(1+{K}_{\alpha}\right){P}_{RES}^F(t)\ge }}{P}_L(t)+R(t) $$

(18)

$$ {K}_{\alpha }=\left|{E}_{-}\%\right|\sqrt{\frac{2\alpha -1}{2\sigma \left(1-\alpha \right)}} $$

(19)

It can be proved that K _α is a monotonously increasing function. Equation (18) illustrates the links between the confidence level of the fuzzy constraint and spinning reserve allocation when taking the fuzziness of RES predicted error into account. It shows that to improve the confidence level of the spinning reserve constraint, a greater spinning reserve should be allocated. The form of the formula is similar to the traditional spinning reserve constraint. Thus, the model can be easily solved by correcting the reserve levels using the regular optimization algorithm with the coefficient K _α .

Methods

As introduced above, once chance constraint is transformed into its crisp equivalent, traditional optimization methods can be employed to solve the scheduling problem. Based on the natural selection and genetic manipulation, genetic algorithms (GAs) are heuristic random searching methods, and they possess excellent robustness and commonality. However, there are some shortfalls in the original GA, e.g. the slow convergence speed, falling easily into the locally optimal solution, and so on. A self-adaptive GA method was introduced to improve the performance. The probabilities of crossover and mutation for each generation are adaptively determined, which can overcome the premature convergence and the slow convergence speed in later evolutionary processes.

The crossover and mutation operators are two important genetic operators. In this paper, the crossover operator adopts double-cut-point crossover and the mutation operator is implemented through power disturbance. The crossover and mutation probabilities adopt self-adaptation mechanism and they will adjust adaptively according to the values of the fitness function [25], as shown in (20) and (21):

$$ \begin{array}{l}{P}_c=\left\{\begin{array}{l}{P}_{c2}-\frac{\left({P}_{c2}-{P}_{c3}\right)\left({f}^{\prime }-{f}_{avg}\right)}{f_{\max }-{f}_{avg}},\kern0.5em {f}^{\prime}\ge {f}_{avg}\kern0.1em \\ {}{P}_{c1}-\frac{\left({P}_{c1}-{P}_{c2}\right)\left({f}^{\prime }-{f}_{\min}\right)}{f_{avg}-{f}_{\min }},{f}^{\prime }<{f}_{avg}\kern0.2em \end{array}\right.\\ {}\end{array} $$

(20)

$$ {P}_m=\left\{\begin{array}{l}{P}_{m2}-\frac{\left({P}_{m2}-{P}_{m3}\right)\left({f}^{\prime }-{f}_{avg}\right)}{f_{\max }-{f}_{avg}},\kern0.5em {f}^{\prime}\ge {f}_{avg}\kern0.1em \\ {}{P}_{m1}-\frac{\left({P}_{m1}-{P}_{m2}\right)\left({f}^{\prime }-{f}_{\min}\right)}{f_{avg}-{f}_{\min }},{f}^{\prime }<{f}_{avg}\kern0.2em \end{array}\right. $$

(21)

where P _c and P _m are the crossover and mutation probabilities respectively; f _max , f _min , f _avg are the maximum, minimum, and average fitness; f′ is the greater fitness of the two individuals for genetic operation. Therefore, the superior individual with greater fitness is more likely to be reserved and the inferior individual tends to be transformed into a new one. The improved method could guarantee the population diversity and accelerate its convergence; furthermore, it could avoid the phenomena of premature and slow convergent speed in the later stage of evolution.

Case study

To evaluate the proposed approach, two test systems are studied. At first, a small VPP consisting of three conventional generators, one 50 MW wind farm and loads (conventional and interruptible) is employed. Then a system consisting of 10 generators and one wind farm is implemented to show the effectiveness of the proposed model.

Test systems

The structure of the proposed VPP is shown in Fig. 1. The parameters of the generators and loads in 24 h are indicated in Tables 1 and 2. The wind farm is integrated into the system at Node 4, and its forecasted output in 24 h is shown in Fig. 2. The load at Node 1 is the interruptible load which can be curtailed if necessary. The curtailed load can be regarded as virtual power which can be adjusted continuously and provide the spinning reserve. Its virtual generation capacity ranges from 10 MW to 40 MW. The cost paid for the curtailed load is 45 $/MW.

Fig. 1

Wiring Diagram of the VPP

Table 1 Parameters of conventional generators

Table 2 Load data of the VPP in 24 h

Fig. 2

Forecasted Output of the Wind Farm in 24 h

The parameters of the self-adaptive GA are set as follows: the population size Np = 30; maximum iterations N _ite   = 300; P _c1 = 0.85, P _c2 = 0.5, P _c3 = 0.2, P _m1 = 0.09, P _m2 = 0.05, P _m3 = 0.01. Considering the stochastic nature of GA, 20 test trials were conducted for each case.

Results and discussion

The scheduling model, consisting of (4)–(7), (9)–(11), and (18)–(19), is solved by the self-adaptive GA method in Methods. Apart from the data described in Test systems, different confidence levels are also applied, ranging from 0.6 to 0.9, in steps of 0.1. The corresponding costs for satisfying the fuzzy chance spinning reserve constraint are listed in Table 3, including start-up cost, operation cost, cost of curtailing load, and total cost. In addition, the solutions of the fuzzy chance model are compared with those of the traditional deterministic model.

Table 3 Optimal solutions compared between deterministic and fuzzy chance-constrained model

From Table 3, the total costs vary under different confidence levels; especially when α = 0.6, α = 0.7, α = 0.8, α = 0.9, the total cost are 146,033 $, 146,015 $, 146,124 $, 146,122 $, respectively, which are all less than the cost in deterministic model. It can be inferred that the proper selection of confidence levels will help achieve a tradeoff between economy and reliability. However, as the credibility level is increasing gradually from 0.6 to 0.9, the optimized results (i.e., the total costs) in Table 3 do not show a clear monotonic feature. It should be noted that this does not mean that the results of the fuzzy chance model based on credibility theory are confusing. It is because the results are interfered by the demand-side resources.

If the loads are not allowed to be curtailed, the effect of the interruptible load on the solutions will be excluded. Then the total cost of VPP operation in different confidence levels will be 146,254 $, 146,265 $, 146,280 $, 146,296 $ and 146,487 $ respectively, showing a clear monotonously increasing trend, just as shown in Table 4. This is because, as the credibility level increases, VPP operator needs to spare more reserve capacity to guarantee the growing reliability requirement. Undoubtedly, that would lead to the rise of the total cost. Meanwhile, it is obvious that the total costs in model without curtailing loads are higher than those in original model through comparing the values in Tables 3 and 4. Therefore, the introduction of the demand response (or interruptible loads) helps to improve the economy of the whole system, which is consistent with the current research results. Furthermore, these results stimulate VPP to incorporate demand response and chance constraint programming into its operation strategy.

Table 4 Optimal solutions without curtailing loads

To further confirm the effectiveness of the proposed fuzzy chance model, the operation strategy of a larger VPP system in 6 h is tested. In order to exclude the impact of the interruptible load cost, loads in this system do not participate in the operation. The forecasted output of the wind farm and loads is shown in Table 5, and the parameters of the 10 generators are listed in Table 6.

Table 5 Wind power and the load of the VPP in 6 h

Table 6 Parameters of conventional generators

The operational costs of VPPs under different confidence levels are depicted in Fig. 3, which are the same as the results in [24], except that confidence levels are set as 1 − α in this paper. Figure 3 shows the corresponding cost is increasing when the credibility level rises from 0.6 to 0.9. It is because the confidence level represents the reliability of VPP operation. To reduce the risk resulting from the unpredictable output of renewables, more spinning reserves are required, which will definitely increase the operational cost. The two case studies prove that the proposed model can put forward an optimal operation strategy which can reach the balance between economy and risks/reliability.

Fig. 3

Total Cost of the VPP under Various Confidence Levels

Conclusions

VPP is a promising way to integrate the DERs into the power system. As the output of DERs is usually unpredictable, the scheduling of VPPs has to deal with a number of uncertain variables, which is a fuzzy programming problem. To realize the proper balance between benefits and risks, credibility theory is introduced in the optimal scheduling strategy for VPPs in this paper, thereby proposing a fuzzy chance scheduling model. The concept of the confidence level can quantify the possibility of satisfying the fuzzy chance constraints, which represents the risk tolerance of VPPs. Further, through transforming the fuzzy chance constraints into their equivalent forms, the conventional optimization algorithms can be utilized to solve the optimal scheduling problem. The case study proves that the operational cost of VPPs will increase when the confidence level increases. That is to say, unnecessary costs can be reduced when the risk of VPP operation is within tolerance.