# Sizing a Hybrid Renewable Energy System by a Coevolutionary Multiobjective Optimization Algorithm

Authors: Wenhua Li; Guo Zhang; Xu Yang; Zhang Tao; Hu Xu
Journal: Complexity
 (2021)

---

## Abstract

Hybrid renewable energy system (HRES) arises regularly in real life. By optimizing the capacity and running status of the microgrid (MG), HRES can decrease the running cost and improve the efficiency. Such an optimization problem is generally a constrained mixed-integer programming problem, which is usually solved by linear programming method. However, as more and more devices are added into MG, the mathematical model of HRES refers to nonlinear, in which the traditional method is incapable to solve. To address this issue, we first proposed the mathematical model of an HRES. Then, a coevolutionary multiobjective optimization algorithm, termed CMOEA-c, is proposed to handle the nonlinear part and the constraints. By considering the constraints and the objective values simultaneously, CMOEA-c can easily jump out of the local optimal solution and obtain satisfactory results. Experimental results show that, compared to other state-of-the-art methods, the proposed algorithm is competitive in solving HRES problems.


---

## Body

## 1. Introduction

Energy shortages and environmental pollution problems have become increasingly severe in recent years. Microgrid (MG) technology [1] has received more and more attention to improving the rate of renewable energy usage, especially in large-scale wind and solar energy. MG is a small power supply and consumption system that contains a variety of components, e.g., electrical loads, energy storage devices, and renewable energy. So far, there have been many pieces of research on microgrid energy management. However, how to plan the capacity of the microgrid and consider the running operation of the microgrid in the design stage has become an urgent problem.Hybrid renewable energy system (HRES) [2] aims to optimize the installed capacity of components and energy management of the MG system during the planning phase. The main problem is to determine a set of optimal configurations, including whether to install a component and the capacity to install [3]. The main problem in microgrid energy management is how to formulate a power generation and scheduling plan without affecting the stable operation of the system.To address the above problem, many studies have proposed and improved the HRES model [4, 5]. Generally speaking, this problem is mixed-integer programming, so it can be optimized by traditional solving tools, e.g., branch-and-cut [6]. However, with the update of microgrid components, the HRES model has increasingly shown nonlinear characteristics, which cannot be solved directly by traditional linear programming methods. It is reported that through the transformation, which transfers the nonlinear constraints and objective functions to their linear form, some simple nonlinear problems can be solved by traditional linear programming methods. However, such transformation is limited and loses the information of the original problems. On the other hand, the HRES problem is a typical multiobjective optimization problem [3]. Decision makers (DMs) need to consider the full life cycle cost, power reliability, pollution emission, and so on simultaneously [7]. The traditional linear programming method usually converts multiobjective optimization problems to single-objective one by summing up objectives with a group of given weights [8]. That is, DM gives a set of weight vectors in advance, and then a scalar function is constructed for optimization. Although this method is simple, it has many drawbacks. Firstly, due to the inconsistency of various objective functions, it is difficult to determine the weights, resulting in poor robustness of the single-objective optimization problem. The use of larger weights will amplify the influence of the objective function noise, leading to unilateral preference. Secondly, it is often difficult for decision makers to give appropriate preference weights in advance [9].Evolutionary multiobjective optimization (EMO) algorithm has gained more and more attention in dealing with real-world engineering problems with nonlinear objective functions and constraints [10]. Multiobjective optimization problems (MOPs) which require the simultaneous optimization of multiple objectives are common in real-world applications. Without loss of generality, a MOP can be formulated as follows:(1)MinimizeFx=f1x,f2x,…,fmx,s.t.x=x1,x2,…,xn∈Ω,where Ω denotes the feasible decision space, m is the number of objectives, and x is a decision vector consisting of n decision variables xi. A solution xa is said to Pareto dominate another solution xbiff∀i=1,2,…,m,fixa≤fixb and ∃j=1,2,…,m,fjxa<fjxb. The images of Pareto optimal solution set (PS) in the objective space are termed the Pareto optimal front (PF).So far, a large number of works have been done to find a well-distributed PF of a MOP without constraints, which can be roughly categorized as (i) Pareto dominance-based algorithms, e.g., NSGA-II [11] and SPEA2 [12], (ii) indicator-based algorithms, e.g., IBEA [13], and (iii) decomposition-based methods, e.g., MOEA/D [14, 15]. Although the proposed EMO algorithms can well solve the benchmark problems without constraints [16], they are not specially designed for MOPs with constraints. To deal with constraints by EMO algorithms, many approaches have been proposed. Among them, penalty function [17, 18] may be the most representative and easiest way, which introduces a penalty term into the objective function to penalize constraint violations on a minimization problem. The introduction of the penalty term enables us to transform a constrained optimization problem into an unconstrained one. However, it is very difficult to strike the right balance between objective and penalty functions. Other approaches like ϵ-constraints [19] and stochastic ranking [20] can somehow deal with the constraints. Another effective way to deal with the constraints is to modify the dominance relationship [21], which has been proved effective and efficient. Specifically, there are two basic rules to calculate the dominance relationship. Solutions satisfying the constraints dominate unsatisfied solutions. If both solutions satisfy the constraints, then use the basic rule to compare their objective values.In addition, it is still an open issue to solve mixed-integer programming problem through EMO [22, 23]. Compared to continuous problems, the decision spaces of mixed-integer problems are separated. As shown in Figure 1, a very simple example is given with only two integer variables. In this case, each feasible region contains only one solution. The number of feasible regions will exponentially increase as the number of decision variables grows. In general, we set the population size to 100 to optimize, which is largely insufficient for the whole decision space. Moreover, since feasible regions in the decision space are separated, it is difficult for EMO algorithms to continuously search the whole decision space.Figure 1
Decision space of a mixed-integer programming problem.In this paper, we first proposed the mathematical model of an HRES. We consider the building and running cost of this system as well as the energy supply stability. This HRES model is a nonlinear and mixed-integer multiobjective optimization problem. To solve this problem, we proposed a coevolutionary EMO algorithm with modified dominance relationship to deal with the constraints, termed CMOEA-c. Specifically, there is an assistant archive which aims to explore the whole decision space and help jump out of the local optimal solution. In addition, we compared the performance of the proposed algorithm with other state-of-the-art algorithms. Experimental results show that our model and algorithm are effective and efficient.The rest of this paper is structured as follows. A mathematical model of a hybrid renewable energy system is proposed and specifically explained in Section2. In Section 3, the proposed coevolutionary multiobjective optimization algorithm is illustrated, followed by Section 4, which shows the experiment setting and the result analysis. Finally, a conclusion of this work is given in Section 5.


