Next Article in Journal
Optimization of a Power Line Communication System to Manage Electric Vehicle Charging Stations in a Smart Grid
Next Article in Special Issue
Design and Analysis of Flexible Multi-Microgrid Interconnection Scheme for Mitigating Power Fluctuation and Optimizing Storage Capacity
Previous Article in Journal
High Efficiency Solar Power Generation with Improved Discontinuous Pulse Width Modulation (DPWM) Overmodulation Algorithms
Previous Article in Special Issue
Practical Analysis and Design of a Battery Management System for a Grid-Connected DC Microgrid for the Reduction of the Tariff Cost and Battery Life Maximization
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Optimal Operational Scheduling of Reconfigurable Multi-Microgrids Considering Energy Storage Systems

by
Saeid Esmaeili
1,
Amjad Anvari-Moghaddam
2,* and
Shahram Jadid
1
1
Department of Electrical Engineering, Iran University of Science and Technology, 16846-13114 Tehran, Iran
2
Department of Energy Technology, Aalborg University, 9220 Aalborg East, Denmark
*
Author to whom correspondence should be addressed.
Energies 2019, 12(9), 1766; https://doi.org/10.3390/en12091766
Submission received: 20 March 2019 / Revised: 11 April 2019 / Accepted: 4 May 2019 / Published: 9 May 2019
(This article belongs to the Special Issue Energy Storage Applications for Hybrid DC/AC Microgrids)

Abstract

:
This paper proposes an optimal operational scheduling of a reconfigurable multi-microgrid (MG) distribution system complemented by demand response programs and Energy Storage Systems (ESSs) in an uncertain environment. Since there is a set of competing players with inherently conflicting objectives in the system under study such as the Distribution System Operator (DSO) and MG owners, a one-leader multi-follower-type bi-level optimization model is proposed. In this framework, the upper-level player as a leader minimizes the total cost from DSO’s point of view, while the lower-level players as multi-followers maximize the profit of MG owners. Since the resulting model is a non-linear bi-level optimization problem, it is transformed into a single-level mixed-integer second-order cone programming problem through Karush–Kuhn–Tucker conditions. The satisfactory performance of the proposed model is investigated on a real-test system under different scenarios and working conditions.

1. Introduction

Recently, due to the energy crisis and environmental deteriorations, the penetration level of Distributed Energy Resources (DERs) including Energy Storage Systems (ESSs), dispatchable and renewable energy sources in distribution sector has been increased significantly. This growing tendency has led to defining the Microgrid (MG) concept as a promising solution to the optimal use of energy resources [1]. Moreover, it mitigates the monitoring and management burden for the Distribution System Operator (DSO) and increases the operational flexibility of the system in the modified decision-making environment of sustainable energy systems [2]. Specifically, a MG is a cluster of loads and DERs which can be operated in both grid-connected and islanded modes [3]. Different aspects related to the application of MGs in distribution systems regarding the analysis and optimization of energy processes including optimal planning [4], operational scheduling [5] and system reliability [6] were thoroughly investigated in the literature. In Reference [7], DSO, who has the responsibility of operating the distribution system in an optimal fashion, determines day-ahead scheduling of DERs using particle swarm optimization (PSO) algorithm. In Reference [8], a two-phase optimal short-term operational scheduling of utility-owned DERs in an active distribution system has been proposed. In the first phase, to determine the amount of purchased power from the wholesale market and the set-points of DERs, a day-ahead energy acquisition model has been developed, where in the second-phase hourly network reconfiguration has been implemented. A day-ahead scheduling method in distribution system considering Demand Response (DR) programs has been proposed in Reference [9]. To minimize the total operating cost and pollutants emission (as defined objectives), the augmented ε-constraint method is utilized by the DSO.
In References [6,7,8,9] the decision authority is only devoted to the DSO to schedule DERs through a Distribution Management System (DMS) framework. However, with MG implementation, DSO and MG Owners (MGOs) may have conflicting objectives in making decisions. Thus, it is required to establish a comprehensive decision-making model to meet the conflicting objectives desired by different stakeholders. In Reference [10], the day-ahead scheduling of DSO and MGs as the self-governing systems was modelled by the bi-level system of systems framework. At the first step, the problem is solved for MGs and then it is solved for the DSO in an iterative process. Although an appropriate framework has been proposed, the optimization problem is not modelled simultaneously for DSO and MGs. Authors of [11] propose a bi-level DSO-MGs model for optimal operation of the system. The upper-level optimization problem determines the optimal dispatch of distribution system to achieve minimum power loss and voltage deviation, where the lower-level problem takes minimum MGs’ operating cost as the objective. Likewise, to minimize carbon emissions, a game between DSO and MG to obtain operational equilibrium strategies is established in Reference [12]. However, the interactions between the two levels have not been implemented in models presented in References [11,12]. In Reference [13], a bi-level methodology to develop the interaction between electric vehicles and DSO considering load demand and wind power uncertainties has been provided. The main drawback of [13] is that each level (DSO and parking lots) has been modelled as a single bus system without considering the constraints of the network. The operational planning of the multi-MG distribution system with local exchanged power has been proposed in References [14,15,16]. The optimal scheduling model in Reference [14] is solved using a classical optimization strategy, while metaheuristic algorithms are applied for problem solving in References [15,16]. The major drawback of [14,15,16] is devotion of the decision authority to the MGOs without considering the interactions between DSO and each MG, which is addressed in Reference [17]. Bahramara et al. [18] propose a bi-level optimization algorithm, which models the hierarchical decision-making environment of distribution system, where DSO and multi-MGs optimize their respective objectives in a cooperative manner. The resulting bi-level optimization problem is then transformed into a single-level problem through the Karush–Kuhn–Tucker (KKT) optimality conditions. Likewise, in Reference [19], a multi follower bi-level model for optimal decision making of DSO and multi-MGs is presented. In the upper-level problem, the total operation cost is minimized, while in the lower-level problem the profit of each MG is maximized. In Reference [20], a Stackelberg game between a utility company and multiple users aimed at balancing supply and demand is formulated. A one-leader, N-follower Stackelberg game-based DR algorithm is proposed in Reference [21] to capture the interactions between virtual retailer and Responsive Loads (RLs). In addition to the mentioned drawbacks, each level in the proposed leader-follower frameworks [17,18,19,20,21] has also been modelled as a single bus system without considering the constraints of the network. Besides, the financial interactions between these two levels are not modelled precisely as independent entities. Moreover, none of the reviewed literature considers the reconfigurable topology of the distribution systems.
Recently, by introducing Remotely Controlled Switches (RCSs), hourly reconfiguration can be implemented for short-term day-ahead scheduling of distribution systems [22,23]. In Reference [24], by using hybrid PSO approach, the optimal day-ahead scheduling of RCSs and DERs is proposed in order to minimize the cost function including the cost related to the power losses and switching. Likewise, Anand, et al. [25] solves a simultaneous day-ahead scheduling and hourly reconfiguration problem in distribution systems. In the same subject area, a stochastic optimal operational scheduling of reconfigurable multi-MGs in presence of renewable energy resources is presented in Reference [26] to maximize the total profits.
To the best of our knowledge, none of the reviewed literature provides a bi-level optimization scheduling for decision making of DSO and reconfigurable multi-MGs. In the lights of foregoing discussions, in this paper the stochastic one-leader multi-follower-type bi-level model is proposed to embody Distribution System Operator-Microgrid Operators (DSO-MGOs) gaming strategy. In this model, for the upper-level optimization problem, the total cost of the system, including the costs related to power losses, switching actions, exchanged power with wholesale market and exchanged power between DSO and MGs is minimized from DSO’s point of view. In the lower-level optimization problem, the profit of each MGO is maximized. To this end, the difference between revenues and costs related to DERs, RLs, consumed power by each MG, exchanged power among MGs and exchanged power between DSO and MGs is maximized. The amount of exchanged power between DSO and each MGO is considered as a mutual decision variable which links the two optimization levels to each other. Since the resulting model is a non-linear bi-level optimization problem, it is then transformed into a single-level Mixed-Integer Second-Order Cone Programming (MISOCP) problem through KKT optimality conditions and linearization techniques. To verify that each final solution resulted from the transformed single-level MISOCP problem is a Nash equilibrium, a single-iteration diagonalization technique is implemented.
In brief, the major contributions of this paper are highlighted as follows:
  • A one-leader multi-follower-type bi-level model considering ESSs in an uncertain environment is proposed,
  • An optimal day-ahead scheduling of multi-MG distribution systems is proposed considering DR and hourly reconfiguration actions,
  • Modelling the DSO’s decision-making problem which is affected not only by the exchanged power between DSO and each MG as a mutual decision variable but also by the reactions of interconnected MGs in an hourly reconfigurable environment.
