Next Article in Journal
Monitoring of Cardiorespiratory Parameters during Sleep Using a Special Holder for the Accelerometer Sensor
Next Article in Special Issue
Multilayer Semantic Features Adaptive Distillation for Object Detectors
Previous Article in Journal
Load Balancing Using Artificial Intelligence for Cloud-Enabled Internet of Everything in Healthcare Domain
Previous Article in Special Issue
Graph-Based Self-Training for Semi-Supervised Deep Similarity Learning
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

A Low-Carbon and Economic Dispatch Strategy for a Multi-Microgrid Based on a Meteorological Classification to Handle the Uncertainty of Wind Power

1
College of Electrical Engineering, Sichuan University, Chengdu 610065, China
2
Key Laboratory of Intelligent Electric Power Grid of Sichuan Province, Sichuan University, Chengdu 610065, China
*
Author to whom correspondence should be addressed.
Sensors 2023, 23(11), 5350; https://doi.org/10.3390/s23115350
Submission received: 14 April 2023 / Revised: 29 May 2023 / Accepted: 1 June 2023 / Published: 5 June 2023
(This article belongs to the Special Issue Emerging Machine Learning Techniques in Industrial Internet of Things)

Abstract

:
In a modern power system, reducing carbon emissions has become a significant goal in mitigating the impact of global warming. Therefore, renewable energy sources, particularly wind-power generation, have been extensively implemented in the system. Despite the advantages of wind power, its uncertainty and randomness lead to critical security, stability, and economic issues in the power system. Recently, multi-microgrid systems (MMGSs) have been considered as a suitable wind-power deployment candidate. Although wind power can be efficiently utilized by MMGSs, uncertainty and randomness still have a significant impact on the dispatching and operation of the system. Therefore, to address the wind power uncertainty issue and achieve an optimal dispatching strategy for MMGSs, this paper presents an adjustable robust optimization (ARO) model based on meteorological clustering. Firstly, the maximum relevance minimum redundancy (MRMR) method and the CURE clustering algorithm are employed for meteorological classification in order to better identify wind patterns. Secondly, a conditional generative adversarial network (CGAN) is adopted to enrich the wind-power datasets with different meteorological patterns, resulting in the construction of ambiguity sets. Thirdly, the uncertainty sets that are finally employed by the ARO framework to establish a two-stage cooperative dispatching model for MMGS can be derived from the ambiguity sets. Additionally, stepped carbon trading is introduced to control the carbon emissions of MMGSs. Finally, the alternative direction method of multipliers (ADMM) and the column and constraint generation (C&CG) algorithm are adopted to achieve a decentralized solution for the dispatching model of MMGSs. Case studies indicate that the presented model has a great performance in improving the wind-power description accuracy, increasing cost efficiency, and reducing system carbon emissions. However, the case studies also report that the approach consumes a relative long running time. Therefore, in future research, the solution algorithm will be further improved for the purpose of raising the efficiency of the solution.

1. Introduction

With the issues of global pollution and fossil-energy depletion becoming more and more severe, carbon-emission reduction has become an important focus for technological development [1]. As a result of its remarkable advantages [2], renewable energy generation has been adopted for low-carbon applications in the power system [3]. Research in this area [4] has provided electricity generated by renewable energy to the green cottage and obtained relatively greater benefits. However, the strong uncertainty and randomness of renewable energy generation cause significant issues in terms of the security and efficiency of the power system [5]. Microgrids are able to provide effective solutions for the local consumption of renewable energy owing to their flexible operation and high autonomy [6], avoiding the issues caused by the direct connections of renewable energies to the grid. Additionally, with the advancement of electricity marketization, it is possible to interconnect a certain number of microgrids to form an MMGS [7]. An MMGS aims to achieve a balance between power supply and demand by means of energy interaction and collaborative optimization within the system, further promoting the consumption of renewable energies. Compared to individual microgrids, MMGSs have better overall economic efficiency and lower carbon emissions [8]. However, the uncertainty of the energy generation in the microgrid, especially that produced by wind energy, may lead to poor energy utilization [9]. This leads to dispatching operation being dependent on units with a high carbon emission and a failure to fully utilize the low-carbon characteristics of the microgrid [10]. Therefore, it is highly valuable to study the dispatching strategy for MMGSs with regard to wind-power uncertainty to ensure carbon-emission reduction and economic improvement.
As mentioned above, the uncertainty of wind-power generation in the microgrid leads to difficulty in dispatching decisions. Mathematical approaches such as stochastic optimization (SO) and robust optimization (RO) are widely employed to address dispatching decisions involving uncertainties [11]. Li et al. [10] presented a scenario-based optimal operational model based on SO, mainly to handle the uncertainties involved in energy demand and renewable generation. The effectiveness of the approach was verified according to the experimental results. However, Chen et al. [12] pointed out that the probability distribution of the random variables in SO is difficult to obtain precisely. They also suggested that in the RO model, the range of renewable energy generation can be depicted by constructing an uncertainty set without information on the probability distribution of variables. Although RO is able to provide better dispatching strategies theoretically, Wang et al. [13] suggested that the decision results based on RO are frequently overly conservative. Therefore, Zhai et al. [14] presented an ARO model to address renewable energy uncertainty while utilizing the controllable uncertainty set to reduce the conservatism of the solution. Case studies illustrated that the ARO model can better balance the economy and robustness of the dispatching strategy by controlling the frequency of worst-case scenarios. However, the ignorance of the uncertainty probability information in ARO and the subjective determinations of the current construction of the uncertainty set result in a lack of precise delineation of the variables [15].
In order to address the shortage of ARO uncertainty intervals, historical data on wind power are employed to provide scientific data support for the construction of the uncertainty set [16]. Wu et al. [11] developed an ambiguity set of the probability distribution of wind power based on the imprecise Dirichlet model, which used the historical data to establish the uncertainty intervals without relying on subjective determinations. The model was adopted into the ARO framework, which objectively improved the efficiency of the final dispatching model. Wang et al. [17] constructed the ambiguity set of the probability distribution of wind power based on the Wasserstein distance, and the experimental results indicated that the description accuracy of the uncertainty gradually increased with the increasing number of historical samples. The research suggests that the construction of the ambiguity set highly depends on a sufficient amount of historical data.
Therefore, it is fundamental to generate a suitable amount of historical wind-power data for ARO to build a precise ambiguity set in terms of achieving the optimal dispatching strategy for microgrids. Jiang et al. [18] presented a generative adversarial network (GAN) to generate synthesized wind-power scenarios. Ning et al. [19] generated a set number of wind-power data samples using GAN to implement economic dispatching optimization. The experimental results of these studies demonstrate that GAN can accurately capture the probability-distribution characteristics of the sample data and generate new synthesized samples with similar statistical characteristics to expand the historical dataset. Meanwhile, Li et al. [20] and Qin et al. [21] reported that wind-power output is highly related to the meteorology in the location of the microgrids; thus, the distribution of wind power varies under different meteorological categories. Nevertheless, the existing research, which integrates data-generation techniques and the ambiguity set to reflect the uncertainty of wind-power generation, tends to assume that the distributions in the ambiguity set are similar. In addition, most studies employ only one uncertainty set to describe the range of variation. It should be pointed out that a single uncertainty set is not conducive to accurately portraying the uncertainty. Therefore, Xu et al. [8] clustered the historical meteorological dataset to obtain various meteorological patterns, thereby building a wind-power prediction model for different meteorological patterns. The simulations proved that the clustering model can adequately extract historical data to improve the prediction accuracy, with better results than the non-clustering model. Therefore, meteorological classification combined with the generation of data using GAN is an effective way to improve the utilization of data samples and the effectiveness of ARO in terms of achieving the optimal dispatching strategy.
Additionally, to further reduce carbon emissions, studies involving coordinated dispatching for MMGS in combination with carbon trading have been conducted. Zhang et al. [22] and Wang et al. [23] introduced the carbon-trading mechanism to MMGSs and constructed a decentralized dispatching model using ADMM. The simulation results demonstrated the effectiveness of the carbon-trading mechanism in guiding an MMGS to reduce carbon emissions. Yang et al. [24] achieved efficient low-carbon operation by introducing stepped carbon trading into an optimal dispatching mechanism, and the analysis showed a stronger carbon-reduction ability compared to the traditional carbon-trading approaches. Therefore, the further use of stepped carbon prices to limit carbon emissions as part of the dispatching strategy can additionally improve the low-carbon performance of MMGSs.
Motivated by previous research, this paper focuses on the efficient low-carbon dispatching of MMGSs in light of wind-power uncertainty using stepped carbon trading. The main contributions of this paper are summarized as follows: (i) According to the variability of wind power in different meteorological scenarios, the meteorological features that are highly relevant to wind-power output are determined. Then, a meteorological clustering model is established to improve the effectiveness of utilizing the historical wind-power data; (ii) a GAN-based synthesized data-generation technique and an ambiguity set are employed to develop a wind-power interval estimation model for different meteorological patterns, to better address wind-power uncertainty using historical data; (iii) taking into account the carbon-trading mechanism, a two-stage ARO cooperative operation model based on the improved uncertainty set of wind power is presented to achieve an optimal low-carbon and economically efficient dispatching strategy for MMGSs.
The remainder of this paper is organized as follows. Section 2 presents the interval estimation model of wind power with different meteorological patterns. Section 3 presents the two-stage ARO low-carbon economic dispatching model of MMGS, considering the carbon-trading mechanism. Section 4 introduces the solution method for the presented model. Section 5 presents the experimental analysis. Section 6 presents the conclusions of this paper.