## 2. Mathematical Model of the Hybrid Renewable Energy System (HRES)

A typical HRES model includes the following components, i.e., the external electricity grid, renewable power generation, user load, diesel generator (DE), and energy storage system (ESS), as shown in Figure2. We need to first determine the installed capacities of these components. Then, we can optimize the control strategy of ESS and DE to minimize the running cost of this HRES.Figure 2
Physical structure of an HRES.


### 2.1. Constraints

Due to the randomness and intermittent nature of renewable energy, the power supply is often unstable [24], and it is difficult to meet energy demand all the time with renewable energy alone. With the help of ESS, the gap between supply and demand can be eased to a certain extent. In order to improve the reliability of power supply, MG must be connected to an external power grid. In this process, to ensure safety, the maximum transmission capacity is limited within a certain range.(2)XsellPgridmin≤Pgridt≤XsellPgridmax,where Pgridt is the exchanged power between external grid and MG. Pgridmin and Pgridmax represent the minimum and maximum power of the interaction respectively. Xsell is a binary variable that indicates whether the MG can sell electricity to the grid. Pgridmin could be negative which means that the MG can sell electricity to the external grid.Renewable energy includes photovoltaic and wind turbine; the main constraint is the minimum and maximum installed capacity.(3)Aminpv⋅Xpv≤Apv≤Amaxpv⋅Xpv,Ppvt≤ApvCpratpv,where Apv is the installed area of photovoltaic; Xpv is a binary variable presenting if the photovoltaic equipment is installed or not; and Cpratpv is the transfer efficiency of photovoltaic. The constraints of the wind turbine can be expressed as(4)Nminwt⋅Xwt≤Nwt≤Nmaxwt⋅Xwt,Pwtt≤Cpratwt⋅Nwt,where Nwt and Cpratwt represent the installed number and rated capacity of the wind turbine, respectively. Xwt is the selecting state of the wind turbine, where Xwt=0 means that wind turbine is not installed in this HRES.Similarly, the constraints of diesel generator are listed as follows:(5)Nminde⋅Xde≤Nde≤Nmaxde⋅Xde,Pdet≤Cpratde⋅Nde.Energy storage system (ESS) in an MG can not only store excess power but also supply power as a backup when the power generation is insufficient. With the help of the ESS, HRES can run more flexibly and stably. The main constraints are shown as follows:(6)Pessmin⋅Xess≤Pesst≤Pessmax⋅Xess,Pessmax=Cpratess⋅Ness,Eessmin⋅Xess≤Eesst≤Eessmax⋅Xess,Eesst+1=Eesst1−ϵess+ηessPesstΔt,where Pessmin and Pessmax are the minimum and maximum power of charging and discharging, respectively. Eesst means the energy storage capacity at t. In addition, ϵess is the self-discharge rate of ESS, which is provided by the manufacturer.Parameterηbess denotes the charging and discharging efficiency of the ESS, which changes according to the state (charging and discharging) of the ESS.(7)ηbess=ηbessc,Pbesst>0,ηbessd,Pbesst≤0,where ηbessc and ηbessd denote the charge/discharge efficiency of the energy storage system ranging from 0 to 1.The power balance constraint refers to balancing the power supply and demand as shown in the following equation:(8)Ppvt+Pwtt+Pdet+Pgridt+Plackt=Ploadt+Pesst,where Ppvt, Pwtt, Pdet, Pgridt, Ploadt, and Pesst represent the power of photovoltaic, wind turbine, diesel generator, interaction with external grid, users’ load, and the energy storage system, respectively.