The remainder of the paper is organized as follows: In Section 2, the conceptual framework of the proposed DMS is explained. The bi-level formulation of the optimization problem is proposed in Section 3. Case study and simulation results are discussed in Section 4. Finally, Section 5 summarizes the contribution of the paper.

2. Conceptual Framework of the Proposed DMS

In this study, it is assumed that MGs have their own private owners who seek profit maximization, while DSO utilizes the DMS software to minimize the total cost of the distribution system. Thus, DSO and MGs have their own inherently conflicting objectives in optimal scheduling of energy-related generation and consumption units, which can be modelled as a bi-level optimization problem. Figure 1 shows the framework of the proposed bi-level model in the form of a one-leader multi-follower structure for DMS. The leader (which plays at the upper-level in our proposed DMS) is DSO who is responsible for minimizing the total operating costs, whereas the followers (act in the lower-level of the proposed DMS) are MGOs aiming to maximize their own profit. DSO is connected to the upstream utility grid and interacts with networked MGs, while MGOs not only feed the local demand but also exchange energy with each other to make more profit. Thus, the exchanged powers between DSO and multi-MGs are considered as coupling variables between these levels, which enforce decision maker to consider a multi-criteria action plan. It can be seen that DMS receives the network model, retail prices, cost function of DERs, RLs bilateral contracts and forecasted data of load profile, PVs output power and the wholesale market prices as input data. Finally, proposed bi-level DMS returns the optimal amount of exchanged power among MGs, exchanged power between DSO and MGs, Micro Turbines (MTs) and ESSs dispatches, RLs participations, wholesale market purchases and RCSs status during each time interval. Changing the status of RCSs in short-term results in a reconfigurable topology of distribution system, which represents a flexible multi-MG distribution system.

Uncertainty Modelling

In the proposed DMS, there are some uncertain parameters such as solar irradiance, wholesale market price and electrical load demand. To study the uncertainty nature of these input data, a stochastic scenario-based method using the mean values (i.e., day-ahead prediction) with different probability density functions is implemented. The scenario generation process is done by Monte-Carlo simulation on predicted mean values while forecasting errors are considered within appropriate probability density functions through associated standard deviations (STDs). The total number of generated scenarios can be calculated by (1) considering constraint (2).
N s = N W M × N P V × N L
s = 1 N s ( π s W M × π s P V × π s L ) = 1
Due to the computational burden limits of the optimization process, a scenario reduction algorithm based on Kantorovich distance [27] method is also incorporated to decrease the number of generated scenarios into a smaller set representing well enough the uncertainties.

3. Bi-Level Formulation of the Optimization Problem

Problem formulation of the bi-level model for operational scheduling of the examined multi-MG distribution system and related solution methodology are described in the following subsections.

3.1. Upper-Level: DSO

The objective function of the upper-level is defined as:
O F D S O = M i n [ S W M = 1 N W M π s W M ( t = 1 24 ( C t l o s s + C t S W + C t W M + C t M G 2 D S O ) ) ]  
As can be seen, the objective function of the upper-level aims at minimizing the total cost from DSO’s point of view, which includes different cost terms. The first term denotes the cost of power losses as proposed in (4).
C t l o s s = ρ l o s s P t l o s s
where, the amount of active power losses P t l o s s can be calculated by (16). The second term which is represented by (5) denotes the switching cost of RCSs.
C t S W = ρ S W s w = 1 N s w | X s w , t , s X s w , t 1 , s |
The absolute value in (5) can be avoided by introducing new auxiliary variables as follows:
X s w , t , s X s w , t 1 , s = Z s w , t Z s w , t = Z s w , t + Z s w , t | Z s w , t | = Z s w , t + + Z s w , t Z s w , t + , Z s w , t = 0 , 1
The third term in (3) calculates the cost of purchasing/selling active power from/to day-ahead wholesale market at time t.
C t W M = ρ t W M ( P t , s W M 2 D S O - P t , s D S O 2 W M )
Finally, the last term stated in (3) denotes the cost of exchanging power between DSO and MGs represented by (8).
C t M G 2 D S O = ρ t W M p = 1 N M G ( P t , s M G p 2 D S O P t , s D S O 2 M G p )
Constraints:
The upper-level objective function is subjected to the following constraints.
  • Distribution power flow equations:
The generic form of the branch flow model deals with the currents and powers flowing through the branches is as follows:
V i , t , s V j , t , s = Z i j I i j , t , s       ( i , j ) b r
S i j , t , s = V i , t , s I i j , t , s       ( i , j ) b r
( i , j ) b r S i j , t , s ( k , i ) b r ( S k i , t , s z k i | I k i , t , s | 2 ) + y i | V i , t , s | 2 = S i , t , s       i = 1 , 2 , , , N b u s
where, (9) represents the Ohm’s law, (10) defines the branch power flow and (11) states the power balance constraint at each bus. By defining new variables i j , t , s = | I i j , t , s | 2 and ν i , t , s = | V i , t , s | 2 as the squared current and voltage magnitudes, respectively and neglecting the phase angles of currents and voltages, the branch flow model is derived as follows:
P i , t , s = ( i , j ) b r P i j , t , s ( k , i ) b r ( P k i , t , s r k i k i , t , s ) + g i ν i , t , s       i = 1 , 2 , , , N b u s
Q i , t , s = ( i , j ) b r Q i j , t , s ( k , i ) b r ( Q k i , t , s x k i k i , t , s ) + b i ν i , t , s       i = 1 , 2 , , , N b u s
ν j , t , s = ν i , t , s 2 ( r i j P i j , t , s + x i j Q i j , t , s ) + ( r i j 2 + x i j 2 ) i j , t , s       ( i , j ) b r
i j , t , s = P i j , t , s 2 + Q i j , t , s 2 ν i , t , s       ( i , j ) b r
The amount of active power losses is calculated as:
P t l o s s = ( i , j ) b r r i j i j , t
  • Voltage limits constraints:
    V min 2 ν i , t , s V max 2   ,   ν s l a c k = 1
  • Exchanged power limit with the wholesale market:
    P t , s W M 2 D S O P max W M 2 D S O
  • Line current limits:
At any time and working conditions, the loading level of the lines/feeders should be in an allowed range.
i j , t , s I max 2       ( i , j ) b r
  • Network radiality:
To preserve the radial configuration of the distribution network at each optimization interval, constraints (20)–(23) should be met.
N b r , t = N b u s , t 1
β i j + β j i = X b r
β 0 j = 0   , j N ( 0 )
j N ( i ) β i j = 1
Equation (20) indicates that the resulted configuration at each hour should be without any loop in the equivalent tree graph. In case that bus j is the parent of bus i ( β i j = 1 ) or bus i is the parent of bus j ( β j i = 1 ), according to (21) the respective branch is in the spanning tree ( X b r = 1 ). In order to avoid islanded buses in the final topology, (22)–(23) state that except the substation bus, all the buses should have one parent.
  • Number of switching actions:
    t = 1 24 | X s w , t , s X s w , t 1 , s | N max S W   ,   s w = 1 , 2 , , N s w