2. Improved Data-Driven Uncertainty Set for Wind Power

In this section, based on the limited historical data of wind power and the corresponding multi-dimensional meteorological information, the weather type labels of the original data are obtained using the MRMR feature selection method and CURE clustering algorithm. The CGAN is further employed to generate an appropriate number of wind-power samples with different labels, in order to increase the number of samples for the original wind-power data. Based on the achieved labels and the expanded wind-power data, a grouping generative model of wind power is established. The generated samples are also utilized to construct Wasserstein metric-based ambiguity sets. As a result, the uncertainty interval of wind power can be obtained to precisely describe the uncertainty. The presented data-driven model is illustrated in Figure 1.

2.1. Wind Power Generative Model Considering Meteorological Classification

2.1.1. MRMR-Based Feature Selection Method

The features with redundancy or low relevance frequently have negative impacts on the classification of meteorological data. Therefore, MRMR technology is applied to obtain an optimally selected feature subset that has a minimum redundancy among the interior features and maximum relevance to the wind power. The maximum relevance and minimum redundancy indicators are defined in Equations (1) and (2):
max D ( S , ν ) , D = 1 S d p S I ( d p ; ν )
min R ( S ) , R = 1 S 2 d p , d q S I ( d p ; d q )
where S denotes the set of the associated features affecting the wind power; I(·) represents the mutual information; D(S, ν) describes the relevance between each feature dp in S and the wind power ν; R(S) describes the redundancy among features in S; |S| denotes the number of features contained in S.
Assuming the feature subset Sk−1 composed of k − 1 features has been determined, the k-th feature selected from the remaining feature set should satisfy Equation (3).
max d j { S S k 1 } ( I ( d q ; ν ) 1 k 1 d p S k 1 I ( d q ; d p ) )
Finally, the meteorological features for which the values of the operator increment are greater than zero are selected to form the feature subset SK. Then, the selected features and the wind-power data in SK are normalized using Equation (4). As a result, a normalized dataset Rnor containing the optimal feature information and wind power is constructed. The details of Rnor are shown in Equation (5).
d nor = ( d ¯ d _ ) ( d d min ) d max d min + d _
R nor = { d 1 , n o r , d 2 , n o r , , d K , n o r , ν n o r }
Here, d ¯ and d _ denote the expected maximum and minimum values, which are taken as 1 and −1, respectively; the subscript “nor” indicates that the value has been normalized.

2.1.2. Clustering of Meteorological Features Based on the CURE Algorithm

The CURE clustering algorithm is employed to implement the clustering for the high-dimensional dataset Rmet to group similar weather patterns. Based on the clustered result, the weather type labels llab can be obtained. Each corresponding wind-power sample in Rnor can then be assigned a weather type label. Finally, the dataset Rlab containing the labeled wind-power samples can be determined. The compositions of Rmet and Rlab are shown in Equation (6):
R met = { d 1 , n o r , d 2 , n o r , , d K , n o r } , R lab = { ν nor , l lab }
The CURE algorithm is a hierarchical clustering method that uses multiple representative elements to represent a cluster. When clustering the normalized dataset Rmet, each sample is firstly regarded as a cluster. Then, the algorithm combines the two closest clusters to form a new cluster. When the pre-specified number of clusters is reached, the algorithm terminates. The distance between two clusters is the distance between the nearest two representative elements belonging to the two clusters, as determined in accordance with Equation (7). The identification of the representative elements is based on [25].
d i s t ( u , w ) = min u u . rep , w w . rep d ( u , w )
Here, u.rep and w.rep represent the collection of the representative elements of cluster u and cluster w, respectively; d(u′,w′) represents the distance between the representative elements u′ and w′. The distance is determined using the square of the Euclidean distance.

2.1.3. Generation of Wind-Power Samples Using CGAN

CGAN is an improved model based on the original GAN model; it allows generation of the data samples based on the predefined labels. Therefore, it can be adopted to generate the labeled data samples serving the specific designed scenarios. It trains the model parameters using the adversarial competition between its generator and discriminator. When the Nash equilibrium is achieved, the training process terminates. Then, the samples with given labels can be further generated. Figure 2 illustrates the basic structure of the CGAN model.
The generator and discriminator are both deep neural networks defined by a set of parameters. The objective of training the generator parameters is the generation of newly synthesized samples in which the distribution is similar to the original data and which eventually cheat the discriminator. The objective of training the discriminator parameters is the identification of whether the input sample is a real sample or a synthesized sample. Using the adversarial training of the above two neural networks, we can finally reach the Nash equilibrium point, which indicates that the synthesized samples have sufficiently similar data features to those of the original samples. Therefore, they can be employed to enrich the original to-be-processed dataset.
The training objective function of CGAN is shown in Equation (8). The weather type label llab in the dataset Rlab is taken as the conditional information z and fed into the generator along with the noise b. The generated sample and the real sample a are each combined with z and then fed into the discriminator. Through the adversarial training of CGAN, the generator can finally generate an appropriate amount of wind-power data as conditioned by the weather type labels to acquire the generated dataset Rgen, as shown in Equation (9).
min G   max D V ( D , G ) = E a ~ P a [ ln D ( a | z ) ] + E b ~ P b [ ln ( 1 D ( G ( b | z ) ) ) ]
R gen = { ν 1 , , ν m , , ν M }
Here, E(·) denotes the expected value; D(a|z) is the probability that the real sample a conditioned by label z is determined to be true in the discriminator. D(G(b|z)) is the probability that the generated sample G(b|z) based on the noise b and label z is determined to be true in the discriminator. ν m is a generated wind-power sample with label m. M represents the total number of labels.

2.2. Construction of Uncertain Interval under Ambiguity Probability Distribution