### 2.2. Objective Functions

In this HRES model, we consider two objective functions, one is to minimize the life cycle cost, and the other is to minimize the rate of lack of electricity. Specifically, the life cycle cost includes the investment cost and maintenance cost, which is calculated as(9)CINV=CINVpv+CINVwt+CINVess+CINVde,CINVpv=CRFpv⋅Cpratpv⋅Apv⋅Cpv,CINVwt=CRFwt⋅Cpratwt⋅Nwt⋅Cwt,CINVde=CRFde⋅Cpratde⋅Nde⋅Cde,CINVess=CRFess⋅Cpratess⋅Ness⋅Cess,where CINV and Cequipment are the total and unit installed costs of each component. In this study, we only consider two-day energy management. Thus, CRF is introduced to calculate the annual cost, which is given by decision makers.The maintenance cost of HRES can be expressed as(10)CMTN=CMTNpv+CMTNwt+CMTNess+CMTNde+Copgrid,CMTNpv=CRFpv⋅Ppv⋅Cmtnpv,CMTNwt=CRFwt⋅Pwt⋅Cmtnwt,CMTNde=CRFde⋅Pde⋅Cmtnde,CMTNess=CRFess⋅Pess⋅Cmtness,CopGrid=CPurgrid⋅PPurgrid−CSalgrid⋅PSalgrid,where CopGrid is the cost of purchasing and selling electricity with the grid.Another objective is to minimize the rate of lack of electricity. Therefore, the objective functions of HRES are written as follows:(11)Minf1=CINV+CMTN,Minf2=∑Plackt.Generally speaking, these two objectives are conflicting, which means we cannot simply optimize one objective. Reasonably, the higher the cost of investment and maintenance, the lower the lack of electricity.


## 2.1. Constraints

Due to the randomness and intermittent nature of renewable energy, the power supply is often unstable [24], and it is difficult to meet energy demand all the time with renewable energy alone. With the help of ESS, the gap between supply and demand can be eased to a certain extent. In order to improve the reliability of power supply, MG must be connected to an external power grid. In this process, to ensure safety, the maximum transmission capacity is limited within a certain range.(2)XsellPgridmin≤Pgridt≤XsellPgridmax,where Pgridt is the exchanged power between external grid and MG. Pgridmin and Pgridmax represent the minimum and maximum power of the interaction respectively. Xsell is a binary variable that indicates whether the MG can sell electricity to the grid. Pgridmin could be negative which means that the MG can sell electricity to the external grid.Renewable energy includes photovoltaic and wind turbine; the main constraint is the minimum and maximum installed capacity.(3)Aminpv⋅Xpv≤Apv≤Amaxpv⋅Xpv,Ppvt≤ApvCpratpv,where Apv is the installed area of photovoltaic; Xpv is a binary variable presenting if the photovoltaic equipment is installed or not; and Cpratpv is the transfer efficiency of photovoltaic. The constraints of the wind turbine can be expressed as(4)Nminwt⋅Xwt≤Nwt≤Nmaxwt⋅Xwt,Pwtt≤Cpratwt⋅Nwt,where Nwt and Cpratwt represent the installed number and rated capacity of the wind turbine, respectively. Xwt is the selecting state of the wind turbine, where Xwt=0 means that wind turbine is not installed in this HRES.Similarly, the constraints of diesel generator are listed as follows:(5)Nminde⋅Xde≤Nde≤Nmaxde⋅Xde,Pdet≤Cpratde⋅Nde.Energy storage system (ESS) in an MG can not only store excess power but also supply power as a backup when the power generation is insufficient. With the help of the ESS, HRES can run more flexibly and stably. The main constraints are shown as follows:(6)Pessmin⋅Xess≤Pesst≤Pessmax⋅Xess,Pessmax=Cpratess⋅Ness,Eessmin⋅Xess≤Eesst≤Eessmax⋅Xess,Eesst+1=Eesst1−ϵess+ηessPesstΔt,where Pessmin and Pessmax are the minimum and maximum power of charging and discharging, respectively. Eesst means the energy storage capacity at t. In addition, ϵess is the self-discharge rate of ESS, which is provided by the manufacturer.Parameterηbess denotes the charging and discharging efficiency of the ESS, which changes according to the state (charging and discharging) of the ESS.(7)ηbess=ηbessc,Pbesst>0,ηbessd,Pbesst≤0,where ηbessc and ηbessd denote the charge/discharge efficiency of the energy storage system ranging from 0 to 1.The power balance constraint refers to balancing the power supply and demand as shown in the following equation:(8)Ppvt+Pwtt+Pdet+Pgridt+Plackt=Ploadt+Pesst,where Ppvt, Pwtt, Pdet, Pgridt, Ploadt, and Pesst represent the power of photovoltaic, wind turbine, diesel generator, interaction with external grid, users’ load, and the energy storage system, respectively.