The above nonlinear constraint can be linearized using auxiliary variables as proposed in (6).
  • Exchanged power limit between MGs and DSO:
    P min M G 2 D S O P t , s M G p 2 D S O P max M G 2 D S O
    P min D S O 2 M G P t , s D S O 2 M G p P max D S O 2 M G

3.2. Lower-Level: Multi-MGs

The objective function of the lower-level part aims to maximize the profit of pth MG considering seven different terms.
OF MGp = Max ( S P V = 1 N P V π s P V S L = 1 N L π s L t = 1 24 ( Income t , s MGp Cos t t , s MGp ) ) = Max ( S P V N P V π s P V S L = 1 N L π s L t = 1 24 ( Pr p , t , s L + Pr t , s MGp 2 DSO + Pr t , s MGp 2 MGq + Pr p , t , s MT   + Pr p , t , s PV + Pr p , t , s ESS + Pr p , t , s DR ) )
Profit terms of the above objective function are defined as follows:
Pr p , t , s L = ρ t L M i ψ p ( P i , t , s L )
Pr t , s MGp 2 DSO = ρ t L M ( P t , s M G p 2 D S O P t , s D S O 2 M G p )
Pr t , s MGp 2 MGq = ρ t L M q = 1 , q p N M G ( P t , s M G p 2 M G q P t , s M G q 2 M G p )
Pr p , t , s MT = i ψ p ρ i M T P i , t , s M T
Pr p , t , s PV = i ψ p ρ i P V P i , t , s P V
Pr p , t , s E S S = i ψ p ρ i E S S ( P i , t , s d c h P i , t , s c h )
Pr p , t , s DR = i ψ p ξ = 1 ϕ ρ ξ , i , t D R h ξ , i , t , s
Constraints:
The constraints of the operational scheduling problem at the lower-level are as follows:
  • Operation limit of MT:
The operation limits of MTs are formulated in (35)–(41). Constraint (35) guarantees that the output power of the MTs are within the lower and upper limit. The ramp up/down rate constraints of MTs are stated by (36)–(37), while (38)–(41) consider the up/down time limits.
P min M T P i , t , s M T P max M T
P i , t , s M T P i , t 1 , s M T R i u p × U i , t M T
P i , t 1 , s M T P i , t , s M T R i d o w n × U i , t 1 M T
U i , t M T U i , t 1 M T U i , t + U p i , k M T
U i , t 1 M T U i , t M T 1 U i , t + D n i , k M T
U p i , k = { k k M U T i 0 k > M U T i }
D n i , k = { k k M D T i 0 k > M D T i }
  • Exchanged power limit with DSO:
    P min M G 2 D S O P t , s M G p 2 D S O P max M G 2 D S O
    P min D S O 2 M G P t , s D S O 2 M G p P max D S O 2 M G
  • Exchanged power limit between MGs:
    P min M G p 2 M G q P t , s M G p 2 M G q P max M G p 2 M G q
    P min M G 2 M G P t , s M G q 2 M G p P max M G 2 M G
  • Limits on operation of ESSs:
    P min E S S U i , t c h P i , t , s c h P max E S S U i , t c h
    P min E S S U i , t d c h P i , t , s d c h P max E S S U i , t d c h
    E min E i , t , s E max
    E i , t , s = E i , t 1 , s + η i c h P i , t , s c h P i , t , s d c h η i d c h , t 1
    E i , t , s = E i i n i t i a l   ,   t = 0
    U i , t c h + U i , t d c h 1
  • DR program limits:
In this paper, bid-quantity package offers including the amount of load curtailment and related requested prices are considered as the model of RLs. A typical bid-quantity package for the ith node is proposed in Figure 2 and formulated by (52)–(54).
H i , min h i , ξ H i , ξ ,   ξ = 1
0 h i , ξ ( H i , ξ + 1 - H i , ξ ) ,   ξ = 2 , 3 , , ϕ
P i D R = ξ = 1 ϕ h i , ξ
where, (52) and (53) state that the amount of accepted load curtailment for DR program in each step ( ξ   =   1 and ξ   =   2 ,   3 ,   ,   ϕ , respectively) should be controlled within an allowable range.
  • Power balance for pth MG:
    i ψ p ( P i , t , s P V + P i , t , s M T + P i , t , s d c h P i , t , s c h + P i , t , s D R ) + P t , s D S O 2 M G p P t , s M G p 2 D S O + q = 1 , q p N M G ( P t , s M G q 2 M G p P t , s M G p 2 M G q ) = i ψ p ( P i , t , s L + P i , t , s l o s s )

3.3. Solution Methodology

As formulated in previous section, Y = [ X s w , t   P t W M 2 D S O   P t D S O 2 W M   P t M G p 2 D S O   P t D S O 2 M G p ] and X = [ P t M G p 2 D S O   P t D S O 2 M G p   P t M G p 2 M G q   P t M G q 2 M G p   P i , t M T   Q i , t M T   P i , t c h   P i , t d c h   P i , t D R ] are DSO’s and MGOs’ decision variables, respectively. The amount of exchanged power between DSO and MGs plays an important role in the solution process, which couples the two levels through interactions among players. The proposed bi-level framework cannot be directly implemented in commercial solvers. To resolve this, by adding the KKT conditions of each follower problem, the lower-level problem (27)–(55) is converted into a single-level optimization problem. To solve the resulted single-level MISOCP problem by DSO, DSO has thorough knowledge of the required information pertaining to the MGs. Figure 3 briefly represents the decision-making process outlining the objectives, constraints of the bi-level problem and its transformation into a corresponding single-level MISOCP problem through KKT optimality conditions of the lower-level. The Lagrangian function and related derived KKT conditions of the lower-level problem can be calculated by (A1)–(A36) which are given in Appendix A. In this regard, the collection of non-equality constraints of the lower-level problem are rewritten as greater than or equal to zero constraints. Likewise, all equality constraints of the lower-level problem are rewritten as equal to zero constraints. Indeed, the resulted MISOCP problem is nonlinear because of the complimentary conditions from applying KKTs. To this end, the strong duality theorem is used in Appendix A to linearize the resulted MISOCP problem.

3.4. Verification of Nash Equilibrium

Generally speaking, a Nash equilibrium of a competitive system indicates that no player has incentive to change its decision. In order to verify that each final solution obtained from the transformed single-level MISOCP problem is a Nash equilibrium, a single-iteration diagonalization technique [28] is used. In this way, offered decision of other players are assumed to be constant which results to a single player problem. To this end, the multi-follower players in the proposed equilibrium problem are divided into N M G (the number of MGs) optimization problems. Optimization problem of each MG is solved with regard to the fixed decision strategies of the rival players (i.e., other MGs). This process is repeated for all of the players. If the decision strategies resulted by diagonalization technique are identical to those obtained by MISOCP problem (i.e., no rival has a profitable unilateral deviation), then the proposed final solution is a Nash equilibrium.

4. Test and Results

The bi-level formulation of the proposed model and the solution methodology were discussed in the previous sections. In this section, after introducing the test system, simulation results of the proposed bi-level day-ahead scheduling model are discussed.

4.1. Case study