The weather type label llab for a certain day can be determined from the meteorological information provided by the weather prediction for the day. Then, the generated samples using the label llab in Rgen can be employed to delineate the wind power more precisely. However, the probability distribution of wind power can remain uncertain. Therefore, Wasserstein metric-based ambiguity sets containing a set of uncertain probability distributions are constructed separately for the wind-power scenarios with different labels. Specifically, this involves limitation of the probability distribution P ˜ m of the true wind power ν ˜ m with label m in an ambiguity set Ωm. The probability expectation of the true wind power in the ambiguity set Ωm with a given uncertainty set is employed as the index to determine the worst-case scenario, as shown in Equation (10):
sup P ˜ m Ω m E P [ P ( ν ˜ m ν ^ m l ν ˜ m ν ^ m u ) ]
where ν ^ m u and ν ^ m l represent the upper and lower bound of the uncertainty set of the wind power with label m.
The Wasserstein distance is adopted to measure the distance between the empirical distribution P ^ m 0 based on the generated sample ν ^ m and the true distribution P ˜ m based on ν ˜ m , as shown in Equation (10). The ambiguity set is modeled in Equations (11) and (12). The construction of the empirical distribution is based on [17].
W ( P ˜ m , P ^ m 0 ) = inf Π Ξ 2 ν ˜ m ν ^ m Π d ( ν ˜ m ) , d ( ν ^ m )
Ω m = P m M ( Ξ m ) | W ( P ˜ m , P ^ m 0 ) ε m
Here, ν ^ m represents the generated sample with label m; represents a norm function, which is L1-norm in this paper; Π ( d ( ν ˜ m ) , d ( ν ^ m ) ) represents the joint probability distribution of ν ^ m and ν ˜ m ; M ( Ξ m ) represents the set of all probability distributions of ν ˜ m with supporting set Ξ m ; ε m controls the size of Ωm, which depends on the sample number Nm with label m and the confidence level of Ωm [17].
We substitute Ωm into Equation (10) and then convert Equation (10) into the form shown in Equation (13):
inf λ 0 , σ n λ ε m + 1 N m n = 1 N σ n s . t . σ n = 1 , ν _ m ν ^ m n < ν ^ m l , ν ^ m u < ν ^ m n ν ¯ m 1 λ ( ν ^ m u ν ^ n ) σ n , ν ^ m l ν ^ m n < ν ^ m u 1 λ ( ν ^ n ν ^ m l ) σ n , ν ^ m l ν ^ m n < ν ^ m u 0 σ n , ν ^ m l ν ^ m n < ν ^ m u
where λ represents the dual variable; σ n represents an auxiliary variable; ν ¯ m and ν _ m represent the upper limit and the lower limit of ν ˜ m in the supporting set Ξ m .
In order to simplify the calculation, it is assumed that the boundaries of the uncertainty set, namely ν ^ m u and ν ^ m l , are symmetric about the mean value μ ^ m , as shown in Equation (14). Therefore, the relationship between the different uncertainty set bounds and different probability expectation values fm can be obtained using Equation (15):
ν ^ m l = μ ^ m δ ^ m , ν ^ m u = μ ^ m + δ ^ m
f m δ ^ m = sup P ˜ m Ω m E P [ P ( ν ˜ m μ ^ m δ ^ m | | ν ˜ m μ ^ m + δ ^ m ) ]
where δ ^ m is an auxiliary variable.
The probability point fm = 1 − θ can be approached gradually using the dichotomy denoted by Equation (15). Its corresponding values ν ^ m l and ν ^ m u are further taken as the lower and the upper boundaries of the uncertainty set U to complete the construction of the uncertainty interval with the label m.

3. Modeling of MMGS Considering the Carbon-Trading Mechanism

The structure of the MMGS studied in this paper is shown in Figure 3. The MMGS consists of a number of n combined heat and power microgrids, each of which contains a wind turbine, distribution/gas network, controllable generation (CG) (gas turbine, gas boiler, electric boiler), and electric/thermal load. Each microgrid is connected to the distribution network, while different microgrids are connected to each other via tie line. The dispatch center of every microgrid can exchange limited operational information with other connected microgrids. Therefore, each microgrid has the ability to make decisions independently to interact with the distribution network or the other microgrids in terms of implementing electricity trading. At the same time, the microgrids also conduct carbon trading with the carbon market to optimize the low-carbon and economic performance of their own dispatching strategies.
RO adopts a bounded and closed uncertainty set to describe the variable range of uncertain parameters. Then, the uncertainty set is searched for the case that makes the optimization result the most pessimistic. Therefore, RO is an uncertainty handling method that optimizes for the worst-case scenario in the uncertainty set of uncertain parameters. Based on RO, an adjustable robust parameter is introduced to control the frequency of the worst-case scenario in the uncertainty set. Thus, the ARO model is obtained.
In order to effectively cope with the risk brought by the uncertainty of wind-turbine output to the microgrid dispatching, we construct a two-stage ARO microgrid model using the following compact form, as shown in Equation (16):
min x { C da ( x ) + max u   min y   C rt ( u , y ) }
where x, u, y, Cda(x), and Crt(u,y) represent the day-ahead dispatching strategy, the worst-case scenario of wind-power output, the real-time adjustment strategy for x with the worst-case scenario, the day-ahead operation cost, and the real-time adjustment cost, respectively.
The uncertainty set U = { ν ˜ WT [ ν WT l , ν WT u ] } is adopted to describe the uncertainty of wind power in the adjustment stage. In the aforementioned presentation, an adjustable robust parameter represents the number of occurrences of the worst-case scenarios of wind-power output during the dispatch period. The adjustable robust parameter Γ is introduced to control the conservativeness of the model. Therefore, the wind-power output can be described as shown in Equation (17):
t T ( P ˜ WT , t P WT , t pre ν WT , t u ρ t + + P WT , t pre P ˜ WT , t ν WT , t l ρ t ) Γ
where ν WT , t u and ν WT , t l represent the fluctuation ranges of wind power at time t, which is explained in detail in Section 2; P wind , t pre and P ˜ wind , t represent the predicted value and real value of wind-power output at time t, respectively; ρ t + and ρ t represent auxiliary 0–1 variables; and T represents the time set.

3.1. Modeling of Microgrid Dispatch in the First Stage