## 2.2. Objective Functions

In this HRES model, we consider two objective functions, one is to minimize the life cycle cost, and the other is to minimize the rate of lack of electricity. Specifically, the life cycle cost includes the investment cost and maintenance cost, which is calculated as(9)CINV=CINVpv+CINVwt+CINVess+CINVde,CINVpv=CRFpv⋅Cpratpv⋅Apv⋅Cpv,CINVwt=CRFwt⋅Cpratwt⋅Nwt⋅Cwt,CINVde=CRFde⋅Cpratde⋅Nde⋅Cde,CINVess=CRFess⋅Cpratess⋅Ness⋅Cess,where CINV and Cequipment are the total and unit installed costs of each component. In this study, we only consider two-day energy management. Thus, CRF is introduced to calculate the annual cost, which is given by decision makers.The maintenance cost of HRES can be expressed as(10)CMTN=CMTNpv+CMTNwt+CMTNess+CMTNde+Copgrid,CMTNpv=CRFpv⋅Ppv⋅Cmtnpv,CMTNwt=CRFwt⋅Pwt⋅Cmtnwt,CMTNde=CRFde⋅Pde⋅Cmtnde,CMTNess=CRFess⋅Pess⋅Cmtness,CopGrid=CPurgrid⋅PPurgrid−CSalgrid⋅PSalgrid,where CopGrid is the cost of purchasing and selling electricity with the grid.Another objective is to minimize the rate of lack of electricity. Therefore, the objective functions of HRES are written as follows:(11)Minf1=CINV+CMTN,Minf2=∑Plackt.Generally speaking, these two objectives are conflicting, which means we cannot simply optimize one objective. Reasonably, the higher the cost of investment and maintenance, the lower the lack of electricity.


## 3. The Constrained Coevolutionary Multiobjective Optimization Algorithm

### 3.1. Motivation and Framework

There are many approaches to deal with constraints in a MOP as we have reviewed in Section1. These approaches can obtain favorable results on benchmark problems. However, real-world engineering problems are generally complex and multimodal. Generally, the feasible regions of these problems are usually separated from each other in objective space and decision space. Figure 3 explains the objective space of a two-objective real-world engineering problem, where the red line means the Pareto front. As shown in Figure 3, there are two feasible regions B and D in the objective space, separated by infeasible region C. For traditional EMO algorithms with constraint-handling strategies, it is really hard for populations to enter into region B due to the existence of infeasible region C. Generally speaking, at the beginning of the algorithm run, most of the solutions will randomly locate outside region C. As the algorithms adopt the constraint-handling methods, solutions will converge to the bound of region C and D and keep exploring region D. As a result, the algorithm is stuck into the local optimal solution and it is extremely hard to jump out.Figure 3
Illustration of a constraint multiobjective problem, where the feasible regions are separate.To address this issue, we proposed a constrained coevolutionary multiobjective optimization algorithm, termed CMOEA-c, which introduces an archive to help explore the whole decision space. The thoughts of coevolution can be widely found in some state-of-the-art EMO algorithms [25–27], which is proved effective and efficient. Specifically, we do not process the constraints in this archive. This archive aims to find the Pareto optimal front of a normal MOP without considering the constraints. Therefore, solutions in the archive will quickly converge to the true Pareto front, namely, the red line in Figure 3. In the beginning of the evolution process, solutions in the main population and the archive are randomly generated and may locate on regions C and D. As the algorithm runs, solutions in main population will converge to the optimal solution of region D, which is similar to that of traditional constrained EMO. As a comparison, since solutions in the archive do not consider the constraints, they will directly go through region C. Once the solutions in the archive enter into region B, this information will pass to the main population through the sharing function. As a result, the main population will quickly move to region B and then converge to the true Pareto optimal front. The framework of the proposed algorithm is explained in Algorithm 1.Algorithm 1: General framework.
Input: Maximum generations MaxGen, population size NOutput: Nondominated set Pop1Pop⟵InitializationN2Arc⟵InitializationN3Whilegen≤MaxGen4MatingPool1⟵TournamentSelectionPop5MatingPool2⟵TournamentSelectionArc6OS1⟵VariationMatingPool17OS2⟵VariationMatingPool28Pop⟵EnvSelectionPop,OS1,OS29Arc⟵EnvSelectionArc,OS1,OS210End WhileAs we can see from Algorithm1, the main population and the introduced archive will coevolve by sharing their offspring (line8−9). Therefore, solutions in region B can be added to the main population and help to converge to the true Pareto front. We will explain the selection strategy in the following section in detail.