In this paper, the 84-bus 11.4 kV Taiwan power company distribution system [29], as shown in Figure 4, is considered as the test system. This system has three MGs which are interconnected through 13 tie lines. Moreover, it includes 11 feeders and 20 sectionalizing switches. It is assumed that similar type and size of MTs, PVs and ESSs are utilized in MGs with a sitting layout illustrated in Figure 4. All characteristics of DERs and other values for technical parameters are depicted in Table 1 [29]. The predicted values for PV output powers can be extracted from [30]. The support areas of DR programs for the corresponding MGs and their bid-quantity offer packages [31] are provided in Table 2 and Table 3, respectively. The forecasted hourly load profile of each MG is shown in Figure 5a, while Figure 5b represents the forecasted Real Time Pricing (RTP) of the wholesale market and the retail market prices based on Time-of-Use (TOU) scheme [29].
As proposed in Reference [13], a seven-segment density function for a given normally distributed random variable with mean centred on zero and different STDs can be used to account for generated scenarios. Therefore, the same procedure is adopted for stochastic modelling of the output power of PV units, the wholesale market prices and the electrical load demand. The STD of the PV units’ power, the wholesale market prices and the electrical load demand forecast errors are assumed to be ±10%, ±4% and ±2% of their hourly forecasted values, respectively. The Monte-Carlo simulation is performed using MATLAB 2016a and the proposed MISOCP optimization problem is formulated using the General Algebraic Modeling System (GAMS) language and solved by the CPLEX (24.1.2, GAMS Development Corporation, Fairfax, NV, USA) [32] solver.

4.2. Simulation results

In order to investigate the satisfactory performance of the proposed model, the problem is addressed in three different case studies. In Case Study 1 (CS1), the interaction of MGs based on the hourly reconfiguration through RCSs is studied, while no interconnection among MGs is considered in Case Study 2 (CS2). In both CS1 and CS2, MGs are equipped with DR programs and ESSs facilities, where MGs in Case Study 3 (CS3) are not possess any of them. In order to deeply evaluate these case studies, three different scenarios are considered in each case. The proposed wholesale market and retail prices in Figure 5b are considered as scenario 1, where 10% increment and decrement in these prices are defined as scenario 2 and scenario 3, respectively. Table 4 summarizes the above CSs and scenarios.
The opened RCSs in reconfiguration process of multi-MG distribution system have been tailored in Table 5. By determining the proposed switching sequences at each hour, the optimal topology of the distribution system is resulted. As can be seen in all the final topologies in Table 5, the network radiality without any islanded buses is preserved, which meet constraints (20)–(23). Moreover, the maximum allowable number of switching actions constraint in the day, stated in (24), is met. Particularly, due to the excess power supply in MG1 and shortage power supply in MG3, RCS no. 84 has the most switching action among all the switches during the day. It is 5 times, which is less than the maximum allowable number of switching actions.
Hourly operation scheduling of the MTs, DR programs and ESSs in CS1 for the defined three scenarios in MG1, MG2 and MG3 are shown in Figure 6, Figure 7 and Figure 8, respectively. It can be seen that for scenario 2 in all three MGs, due to the increased retail and wholesale market prices, the amount of participated load in DR programs and MTs output power are increased. On the other hand, the amount of responsive loads and MTs output power are decreased in scenario 3.
As can be seen in Figure 6, Figure 7 and Figure 8, curtailable loads are participated in DR programs through the bid-quantity offer packages in peak load periods to flatten the demand curve. In all scenarios, ESSs tend to store power during the hours with low market prices and discharge (i.e., positive values in the figures) the stored power during the high market price periods. Figure 9a, shows the amount of exchanged power among MGs in different scenarios for CS1. Due to the low-load level condition and high penetration of MTs and PVs in MG1, for all scenarios, the power is transmitted from MG1 to MG2 and MG1 to MG3. The negative values represent the reverse power flow (e.g., negative power flow from MG2 to MG3 denotes a flow from MG3 to MG2). Due to the decrement of market prices in scenario 3, MG2 generates less power, thus, the transmitted power from MG1 to MG2 is increased by 6% compared to scenario 1. The amounts of exchanged power between DSO and MGs in different scenarios for CS1 to manage the excess or shortage of power supply in each MG are illustrated in Figure 9b. Based on the lower market prices at time 1:00–8:00 and 24:00, MGOs mainly purchase power from DSO in scenario 1 and scenario 3, while in other hours (i.e., 9:00–23:00), MG1 sells power to DSO. In contrast, in scenario 2 at time 8:00 and 24:00, MG1 sells power to DSO because of the higher wholesale market prices. Moreover, due to the lower wholesale market prices in scenario 3, the total amount of purchased power from DSO is increased by 5% and 8%, respectively in comparison with those in scenario1 and scenario 2. Figure 10 shows the amounts of exchanged power between each MG and DSO in CS2 for the three defined scenarios. Since no interconnection between MGs is considered in CS2, the power is not exchanged among MGs. This can also be deduced from Figure 10 where due to the higher wholesale market prices in scenario 2, the amount of purchased power from DSO is decreased by 3% and 5%, respectively. As a whole, in scenario 3, which reflects an operating condition with lower electricity prices, the MGOs prefer to supply more power from the DSO through participating in the market rather than internal energy trading among themselves. Thus, the expensive DERs are switched off in scenario 3 to ensure the economical operation of the distribution system. The amounts of exchanged power between each MG and DSO in CS3 for the three scenarios are shown in Figure 11. As can be seen, the amounts of purchased power from DSO to MG2 and MG3 are increased in peak load periods (i.e., 18:00–23:00) compared to CS2 and CS3. This is because there is no ESSs or DR programs in CS3 to supply power shortage. Figure 12 compares the technical and financial results between CS1, CS2 and CS3 under different scenarios. To get a better insight into this comparative study, the results related to the CS2 scenario 1 are considered as base values and treated as 1.00 per unit (p.u.). As can be seen, in the interconnected topology through the hourly reconfiguration the total loss of the distribution system is less than that of in CS2. Specifically, a reduction of 7%, 6% and 8% in total losses for scenario 1, scenario 2 and scenario 3 are achieved, respectively, which demonstrates the effect of hourly reconfiguration on loss reduction. Due to the increased power generations from DERs in scenario 2, the total loss in scenario 2 is less than that of scenario 1 and scenario 3 for both CSs. The responsive loads commitment in DR programs in scenario 2 is 27% and 38% more than those in scenario 1 and scenario 3, respectively for CS1. On the other hand, consumers’ participation in DR actions for CS2 in scenario 2 is 21% and 29% more than those in scenario 1 and scenario 3, respectively. Hence, by utilization of hourly reconfiguration for interconnected topology of MGs in CS1, DR activities are increased by 4%, 11% and 2% in scenario 1, scenario 2 and scenario 3, respectively as compared to CS2. More importantly, the financial profit of MGOs in CS1 are more than those made in CS2 for all scenarios, which demonstrates the efficiency of the proposed interconnected MGs topology. Due to the hourly reconfiguration in CS1, the amounts of profit in scenario 1 are 1.04 p.u., 1.09 p.u. and 1.07 p.u. for MG1, MG2 and MG3, respectively, where these amounts are considered to be 1.00 p.u. for CS2. It is clearly observed from Figure 12 that by applying the hourly reconfiguration through interconnected MGs topology, significant decreases in total cost of distribution system could be achieved in different scenarios. Besides, the amounts of total loss, DR participation, profit of MGs and total costs are presented in Figure 12c. As can be seen, the amounts of losses and total costs are increased compared to CS1 and CS2. On the other hand, the profit of MGs is decreased significantly in different scenarios, which shows the effectiveness of DR programs and ESSs implementation. Through the proposed checking mechanism in Section 3.3, it is verified that the final solutions obtained by the MISOCP problem are Nash equilibrium. For example, for the optimization problem related to the MG1 (MGO2 and MGO3 are considered as fixed decision makers), the profit of MGO1 is 1.04 p.u. and 1 p.u., respectively for CS1 and CS2 in scenario 1, which are consistent with the results shown in Figure 12.
Total load profile of the system after load participation in DR program is shown in Figure 13. It can be seen that RLs are participated in DR programs through the bid-quantity offer packages in peak load periods to flatten the demand curve. Due to the increased retail and wholesale market prices in scenario 2, the amount of participated load in DR programs is increased. Particularly, the peak load has been decreased from 34.2 MW to 29.9 MW, 29.7 MW and 30.7 MW for scenario 1, scenario 2 and scenario 3, respectively.
From the voltage-security point of view, Figure 14 shows the maximum voltage deviation of busses from 1.00 p.u. for CS1, CS2 and CS3 in three defined scenarios. Due to the higher wholesale market prices and increased power generations from DERs in scenario 2, better bus voltages are achieved. It can be seen that hourly reconfiguration through the interconnected MGs, DR participation and ESSs implementation in CS1 causes better results for bus voltages during the 24h time horizon in all scenarios. Besides, all bus voltages are regulated within their allowable 0.05 p.u. ranges.