In the first stage, Microgrid i formulates the dispatching strategy x with the objective of minimizing the day-ahead operation costs, which include the cost of purchasing and selling electricity within the distribution network C Grid , i da , the cost of purchasing gas from the gas network C Gas , i da , the cost of carbon trading C C , i da , and the cost of trading electricity with other microgrids CMG,i. The details are shown in Equations (18)–(21).
min x C da ( x ) = C Grid , i da + C Gas , i t da + C C , i d a + C MG , i
C Grid , i da = t T ( τ ebuy , t da P ebuy , i , t da τ esell , t da P esell , i , t da )
C Gas , i da = t T τ Gas ( G GT , i , t da + G GB , i , t da )
C MG , i = t T j Ψ i τ ex , t P i j , t ex
Here, τ ebuy , t da , τ esell , t da , τ Gas , and τ ex , t represent the price of electricity purchased from the distribution network, the price of electricity sold to the distribution network, the price of gas purchased from the gas network, and the price of electricity in interactions with other microgrids at time t in the day-ahead stage; Ψ i represents the set of microgrids connected to Microgrid i; P ebuy , i , t da , P esell , i , t da , G GT , i , t da , P GB , i , t da , and P i j , t ex represent the amount of electricity purchased from the distribution network, the amount of electricity sold to the distribution network, the amount of gas consumed by the gas turbine, the amount of gas consumed by the gas boiler, and the amount of electricity interacting with Microgrid j in the day-ahead stage at time t of Microgrid i, respectively. The details for the cost of carbon trading are provided in Section 3.3.
The constraints in the first stage include energy-balance constraints, constraints for interaction with distribution/gas networks, constraints for power interaction with other microgrids, CG operation constraints, and carbon-balance constraints. The details of the constraints are shown in Equations (22)–(27).
A.
Energy balance constraints:
P GT , i , t da + P Wind , i , t pre + P ebuy , i , t da + j Ψ i P i j , t ex = P EB , i , t da + P esel , i , t da + P Eload , i , t
Q GT , i , t da + Q GB , i , t da + Q EB , i , t da = P Hload , i , t
where P GT , i , t da , P EB , i , t da , P Eload , i , t , Q EB , i , t da , and P Hload , i , t represent the electric output of the gas turbine, the electric power consumed by the electric boiler, the electric load demand, the thermal output of the electric boiler, and the thermal load demand in Microgrid i at time t in the day-ahead stage, respectively.
B.
Constraints for interaction with distribution/gas networks:
0 P ebuy , i , t da V ebuy , i , t P Grid , i max 0 P esell , i , t da V esell , i , t P Grid , i max V ebuy , i , t + V esell , i , t 1 0 G GT , i , t da + G GB , i , t da G Gas , i max
where Vebuy,i,t and Vesell,i,t represent the states of the power purchased and sold from Microgrid i to the distribution network at time t, which are 0–1 variables; P Grid , i max and P Gas , i max represent the maximum value of power interacting with the distribution network and the maximum value of gas purchased from the gas network, respectively.
C.
Constraints for power interaction with other microgrids:
P i j max P i j , t ex P i j max
where P i j max represents the maximum value of the transaction power between Microgrid i and Microgrid j.
D.
CG operation constraints:
V CG , i , t P CG , i min P CG , i , t da V CG , i , t P CG , i max R CG , i dw P CG , i , t da P CG , i , t 1 da R CG , i up
where VCG,i,t represents the operation state of the CG, which is a 0–1 variable; P CG , i min / max and R CG , i up / dw represent the maximum/minimum output of the CG and the maximum up/down ramping capacities, respectively.
Energy conversion model for CG:
P GT , i , t da = η GT H ng G GT , i , t da Q GT , i , t da = η HE η WH ( 1 η G T ) H ng G GT , i , t da Q GB , i , t da = η GB H n g G GB , i , t da Q EB , i , t da = η EB P EB , i , t da
where ηGT, ηWH, ηHE, ηGB, and ηEB represent the conversion efficiencies of the gas turbine power generation, the waste heat recovery, the heat exchanger, the gas boiler heating, and the electric boiler heating, respectively. Hng represents the heat value of natural gas.

3.2. Modeling Real-Time Adjustment Dispatch in the Second Stage

Based on the x obtained in the first stage, Microgrid i searches for the worst-case scenario of wind power u and formulates the corresponding real-time adjustment strategy y after the realization of the wind-power uncertainty. The real-time adjustment cost consists of the regulation cost of CG C CG , i rt , the real-time grid interaction cost C Grid , i rt , the real-time gas purchasing cost C Gas , i rt , the real-time carbon trading cost C C , i rt , and the wind curtailment cost C Wind , i loss . The details are shown in Equations (28)–(32).
C rt ( u , y ) = C CG , i rt + C Grid , i rt + C Gas , i rt + C C , i r t + C Wind , i loss
C CG , i rt = t T ( τ GT up G GT , i , t up + τ GT dw G GT , i , t dw + τ GB up G GB , i , t up + τ GB dw G GB , i , t dw + τ EB up P EB , i , t up + τ EB dw P EB , i , t dw )
C Grid , i rt = t T ( τ ebuy , t rt P ebuy , i , t rt τ esell , t rt P esell , i , t rt )
C Gas , i rt = t T τ Gas ( G GT , i , t up G GT , i , t dw + G GB , i , t up G GB , i , t dw )
C Wind , i loss = t τ loss ( P ˜ Wind , i , t P Wind , i , t get )
Here, τ GT up / dw , τ GB up / dw , τ EB up / dw , and τ loss represent the up/down regulation of the price of the GT, the up/down regulation of the price of the GB, the up/down regulation of the price of the EB, and the wind penalty price, respectively; τ ebuy , t rt and τ esell , t rt represent the purchased and sold prices of electricity in the real-time stage, respectively; G GT , i , t up / dw , G GB , i , t up / dw , and P EB , i , t up / dw represent the up/down regulation of gas to the GT, the up/down regulation of gas to the GB, and the up/down regulation of power to the EB, respectively; P ebuy , i , t rt and P esell , i , t rt represent the purchased and sold power in the real-time stage, respectively; P wind , i , t get represents the real-time injected wind power.
The constraints in the second stage consist of the wind turbine regulation constraints, the CG regulation constraints, the real-time energy balance constraints, and the real-time power/gas interaction constraints. The details of the constraints are shown in Equations (33)–(37).
A.
Wind turbine regulation constraints:
0 P Wind , i , t get P ˜ Wind , i , t
B.
CG regulation constraints:
0 P CG , i , t up V CG , i , t up R CG , i up , 0 P CG , i , t dw V CG , i , t dw R CG , i dw V CG , i , t up + V CG , i , t dw 1 V CG , i , t P CG , i min P CG , i , t da + P CG , i , t up P CG , i , t dw V CG , i , t P CG , i max R CG , i dw P CG , i , t da + P CG , i , t up P CG , i , t dw ( P CG , i , t 1 da + P CG , i , t 1 up P CG , i , t 1 dw ) R CG , i up
where V CG , i , t up / dw represents the ramping state of the CG, which is a 0-1 variable.
C.
Real-time energy balance constraints:
P GT , i , t da + P GT , i , t up P GT , i , t dw + P Wind , i , t get + P ebuy , i , t da + P ebuy , i , t rt + j Ψ i P i j , t ex = P EB , i , t da + P EB , i , t up P EB , i , t dw + P esell , i , t da + P esell , i , t rt + P Eload , i , t
Q GT , i , t da + Q GT , i , t up Q GT , i , t dw + Q GB , i , t da + Q GB , i , t up Q GB , i , t dw + Q EB , i , t da + Q EB , i , t up Q EB , i , t dw = P Hload , i , t
D.
Real-time power/gas interaction constraints:
0 P ebuy , i , t rt P Grid , i max 0 P esell , i , t rt P Grid , i max 0 P ebuy , i , t da + P ebuy , i , t rt V ebuy , i , t P Grid , i max 0 P esell , i , t da + P esell , i , t rt V esell , i , t P Grid , i max 0 G GT , i , t da + G GT , i , t up G GT , i , t dw + G GB , i , t da + G GB , i , t up G GB , i , t dw G Gas , i max

3.3. Carbon-Trading Mechanism

When there is a shortage of carbon allowance for a microgrid, it must buy its carbon allowance from the carbon market. The cost of purchasing the carbon allowance should be regarded as a part of the operation costs. In contrast, the microgrid can sell the surplus carbon allowance to receive certain monetary compensation. The introduction of the carbon-trading cost will change the total operational cost of the microgrid, thus guiding the microgrid to adopt an efficient dispatching strategy to achieve the goal of reducing carbon emissions. The microgrid employs the stepped carbon-trading mechanism to conduct carbon trading with the carbon market, as shown in Equation (38).
C C , i = τ C E i , E i l C τ C ( 1 + ρ ) ( E i l C ) + τ C l C , l C E i 2 l C τ C ( 1 + 2 ρ ) ( E i 2 l C ) + ( 2 + ρ ) τ C l C , 2 l C E i 3 l C τ C ( 1 + 3 ρ ) ( E i 3 l C ) + ( 3 + 3 ρ ) τ C l C , 3 l C E i 4 l C τ C ( 1 + 4 ρ ) ( E i 4 l C ) + ( 4 + 6 ρ ) τ C l C , 4 l C E i
Here, C C , i , τ C , l C , ρ , and Ei represent the carbon trading cost, the initial carbon-trading price, the interval length of the carbon emission, the increase ratio of the stepped price, and the carbon emissions traded with the carbon market, respectively.
Carbon emissions of the microgrid are mainly caused by the power purchased from the distribution network, the operation of the gas turbine, and the operation of the gas boiler. In Microgrid i, the formulation of the actual carbon emissions Ei,a and the free allowance for the carbon emission Ei,0 are presented in [24] in detail. The carbon-balance constraint in the dispatching process of Microgrid i is shown in Equation (39):
E i , a E i , 0 = E i