### 3.2. Environmental Selection

After combining with the offspring, we need to update the population and the assistant archive by environmental selection, namely, maintain the population size to a certain number, shown in Algorithm2. There is one major difference between the update process of the population and the archive. Specifically, there are two steps. Firstly, we need to calculate the dominance ranking information and crowding distance of the population. Secondly, if the number of nondominated solutions exceeds N, then we truncate it to N according to crowding distance; otherwise, we will firstly choose all nondominated solutions and then select other solutions by crowding distance to make sure the population size is equal to N.Notably, for the main population, we use modified dominance relationship. That is, a feasible solution dominates an infeasible solution; if two solutions are feasible, then we use objective values to calculate the dominance relationship. As for the assistant archive, we do not consider whether the solution is feasible or not. The calculation of the dominance relationship is the same as the traditional ones.Algorithm 2: Environmental selection.
Input: Joint population JointPop, population size NOutput: Updated population Pop1Ranking⟵NondominatedSortJointPop2CrowdDis⟵CalCrowdDisJointPop3NumNondominated←numberRanking==14IfNumNondominated>Nthen5Pop⟵JointPopRanking==16Pop⟵PopCrowdDis1:N7else8Pop⟵JointPopRanking==19Pop⟵Pop∪PopCrowdDis1:N−NumNondominated10
End If


### 3.3. Solving HRES by CMOEA-c

The main problem to solve HRES problem by EMO algorithms is to encode a solution and design the mutation strategies. Since the HRES model in the work is complex, we use a structure to represent the solution, which can be seen in Figure4.Figure 4
Illustration of solution encoding method and the variable type.As we can see from Figure4, there are five parts describing a solution for an HRES. The first two parts indicate the installed information of an HRES, including whether to install the equipment or not and the installed capacity. Specifically, 0 means that the HRES does not select to install this equipment, and vice versa. Besides, the running state of this HRES is determined by the first four parts, where ESS running state and DE running state participate. Notably, some instrumental variables can help to calculate the objective function values but do not take part in the mutation, which are stored in the final part of the solution, e.g., wind power output, photovoltaic power output, and electricity prices. Specifically, the values of these variables change when the equipment select state and installed capacity change.As we can see from Figure4, there are several variable types in a solution for an HRES. Thus, simply applying the same mutation strategy to evolve the solution is low-efficient and unreasonable. To accelerate the searching process, we divide them into several parts and perform different mutation strategies. Specifically, for the equipment select states, we use a small mutation probability pm=0.1 because the change of equipment select state will significantly affect the running state of an HRES. In addition, for mixed-integer variables, we will perform integrity checking after the mutation to ensure the solution is feasible. The mutation probabilities for mixed-integer variables and continuous variables are 0.5 and 1, respectively.


## 3.1. Motivation and Framework