5. Conclusions

In this paper, the problem of optimal day-ahead scheduling of reconfigurable multi-MG distribution system considering demand response programs and ESSs in an uncertain environment was investigated. Due to participation of multi-players including DSO and multi-MGs with inherently conflicting objectives in the framework, a one-leader multi-follower-type bi-level optimization model was developed to embody DSO-MGOs gaming strategy. The proposed decision-making model sought to minimize the DSO’s total operation cost as the upper-level problem taking into account maximizing the profit of each MG as the lower-level problem. Decision maker was affected not only by the exchanged power between DSO and MGOs as a mutual decision variable but also by the interactions of the interconnected MGs in an hourly reconfigurable topology. KKT optimality conditions and linearization techniques were used to transform the proposed non-linear bi-level optimization problem into a single-level MISOCP problem. The performance of the proposed model was investigated on the 84-bus Taiwan power company distribution system. The simulation results revealed that in conditions where the market prices are relatively higher, MGOs prefer to dispatch first their distributed energy resources including micro turbines, PVs and responsive loads and then exchange power with the interconnected MGs and DSO. However, when the market prices are lower, MGOs prefer to trade energy with DSO. Moreover, it was shown that by implementing hourly reconfiguration through interconnected MGs, the total power losses, the maximum voltage deviation of buses, participation in demand response programs, MGOs’ profit and the total system cost could be improved significantly.

Author Contributions

S.E. and A.A.-M. developed the idea and designed the model. The simulation was executed and analysed by S.E. S.E. and A.A.-M. accomplished the writing of the paper. S.J. guided the whole work and reviewed the final paper.

Funding

This research received no external funding.

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A

To calculate the KKT conditions of the follower problem, all non-equality constraints of the lower-level problem can be rewritten as greater than or equal to zero constraints proposed in (A1)–(A24). Similarly, the collection of equality constraints of the lower-level are rewritten as equal to zero constraints (A25)–(A28).
C i , p , t , s 1 = P i , t , s M T P min M T 0 : λ i , p , t , s 1   ,   i , p , t , s
C i , p , t , s 2 = P max M T P i , t , s M T 0 : λ i , p , t , s 2   ,   i , p , t , s
C i , p , t , s 3 = R i u p × U i , t M T P i , t , s M T + P i , t 1 , s M T 0 : λ i , p , t , s 3   ,   i , p , t , s
C i , p , t , s 4 = R i d o w n × U i , t 1 M T + P i , t , s M T P i , t 1 , s M T 0 : λ i , p , t , s 4   ,   i , p , t , s
C i , p , t , s 5 = U i , t + U p i , k M T U i , t M T + U i , t 1 M T 0 : λ i , p , t , s 4   ,   i , p , t , s
C i , p , t , s 6 = 1 U i , t + D n i , k M T + U i , t M T U i , t 1 M T 0 : λ i , p , t , s 6   ,   i , p , t , s
C i , p , t , s 7 = P t , s M G p 2 D S O P min M G 2 D S O 0 : λ i , p , t , s 7   ,   i , p , t , s
C i , p , t , s 8 = P max M G 2 D S O P t , s M G p 2 D S O 0 : λ i , p , t , s 8   ,   i , p , t , s
C i , p , t , s 9 = P t , s D S O 2 M G p P min D S O 2 M G 0 : λ i , p , t , s 9   ,   i , p , t , s
C i , p , t , s 10 = P max D S O 2 M G P t , s D S O 2 M G p 0 : λ i , p , t , s 10   ,   i , p , t , s
C i , p , t , s 11 = P t , s M G p 2 M G q P min M G 2 M G 0 : λ i , p , t , s 11   ,   i , p , t , s
C i , p , t , s 12 = P max M G 2 M G P t , s M G p 2 M G q 0 : λ i , p , t , s 12   ,   i , p , t , s
C i , p , t , s 13 = P t , s M G q 2 M G p P min M G 2 M G 0 : λ i , p , t , s 13   ,   i , p , t , s
C i , p , t , s 14 = P max M G 2 M G P t , s M G q 2 M G p 0 : λ i , p , t , s 14   ,   i , p , t , s
C i , p , t , s 15 = P i , t , s c h P min E S S U i , t c h 0 : λ i , p , t , s 15   ,   i , p , t , s
C i , p , t , s 16 = P max E S S U i , t c h P i , t , s c h 0 : λ i , p , t , s 16   ,   i , p , t , s
C i , p , t , s 17 = P i , t , s d c h P min E S S U i , t d c h 0 : λ i , p , t , s 17   ,   i , p , t , s
C i , p , t , s 18 = P max E S S U i , t d c h P i , t , s d c h 0 : λ i , p , t , s 18   ,   i , p , t , s
C i , p , t , s 19 = E i , t , s E min 0 : λ i , p , t , s 19   ,   i , p , t , s
C i , p , t , s 20 = E max E i , t , s 0 : λ i , p , t , s 20   ,   i , p , t , s
C i , p , t , s 21 = h i , ξ H i , min 0 : λ i , p , t , s 21   ,   i , p , t , s ,   ξ = 1
C i , p , t , s 22 = H i , ξ h i , ξ 0 : λ i , p , t , s 22   ,   i , p , t , s   , ξ = 1
C i , p , t 23 = h i , ξ 0 : λ i , p , t 23   ,   i , p , t , ξ = 2 , 3 , , ϕ
C i , p , t 24 = H i , ξ + 1 H i , ξ h i , ξ 0 : λ i , p , t 24 ,   i , p , t , ξ = 2 , 3 , , ϕ
i M G p ( P i , t , s P V + P i , t , s M T + P i , t , s d c h P i , t , s c h + P i , t , s D R ) + P t , s D S O 2 M G p P t , s M G p 2 D S O + q = 1 , q p N M G ( P t , s M G q 2 M G p P t , s M G p 2 M G q ) i M G p ( P i , t , s L + P i , t , s l o s s ) = 0 : λ i , p , t , s 25 ,   i , p , t , s
E i , t , s E i , t 1 , s η i c h P i , t , s c h + P i , t , s d c h η i d c h = 0   : λ i , p , t , s 26 ,   i , p , s , t > 1
E i , t , s E i i n i t i a l η i c h P i , t , s c h + P i , t , s d c h η i d c h = 0   : λ i , p , t , s 27 ,   i , p , s , t = 1
P i D R ξ = 1 ϕ h i , ξ = 0 : λ i , p , t 28 ,   i , p , t , ξ
The Lagrangian function and related derived KKT optimality conditions of the lower-level problem (27)–(55) considering the rewritten form of non-equality and equality constraints of the lower-level problem (A1)–(A28) can be calculated as follows:
L p = S P V N P V π s P V S L = 1 N L π s L t = 1 24 [ ρ t L M i M G p ( P i , t L ) + ρ t L M ( P t , s M G p 2 D S O P t , s D S O 2 M G p ) + ρ t L M q = 1 , q p N M G ( P t , s M G p 2 M G q P t , s M G q 2 M G p ) i M G p ( ρ i , t M T P i , t , s M T ) i M G p ( ρ i , t P V P i , t , s P V ) + i M G p ( ρ i , t E S S ( P i , t , s c h P i , t , s d c h ) ) i M G p ξ = 1 ϕ ρ ξ , i , t D R h ξ , i , t z = 1 24 C i , p , t , s z λ i , p , t , s z λ i , p , t , s 25 ( i M G p ( P i , t , s P V + P i , t , s M T + P i , t , s d c h P i , t , s c h + P i , t , s D R P i , t , s L P i , t , s l o s s ) + P t , s D S O 2 M G p P t , s M G p 2 D S O + q = 1 , q p N M G ( P t , s M G q 2 M G p P t , s M G p 2 M G q ) ) λ i , p , t , s 26 ( E i , t , s E i , t 1 , s η i c h P i , t , s c h + P i , t , s d c h η i d c h ) λ i , p , t , s 27 ( E i , t , s E i i n i t i a l η i c h P i , t , s c h + P i , t , s d c h η i d c h ) λ i , p , t , s 28 ( P i D R ξ = 1 ϕ h i , ξ ) ]
L p P t , s M G p 2 M G q = ρ t L M ( N M G 1 ) λ i , p , t , s 11 + λ i , p , t , s 12 + λ i , p , t , s 25 ( N M G 1 ) = 0
L p P t , s M G q 2 M G p = ρ t L M ( N M G 1 ) λ i , p , t , s 13 + λ i , p , t , s 14 λ i , p , t , s 25 ( N M G 1 ) = 0
L p P i , t , s M T = i M G p ρ i , t M T λ i , p , t , s 1 + λ i , p , t , s 2 + λ i , p , t , s 3 λ i , p , t , s 4 λ i , p , t , s 25 α t M G p = 0
L p Q i , t , s M T = i M G p K q M T ρ i , t M T = 0
L p P i , t , , s c h = i M G p ρ i , t , s E S S λ i , p , t , s 15 + λ i , p , t , s 16 + λ i , p , t , s 25 α t M G p + λ i , p , t , s 26 | t > 1 ( η i c h ) + λ i , p , t , s 27 | t = 1 ( η i c h ) = 0
L p P i , t , s d c h = i M G p ρ i , t , s E S S λ i , p , t , s 17 + λ i , p , t , s 18 λ i , p , t , s 25 α t M G p λ i , p , t , s 26 | t > 1 ( 1 η i d c h ) λ i , p , t , s 27 | t = 1 ( 1 η i d c h ) = 0
L p P i , t , s D R = i M G p ξ = 1 ϕ ρ ξ , i D R λ i , p , t , s 25 α t M G p λ i , p , t 28 = 0
Primal feasibility:
Equations (A1)–(A28) state the primal feasibility conditions.
Dual feasibility:
As all non-equality constraints of the lower-level problem are rewritten as greater than or equal to zero constraints in (A1)–(A24), the respective Lagrangian multipliers (i.e., dual variables) are in the same form. Similarly, as the collection of equality constraints of the lower-level are rewritten as equal to zero constraints in (A25)–(A28), the related dual variables are unrestricted as follows:
λ i , p , t , s z 0 ,   z = 1 , 2 , , 24   i , p , t , s
λ i , p , t , s z   U n r e s t r i c t e d ,   z = 24 , 25 , , 28   i , p , t , s
Complementary slackness conditions:
C i , p , t , s z λ i , p , t , s z = 0 ,   z = 1 , 2 , , 24   i , p , t , s
The nonlinear constraints in (A39) are transformed into a linear form by big-M method as follows:
C i , p , t , s z M U i , p , t , s z ,   z = 1 , 2 , , 24   i , p , t , s
λ i , p , t , s z M ( 1 U i , p , t , s z ) ,   z = 1 , 2 , , 24   i , p , t , s
where, M should be considered as a large positive number.

