1. Introduction
Electrical distribution networks are entrusted with providing electricity services to the end users in medium- and low-voltage level in rural or urban areas [
1]. These grids are typically operated with a radial configuration to reduce investment, maintenance and operative costs [
2]. However, the radial configuration produces higher power losses in contrast to meshed configurations; also, the nodal voltage rapidly worsens, as the nodes are far from the substation [
3]. To mitigate these higher power losses, the literature proposes multiple approaches to know: (i) optimal placement of shunt capacitors [
4], (ii) optimal reconfiguration of the distribution grid [
5], (iii) optimal selection/substitution of the calibers of the conductors [
6,
7], (iv) optimal placement and sizing distributed generators [
8,
9,
10], among others. Each one of these approaches allow dealing with power losses minimization; nevertheless, the most effective approach for dealing with this power loss corresponds to the optimal placement and sizing of DGs since reductions higher than 50% have been reported for this methodology [
11].
The optimal placement and sizing of DGs in electric distribution networks is a complex and large-scale mixed-integer nonlinear programming (MINLP) problem. This MINLP structure of the optimization problem complicates the possibility of finding the global optimal solution due to the non-convexity shape of the solution space [
12]. For this reason, in this research, we propose a combination of a metaheuristic approach with a second-order cone programming (SOCP) formulation to address this problem with excellent numerical performance as will be presented in the results section.
Due to the importance of having mathematical optimization in distribution systems analysis, here, we propose a new hybrid optimization approach based on the discrete version of the sine–cosine algorithm, i.e., (DSCA) added to the SOCP formulation to solve the exact mixed-integer nonlinear programming (MINLP) formulation of the problem of the optimal location and sizing of DGs in AC distribution networks [
13]. This hybrid optimization approach called DSCA-SOCP is motivated by the following facts: (i) the exact MINLP structure makes it impossible to find the global optimal solution for this problem with the current optimization approaches even using metaheuristic; this situation occurs since the studied problem contains binary variables regarding the placement of the DGs and the continuous part associated with their sizing, which is formulated as an optimal power flow problem being non-convex due to the presence of trigonometric functions in its formulation where it is not possible to ensure global solution with non-convex methods [
14,
15]. The union of both problems (integer and nonlinear continuous) increases the possibility of branch and bound methods or metaheuristics to be stuck in local optimal solutions [
16]; and (ii) the conventional metaheuristic approaches to solve the MINLP problem deals with the optimal power flow problems using controlled random procedures [
8], which are inadequate approaches (they do not guarantee the global optimal solution); in opposition, the convex optimization allows to find it with duality zero gap [
17].
Based on the aforementioned problems with conventional metaheuristic approaches, we propose a hybrid DSCA-SOCP programming to solve the studied problem using a master–slave optimization strategy, where the master stage is entrusted with determining the subset of nodes where DGs will be located, and the slave stage solves the resulting optimal power flow problem to determine their optimal sizes. The main advantage of the proposed approach is that the SOCP programming ensures the global optimal solution for each nodal combination provided by the DSCA [
18], which implies that if the best subset of nodes is identified by the master stage, the global optimal solution for the problem of the optimal placement and sizing of DGs in AC distribution networks will be guaranteed (this will be confirmed in the results section) [
19].
The problem of the optimal placement and sizing of distributed generation in AC distribution networks to minimize active power losses in all the branches of the grid has been largely studied in the last two decades [
20]. Most of the proposed approaches in literature work with master–slave algorithms based on metaheuristic optimization techniques [
8]. Some of the recent approaches in this field of study are listed in
Table 1.
The common denominator of these approaches is that these references work with hybrid master–slave optimization approaches to solve the exact MINLP model in two stages, i.e., a discrete part of the algorithm is entrusted with determining the location of the DGs and the continuous part deals with the dimensioning problem via optimal power flow analysis [
21]. However, no evidence about the combination of the convex optimization approach for the continuous part and the discrete sine–cosine algorithm for the integer part has been found after the revision of the state-of-the-art, and this gap has been exploited in this paper as an opportunity of research.
Remark 1. In the revision of the state-of-the-art, only the methodologies called MINLP proposed in [9] and GAMS presented in [12] work with the exact model of the problem by implementing branch and bound in conjunction with interior point methods to solve the problem. However, due to the non-convexities of the solution space, these are stuck in local optimums. To avoid being stuck in local optimum solutions, our approach combines the efficiency of conic programming with easily implementable metaheuristic to find the global optimal solution of the problem using a master–slave optimization approach. The main advantage of the SOCP is that if the combination of the nodes where DGs will be located is fixed, the optimal sizing provided by the SOCP approach remains equal (repeatability property), which is not ensured with conventional metaheuristics used for optimal power flow analysis.
Based on the review of the state-of-the-art presented in the previous section, the main contributions of our proposal can be summarized as follows:
- ✓
The reformulation of the exact mixed-integer nonlinear programming model into a mixed-integer one by transforming its continuous, i.e., optimal power flow, into a convex formulation via second-order cone programming.
- ✓
The presentation of the discrete version of the sine–cosine algorithm to address the integer part of the MISOCP approach by using an integer codification that contains the nodal numbers as decision variables.
- ✓
The hybridization of the SCA and the SOCP programming has the capability of finding the global optimal solution with low computational effort in both test feeders studied. Numerical results show improvements regarding classical mataheuristic methods available in literature, including exact MINLP approaches.
It is worth mentioning that the proposed optimization approach deals with the optimal placement and sizing of DGS in AC distribution networks considering the load peak conditions by assuming that the distributed generators are fully dispatchable as recommended in [
9]. In addition, no considerations are made regarding the total distributed generation since we are interested in finding the best possible reduction in the active power losses in the distribution network without penetration limitations. Finally, we consider the possibility of installing three distributed generators since this is the most common assumption in literature [
32]. In addition, three simulations cases are analyzed: (i) the optimal location and sizing of the DGs considering unity power factor, (ii) variable power factor, and (iii) daily load and photovoltaic solar curves.
The remainder of this document is organized as follows:
Section 2 presents the exact mixed-integer nonlinear problem formulation of the optimal location and sizing of DGs in AC distribution networks with radial structure.
Section 3 presents the proposed hybrid optimization methodology with master–slave structure, where the master slave is entrusted with solving the location problem by implementing the discrete version of the sine–cosine algorithm, and the slave stage is entrusted with determining the optimal sizes of the DGs by using a SOCP formulation.
Section 4 presents the main features of the test feeders which are composed of 33 and 69 nodes, with radial structure and operated with 12.66 kV at the substation node.
Section 5 presents the numerical achievements of the proposed optimization approach regarding the optimal location and sizing of DGs with their corresponding analysis and discussion.
Section 6 shows the main concluding remarks as well as some possible future works derived from this research.
2. MINLP Formulation
The problem of the optimal location and sizing of distributed generation in AC distribution networks can be formulated as a mixed-integer nonlinear programming (MINLP) problem. The objective function of this problem corresponds to the minimization of the active power losses in the distribution network, which is subjected to a set of nonlinear constraints regarding active and reactive power balance equations, device capabilities and voltage regulation bounds, among others. Here, we present the MINLP formulation in the complex domain in order to simplify the proposed optimization approach that will be presented in
Section 3. The complete MINLP model is presented below.
Objective function: The objective function that represents the problem of the optimal placement and sizing of DGs in AC distribution networks corresponds to the total power losses caused by the current flow in all the branches of the network. This objective function is formulated as presented in Equation (
1).
where
is the objective function value,
and
are the voltage values (magnitude and angle) in the nodes
i and
j, respectively;
is the complex admittance value of the nodal admittance matrix that relates nodes
i and
j. Note that
represents the set that contains all the nodes of the network, and
represents the complex conjugate operator applied to the argument.
Set of constraints: The set of constraints that intervene in the problem of the optimal placement and sizing of DGs in AC distribution networks are described as follows:
where
is the apparent power generation in the slack node connected at bus
i,
corresponds to the apparent power generation provided by the DG connected at node
i, and
represents the apparent power consumption at node
i.
Expression (
3) is associated to the voltage regulation bounds in all the nodes of the network.
where
is the maximum deviation given by the regulatory policies, which is usually between
pu and
pu. Note that in the case of the substation,
pu.
The capacity of the existing and newly distributed generators is upper and lower bounded as follows:
where
which denotes the binary variable of the problem, which has a value of 1 if a DG is installed at node
i or 0. There is a limit to the number of DGs that can be installed in the system, which is given by (
7),
where
is the total number of distributed generators available for installation in the AC distribution network.
Remark 2. The structure of the optimization model (1) to (7) exhibits a nonlinear non-convex structure with the presence of binary variables regarding the location of the DGs in a particular node of the grid. However, the nonlinear structure of the power balance equations in (2) is the most challenging constraint since it does not guarantee the global optimum finding even if all the binary variable combinations are explored. Figure 1 summarizes the main characteristics of the MINLP model that represents the problem of the optimal placement and sizing of DGs in AC radial distribution networks.
To address the nonlinear part of the optimization model described in
Figure 1, we propose the reformulation of the nonlinear part of the model (i.e., power balance equations) into a second-order cone equivalent, while the binary part of the model is addressed through a metaheuristic approach as is presented in the following section.
6. Conclusions and Future Works
The problem of the optimal location and sizing of DGs in AC distribution networks was explored in this research from the point of view of the hybrid optimization by proposing a master–slave optimization algorithm. The original MINLP model was rewritten as a MISOCP problem, where the master stage was entrusted with determining the optimal location of the DGS (i.e., discrete optimization problem), while the slave stage is entrusted with solving the sizing problem, i.e., the optimal power flow problem. The master stage was addressed with a new formulation of the sine–cosine algorithm in its discrete form, while the slave stage was formulated as a SOCP problem. The main advantage of using convex optimization for the optimal sizing of the DGs is that this approach guarantees global optimal solution for each nodal combination provided in the master stage.
Numerical simulations demonstrate that the proposed hybrid DSCA-SOCP approach allowed reaching the global optimal solution for both test feeders, which implies power loss reductions to about and for the 33- and 69-node test feeders, respectively. It was possible to establish that those solutions are indeed the global optimal ones for the test feeders considered since an exhaustive approach was made, i.e., the evaluation of the complete solution space: this has been demonstrated.
Evaluations considering active and reactive power in the distributed generation for both test feeders demonstrates that apparent power injections improve the grid performance by reducing grid power losses more than 90% for two or three distributed generators, with voltage regulation lower than 1.00% in the case of installing three distributed generators. In addition, the possibility of installing photovoltaic generation considering daily production and demand curves was tested in the 69-bus test feeder for the DSCA-SOCP approach and MINLP solvers available in GAMS, where it was observed that the proposed approach allows reducing daily energy losses by about , while GAMS solvers are stuck in local optimal solutions with reductions lower than 25%, which demonstrates the efficiency of the proposed optimization for installing renewable energy resources in AC distribution networks.
Regarding processing times, both test feeders have been solved using less than 600 s. The time consumed for our approach illustrates the efficiency to solve the complex MINLP formulation by using an MISOCP equivalent with capabilities of optimal finding after 100 consecutive evaluations.
Lastly, the following researches can be derived from this proposal: (i) the application of the proposed MISOCP model to the problem of voltage stability improvement in distribution networks by including renewable distribution generation; (ii) the solution of the MISOCP model with branch and bound methods to guarantee the global optimum finding without requiring consecutive evaluations and statistical tests; and (iii) to propose a MISOCP formulation for the problem of the optimal location and selection of battery energy storage systems and distributed generators in AC distribution networks, including devices’ costs during the planning horizon.