There are many approaches to deal with constraints in a MOP as we have reviewed in Section1. These approaches can obtain favorable results on benchmark problems. However, real-world engineering problems are generally complex and multimodal. Generally, the feasible regions of these problems are usually separated from each other in objective space and decision space. Figure 3 explains the objective space of a two-objective real-world engineering problem, where the red line means the Pareto front. As shown in Figure 3, there are two feasible regions B and D in the objective space, separated by infeasible region C. For traditional EMO algorithms with constraint-handling strategies, it is really hard for populations to enter into region B due to the existence of infeasible region C. Generally speaking, at the beginning of the algorithm run, most of the solutions will randomly locate outside region C. As the algorithms adopt the constraint-handling methods, solutions will converge to the bound of region C and D and keep exploring region D. As a result, the algorithm is stuck into the local optimal solution and it is extremely hard to jump out.Figure 3
Illustration of a constraint multiobjective problem, where the feasible regions are separate.To address this issue, we proposed a constrained coevolutionary multiobjective optimization algorithm, termed CMOEA-c, which introduces an archive to help explore the whole decision space. The thoughts of coevolution can be widely found in some state-of-the-art EMO algorithms [25–27], which is proved effective and efficient. Specifically, we do not process the constraints in this archive. This archive aims to find the Pareto optimal front of a normal MOP without considering the constraints. Therefore, solutions in the archive will quickly converge to the true Pareto front, namely, the red line in Figure 3. In the beginning of the evolution process, solutions in the main population and the archive are randomly generated and may locate on regions C and D. As the algorithm runs, solutions in main population will converge to the optimal solution of region D, which is similar to that of traditional constrained EMO. As a comparison, since solutions in the archive do not consider the constraints, they will directly go through region C. Once the solutions in the archive enter into region B, this information will pass to the main population through the sharing function. As a result, the main population will quickly move to region B and then converge to the true Pareto optimal front. The framework of the proposed algorithm is explained in Algorithm 1.Algorithm 1: General framework.
Input: Maximum generations MaxGen, population size NOutput: Nondominated set Pop1Pop⟵InitializationN2Arc⟵InitializationN3Whilegen≤MaxGen4MatingPool1⟵TournamentSelectionPop5MatingPool2⟵TournamentSelectionArc6OS1⟵VariationMatingPool17OS2⟵VariationMatingPool28Pop⟵EnvSelectionPop,OS1,OS29Arc⟵EnvSelectionArc,OS1,OS210End WhileAs we can see from Algorithm1, the main population and the introduced archive will coevolve by sharing their offspring (line8−9). Therefore, solutions in region B can be added to the main population and help to converge to the true Pareto front. We will explain the selection strategy in the following section in detail.


## 3.2. Environmental Selection

After combining with the offspring, we need to update the population and the assistant archive by environmental selection, namely, maintain the population size to a certain number, shown in Algorithm2. There is one major difference between the update process of the population and the archive. Specifically, there are two steps. Firstly, we need to calculate the dominance ranking information and crowding distance of the population. Secondly, if the number of nondominated solutions exceeds N, then we truncate it to N according to crowding distance; otherwise, we will firstly choose all nondominated solutions and then select other solutions by crowding distance to make sure the population size is equal to N.Notably, for the main population, we use modified dominance relationship. That is, a feasible solution dominates an infeasible solution; if two solutions are feasible, then we use objective values to calculate the dominance relationship. As for the assistant archive, we do not consider whether the solution is feasible or not. The calculation of the dominance relationship is the same as the traditional ones.Algorithm 2: Environmental selection.
Input: Joint population JointPop, population size NOutput: Updated population Pop1Ranking⟵NondominatedSortJointPop2CrowdDis⟵CalCrowdDisJointPop3NumNondominated←numberRanking==14IfNumNondominated>Nthen5Pop⟵JointPopRanking==16Pop⟵PopCrowdDis1:N7else8Pop⟵JointPopRanking==19Pop⟵Pop∪PopCrowdDis1:N−NumNondominated10
End If


## 3.3. Solving HRES by CMOEA-c

The main problem to solve HRES problem by EMO algorithms is to encode a solution and design the mutation strategies. Since the HRES model in the work is complex, we use a structure to represent the solution, which can be seen in Figure4.Figure 4
Illustration of solution encoding method and the variable type.As we can see from Figure4, there are five parts describing a solution for an HRES. The first two parts indicate the installed information of an HRES, including whether to install the equipment or not and the installed capacity. Specifically, 0 means that the HRES does not select to install this equipment, and vice versa. Besides, the running state of this HRES is determined by the first four parts, where ESS running state and DE running state participate. Notably, some instrumental variables can help to calculate the objective function values but do not take part in the mutation, which are stored in the final part of the solution, e.g., wind power output, photovoltaic power output, and electricity prices. Specifically, the values of these variables change when the equipment select state and installed capacity change.As we can see from Figure4, there are several variable types in a solution for an HRES. Thus, simply applying the same mutation strategy to evolve the solution is low-efficient and unreasonable. To accelerate the searching process, we divide them into several parts and perform different mutation strategies. Specifically, for the equipment select states, we use a small mutation probability pm=0.1 because the change of equipment select state will significantly affect the running state of an HRES. In addition, for mixed-integer variables, we will perform integrity checking after the mutation to ensure the solution is feasible. The mutation probabilities for mixed-integer variables and continuous variables are 0.5 and 1, respectively.