Nomenclature

Parameters
y i Admittance between bus i and ground.
η i ch / η i dch Charging/Discharging efficiency of ESS i.
g i / b i Conductance/ susceptance of bus i.
ρ t WM Day-ahead wholesale market electricity price at time t ($/MWh).
z ij Impedance of branch ij.
E i initial Initial energy storage of ESS i (MWh).
ρ t LM Local market price ($/MWh).
MDT i / MUT i Minimum down/up time for MT i.
N WM / N PV / N L Number of generated scenarios for wholesale market price/ PV output power/ demanded load.
ρ ξ , i . t DR Offered price of DR program for load curtailment in step ξ at time t ($/MWh).
ρ i ESS Operation & maintenance cost coefficient of Energy Storage System (ESS) i ($/MWh).
ρ i MT Operation & maintenance cost coefficient of MT i ($/MWh).
ρ i PV Operation & maintenance cost coefficient of PV i ($/MWh).
ρ loss Price for power losses ($/MWh).
ρ SW Price of each switching operation ($).
π s WM / π s PV / π s L Probability of scenarios for wholesale market price/ PV output power/ demanded load.
R i up / R i down Ramp-up/ramp-down rate of MT i.
r ij / x ij Resistance/reactance of branch ij.
Variables
h i , ζ Amount of accepted load curtailment for DR program in step ξ of bus i.
S i j , t , s Apparent power of branch ij at time t.
D n i , k / U p i , k Auxiliary variables for linear modelling of minimum down/up time limits.
U i , p , t , s z Auxiliary variable used for linearization of the complementary conditions.
U i , t c h / U i , t d c h Binary variable for the charging /discharging status of ESS i at time t (0: when ESS i is not in the charging or discharging mode).
STDStandard deviation
TOUTime-of-use
Indices and sets
k Index for On-time/OFF-time limits modelling.
t Index   of   time   ( t = 1 , 2 , , 24 ).
i , j Index   of   buses   ( i , j = 1 , 2 , , , N b u s ).
br Index   of   branches   ( b r = 1 , 2 , , N b r ).
sw Index   of   RCSs   ( s w = 1 , 2 , , N s w ).
p , q Index   of   MGs   ( p , q = 1 , 2 , , N M G ).
ξ Index   of   steps   in   bid - quantity   packages   of   DR   programs   ( ξ = 1 , 2 , 3 , , ϕ ).
ψ p Set   of   buses   pertaining   to   the   MG   number p .
s Set of scenarios.
U i , t M T Binary variable for the status of MT i at time t (0: when MT i is OFF).
X s w , t , s Binary variable for the status of RCS sw at time t (0: when the related switch is opened)
C t M G 2 D S O Cost of exchanging power between DSO and MGs ($).
C t WM Cost of exchanging power with wholesale market at time t ($).
C t S W Cost of switching actions for RCSs at time t ($).
I i j , t , s Current of branch ij at time t (kA).
P i , t , s D R Curtailed power of DR for bus i at time t (MW).
P t , s W M 2 D S O / P t , s D S O 2 W M Day-ahead power purchased/sold from/to wholesale market at time t by DSO (MW).
λ i , p , t , s z Dual variable.
E i , t , s Energy storage of ESS i at time t (MWh).
P i , t , s c h / P i , t , s d c h ESS i charge/discharge power at time t (MW).
C i , p , t , s z Greater than or equal to zero constraints.
L p Lagrangian function of pth lower-level problem related to MG p.
α t M G p Number of buses in the border of MG p at time t.
P i , t , s M T Output active power of MT i at time t (MW).
P i , t , s P V Output power of PV i at time t (MW).
Q i , t , s M T Output reactive power of MT i at time t (MVAR).
Pr p , t , s α Profit   related   to   term   α   ( $ )   ( α includes loads, PVs, MTs, DR programs and exchanged power between MGs and DSO).
ν i , t , s / i j , t , s Squared voltage/current magnitude of branch ij.
P i , t , s / Q i , t , s The net injected active/reactive power at bus i.
P i , t , s L Total electrical load of bus i at time t (MW).
P t , s M G p 2 D S O / P t , s D S O 2 M G p Transmitted power from MG p to DSO/ from DSO to MG p (MW).
P t , s M G p 2 M G q Transmitted power from MG p to MG q at time t (MW).
V i , t , s Voltage magnitude of bus i at time t.