4. Model Solution

Since each microgrid belongs to a different party, in order to guarantee the privacy of the information and the independence of the decision making of each microgrid, ADMM is employed to achieve a decentralized solution for MMGS optimal dispatching. At first, the tie-line transmission power between two microgrids is decoupled using the coordination variables P ^ i j , t and the corresponding consistency constraint shown in Equation (40). Then, the augmented Lagrangian function shown in Equation (41) is constructed. Therefore, the original problem can be decomposed into multiple local optimization problems, which can be solved in each individual microgrid system.
P i j , t ex = P ^ i j , t
min x c T x + t T j Ψ i λ i j , t q P i j , t ex , q P ^ i j , t q + ρ pen 2 P i j , t ex , q P ^ i j , t q 2 2 + max u min y d T y + e T u
Here, λij,t represents the dual variable; ρ pen represents the penalty factor, which is greater than zero; the superscript q represents the number of iterations.
Each microgrid solves the optimization problem locally to obtain the local dispatching strategies and the tie-line coupling variables. The two-stage ARO problem can be solved using the C&CG algorithm. The details of the C&CG algorithm are presented in the Appendix A [11]. The original problem can be decomposed into a master problem and a sub problem. Then, the sub and master problems iterate alternately. The detailed procedure of the nested iterative solution of ADMM and C&CG algorithms is shown in Algorithm 1.
Algorithm 1 The nested iterative solution process of the ADMM and C&CG methods
  1: Initialize: dual variable λ, coordination variables P ^ i j , t , convergence gap ξ, number of iterations q
  2: Calculate: initial power of tie-line
  3: Update: dual variable λ q and coordination variables P ^ i j , t q
  4: Each microgrid solves the optimal economic dispatching model in a decentralized way
  5: Initialize: upper boundary U0, lower boundary L0, initial scenario set u1, convergence gap ε, number of iterations l for robust dispatching
  6: Calculate: master problem
  7: Obtain: day-ahead dispatching strategy and corresponding adjustment strategy (xl,yl)
  8: Update: lower boundary Ll
  9: Calculate: sub problem
10: Obtain: worst-case wind-power scenarios and corresponding adjustment strategy ( x l * , y l * )
11: Update: upper boundary Ul
12: Repeat Step 6 to Step 11 until U l L l < ε
13: Output: economic dispatching strategy for each microgrid
14: Update: dual variable λ q + 1 , coordination variable P ^ i j , t q + 1
15: Repeat Step 4 to Step 14 until the primary residuals and dual residuals are less than the specified convergence gap ξ

5. Case Study

5.1. Basic Parameter Setting

In order to verify the effectiveness of the presented data-driven wind-power uncertainty-set-based low-carbon economic dispatching model for MMGSs, experiments are conducted in the Win10 64-bit system. The optimal dispatching operation of the MMGS is modeled using MATLAB R2018b and solved by Gurobi. The deep-learning network is built in the Keras framework [26] based on Tensorflow 2.2, Python 3.6. An MMGS composed of four microgrids is employed in this paper. The architecture of the MMGS is shown in Figure 3. The structure and device parameters of the four microgrids are identical, while the electric and thermal load demands and wind-power outputs of the microgrids are different. The details of the load curves are shown in Figure 4. The system device parameters are shown in Table 1. The operation cost coefficients are shown in Table 2. The prices of electricity purchased and sold from the distribution network are shown in Table 3.
In terms of the CGAN employed in this paper, the generator adopts four fully connected layers. The number of neurons in the hidden layers is 128, 256, and 128. The activation function is a rectified linear unit (ReLU). In addition, the size of the output layer is set to 24, which is the same as the number of real daily wind-power samples. In the discriminator, four fully connected layers are also adopted. The number of neurons in the hidden layers is 256, 128, and 64. The activation function is also ReLU. The number of neurons in the output layer is set to 1. The historical data of a wind farm from 2017 to 2018 (640 days in total) are employed. The dataset includes daily multi-dimensional meteorological data and wind-power data, with a sampling interval of 1 h. Additionally, the historical data of 500 days are selected as the training dataset and the historical data of the remaining 140 days are the testing dataset.

5.2. Validity Analysis of Uncertainty Set

Due to the large variability of the meteorological characteristics in different seasons, the data of four days from four seasons are randomly selected from the testing dataset to illustrate the capability of the presented model in accurately describing the wind power. The data of these four days are substituted into the presented generative model with labels in this paper (Model 1) and the generative model without feature selection and feature clustering (Model 2) for comparison. The number of samples generated by these two generative models is set to 3000, and the confidence level is 90%. Figure 5 shows the uncertainty intervals of the four-day data with the two models. In the figure, the deep blue line, the orange interval, and the gray interval are the actual value of the wind power, the uncertainty interval of Model 1, and the uncertainty interval of Model 2, respectively.
Figure 5 indicates that in the four-day experiments, the widths of the uncertain intervals of the wind power for Model 1 and Model 2 are similar. However, the interval of Model 1 can fully cover the actual value of the wind power, while that of Model 2 can only partially cover the value. When the width of the uncertainty interval is close to the actual value, the coverage rate is higher and the uncertainty portrayal is more accurate. The method presented in this paper can achieve a higher accuracy in describing wind power for different meteorological patterns in all four seasons.
In order to evaluate the performance of CGAN in enriching the dataset, the samples of the training dataset and the noise are inputted into CGAN to generate 3000 synthesized samples. Then, the probability distribution of the generated samples is compared to the distribution of the real samples. The comparison results of the sample distribution with Label 1 are shown in Figure 6. It can be observed that the distribution results of the generated samples based on the CGAN model are basically consistent with the real samples, demonstrating the effectiveness of CGAN in sample generation.
In order to verify the effectiveness of the data-driven ambiguity set, the widths of the wind-power uncertainty interval with different sample sizes are compared. The comparison results with Label 1 are shown in Figure 7. As the number of samples utilized to construct the ambiguity set increases, the width of the obtained uncertainty interval gradually narrows. This is mainly because the Wasserstein ball can limit the fluctuation range of the probability distribution of wind power. The radius of the ambiguity set decreases with the increasing number of samples, resulting in the unknown uncertainty distribution approximating the true distribution of the historical data. Therefore, the conservativeness of the model can be reduced. This indicates that the interval estimation using the data-driven model presented in this paper, i.e., the expansion of the number of wind-power samples serving the construction of the Wasserstein distance-based ambiguity sets, can effectively improve the accuracy of the uncertainty portrayal when the historical data are insufficient.

5.3. Analysis of Data-Driven Microgrid Dispatching Results

5.3.1. Comparison of Dispatching Results with Different Sample Sizes

In order to analyze the impact of the sample size on the microgrid dispatching, the uncertainty intervals of the wind power driven by the sample sizes of the original amount (102), 300, 500, 1000, and 3000 with Label 1 are employed for the dispatching of Microgrid 1. The comparison of the cost and the carbon emission is shown in Figure 8. It can be observed that with the increasing number of samples, both the cost and the carbon emissions of the microgrid dispatching decrease. This is because more samples drive the uncertainty interval to become narrower. As a result, the optimization can guarantee dispatching under the worst scenario with a higher efficiency. Meanwhile, wind-power consumption and carbon-emission reduction also benefit from the improvement in the accuracy of the wind-power description. The results significantly suggest that data-driven wind-power interval estimation can effectively improve efficiency and reduce the carbon emissions of microgrid dispatching.