## 4. Experiments

### 4.1. Parameter Setting

To examine the performance of CMOEA-c, we choose SRA [20] and SPEA2+pf (SPEA2+ [28] with penalty function) as the competitor algorithms. Specifically, SRA is the most representative algorithm using stochastic ranking to deal with the constraints; SPEA2+ is chosen as the latest MOEA where the penalty function is added to each objective directly. All parameters are set to default values according to the original paper for fairness. For all algorithms, population size is 100 and the number of function evaluation is 20000. Each experiment is run for 31 times and the mean value is adopted for comparison and presentation. The parameters of this HRES are listed in Table 1. Besides, the generation power of the wind turbine and photovoltaic is related to local weather, which is shown in Figure 5. Moreover, the purchasing price and selling price of electricity are given as well.Table 1
The parameter values of all equipment used in HRES.
EquipmentUnit cost investmentUnit cost maintenanceMin capacityMax capacityLifetimeWind turbine55501005Photovoltaic140.1010000 (m2)25Energy storage system30.101009Diesel generator20000.0505020Power grid———10000 (kW)—Figure 5
Running data of HRES in this study. (a) Wind speed and solar radiation. (b) User load and electricity price.
(a)(b)


### 4.2. Performance of the Proposed Algorithm

To examine the performance of CMOEA-c, we choose two constraint EMO algorithms as the competitors. It is worth mentioning that all experiments are executed 31 times independently. We choose the mean result among 31 times to present, which is shown in Figure6.Figure 6
Pareto fronts obtained by CMOEA-c, SRA, and SPEA2+pf.As we can see from Figure6, the Pareto front obtained by CMOEA-c is better than that of SRA. Moreover, the result obtained by SPEA2+pf is far away from the true Pareto front. This is because directly adding penalty function to objective functions cannot provide effective information to lead the search. As a result, there is a large probability for SPEA2+pf to get into the local optimal solution in the early stage of the algorithm run.Compared to SRA, CMOEA-c got better results. This is because the introduction of the assistant archive can help to explore the whole decision space. As we mentioned in Section3, since the feasible regions are generally separated, once the constraint population converges to the optimal solution, the archive will keep search without considering the constraints. However, there is no such mechanism in SRA to help jump from one feasible region to another. Therefore, CMOEA-c can obtain better results.


### 4.3. Analysis of the Obtained Result

To further analyse the result obtained by CMOEA-c, we use Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) [29] to pick the ideal solution as the final optimal result. Other approaches like knee point [30, 31] are also suitable for selecting satisfactory solutions. Specifically, the basic principle of TOPSIS is to sort solutions by calculating the distances between the evaluating solution and the optimal and the worst solutions. If the evaluating solution is closest to the optimal solution and farthest from the worst solution, it is the best; otherwise, it is not an optimal solution. The running status of all components is presented in Figure 7.Figure 7
The equipment running status of HRES in this study. (a) Isolated microgrid. (b) Grid-connected microgrid.
(a)(b)As we can see from Figure7(b), when the HRES is connected with the grid, it is more likely to sell electricity to the grid when the electricity purchasing price is high. This is because the system can minimize the running cost in this way. It is worth mentioning that wind turbine power generation is very close to electricity, and thus other components of the HRES are running with a low maintenance cost. In addition, when the HRES is isolated from the main grid, it needs to balance the power supply and demand all the time. To minimize the running cost of diesel generator and energy storage system, renewable energy generation (wind power and photovoltaic) is matched with the electricity load as much as possible as we can see from Figure 7(a). In conclusion, the proposed HRES model is effective which can be used to optimize the configuration in the designing stage. Moreover, our proposed CMOEA-c can effectively and efficiently solve HRES problems with nonlinear parts.


## 4.1. Parameter Setting