References

  1. Kim, M.S.; Haider, R.; Cho, G.J.; Kim, C.H.; Won, C.Y.; Chai, J.S. Comprehensive Review of Islanding Detection Methods for Distributed Generation Systems. Energies 2019, 12, 837. [Google Scholar] [CrossRef]
  2. Holjevac, N.; Capuder, T.; Kuzle, I. Defining key parameters of economic and environmentally efficient residential microgrid operation. Energy Procedia 2017, 105, 999–1008. [Google Scholar] [CrossRef]
  3. Khodaei, A. Provisional microgrid planning. IEEE Trans. Smart Grid 2017, 8, 1096–1104. [Google Scholar] [CrossRef]
  4. Quashie, M.; Marnay, C.; Bouffard, F.; Joós, G. Optimal planning of microgrid power and operating reserve capacity. Appl. Energy 2018, 210, 1229–1236. [Google Scholar] [CrossRef]
  5. Esmaeili, S.; Jadid, S. Economic-Environmental Optimal Management of Smart Residential Micro-Grid Considering CCHP System. Electr. Power Syst. Res. 2019, 1–15. [Google Scholar] [CrossRef]
  6. Uski, S.; Rinne, E.; Sarsama, J. Microgrid as a Cost-Effective Alternative to Rural Network Underground Cabling for Adequate Reliability. Energies 2018, 11, 1978. [Google Scholar] [CrossRef]
  7. Meirinhos, J.L.; Rua, D.E.; Carvalho, L.M.; Madureira, A.G. Multi-temporal Optimal Power Flow for voltage control in MV networks using Distributed Energy Resources. Electr. Power Syst. Res. 2017, 146, 25–32. [Google Scholar] [CrossRef]
  8. Gutiérrez-Alcaraz, G.; Galván, E.; González-Cabrera, N.; Javadi, M.S. Renewable energy resources short-term scheduling and dynamic network reconfiguration for sustainable energy consumption. Renew. Sustain. Energy Rev. 2015, 52, 256–264. [Google Scholar] [CrossRef]
  9. Faria, P.; Spínola, J.; Vale, Z. Distributed Energy Resources Scheduling and Aggregation in the Context of Demand Response Programs. Energies 2018, 11, 1987. [Google Scholar] [CrossRef]
  10. Marvasti, A.K.; Fu, Y.; DorMohammadi, S.; Rais-Rohani, M. Optimal operation of active distribution grids: A system of systems framework. IEEE Trans. Smart Grid 2014, 5, 1228–1237. [Google Scholar] [CrossRef]
  11. Lv, T.; Ai, Q.; Zhao, Y. A bi-level multi-objective optimal operation of grid-connected microgrids. Electr. Power Syst. Res. 2016, 131, 60–70. [Google Scholar] [CrossRef]
  12. Feijoo, F.; Das, T.K. Emissions control via carbon policies and microgrid generation: A bilevel model and Pareto analysis. Energy 2015, 90, 1545–1555. [Google Scholar] [CrossRef]
  13. Aghajani, S.; Kalantar, M. Operational scheduling of electric vehicles parking lot integrated with renewable generation based on bilevel programming approach. Energy 2017, 139, 422–432. [Google Scholar] [CrossRef]
  14. Sandgani, M.R.; Sirouspour, S. Energy management in a network of grid-connected microgrids/nanogrids using compromise programming. IEEE Trans. Smart Grid 2018, 9, 2180–2191. [Google Scholar]
  15. Haddadian, H.; Noroozian, R. Multi-microgrids approach for design and operation of future distribution networks based on novel technical indices. Appl. Energy 2017, 185, 650–663. [Google Scholar] [CrossRef]
  16. Gazijahani, F.S.; Ravadanegh, S.N.; Salehi, J. Stochastic multi-objective model for optimal energy exchange optimization of networked microgrids with presence of renewable generation under risk-based strategies. ISA Trans. 2018, 73, 100–111. [Google Scholar] [CrossRef] [PubMed]
  17. Bahramara, S.; Moghaddam, M.P.; Haghifam, M.R. A bi-level optimization model for operation of distribution networks with micro-grids. Int. J. Electr. Power Energy Syst. 2016, 82, 169–178. [Google Scholar] [CrossRef]
  18. Bahramara, S.; Moghaddam, M.P.; Haghifam, M.R. Modelling hierarchical decision making framework for operation of active distribution grids. IET Gener. Transm. Distrib. 2015, 9, 2555–2564. [Google Scholar] [CrossRef]
  19. Jalali, M.; Zare, K.; Seyedi, H. Strategic decision-making of distribution network operator with multi-microgrids considering demand response program. Energy 2017, 141, 1059–1071. [Google Scholar] [CrossRef]
  20. Yu, M.; Hong, S.H. Supply–demand balancing for power management in smart grid: A Stackelberg game approach. Appl. Energy 2016, 164, 702–710. [Google Scholar] [CrossRef]
  21. Yu, M.; Hong, S.H. A Real-Time Demand-Response Algorithm for Smart Grids: A Stackelberg Game Approach. IEEE Trans. Smart Grid 2016, 7, 879–888. [Google Scholar] [CrossRef]
  22. Esmaeili, S.; Anvari-Moghaddam, A.; Jadid, S.; Guerrero, J.M. Optimal Operational Scheduling of Smart Microgrids Considering Hourly Reconfiguration. In Proceedings of the 2018 IEEE 4th Southern Power Electronics Conference (SPEC), Singapore, Singapore, 10–13 December 2018; pp. 1–6. [Google Scholar]
  23. Esmaeili, S.; Anvari-Moghaddam, A.; Jadid, S.; Guerrero, J.M. A Stochastic Model Predictive Control Approach for Joint Operational Scheduling and Hourly Reconfiguration of Distribution Systems. Energies 2018, 11, 1884. [Google Scholar] [CrossRef]
  24. Chen, S.; Hu, W.; Chen, Z. Comprehensive cost minimization in distribution networks using segmented-time feeder reconfiguration and reactive power control of distributed generators. IEEE Trans. Power Syst. 2016, 31, 983–993. [Google Scholar] [CrossRef]
  25. Anand, M.P.; Golshannavaz, S.; Ongsakul, W.; Rajapakse, A. Incorporating short-term topological variations in optimal energy management of MGs considering ancillary services by electric vehicles. Energy 2016, 112, 241–253. [Google Scholar] [CrossRef]
  26. Hemmati, M.; Mohammadi-Ivatloo, B.; Ghasemzadeh, S.; Reihani, E. Risk-based optimal scheduling of reconfigurable smart renewable energy based microgrids. Int. J. Electr. Power Energy Syst. 2018, 101, 415–428. [Google Scholar] [CrossRef]
  27. Gazijahani, F.S.; Salehi, J. Optimal bilevel model for stochastic risk-based planning of microgrids under uncertainty. IEEE Trans. Ind. Inform. 2018, 14, 3054–3064. [Google Scholar] [CrossRef]
  28. Shahmohammadi, A.; Sioshansi, R.; Conejo, A.J.; Afsharnia, S. Market equilibria and interactions between strategic generation, wind, and storage. Appl. Energy 2018, 220, 876–892. [Google Scholar] [CrossRef]
  29. Rostami, M.A.; Kavousi-Fard, A.; Niknam, T. Expected cost minimization of smart grids with plug-in hybrid electric vehicles using optimal distribution feeder reconfiguration. IEEE Trans. Ind. Inform. 2015, 11, 388–397. [Google Scholar] [CrossRef]
  30. Rabiee, A.; Sadeghi, M.; Aghaeic, J.; Heidari, A. Optimal operation of microgrids through simultaneous scheduling of electrical vehicles and responsive loads considering wind and PV units uncertainties. Renew. Sustain. Energy Rev. 2016, 57, 721–739. [Google Scholar] [CrossRef]
  31. Esmaeili, S.; Anvari-Moghaddam, A.; Jadid, S.; Guerrero, J.M. Optimal simultaneous day-ahead scheduling and hourly reconfiguration of distribution systems considering responsive loads. Int. J. Electr. Power Energy Syst. 2019, 104, 537–548. [Google Scholar] [CrossRef]
  32. CPLEX Optimization Subroutine Library Guide and Reference; ILOG Inc.: Incline Village, NV, USA, 2008.