5.3.2. Comparison of Dispatching Results of Uncertainty Optimization Algorithms

Subsequent experiments compared the performance of the presented data-driven ARO method to that of the traditional RO and ARO methods in terms of microgrid dispatching. In the experiment, the prediction errors of the wind-power uncertainty interval of the traditional RO and ARO methods are assumed to be 20%. The presented data-driven ARO adopts the uncertainty interval using 3000 generated samples with Label 4. The experiment is carried out based on the dispatching of Microgrid 2. The results are shown in Figure 9. The calculation times of the three optimization methods are shown in Table 4.
The RO method utilizes the worst-case scenarios of wind power to achieve optimal dispatching, which results in sacrificing both efficiency and lower carbon emissions to improve robustness. Consequently, the results are conservative compared to the other optimization methods. The ARO method introduces adjustable robust parameters to limit the appearance frequency of the worst-case scenarios, making its dispatching results more efficient and less carbon-emitting than those of RO. However, since the distribution information of the uncertain variables is neglected in ARO, the results remain conservative compared to those of the presented data-driven ARO, from which a more accurate uncertainty boundary can be obtained. Thus, a balance between the efficiency and robustness of the dispatching strategy can be achieved, and carbon emissions can be further reduced.
Table 4 shows that the traditional RO takes the shortest computation time, while the traditional ARO and data-driven ARO require a longer solution time due to multiple iterations. The solution efficiencies of traditional ARO and data-driven ARO are similar. This indicates that the improved ARO model presented in this paper does not carry a burden on computational performance based on the traditional ARO.

5.4. Analysis of MMGS Dispatching with Different Dispatching Cases

5.4.1. Comparison of Dispatching Results Using Different Dispatching Cases

The four dispatching cases shown in Table 5 are conducted to verify the effectiveness of the MMGS dispatching model presented in this paper.
Figure 10 shows the results of MMGS dispatching in four different cases. It can be observed that without the energy interaction and carbon trading, the dispatching strategies of the MMGS generate greater costs and carbon emissions. Although the introduction of carbon trading generates a slightly higher cost, it significantly reduces carbon emissions. The results suggest that involving energy interaction and carbon trading in the dispatching of an MMGS is an effective way to improve the efficiency and lower the carbon emissions of the system. The detailed data of the experiment are shown in Table 6, which gives the energy-interaction costs with external networks (distribution network and gas network), energy-interaction costs among microgrids, device-dispatching costs, carbon-trading costs, and carbon emissions of the four microgrids.
Compared to Case 2, the energy-interaction cost of Case 4 is significantly changed. The energy-purchase costs of the power-deficit Microgrids 1 and 2 decrease by USD 428.5167 and 392.7376, respectively. Simultaneously, the energy-interaction costs between the two microgrids increase by USD 250.142 and USD 246.2674, respectively. Accordingly, the energy-sold revenues due to the power surplus in Microgrids 3 and 4 decrease by USD 212.4599 and USD 254.3293, respectively. The energy-interaction revenues between the two microgrids increase by USD 219.9794 and USD 277.4536, respectively. The total cost of the MMGS decreases by USD 661.8415. The comparison between Case 3 and Case 1 also shows similar results. This is because the power interaction among microgrids provides an additional energy interaction avenue for the microgrids. As the interaction price is between the purchased and sold prices from the distribution network, the microgrid with surplus electricity can sell electricity with a higher price while the microgrid with power shortage can purchase power with a lower price. Each microgrid is able to change its energy-exchanging strategy; this method favors power interaction among microgrids as it reduces the energy-purchase cost and increases the energy-sold revenue. Eventually, the total cost of the MMGS can be lower.
Comparing the MMGS dispatching results before and after considering the carbon-trading mechanism, it can be observed that due to the introduction of the carbon trading in Cases 2 and 4, the total dispatching cost of each microgrid increases compared to that of Cases 1 and 3. The total cost of the MMGS increases by USD 458.2795 and USD 76.5478, respectively. However, the carbon emissions of most microgrids are decreased. The total carbon emission of the MMGS decreases by 3641.78 kg and 752.78 kg, respectively. As purchasing electricity from the distribution network and the output of gas units both generate carbon emissions, the consideration of the carbon costs of the microgrids would increase their total dispatching costs. However, after the introduction of the carbon-trading mechanism, the microgrids prefer using relatively low-carbon gas units and carbon-free wind power to meet load demands over purchasing electricity from the distribution network. The microgrids are able to strategically choose energy-supply methods to obtain low costs and achieve the reduction in carbon emissions. This illustrates the effectiveness of the carbon-trading mechanism in guiding MMGSs to reduce their carbon emissions.

5.4.2. Analysis of Power Interaction among Microgrids

Figure 11 shows the results of the electricity interaction of each microgrid in Case 4. The positive step curve “MG1-MG2” in the figure indicates that Microgrid 1 buys electricity from Microgrid 2, while the negative one indicates that Microgrid 1 sells electricity to Microgrid 2.
As can be observed from Figure 11, the amount of electricity exchanged among microgrids is low during the periods of 01:00–06:00 and 23:00–24:00. This is because the loads of all four microgrids are at low levels during these periods. Wind power is able to meet their individual load demand, and they do not require a large amount of energy interaction with the other microgrids. In other periods, the load demands of Microgrids 1 and 2 increase, resulting in the wind power in the microgrids not being sufficient to balance the loads. At the same time, the wind power of Microgrids 3 and 4 is surplus; they have more than enough power to meet their own load demand. As a result, there is a large amount of energy interaction between Microgrids 1 and 2 and Microgrids 3 and 4.

6. Conclusions

In order to ensure efficient low-carbon dispatching in the power system, a data-driven wind-power uncertainty-set-based low-carbon optimization dispatching model considering wind-power uncertainty for MMGSs is presented here. The main conclusions drawn from the case studies are as follows:
  • Synthesized wind-power samples can be generated to enrich the number of samples using CGAN. Then, based on the meteorological classification, the grouped ambiguity sets are constructed, and the wind-power uncertainty intervals can be obtained. Compared to the interval estimation model without sample generation and meteorological classification, this method can reduce the width of the uncertain intervals, which improves the accuracy of the wind-power description.
  • An ARO model based on the improved wind-power uncertainty intervals is further constructed. Compared to the traditional uncertainty optimization methods, the presented ARO model can improve wind-power consumption by decreasing the deviation between the real wind power and the uncertainty intervals. Therefore, based on the dispatching optimization of the ARO model, the efficiency can be improved and carbon emissions can be reduced.
  • Additionally, a low-carbon dispatching strategy considering power interaction among microgrids is further presented. This strategy can guarantee the benefits of each microgrid while reducing the carbon emissions as a result of microgrid dispatching.
In summary, based on existing studies, this paper provides an improvement on the construction of the uncertainty set of the traditional ARO. It avoids the drawback that an SO encounters difficulty in precisely obtaining the probability distribution of variables. The issue that the decision results based on RO are frequently overly conservative is also mitigated. In addition, historical data are employed to provide scientific data support for the construction of the uncertainty set of the ARO. Importantly, we leverage a meteorological clustering model and a GAN-based synthesized data-generation technique to improve the description accuracy of the uncertainty set.
Considering the strong correlation between electricity and carbon emissions, the MMGS low-carbon economic dispatching strategy will be further studied in terms of reductions resulting from carbon trading. In view of the need for a higher solution speed for the expansion of MMGSs, we will investigate more efficient solution methods in future work.

Author Contributions