To examine the performance of CMOEA-c, we choose SRA [20] and SPEA2+pf (SPEA2+ [28] with penalty function) as the competitor algorithms. Specifically, SRA is the most representative algorithm using stochastic ranking to deal with the constraints; SPEA2+ is chosen as the latest MOEA where the penalty function is added to each objective directly. All parameters are set to default values according to the original paper for fairness. For all algorithms, population size is 100 and the number of function evaluation is 20000. Each experiment is run for 31 times and the mean value is adopted for comparison and presentation. The parameters of this HRES are listed in Table 1. Besides, the generation power of the wind turbine and photovoltaic is related to local weather, which is shown in Figure 5. Moreover, the purchasing price and selling price of electricity are given as well.Table 1
The parameter values of all equipment used in HRES.
EquipmentUnit cost investmentUnit cost maintenanceMin capacityMax capacityLifetimeWind turbine55501005Photovoltaic140.1010000 (m2)25Energy storage system30.101009Diesel generator20000.0505020Power grid———10000 (kW)—Figure 5
Running data of HRES in this study. (a) Wind speed and solar radiation. (b) User load and electricity price.
(a)(b)


## 4.2. Performance of the Proposed Algorithm

To examine the performance of CMOEA-c, we choose two constraint EMO algorithms as the competitors. It is worth mentioning that all experiments are executed 31 times independently. We choose the mean result among 31 times to present, which is shown in Figure6.Figure 6
Pareto fronts obtained by CMOEA-c, SRA, and SPEA2+pf.As we can see from Figure6, the Pareto front obtained by CMOEA-c is better than that of SRA. Moreover, the result obtained by SPEA2+pf is far away from the true Pareto front. This is because directly adding penalty function to objective functions cannot provide effective information to lead the search. As a result, there is a large probability for SPEA2+pf to get into the local optimal solution in the early stage of the algorithm run.Compared to SRA, CMOEA-c got better results. This is because the introduction of the assistant archive can help to explore the whole decision space. As we mentioned in Section3, since the feasible regions are generally separated, once the constraint population converges to the optimal solution, the archive will keep search without considering the constraints. However, there is no such mechanism in SRA to help jump from one feasible region to another. Therefore, CMOEA-c can obtain better results.


## 4.3. Analysis of the Obtained Result

To further analyse the result obtained by CMOEA-c, we use Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) [29] to pick the ideal solution as the final optimal result. Other approaches like knee point [30, 31] are also suitable for selecting satisfactory solutions. Specifically, the basic principle of TOPSIS is to sort solutions by calculating the distances between the evaluating solution and the optimal and the worst solutions. If the evaluating solution is closest to the optimal solution and farthest from the worst solution, it is the best; otherwise, it is not an optimal solution. The running status of all components is presented in Figure 7.Figure 7
The equipment running status of HRES in this study. (a) Isolated microgrid. (b) Grid-connected microgrid.
(a)(b)As we can see from Figure7(b), when the HRES is connected with the grid, it is more likely to sell electricity to the grid when the electricity purchasing price is high. This is because the system can minimize the running cost in this way. It is worth mentioning that wind turbine power generation is very close to electricity, and thus other components of the HRES are running with a low maintenance cost. In addition, when the HRES is isolated from the main grid, it needs to balance the power supply and demand all the time. To minimize the running cost of diesel generator and energy storage system, renewable energy generation (wind power and photovoltaic) is matched with the electricity load as much as possible as we can see from Figure 7(a). In conclusion, the proposed HRES model is effective which can be used to optimize the configuration in the designing stage. Moreover, our proposed CMOEA-c can effectively and efficiently solve HRES problems with nonlinear parts.


## 5. Conclusion

Microgrid is an effective tool to make better use of renewable energy. However, it is a tough task to determine the installed capacity of components, e.g., the number of wind turbine and the area of the photovoltaic cell. Thus, a hybrid renewable energy system (HRES) is proposed, which is generally nonlinear and large-scale. In addition, as more and more aspects are taken into consideration, an HRES problem needs to optimize more than one objective simultaneously. Therefore, traditional methods like linear programming are not suitable to solve this kind of problems.In this paper, we first proposed the mathematical model of a hybrid renewable energy system, which has nonlinear parts. We consider two objectives to optimize, one is to minimize building and daily running cost, and another is to minimize the rate of lack of electricity. To solve this problem, we also proposed a coevolutionary multiobjective algorithm. Specifically, we use an archive to help explore the whole decision space. To examine the effectiveness of our proposed algorithm, several experiments are conducted, which show that the proposed algorithm can effectively find the Pareto optimal front of HRES problems.We only consider a two-day (48 hours) energy management problem for HRES in this study. However, a longer period is necessary, e.g., one year. Such problems are large-scale which have more than 10000 decision variables. So far, it is really difficult to solve this issue with evolutionary algorithms [32, 33], which is our future work. On the other hand, the decision variables of the HRES problem studied in this work are highly correlated. Specifically, the selecting state can significantly affect other decision variables. For such a mixed-integer problem, we need to develop a more effective algorithm.



---

*Source: 8822765-2021-02-10.xml*