Figure 1. Framework of the proposed bi-level Distribution Management System (DMS).
Figure 1. Framework of the proposed bi-level Distribution Management System (DMS).
Energies 12 01766 g001
Figure 2. A bid-quantity offer package for ith node.
Figure 2. A bid-quantity offer package for ith node.
Energies 12 01766 g002
Figure 3. Problem statement and its transformation from a bi-level format into a single-level Mixed-Integer Second-Order Cone Programming (MISOCP) problem.
Figure 3. Problem statement and its transformation from a bi-level format into a single-level Mixed-Integer Second-Order Cone Programming (MISOCP) problem.
Energies 12 01766 g003
Figure 4. 84-bus Taiwan power company distribution system.
Figure 4. 84-bus Taiwan power company distribution system.
Energies 12 01766 g004
Figure 5. (a) Power demand; (b) Real Time Pricing (RTP) Wholesale market and Time-of-Use (TOU) retail market prices.
Figure 5. (a) Power demand; (b) Real Time Pricing (RTP) Wholesale market and Time-of-Use (TOU) retail market prices.
Energies 12 01766 g005
Figure 6. Hourly operation scheduling of the MTs, DR programs and ESSs in MG1 for CS1: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Figure 6. Hourly operation scheduling of the MTs, DR programs and ESSs in MG1 for CS1: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Energies 12 01766 g006
Figure 7. Hourly operation scheduling of the MTs, DR programs and ESSs in MG2 for CS1: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Figure 7. Hourly operation scheduling of the MTs, DR programs and ESSs in MG2 for CS1: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Energies 12 01766 g007
Figure 8. Hourly operation scheduling of the MTs, DR programs and ESSs in MG3 for CS1: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Figure 8. Hourly operation scheduling of the MTs, DR programs and ESSs in MG3 for CS1: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Energies 12 01766 g008
Figure 9. Exchanged power in different scenarios for CS1: (a) among MGs; (b) between DSO and MGs.
Figure 9. Exchanged power in different scenarios for CS1: (a) among MGs; (b) between DSO and MGs.
Energies 12 01766 g009
Figure 10. Exchanged power between DSO and MGs in different scenarios for CS2: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Figure 10. Exchanged power between DSO and MGs in different scenarios for CS2: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Energies 12 01766 g010
Figure 11. Exchanged power between DSO and MGs in different scenarios for CS3: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Figure 11. Exchanged power between DSO and MGs in different scenarios for CS3: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Energies 12 01766 g011
Figure 12. Comparison of technical and financial results between: (a) CS1; (b) CS2; (c) CS3.
Figure 12. Comparison of technical and financial results between: (a) CS1; (b) CS2; (c) CS3.
Energies 12 01766 g012
Figure 13. Total load profile with and without considering DR programs in different scenarios.
Figure 13. Total load profile with and without considering DR programs in different scenarios.
Energies 12 01766 g013
Figure 14. The maximum voltage deviation of buses for CS1, CS2 and CS3 in: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Figure 14. The maximum voltage deviation of buses for CS1, CS2 and CS3 in: (a) scenario 1; (b) scenario 2; (c) scenario 3.
Energies 12 01766 g014
Table 1. Values for technical parameters [29].
Table 1. Values for technical parameters [29].
ParameterValueParameterValue
ρ l o s s ( $ / M W h ) 250 ρ i M T ( $ / M W h ) 71
P max W M 2 D S O / P max D S O 2 M G ( M W ) 36 ρ i P V ( $ / M W h ) 11
P max M G p 2 D S O / P max D S O 2 M G p ( M W ) 20 ρ i E S S ( $ / M W h ) 8
P max M G p 2 M G q / P max M G q 2 M G p ( M W ) 15 V min , V max ( p . u . ) 0.95, 1.05
I i , j , m a x ( k A ) 3.8 P min M T , P max M T ( M W ) 0, 5
ρ S W ( $ ) 1 N max S W 8
Table 2. Supported areas of Demand Response (DR) programs in each Microgrid (MG).
Table 2. Supported areas of Demand Response (DR) programs in each Microgrid (MG).
DR programBuses
MG11, 4, 6, 7, 8, 12
MG216, 17, 18, 22, 23, 28, 31, 32, 40, 45
MG349, 50, 54, 59, 62, 63, 67, 68, 72, 80, 81, 82
Table 3. Bid quantity offer packages of DR programs [31].
Table 3. Bid quantity offer packages of DR programs [31].
MG No.DR Program [Quantity range* (MW)] & [Price** ($/MWh)]
MG100.2*0.20.50.5–0.70.7–1.1
94 **97102112
MG20–0.20.2–0.80.8–1.41.4–1.7
9197104116
MG30–0.20.2–0.70.7–1.31.3–1.8
9296102114
Table 4. Summary of the defined Case studies (CSs) and scenarios.
Table 4. Summary of the defined Case studies (CSs) and scenarios.
Scenario 1Scenario 2Scenario 3
CS1Hourly reconfiguration, DR, ESSs, base pricesHourly reconfiguration, DR, ESSs, 10% increment in pricesHourly reconfiguration, DR, ESSs, 10% decrement in prices
CS2DR, ESSs, base pricesDR, ESSs, 10% increment in pricesDR, ESSs, 10% decrement in prices
CS3base prices10% increment in prices10% decrement in prices
Table 5. Opened Remotely Controlled Switches (RCSs) in reconfiguration process.
Table 5. Opened Remotely Controlled Switches (RCSs) in reconfiguration process.
HourOpen RCSs HourOpen RCSs
152-85-86-87-88-89-90-91-92-93-94-95-9612–1518-26-84-85-86-87-88-91-92-93-94-95-96
2–352-84-85-86-87-88-89-90-91-92-93-94-9516–1884-85-86-87-88-89-90-91-92-93-94-95-96
4–884-85-86-87-88-89-90-91-92-93-94-95-9619–2152-75-85-86-87-89-90-91-92-93-94-95-96
9–1118-52-85-86-87-88-90-91-92-93-94-95-9622–2419-59-84-86-87-88-89-90-92-93-94-95-96

Share and Cite

MDPI and ACS Style

Esmaeili, S.; Anvari-Moghaddam, A.; Jadid, S. Optimal Operational Scheduling of Reconfigurable Multi-Microgrids Considering Energy Storage Systems. Energies 2019, 12, 1766. https://doi.org/10.3390/en12091766

AMA Style

Esmaeili S, Anvari-Moghaddam A, Jadid S. Optimal Operational Scheduling of Reconfigurable Multi-Microgrids Considering Energy Storage Systems. Energies. 2019; 12(9):1766. https://doi.org/10.3390/en12091766

Chicago/Turabian Style

Esmaeili, Saeid, Amjad Anvari-Moghaddam, and Shahram Jadid. 2019. "Optimal Operational Scheduling of Reconfigurable Multi-Microgrids Considering Energy Storage Systems" Energies 12, no. 9: 1766. https://doi.org/10.3390/en12091766

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