Conceptualization, Y.L. (Yang Liu) and X.L.; methodology, X.L., Y.L. (Yang Liu) and Y.L. (Yamei Liu); validation, X.L. and Y.L. (Yang Liu); formal analysis, X.L., Y.L. (Yang Liu) and Y.L. (Yamei Liu); writing—original draft preparation, X.L.; writing—review and editing, X.L., Y.L. (Yang Liu) and Y.L. (Yamei Liu); supervision, Y.L. (Yang Liu). All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

At first: the original “min–max–min” problem is decomposed into a “min” master problem (MP) and a “max–min” sub problem (SP), which can be represented by Equation (A1) and Equation (A2), respectively.
min x { c T x + ϕ } s . t . ϕ d T y + e T u A x = g , B x h C x + D y = r , E x + F y s G y u
max u min y ( d T y + e T u ) s . t . C x + D y = r , E x + F y s G y u
Here, ϕ represents the auxiliary variable.
The SP with the “max–min” structure cannot be solved directly. Therefore, the duality theory is applied to derive the SP as a single-layer “max” optimization problem. The derived SP is shown in Equation (A3).
max u , α , β , γ u T ξ + r T α x T C T α + s T β x T E T β s . t . D T α + F T β + G T γ = d β 0 , γ 0 , ξ = e + γ
Here, α , β , and γ represent the dual variables; ξ represents the auxiliary variable.
Due to the bilinear terms u T ξ in the above SP model, the SP needs to be further transformed. The Big-M method is employed to linearize the bilinear terms u T ξ . The final model of the SP can be described by Equation (A4).
max u , α , β , γ u up ξ + + u dw ξ + u pre 1 ξ + ξ + r T α x T C T α + s T β x T E T β s . t . D T α + F T β + G T γ = d β 0 , γ 0 , ξ = e + γ μ t + + μ t 1 , t = 1 T μ t + + μ t Γ M 1 μ t + + ξ t ξ t + M 1 μ t + + ξ t M 1 μ t + ξ t ξ t M 1 μ t + ξ t M μ t + ξ t + M μ t + , M μ t ξ t M μ t
Here, u up , u dw , and u pre represent the upper boundary value, lower boundary value, and predicted value of the uncertain parameters, respectively. ξ + and ξ represent the positive and negative values of ξ , respectively. μ t + and μ t represent auxiliary 0–1 variables.
Thus far, the original two-stage ARO model has been decomposed and transformed into the MP shown in Equation (A1) and the SP shown in Equation (A4). Ultimately, the MP and SP are iterated alternately to achieve the optimal economic dispatch.

References

  1. Liu, X. Research on bidding strategy of virtual power plant considering carbon-electricity integrated market mechanism. Int. J. Electr. Power Energy Syst. 2022, 137, 107891. [Google Scholar] [CrossRef]
  2. Shayan, M.E.; Najafi, G.; Ghobadian, B.; Gorjian, S.; Mazlan, M. Sustainable Design of a Near-Zero-Emissions Building Assisted by a Smart Hybrid Renewable Microgrid. Int. J. Renew. Energy Dev. 2022, 11, 471–480. [Google Scholar] [CrossRef]
  3. Zhang, L.; Liu, D.; Cai, G.; Lyu, L.; Koh, L.H.; Wang, T. An optimal dispatch model for virtual power plant that incorporates carbon trading and green certificate trading. Int. J. Electr. Power Energy Syst. 2023, 144, 108558. [Google Scholar] [CrossRef]
  4. Shayan, M.E.; Najafi, G.; Ghobadian, B.; Gorjian, S.; Mazlan, M. A novel approach of synchronization of the sustainable grid with an intelligent local hybrid renewable energy control. Int. J. Energy Environ. Eng. 2023, 14, 35–46. [Google Scholar] [CrossRef]
  5. Bauer, R.; Mühlpfordt, T.; Ludwig, N.; Hagenmeyer, V. Analytical uncertainty propagation for multi-period stochastic optimal power flow. Sustain. Energy Grids Netw. 2023, 33, 100969. [Google Scholar] [CrossRef]
  6. Gupta, N.; Prusty, B.R. Probabilistic Load Flow of an Islanded Microgrid with WTGS and PV Uncertainties Containing Electric Vehicle Charging Loads. Int. Trans. Electr. Energy Syst. 2022, 2022, 9569224. [Google Scholar] [CrossRef]
  7. Wei, C.; Shen, Z.; Xiao, D.; Wang, L.; Bai, X.; Chen, H. An optimal scheduling strategy for peer-to-peer trading in interconnected microgrids based on RO and Nash bargaining. Appl. Energy 2021, 295, 117024. [Google Scholar] [CrossRef]
  8. Xu, A.; Yang, T.; Ji, J.; Gao, Y.; Gu, C. Application of cluster analysis in short-term wind power forecasting model. J. Eng. 2019, 2019, 5423–5426. [Google Scholar] [CrossRef]
  9. Shayan, M.E.; Najafi, G.; Ghobadian, B.; Gorjian, S.; Mamat, R.; Ghazali, M.F. Multi-microgrid optimization and energy management under boost voltage converter with Markov prediction chain and dynamic decision algorithm. Renew. Energy 2022, 201, 179–189. [Google Scholar] [CrossRef]
  10. Li, Y.; Zou, Y.; Tan, Y.; Cao, Y.; Liu, X.; Shahidehpour, M.; Tian, S.; Bu, F. Optimal Stochastic Operation of Integrated Low-Carbon Electric Power, Natural Gas, and Heat Delivery System. IEEE Trans. Sustain. Energy 2018, 9, 273–283. [Google Scholar] [CrossRef]
  11. Wu, J.; Liu, Y.; Chen, X.; Wang, C.; Li, W. Data-driven adjustable robust Day-ahead economic dispatch strategy considering uncertainties of wind power generation and electric vehicles. Int. J. Electr. Power Energy Syst. 2022, 138, 107898. [Google Scholar] [CrossRef]
  12. Chen, S.; Wei, Z.; Sun, G.; Cheung, K.W.; Wang, D.; Zang, H. Adaptive Robust Day-Ahead Dispatch for Urban Energy Systems. IEEE Trans. Ind. Electron. 2019, 66, 1379–1390. [Google Scholar] [CrossRef]
  13. Wang, Y.; Tang, L.; Yang, Y.; Sun, W.; Zhao, H. A stochastic-robust coordinated optimization model for CCHP micro-grid considering multi-energy operation and power trading with electricity markets under uncertainties. Energy 2020, 198, 117273. [Google Scholar] [CrossRef]
  14. Zhai, J.; Jiang, Y.; Li, J.; Jones, C.N.; Zhang, X.-P. Distributed adjustable robust optimal power-gas flow considering wind power uncertainty. Int. J. Electr. Power Energy Syst. 2022, 139, 107963. [Google Scholar] [CrossRef]
  15. Hou, W.; Wei, H.; Zhu, R. Data-driven multi-time scale robust scheduling framework of hydrothermal power system considering cascade hydropower station and wind penetration. IET Gener. Transm. Distrib. 2019, 13, 896–904. [Google Scholar] [CrossRef]
  16. Ning, C.; You, F. Data-Driven Adaptive Robust Unit Commitment Under Wind Power Uncertainty: A Bayesian Nonparametric Approach. IEEE Trans. Power Syst. 2019, 34, 2409–2418. [Google Scholar] [CrossRef]
  17. Wang, Y.; Yang, Y.; Fei, H.; Song, M.; Jia, M. Wasserstein and multivariate linear affine based distributionally robust optimization for CCHP-P2G scheduling considering multiple uncertainties. Appl. Energy 2022, 306, 118034. [Google Scholar] [CrossRef]
  18. Jiang, C.; Mao, Y.; Chai, Y.; Yu, M.; Tao, S. Scenario Generation for Wind Power Using Improved Generative Adversarial Networks. IEEE Access 2018, 6, 62193–62203. [Google Scholar] [CrossRef]
  19. Ning, C.; You, F. Deep Learning Based Distributionally Robust Joint Chance Constrained Economic Dispatch Under Wind Power Uncertainty. IEEE Trans. Power Syst. 2022, 37, 191–203. [Google Scholar] [CrossRef]
  20. Li, D.; Yan, W.; Li, W.; Ren, Z. A Two-Tier Wind Power Time Series Model Considering Day-to-Day Weather Transition and Intraday Wind Power Fluctuations. IEEE Trans. Power Syst. 2016, 31, 4330–4339. [Google Scholar] [CrossRef]
  21. Qin, L.; Xiong, Y.; Liu, K. Weather division-based wind power forecasting model with feature selection. IET Renew. Power Gener. 2019, 13, 3050–3060. [Google Scholar] [CrossRef]
  22. Zhang, Y.; Ai, Q.; Wang, H.; Li, Z.; Huang, K. Bi-level distributed day-ahead schedule for islanded multi-microgrids in a carbon trading market. Electr. Power Syst. Res. 2020, 186, 106412. [Google Scholar] [CrossRef]
  23. Wang, H.; Wang, C.; Zhao, L.; Ji, X.; Yang, C.; Wang, J. Multi-Micro-Grid Main Body Electric Heating Double-Layer Sharing Strategy Based on Nash Game. Electronics 2023, 12, 214. [Google Scholar] [CrossRef]
  24. Yang, P.; Jiang, H.; Liu, C.; Kang, L.; Wang, C. Coordinated optimization scheduling operation of integrated energy system considering demand response and carbon trading mechanism. Int. J. Electr. Power Energy Syst. 2023, 147, 108902. [Google Scholar] [CrossRef]
  25. Guha, S.; Rastogi, R.; Shim, K. Cure: An efficient clustering algorithm for large databases. Inf. Syst. 2001, 26, 35–58. [Google Scholar] [CrossRef]
  26. Keras: The Python Deep Learning API. Available online: https://keras.io/ (accessed on 12 May 2023).
Figure 1. Principle framework of the proposed data-driven model.
Figure 1. Principle framework of the proposed data-driven model.
Sensors 23 05350 g001
Figure 2. Basic structure of the CGAN model.
Figure 2. Basic structure of the CGAN model.
Sensors 23 05350 g002
Figure 3. Structure diagram of the multi-microgrid system.
Figure 3. Structure diagram of the multi-microgrid system.
Sensors 23 05350 g003
Figure 4. Load curves of each microgrid. (a) Electric load curves; (b) thermal load curves.
Figure 4. Load curves of each microgrid. (a) Electric load curves; (b) thermal load curves.
Sensors 23 05350 g004
Figure 5. Comparison of the results of the wind-power interval estimation.
Figure 5. Comparison of the results of the wind-power interval estimation.
Sensors 23 05350 g005
Figure 6. PDF of the real samples and the generated synthesized samples.
Figure 6. PDF of the real samples and the generated synthesized samples.
Sensors 23 05350 g006
Figure 7. Comparison of uncertainty intervals for different sample sizes.
Figure 7. Comparison of uncertainty intervals for different sample sizes.
Sensors 23 05350 g007
Figure 8. Relationship between sample quantity, operation costs, and carbon emissions.
Figure 8. Relationship between sample quantity, operation costs, and carbon emissions.
Sensors 23 05350 g008
Figure 9. Comparison of dispatching results with different optimization methods.
Figure 9. Comparison of dispatching results with different optimization methods.
Sensors 23 05350 g009
Figure 10. Comparison of four different dispatching cases of the MMGS.
Figure 10. Comparison of four different dispatching cases of the MMGS.
Sensors 23 05350 g010
Figure 11. Optimization results of power interaction among MMGSs.
Figure 11. Optimization results of power interaction among MMGSs.
Sensors 23 05350 g011
Table 1. Device parameters of microgrids.
Table 1. Device parameters of microgrids.
ParameterValueUnitParameterValueUnit
P Grid max 800kW P i j max 400kW
P GT min / P GT max 50/400kW P GB min / P GB max 0/400kW
P EB min / P EB max 0/400kW R GT min / R GT max 6.67/6.67kW·h−1
η GT 0.35- η WH 0.83-
η HE 0.8- η GB 0.9-
η EB 0.99- H ng 9.7kW/m3
l C 200kg ρ 0.25-
Table 2. Operation cost coefficient of microgrids.
Table 2. Operation cost coefficient of microgrids.
ParameterValueUnitParameterValueUnit
τ CO 2 0.03664USD/kg τ GT up / τ GT dw 0.03344USD/kW
τ GB up / τ GB dw 0.01599USD/kW τ EB up / τ EB dw 0.01599USD/kW
τ loss 0.0756USD/kW τ gas 0.5089USD/m3
Table 3. Electricity price of microgrids.
Table 3. Electricity price of microgrids.
Time PeriodDay-Ahead StageReal-Time Stage
Purchased Price (USD/kW)Sold Price (USD/kW)Purchased Price (USD/kW)Sold Price (USD/kW)
(12:00–14:00, 19:00–22:00)0.13090.065430.26170.03271
(08:00–11:00, 15:00–18:00)0.079960.039980.15990.02006
(23:00–07:00)0.026170.013090.052340.006543
Table 4. Comparison of the calculation time of different optimization methods.
Table 4. Comparison of the calculation time of different optimization methods.
Optimization MethodTraditional ROTraditional AROData-Driven ARO
Time/s4.33121.36108.94
Table 5. The settings of different dispatching cases.
Table 5. The settings of different dispatching cases.
CaseEnergy Interaction among MicrogridsCarbon Trading
1××
2×
3×
4
Table 6. Details of the comparison of four different dispatching cases of the four microgrids.
Table 6. Details of the comparison of four different dispatching cases of the four microgrids.
MGCaseEnergy-Interaction Costs with External
Networks (USD)
Energy-Interaction Costs among Microgrids (USD)Device
Dispatching
Costs (USD)
Carbon
Trading
Costs (USD)
Carbon
Emissions
(kg)
MG111041.9549-24.9475-6628.06
21102.6087-30.7238127.1454866.11
3659.1139257.562725.08995-3216.09
4674.09201250.14222.82337.32773080.96
MG211543.4791-28.6927-8069.76
21568.3277-39.4603253.64747222.47
31155.2733254.868728.6927-4498.05
41175.5901246.267439.874740.30654311.03
MG31−11.2314-34.2466-464.71
2−11.7853-38.5676−29.3412334.06
3200.99−220.27630.4563-784.87
4200.6745−219.97830.1524−12.9717780.85
MG41−40.3239-24.1406-1204.60
2−27.09633-39.8659−27.9585302.70
3233.3495−292.0361723.5328-1385.80
4227.2329−277.453632.9904−3.9066959.20
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Liu, Y.; Li, X.; Liu, Y. A Low-Carbon and Economic Dispatch Strategy for a Multi-Microgrid Based on a Meteorological Classification to Handle the Uncertainty of Wind Power. Sensors 2023, 23, 5350. https://doi.org/10.3390/s23115350

AMA Style

Liu Y, Li X, Liu Y. A Low-Carbon and Economic Dispatch Strategy for a Multi-Microgrid Based on a Meteorological Classification to Handle the Uncertainty of Wind Power. Sensors. 2023; 23(11):5350. https://doi.org/10.3390/s23115350

Chicago/Turabian Style

Liu, Yang, Xueling Li, and Yamei Liu. 2023. "A Low-Carbon and Economic Dispatch Strategy for a Multi-Microgrid Based on a Meteorological Classification to Handle the Uncertainty of Wind Power" Sensors 23, no. 11: 5350. https://doi.org/10.3390/s23115350

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop