Next Article in Journal
Alternative Fuels Substitution in Cement Industries for Improved Energy Efficiency and Sustainability
Next Article in Special Issue
Enhanced Density Peak-Based Power Grid Reactive Voltage Partitioning
Previous Article in Journal
Emerging Parameters Extraction Method of PV Modules Based on the Survival Strategies of Flying Foxes Optimization (FFO)
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Efficient Integration of Fixed-Step Capacitor Banks and D-STATCOMs in Radial and Meshed Distribution Networks Considering Daily Operation Curves

by
Oscar Danilo Montoya
1,*,
Walter Gil-González
2 and
Jesus C. Hernández
3,*
1
Grupo de Compatibilidad e Interferencia Electromagnética (GCEM), Facultad de Ingeniería, Universidad Distrital Francisco José de Caldas, Bogotá 110231, Colombia
2
Department of Electrical Engineering, Universidad Tecnológica de Pereira, Pereira 660003, Colombia
3
Department of Electrical Engineering, University of Jaén, Campus Lagunillas s/n, Edificio A3, 23071 Jaén, Spain
*
Authors to whom correspondence should be addressed.
Energies 2023, 16(8), 3532; https://doi.org/10.3390/en16083532
Submission received: 19 March 2023 / Revised: 17 April 2023 / Accepted: 17 April 2023 / Published: 19 April 2023
(This article belongs to the Special Issue Voltage Stability Analysis in Power Systems II)

Abstract

:
The problem regarding the optimal integration of efficient reactive power compensation in radial and meshed distribution networks using fixed-step capacitor banks and distribution static compensators (D-STATCOMs) is addressed in this research paper by proposing a master–slave optimization methodology. Radial and meshed distribution topologies are considered for the grid structure while including variable active and reactive demand curves. An economic analysis is performed, considering the net present value of the optimization plan, as well as the costs of energy losses and the capacitor banks’ acquisition, installation, and operation. In the case of the D-STATCOMs, an annualized costs analysis is presented. In the master stage, the discrete version of the generalized normal distribution optimization (GNDO) algorithm selects the nodes and the sizes of the capacitor banks. In the slave stage, the successive approximations power flow approach is implemented. Numerical results in the IEEE 33-bus grid (with both radial and meshed topologies) and the IEEE 85-bus grid (with a radial configuration) demonstrated the proposed master–slave optimization’s effectiveness in minimizing the project’s expected net present value for a planning period of five years. Moreover, a simulation in the IEEE 69-bus grid under peak operation conditions showed that the GNDO approach is an excellent optimization technique to solve the studied problem when compared to combinatorial and exact optimization methods. In addition, numerical validations considering D-STATCOMs in the IEEE 85-bus grid confirmed the effectiveness and robustness of the GNDO approach in addressing problems associated with optimal reactive power compensation in medium-voltage distribution systems.

1. Introduction

The issue of improving the performance of distribution networks has attracted a lot of attention, from researchers to distribution network operators. This improvement implies an adequate management of the devices involved, such as load tap changing at the substation transformer and switched shunt compensators to regulate the voltage profiles and support reactive power. These approaches aim to enhance the operating conditions of distribution networks, e.g., reducing the energy losses costs [1,2,3]. Furthermore, this improvement can also include upgrading the networks by installing new devices, such as fixed-step capacitor banks and distribution static compensators (D-STATCOMs) [2,4,5]. One of the cheapest ways to compensate for reactive power in distribution grids is through the installation of fixed-step capacitor banks, which allows for reducing costs due to energy losses by around 13% [4,6].
Fixed-step capacitor banks and D-STATCOMs must be appropriately located in distribution networks, preventing an inadequate operation of the network (i.e., an increase in power losses). An adequate size must also be selected so as to not generate overvoltage (or a voltage decrease) [7]. Thus, the problem regarding the optimal location and sizing of fixed-step capacitor banks in distribution grids has been widely analyzed in the scientific literature. Some of these analyses are presented below.
In specialized literature, the optimal location and sizing of fixed-step capacitor banks in distribution systems has been widely addressed using classical mathematical models and metaheuristic strategies. Combinatorial algorithms such as a discrete version of the vortex search algorithm [7], fuzzy logic [8], the whale optimization algorithm [2], genetic algorithms [9,10], artificial neural networks [11], the spring search algorithm [12], simulated annealing [11], and the particle swarm optimization algorithm [13,14] have been proposed for solving this problem. In Ref. [15], a genetic algorithm combined with mathematical optimization was used to optimally locate and size fixed-step capacitor banks in distribution networks. The objective function involved minimizing the power losses and operating costs of the network. In Ref. [16], a heuristic methodology for the optimal sizing and placement of capacitor banks was proposed. This work considered the reduction of the total harmonic distortion, demonstrating that this methodology could minimize network costs to a greater extent than classical genetic algorithms. Other works have focused on improving voltage stability and, simultaneously, reducing the network power losses, as shown in [17,18]. The authors of [19] included a reconfiguration of distribution networks for the optimal allocation of capacitor banks via a fuzzy-based strategy. The study by [20] considered balanced and unbalanced distribution grids, as well as network reconfiguration and the optimal location of capacitor banks. The authors reduced total active power losses and bus voltage violation indices by employing a hybrid Big Bang-Big Crunch algorithm. The research by [21] presented a hybrid mathematical formulation for the optimal selection and placement of fixed-step capacitor banks in electrical distribution networks, focusing on minimizing the annual operating costs. The authors of [22] transformed the mixed-integer non-convex nonlinear model for the problem under study into a mixed-integer convex one using second-order cone relaxations. Numerical results demonstrated that the convex model found a better solution than the General Algebraic Modeling System (GAMS) software and the Chu and Beasley genetic algorithm.
Multi-objective formulations for the optimal location and sizing of fixed-step capacitor banks have also been proposed, which have usually implemented the Pareto front strategy. This method solves the problem using a set of trade-off solutions, and is known as the Pareto optimality of solutions. The main works in this regard are a multi-objective adaptive algorithm based on decomposition and differential evolution [23], a multi-objective formulation busing a two-stage immune algorithm [24], a hybrid configuration using weight-improved particle swarm optimization and the gravitational search algorithm [25], a multi-objective salp swarm optimizer [26], and multi-objective particle swarm optimization [1], among others. However, these works focus on optimizing technical and economic objectives for a short period of time and do not include the costs of the fixed-step capacitor banks, i.e., regarding their acquisition, operation, and maintenance, along with their useful life.
Similarly, the problem of the optimal location and sizing of D-STATCOMs in distribution systems has been widely studied. The authors of [27] used an artificial rabbits’ optimization algorithm for the optimal allocation of PV systems plus D-STATCOM in order to reduce the voltage regulation profile and the energy losses during the day, considering a load curve of 24 h. Similarly to previous authors, the researchers in [28] allocated PV systems plus D-STATCOM in distribution systems to minimize their energy losses and improve their voltage profile using hunter-prey-based algorithm. The authors of [29] located and dimensioned the D-STATCOMs optimally in the electrical distribution grids to minimize their operative costs based on a discrete-continuous version of the vortex search algorithm. The authors of [30] used a discrete-continuous version of the genetic algorithm in order to locate-size of the D-STATCOM in radial and meshed distribution networks for minimizing their annual operative costs. These costs involved energy losses and installation investment costs annually. The study by [5] tackled sizing and locating D-STATCOMs optimally in electrical distribution networks and implemented a stochastic mixed-integer convex model. This model was performed in a complex domain and included the stochastic nature of renewable energy and demand via multiple scenarios, defining different levels of generation/demand. Although all the previous works can find good solutions, none have considered the expected return rate of the distribution company, as well as the anticipated interest of the increase in energy losses costs in their objective functions. Therefore, in light of the state of the art, this research presents the following contributions:
i.
A general formulation of the problem regarding the optimal placement and sizing of fixed-step capacitor banks and D-STATCOM while considering a planning period different from one year, which includes the expected return rate of the distribution company, the anticipated interest of the increase in energy losses costs, and the increase in the operating expenses of the fixed-step capacitor banks. These aspects are formulated using the net present value as an objective function subjected to a set of mixed-integer nonlinear constraints, thus generating a general mixed-integer nonlinear programming (MINLP) model to represent the studied problem.
ii.
The application of the generalized normal distribution optimizer (GNDO) approach and the successive approximations power flow method within master–slave strategy to solve the proposed MINLP model, with the main advantage that different sets of candidate nodes are explored to identify the best solution regarding the final net present value. These simulations found that, as expected, an excessive injection of reactive power is not always adequate in distribution networks. Numerical results confirmed that the radial grid configuration of the IEEE 33-bus grid with two packs of capacitors reached the lowest objective function value. In contrast, for the meshed configuration, only one set of capacitor banks was enough to find the lowest value.
Within the scope of this research, it is worth mentioning that the expected active and reactive power consumptions correspond to the information provided by the distribution company for the terminals of the grid substation, which was obtained after multiple measuring and filtering processes. In addition, the selected objective function is the summation of the purchasing, installing, and operating costs of fixed-step capacitor banks and the annual costs of energy losses, using a net present value analysis for a planning horizon of five years, given that all of the required investments regarding capacitor banks are not recovered with a traditional one-year planning scenario [31].
Note that, in order to validate the effectiveness and robustness of the proposed GNDO approach in locating shunt reactive power compensators, additional simulation scenarios included the peak operating conditions of the IEEE 69-bus grid, the optimal placement and sizing of static distribution compensators in the IEEE 33- and 69-bus grids, and the optimal selection and location of fixed-step capacitor banks in the IEEE 85-bus grid with a radial configuration. These simulations include comparisons with combinatorial optimization methods available in the current literature and the exact MINLP tools of the GAMS software.
This study is organized as follows. Section 2 presents the exact formulation of the optimal location and sizing of fixed-step capacitor banks in electrical distribution networks. Section 3 presents the proposed master–slave optimization model. Section 4 describes the radial and meshed test systems implemented, along with their daily operation curves. Section 5 shows the proposed optimizer model’s primary results and analysis. Finally, the main conclusions of this research, as well as some future works, are presented in Section 6.

2. Exact Mathematical Modeling

The efficient integration of fixed-step capacitor banks can be expressed as a mixed-integer nonlinear programming (MINLP) model belonging to the family of mixed-integer non-convex optimization methods. The decision variables regarding the nodal location and size of the fixed-step capacitors are binary. The power flow variables (i.e., power generation, voltages, and currents, among others) are in the real-variable domain. The MINLP model for the efficient reactive power compensation in radial and meshed distribution networks is detailed below.

2.1. Objective Function

The main idea behind integrating fixed-step capacitor banks in distribution grids is to obtain a positive net profit within an expected planning period, i.e., to recover the initial purchasing, installing, and maintenance costs of the capacitor banks, along with an annual reduction in total grid energy losses costs. The objective function for this research corresponds to the net present value (NPV) associated with the energy losses costs for five years, added to the purchasing, installing, and operating costs of the fixed-step capacitor banks. Each one of the objective function’s components is presented below.
f 1 = C k W h T y Y 1 + i e 1 + i r y i N j N h H v i h Y i j v j h cos δ i h δ j h θ i j Δ h ,
f 2 = i H c C C c purc Q i c + C c ins + C c ope T c y Y 1 + i o 1 + i r y x i c ,
min f NPV = f 1 + f 2 ,
where  f 1  represents the component of the objective function regarding the net present value of the energy losses costs, and  f 2  is the objective function that defines the net present value of the purchasing, installing, and maintenance costs of the reactive power compensators. The sum of both components represents the objective function  f NPV . In addition,  C k W h  is the average cost of the energy losses; T means the number of days in a year;  v i h  and  v j h  correspond to the voltage variables at nodes i and j in the period h, which have angles  δ i h , and  δ j h , respectively;  Y i j  is the magnitude of the component of the nodal admittance matrix that relates to nodes i and j, which has an angle  θ i j Δ h  is the duration of each load value (daily load variable curve, i.e., typically 1 h);  i e  is the interest rate associated with the increase in the energy losses costs;  i o  defines the interest rate related to the increase in the operating (maintenance) costs of the fixed-step capacitor banks;  i r  corresponds to the expected return rate of the distribution company for each investment;  C c purc  defines the purchasing costs of a type-c fixed-step capacitor bank per unit of reactive power injection;  C c ins  is a fixed cost associated with the installation of a type-c capacitor bank unit in a particular node of the network; and  C c ope  defines the operating/maintenance costs associated with the type-c capacitor bank. The decision variable that establishes whether a type-c fixed-step capacitor bank should be installed at node i is  x i c , and  T c  is an integer parameter for the type of fixed-step capacitor bank to be used. Note that  N  defines the set that contains all the nodes of the network,  Y  is the set with the number of years of the planning period,  C  is the set containing all of the available fixed-step capacitor bank types, and  H  contains all the periods in day of operation.
Remark 1.
The component of the objective function regarding the expected costs of the energy losses, i.e., the component  f 1  defined in (1), is a nonlinear non-convex function due to the presence of the product between voltages and trigonometric functions [32]. In contrast, the component  f 2  defined in (2) is part of the mixed-integer convex functions due to its linear structure.

2.2. Set of Constraints

The problem regarding the optimal integration of shunt devices in single-phase distribution networks requires that some technical operative constraints be satisfied. These include active and reactive power balance, voltage regulation limits, and the number of shunt devices. The complete set of constraints is listed below.
p i h g p i h d = v i h j N Y i j v j h cos δ i h δ j h θ i j , h H , i N
q i h g p i h d + c C Q i c x i c = v i h j N Y i j v j h sin δ i h δ j h θ i j , h H , i N
p i g , min p i h g p i g , m a x , h H , i N
q i g , min q i h g q i g , m a x , h H , i N
v min v i h v max , h H , i N
c C i N x i c N cap ava ,
c C x i c 1 , i N
x i c 0 , 1 , c C , i N
where  p i h g  and  q i h g  are the active and reactive power generation outputs of a power source connected at node i in each period;  p i h d  and  q i h d  represent the active and reactive power consumption (constant power loads) at each node and in each period;  p i g , min  and  p i g , max  correspond to the lower and upper active power generation bounds assigned to the power source connected at node i q i g , min  and  q i g , max  correspond the lower and upper reactive power generation bounds assigned to the power source connected at node i v min  and  v max  are the minimum and maximum values assigned for the voltage variable at each node; and  N cap ava  is the number of capacitor banks available for installation.
Note that the set of constraints (4)–(11) can be understood as follows. Equations (4) and (5) are the active and reactive power balance equilibrium per node and period [33]. Inequality constraints (6) and (7) define the lower and upper bounds of the generation variables associated with the power sources connected at node i in any period. Box-type constraint (8) defines the well-known voltage regulation constraint applicable to medium-voltage distribution grids by regulatory commissions in each country [34]. Inequality constraint (9) defines the number of fixed-step capacitor banks available for installation in the entire distribution network. In contrast, inequality constraint (10) allows having a maximum of one type of fixed-step capacitor bank per node. Finally, (11) confirms the binary nature of the decision variable regarding the location or not of a set of fixed-step capacitor banks in a particular node of the network.
Remark 2.
The set of constraints (4)–(11) defines a mixed-integer non-convex solution space due to nonlinear constraints regarding the active and reactive power balance per node and period described in (4) and (5) [35].
To solve the proposed optimization models (1)–(11), the current literature recommends the application of master–slave optimization methods based on hybrid formulations [20]. These use combinatorial optimizers for the integer (binary) part of the optimization model, and power flow methods for solving the continuous part [21]. The following section details the application of the proposed GNDO approach.

3. Proposed Master–Slave Optimizer

A master–slave optimization methodology is proposed to deal with the problem regarding the efficient integration of fixed-step capacitor banks in distribution grids with radial and meshed configurations. The master stage defines the set of binary variables (i.e., the values of  x i c ) per node and capacitor type. The slave stage solves the power flow problem while considering the insertion of the capacitor banks provided by the master stage. It is worth mentioning that, in the proposed strategy, the master stage corresponds to the GNDO approach using a discrete codification, and the slave stage involves the successive approximations method. In addition, note that,
i.
with the master stage using a discrete codification, it is possible to obtain the value of the  f 2  component of the objective function, i.e., the purchasing, installation, and maintenance costs of the fixed-step capacitor banks;
ii
the slave stage determines the expected energy losses costs of the network for the planning period, as these depend on the expected demand behavior and the values regarding the active and reactive power consumption per node.
The main characteristics of the master and slave components of the proposed solution methodology are detailed below.

3.1. Slave Stage: Successive Approximations Power Flow Approach

In the current literature, multiple specialized power flow algorithms have been reported for addressing the nonlinearities in Equations (4) and (6) via numerical methods [36]. An efficient power flow method for radial and meshed distribution networks has been proposed in the literature [37]. This approach is a generalization of the classical backward/forward power flow method using nodal admittance matrices, which was named the successive approximations method due to its similarities with the classical Gauss–Seidel power flow approach. The successive approximations power flow method belongs to the family of derivative-free power flow methods, implying that its convergence is linear. On the other hand, derivative-based power flow methods converge quadratically, as is the case of the Newton–Raphson approach [38]. The successive approximations method is efficient regarding processing times, as only one inverse matrix is used during all solution processes. This is not true for derivative-based approaches [39].
The iterative power flow formula for solving Equations (4) and (6) is defined in the complex domain as shown in (12).
V d h m + 1 = Y d d 1 diag 1 V d h m , S d h S c h + Y d g V g h , h H
where m is the iterative counter,  V d h  is a complex vector containing the voltage variables in all of the demand nodes per period;  V g h  corresponds to a vector that contains the voltage values in the slack source;  Y d d  is a square matrix associated with the admittance relations between demand nodes;  Y d g  is a rectangular matrix that contains the complex relations between the demand and slack nodes;  S d h  is a vector containing the set of constant demand power loads per node and period; and  S c h  corresponds to the vector of complex power injections in the selected nodes where capacitors must be placed. Note that  X  denotes the application of the conjugate operator to the complex vector  X .
Remark 3.
Note that the vector  S c h  contains the variables that relate the master stage to the slave stage, as the master stage defines the set of nodes and capacitor sizes. This is fixed in the slave stage to solve the power flow problem with the recursive formula (12).
The convergence criterion applied to the power flow formula in (12), as recommended by the authors of [37], is the error between two consecutive voltage iterations, i.e.,
max h H | V d h m + 1 | | V d h m | ϱ ,
where  V d h 0  corresponds to the vector with the initial voltage values, which are set as equal to the voltage at the substation bus (i.e.,  V g h ). In addition,  ϱ  is the maximum tolerance error, set as  1 × 10 10  [39].
Once the power flow formula (12) has reached the desired convergence in (13), the expected grid power losses can be calculated as follows:
f 1 = C k W h T y Y 1 + i e 1 + i r y h H V h Y V h ,
where  V h  is the vector containing the voltage profiles of the distribution network, including the slack source per period (i.e.,  V h = V g h V d h ), and  Y  is the nodal admittance matrix of the distribution network under analysis.

3.2. Master Stage: The Generalized Normal Distribution Optimizer (GNDO)

The GNDO approach is a recently developed combinatorial optimization method inspired by the statistical properties of a Gaussian distribution. It was originally proposed by the authors of [40] to solve the problem regarding the parametric estimation of photovoltaic modules. The main advantage of the GNDO approach is that its exploration and exploitation rules do not require any special adjustment parameter. It begins the exploration of the solution space with a random population that evolves with simple rules [41]. The general structure of a Gaussian distribution is defined in (15).
f x = 1 2 π δ exp x μ 2 2 δ 2 ,
where x is a set of variables associated with the distribution probability, which is randomly generated. These variables are defined by the location parameter  μ  and the scaling parameter  δ  [41]. From Equation (15), it can be noted that the parameters  δ  and  μ  are the key factors in the generation of the Gaussian distribution, the former being associated with the standard deviation and the latter with the mean value, respectively [40].
Remark 4.
Note that the Gaussian distribution formula in (15) allows defining the initial population, i.e., the set of initial solutions, which takes the following form:
x k t = 5 , i , , 15 | 1 , c , , 6 ,
where the dimension of  x k t  is a  1 × N cap ava , corresponding to a discrete representation of the  x i c . In the potential solution presented in (16), it is observed that a type-1 capacitor is located at node 5, a type-c one at node i, and a type-6 one at node 15. In addition, k denotes the position of the solution individual in the population composed of  N s  vectors, as in (16).
It is worth mentioning that, with the codification presented in (16), the second component of the objective function  f 2  is obtained, i.e., the purchasing, installation, and operating costs of the fixed-step capacitor banks, which, for example, in (16), implies that  x 5 , 1 x i c , and  x 15 , 6  are activated. The remainder of binary variables is maintained at zero.
Considering the general codification of a potential solution to the studied problem, the local and global searches through the solution space with the GNDO approach are detailed below.

3.2.1. Local Search Characteristic: Exploitation of the Solution Space

In this stage, the GNDO approach intensifies its exploration in a local area around the best current solution found in order to accelerate its speed of convergence [42]. The general evolution formula for this local exploration is defined in (16).
v k t = μ k + η δ k , k = 1 , 2 , , N s .
where  η  is defined as a penalty factor;  δ k  corresponds to the generalized standard variation;  μ k  means the generalized mean position; and  v k t  is a potential solution individual. Each of the terms in (17) is calculated as follows:
μ k = 1 3 x k t + x best t + U ,
δ k = 1 3 x k t μ k 2 + x best t μ k ) 2 + U μ k 2 1 2 ,
η = log λ 1 cos 2 π λ 2 , i f a b log λ 1 cos 2 π λ 2 + π , i f a > b
where a, b λ 1 , and  λ 2  are randomly generated in the interval  [ 0 , 1 ]  with a uniform distribution;  x best t  represents the best solution reached until iteration t; and U is a vector associated with the average position of all the individuals in the current population at iteration t.
U = 1 N s k = 1 N s x k t ,
Remark 5.
Once the potential solution  v k t  is generated using Equations (18) to (20), as presented in (17), a feasibility check is implemented. This implies that
v k l t = v k l t , i f x l min v k l t x l max round x l min + r x l min x l min Otherwise ,
where  x l max  and  x l min  are the minimum and maximum limits allowed for the decision variable in the  l t h  position.

3.2.2. Global Search Characteristic: Exploration of the Solution Space

The main idea behind using a global exploration characteristic for combinatorial optimization methods is the possibility of allowing them to escape from locally optimal solutions by exploring new regions of the solution space [43]. The general formula to implement global exploration in the GNDO approach is defined below [40].
v k t = x k t + β λ 3 v 1 + 1 β λ 4 v 2 ,
where  λ 3  and  λ 4  are two randomly generated numbers between 0 and 1 that are subject to a normal distribution, and  β  is a calling and adjustment parameter generated between 0 and 1 with a uniform distribution. In addition,  v 1  and  v 2  are two trail vectors calculated as defined in (24) and (25).
v 1 = x k t x j t , i f F f x k t < F f x j t x j t x k t , Otherwise ,
v 2 = x i t x m t , i f F f x i t < F f x m t x m t x i t , Otherwise ,
where the values of positions i, j, and m are randomly generated between 1 and the number of potential solutions (i.e.,  N s ), with the main characteristic that all of them must be different from each other and the current solution located at position k. In addition,  F f x k t  defines the value of the fitness function, considered as an adaptive representation of the objective function [41]. Note that, in order to maintain the feasibility of the solution space regarding the minimum and maximum permitted values for the decision variables, the revision formula (22) is applied to the potential solution  v k t  in (23).
Finally, the following evolution rule is applied to ensure that the best solution for the current population will be maintained:
x k t + 1 = v k t , i f F f ( v k t ) F f ( x k t ) x k t , Otherwise .

3.2.3. General Implementation of the Master–Slave Optimization Approach

To illustrate the general implementation of the solution approach, a flow diagram is presented in Figure 1.
Remark 6.
The main characteristic in Figure 1 is the intrinsic relationship between the master and slave stages, as each  v k t  generated with the GNDO approach requires evaluation by the power flow problem to determine the total costs of the power losses using the slave stage [44].

4. Test Feeder Characterization

To validate the proposed GNDO approach in combination with the successive approximations power flow method to locate and size fixed-step capacitor banks while aiming to reduce the expected annual operating costs associated with energy losses and including the purchasing, installing, and operating costs of reactive power compensators, the IEEE 33-bus grid with radial and meshed configurations was employed. Figure 2 depicts the electrical configurations of this test feeder.
Data regarding branches and peak load conditions for the IEEE 33-bus grid are presented in Table 1.
In addition, to evaluate the effect of load variations, Figure 3 presents the daily variations regarding the active and reactive power profiles.
To evaluate the objective function regarding expected energy losses costs during the planning period, as well as the purchasing, installation, and operating costs of the fixed-step capacitor banks, the parameters listed in Table 2 are considered.
Note that the step-size per capacitor is 100 kvar, and the maximum reactive power injection per node is 1000 kvar, i.e., from 0 to 10 banks in parallel per node.

5. Numerical Results

For the computational implementation of the proposed master–slave optimization approach, the MATLAB software (version 2021b) was employed on a PC with an AMD Ryzen 7 3700  2.3  GHz processor and 16.0 GB RAM, running a 64-bit version of Microsoft Windows 10 Single Language. The GNDO and the successive approximations power flow method were implemented with our developed scripts. For the simulations, the possibility of installing 0 to 5 sets of capacitor banks is tested by assuming that only a pack can be installed per node.
Note that the parametrization of the GNDO approach considered a population size of 10 individuals, 100 consecutive repetitions, and 1000 iterations, with a local stopper of 100 iterations without improvements in the objective function value.

5.1. Results Obtained for the Radial Grid Configuration

Table 3 presents the numerical simulations for the IEEE 33-bus grid with a radial topology. In this simulation, each node selected to locate a reactive power compensator must have at least one pack of capacitors installed.
The numerical results in Table 3 show that:
i.
An increase in the number of capacitors does not guarantee that the objective function will continue to decrease; for the radial version of the IEEE 33-bus grid with the available set of capacitors (steps of about 100 kvar), it is observed that the option with two capacitors at nodes 13 and 30 with sizes of about 200 and 500 kvar allows for the best reduction concerning the benchmark case (i.e.,  13.8534 % ). In contrast, all the other options report lower impacts in the final objective function value.
ii.
Note that from three to five sets of capacitor banks, the objective function deteriorates with the increase in capacitors, which confirms that, depending on the electrical characteristics (i.e., grid topology and total active and reactive power consumptions), each distribution network has an optimal number regarding compensation devices, and, if this number is exceeded, the final solution becomes sub-optimal. Note that the expected improvement in the objective function is  13.0122 %  when five capacitors are installed, showing that the expected gain has deteriorated about  0.8412 %  concerning the best solution reported in Table 3.
iii.
The main characteristic of the list of solutions in Table 3 is that the most interesting node to install capacitor banks is node 30, which appears in all of the solutions, with sizes between 400 and 600 kvar (thus being the node with the highest penetration regarding reactive power in all solutions). In addition, the expected penetration regarding reactive power varies from 600 to 700 kvar.
Regarding processing times, it is worth mentioning that the last column in Table 3 evidences that the processing times required for solving the MINLP model via the proposed GNDO approach range between 45 and 69 s to reach a solution, depending on the number of nodes analyzed. However, it is noted that these times can be considered minimal due to the enormous dimensions of the solution space for this optimization problem.

5.2. Results Obtained for the Meshed Grid Configuration

Table 4 presents the numerical simulations for the IEEE 33-bus grid with a meshed topology.
The numerical results in Table 4 show that:
i.
In the case of the meshed version of the IEEE 33-bus grid, the best solution is reached by only installing a capacitor bank of 600 kvar at node 30, which allows for a reduction of about  7.6881 %  concerning the benchmark case. However, this solution is very closely followed by the solution with two capacitor banks at nodes 30 and 32, with sizes of 400 and 200 kvar, which allows for a reduction of about  7.5779 %  with respect to the benchmark case, i.e., a slight variation of  0.1102 %  between both solutions.
ii.
As in the radial version of the IEEE 33-bus grid, node 30 seems to be the most attractive node to install a set of capacitor banks; in all solutions, this node appears with the highest value of reactive power injection, which implies that, for this test feeder, node 30 is key for optimal reactive power compensation, regardless of the grid topology under analysis.
iii.
The difference between the best solution with one pack of capacitors at node 30 and the solution with five capacitors is about USD  5132.0671 , which confirms that an increase in the number of fixed-step capacitor banks is not necessarily the most economical solution, since it depends exclusively on the grid topology, the number of nodes, and the demand behavior.
Regarding processing times, it is observed that, on average, the solution times required by the GNDO approach in the meshed configuration are lower than 48 s, and lower than the times taken by the radial topology. However, this is an expected behavior, given that, for meshed grid configurations, the successive approximations power flow method takes fewer iterations in comparison with the radial topology, which finally translates into reduced processing times.

5.3. Complementary Analysis

This subsection presents additional numerical validations to demonstrate the efficiency of the proposed GNDO approach for selecting and installing reactive power compensators in distribution networks. These analyses include the following:
i.
Illustrating the energy losses behavior in the IEEE 33-bus grid with radial and meshed configurations.
ii.
A comparative analysis of the GNDO approach in the IEEE 69-bus grid with different combinatorial optimizers regarding the optimal selection and location of fixed-step capacitor banks for power losses minimization while considering peak load operating conditions.
iii.
A comparative analysis in the radial versions of the IEEE 33-and 69-bus grids considering static distribution compensators (D-STATCOMs) with respect to literature reports.
iv.
An evaluation of the proposed master–slave approach in the IEEE 85-node test feeder with zero to five capacitors. These will be considered as new reference results in medium-size distribution networks for future optimization algorithms.

5.3.1. Energy Losses Behavior in the Radial and Meshed Versions of the IEEE 33-bus Grid

To illustrate the positive effect of the optimal integration of fixed-step capacitor banks in radial and meshed distribution networks, Figure 4a,b present the initial daily energy losses without capacitor banks, as well as the best solutions reported in Table 3 and Table 4.
The main characteristic of the daily energy losses behavior in Figure 4 is that the fixed reactive power injection effectively reduces the total grid power losses throughout the day, as observed in the difference between the benchmark curve and the optimal solution curves.

5.3.2. Optimal Selection and Location of Fixed-Step Capacitor Banks in the IEEE 69-bus Grid

To demonstrate that the proposed GNDO approach is an efficient optimization technique for integrating fixed-step capacitor banks, a comparative analysis with different combinatorial methods and exact optimization method is presented, using the IEEE 69-bus grid as a test feeder. The electrical configuration of this system and its branch load parameters are depicted in Figure 5 and Table 5, respectively.
Table 6 presents all of the numerical comparisons with the IEEE 69-bus grid for locating and sizing fixed-step capacitor banks in radial distribution grids. Note that this comparison is made while considering peak load conditions, as well as with the primary objective of minimizing the expected power losses.
In Table 6, the metaheuristic algorithms used for comparison are the gravitational search algorithm (GSA) [45], the two-stage method (TSM) [46], the teaching-based learning optimizer (TBLO) [47], and the flower pollination algorithm (FPA) [48], and the convex optimization method corresponds to the mixed-integer second-order cone programming (MI-SOCP) approach [22]. Only the GNDO and the MI-SOCP approaches found the best possible solution in the IEEE 69-bus grid when power losses were minimized under peak load conditions. Both methods found the same set of nodes (11, 18, and 31), with capacitor sizes of 300 kvar in the first two and 1200 kvar in the last one. Note that the remainder of metaheuristic algorithms are stuck in locally optimal solutions, which can be attributed to the large dimensions of the solution space, confirming that the GNDO approach based on a statistical formulation (Gaussian distributions) is an efficient tool to deal with complex MINLP models; as demonstrated in the previous sections, it is an excellent alternative to locate and size fixed-step capacitor banks in radial and meshed distribution grids.

5.3.3. Optimal Location and Sizing of D-STATCOMs in the IEEE 33- and 69-bus Grids

To confirm the effectiveness and efficiency of the proposed GNDO approach in defining the optimal location and sizing of reactive power compensators in electrical distribution networks, this subsection presents the application of this algorithm to the problem regarding the optimal placement and sizing of D-STATCOMs in the IEEE 33- and 69-bus grids with radial configurations.
For this comparison, the objective function considers the investment costs of D-STATCOMs ( z 1 ) and the operating costs associated with the energy losses ( z 2 ), considering a one-year period of study. Both functions are algebraically summed, as defined by  z cos t . The structure of the studied objective functions is presented below.
z 1 = T k 1 k 2 k N ω 1 q k comp 2 + ω 2 q k comp + ω 3 q k comp ,
z 2 = C k W h T h H k N m N Y k m v k h v m h cos δ k h δ m h θ k m Δ h ,
min z cos t = z 1 + z 2 ,
where  k 1  and  k 2  are positive constant parameters associated with the annualization of the investment costs of the shunt compensators, considering a planning period of 10 years [3 q k comp  is the nominal size of the shunt reactive power compensator located at node k; and  ω 1 ω 2 , and  ω 3  are the cubic, quadratic, and linear coefficients regarding the investment costs in shunt reactive power compensators.
The parameters used for evaluating the objective functions in (27) and (28) are listed in Table 7 [49]. Note that the remaining parameters were previously defined in Table 2.
For comparison, the optimization algorithms reported by the authors of [49] are used to validate the efficiency of the proposed GNDO approach for installing D-STATCOMs in distribution grids. These are the genetic algorithm combined with a particle swarm optimizer (GA/PSO), the vortex search algorithm (VSA), and two solvers available in the GAMS software: COUENNE and BONMIN. Table 8 lists the comparative results for the proposed GNDO approach and the literature reports regarding the optimal location and sizing of D-STATCOMs in distribution grids.
The numerical results in Table 8 show that:
i.
The proposed GNDO and the VSA approaches reach the exact solution value for the D-STATCOMs in both test feeders, with a final objective function value of about USD 98,497.90 for the IEEE 33-bus grid and USD 102,990.79 in the case of the IEEE 69-bus grid. On the other hand, the GA/PSO approach fails to find the optimal solution in the case of the IEEE 33-bus grid, with an additional investment of about USD 13.73. In contrast, for the IEEE 69-bus grid, the exact solution value is found by the GNDO and the VSA approaches.
ii.
The GAMS solvers confirm the nonlinearity and non-convexity of the exact MINLP model, and both solvers are stuck in locally optimal solutions for the IEEE 33-bus grid. The COUENNE solver finds a reduction of about  3.03 %  in the annual grid operating costs with respect to the benchmark case, while the BONMIN solver reaches a reduction of approximately  7.59 % . However, the main problem with these MINLP solvers is that they did not find a feasible solution for the optimal placement and sizing of D-STATCOMs in the IEEE 69-bus grid simulation scenario.
iii.
The processing times in the IEEE 33- and 69-bus grids with the proposed GNDO approach showed that, even though it has the same numerical behavior as the VSA, it reports better average processing times, being  11.93  s faster in the IEEE 33 bus grid and  31.51  s faster in the IEEE 69-bus grid. However, it is important to mention that both methods take less than 4 min to locate and size D-STATCOMs in radial distribution networks, whereas the GA/PSO approach takes more than 100 min in both cases. These long simulation times are associated with the fact that the GA selects the nodes where the D-STATCOMS must be located, while the PSO approach determines their optimal sizes. At the same time, the GNDO and VSA methodologies solve both problems using a continuous-discrete codification that allows for drastically reducing the required power flow solutions.
After locating and sizing D-STATCOMs in the IEEE 33- and 69-bus grids, the proposed GNDO approach confirmed its robustness and efficiency in solving problems regarding reactive power compensation in distribution networks, with notable numerical performance when compared to recent literature developments.

5.3.4. Optimal Location of Fixed-Step Capacitor Banks in the IEEE 85-bus Grid

The IEEE 85-bus grid is a medium-voltage distribution network with a radial configuration, operated with 11 kV in the substation located at bus 1. The electrical topology of this test feeder is depicted in Figure 6, and its electrical parameters are listed in Table 9.
Table 10 presents the numerical simulations for the IEEE 85-bus grid, considering the possibility of selecting zero to six nodes with shunt capacitors. In this simulation, each node selected to locate a reactive power compensator must have at least one pack of capacitors installed.
The numerical results in Table 10 reveal that:
i.
The maximum reduction in the expected net present value (NPV) is reached when five capacitor banks are installed in the distribution network. These are installed at nodes 12 (200 kvar), 29 (300 kvar), 48 (200 kvar), 60 (200 kvar), and 68 (200 kvar), which summarizes a total of 100 kvar of reactive power injection in the IEEE 85-bus grid, and thus allows for a reduction of about  28.2846 % , i.e., USD 181,871.6061.
ii.
Solutions containing three and four capacitors show a similar reduction in the expected NPV, both installing 1000 kvar in the form of fixed-step capacitor bank compensators. For three capacitors, these were installed at nodes 12 (200 kvar), 34 (400 kvar), and 60 (400 kvar), which allowed for a reduction of about  27.9174 %  in the objective function value with respect to the benchmark case. In the case involving four capacitors, these were assigned to nodes 12 (200 kvar), 35 (200 kvar), 40 (200 kvar), and 64 (400 kvar), which allowed for a reduction in the objective function value of about  27.9493 %  with respect to the benchmark case.
iii.
Solutions involving six shunt capacitor banks show that, for the IEEE 85-bus grid, the objective function tends towards saturation after five capacitors, given that, with six devices, the objective function starts to increase again. The reduction with six capacitors was about  28.1146 %  with respect to the benchmark case (i.e., USD 1093.0829), which is more expensive than the best solution found with five fixed-step capacitor banks. This is a significant result, as it shows that, for the IEEE 85-bus grid, after three shunt capacitors, the expected reduction in the NPV varies by less than 1%, which implies that the distribution company has a variety of reactive power compensation options to improve their NPV with similar reductions, i.e., between  27.9174 %  and  28.2846 % .
Regarding processing times, it is worth mentioning that implementing the GNDO approach took between  231.6172  s and  471.7108  s to solve the studied problem. This is a reduced processing time considering that only the solution space associated with the nodal selection varies from 84 (for one capacitor package) to 406,481,544 (for six capacitor packages) possible nodal options. In addition, the number of capacitor options per node varies from 10 (for one capacitor package) to 1,000,000 (for six capacitor packages), which implies that the dimensions of the integer part of the MINLP model change from a few hundred to trillions of options.

6. Conclusions and Future Work

The problem regarding the optimal placement and sizing of fixed-step capacitor banks in radial and meshed distribution networks was addressed in this study by applying a master–slave optimization technique. The master stage defined the nodes and the sizes of the fixed-step capacitor banks to be installed, employing the discrete version of the GNDO approach. This discrete configuration determines the purchasing, installing, and operating costs of the fixed-step capacitor banks. The slave stage evaluated each capacitor configuration provided by the master stage in order to determine the expected costs of the energy losses for the planning period. Numerical results in the IEEE 33-bus grid with radial and meshed configurations demonstrated that:
i.
For the radial configuration, the best solution reached by the proposed optimization approach involves two packs of capacitor banks at nodes 13 and 30 with sizes of 200, and 500 kvar, allowing for a reduction of about USD 64,937.8319 with respect to the benchmark case, i.e., a net improvement of about  13.8534 % . When the optimal solution (two capacitor banks) was compared with the solution involving five capacitor banks, a deterioration of about  0.8412 %  was observed in the objective function, which confirmed that the increase in number of fixed-step capacitor banks installed did not necessarily improve the expected net present value of the project.
ii.
In the case of the meshed configuration for the IEEE 33-bus grid, for only one set of capacitor banks installed at node 30, with an equivalent size of 600 kvar, the best reduction in the objective function value was found, i.e.,  7.6881 % . However, when the system was forced to install five sets of capacitors, the objective function was deteriorated by about  1.5869 %  with respect to the optimal solution. This confirmed that each distribution network topology could have a different number of capacitor banks which will allow for a better minimization of the objective function.
iii.
Regarding processing times, it was observed that, for the radial simulation, less than 69 s were needed to solve the studied problem with a different number of capacitor banks, whereas, in the meshed configuration, less than 48 s were required. The difference between both processing times is mainly attributable to the fact that, in radial configurations, more iterations are required to ensure the power flow convergence. This is in comparison with a meshed grid structure.
A comparative analysis between the proposed master–slave approach with combinatorial and exact optimization methods in the IEEE 69-bus grid with a radial configuration and peak load conditions confirmed that the GNDO algorithm is an efficient combinatorial optimization method supported by normal distributions to solve hard MINLP models, which opens the possibility of its extension to multiple engineering problems.
Numerical simulations employing the proposed GNDO approach to locate and size D-STATCOMs in the IEEE 33- and 69-bus grids with a radial structure confirmed the effectiveness of this algorithm compared to the GA/PSO and the VSA approaches, where less processing times were required. The exact solution of the VSA approach was found by the GNDO approach in both test feeders. In contrast, the GA/PSO approach, as well as the COUENNE and BONMIN solvers of the GAMS software, exhibited a locally optimal convergence in the IEEE 33-bus grid.
The application of the proposed master–slave approach to locate and select fixed-step capacitor banks in the IEEE 85-bus grid showed that, after three reactive power compensators were installed, the objective function was reduced by less than 1%. The best solution was found when five capacitors were installed, allowing for a reduction of about  28.2846 %  with respect to the benchmark case. In addition, the solution with six reactive power compensators showed that the objective function started to deteriorate, which confirmed that the best number of shunt capacitor banks for installation is five. However, due to the large dimensions of the solution space, more research will be required to confirm or disprove these results for the IEEE 85-bus grid.
Future works derived from this research could include the following: (i) a sensitivity analysis regarding the interest rates applied to the investment returns, energy losses, and operation costs, as well as with respect to capacitor bank sizes, allowing to find better solutions for each distribution network under analysis; (ii) the inclusion of uncertainties in the demand behavior, as well as the distinction between residential, industrial, and commercial users in the studied problem, by transforming the exact MINLP model into a mixed-integer convex model; and (iii) the combination between reactive power compensators with fixed and variable injection characteristics and active power compensators, i.e., dispersed generation for planning and operation studies in distribution networks that involve the GNDO approach.

Author Contributions

Conceptualization, methodology, software, and writing (review and editing): O.D.M., W.G.-G. and J.C.H. All authors have read and agreed to the published version of the manuscript.

Funding

This research was partially funded by the Council of Andalucía (Junta de Andalucía. Consejería de Transformación Económica, Industria, Conocimiento y Universidades. Secretaría General de Universidades, Investigación y Tecnología) through project ProyExcel 00381.

Data Availability Statement

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

Acknowledgments

To God, who opens the doors of scientific knowledge and enlightens us to achieve our goals.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Anilkumar, R.; Devriese, G.; Srivastava, A.K. Voltage and reactive power control to maximize the energy savings in power distribution system with wind energy. IEEE Trans. Ind. Appl. 2017, 54, 656–664. [Google Scholar] [CrossRef]
  2. Prakash, D.B.; Lakshminarayana, C. Optimal siting of capacitors in radial distribution network using whale optimization algorithm. Alex. Eng. J. 2017, 56, 499–509. [Google Scholar] [CrossRef]
  3. Gil-González, W. Optimal Placement and Sizing of D-STATCOMs in Electrical Distribution Networks Using a Stochastic Mixed-Integer Convex Model. Electronics 2023, 12, 1565. [Google Scholar] [CrossRef]
  4. El, M.A.; Abdel-Gwaad, A.F.; Farahat, M.A. Solving the capacitor placement problem in radial distribution networks. Results Eng. 2023, 17, 100870. [Google Scholar]
  5. Gil-González, W.; Montoya, O.D.; Grisales-Noreña, L.F.; Trujillo, C.L.; Giral-Ramírez, D.A. A mixed-integer second-order cone model for optimal siting and sizing of dynamic reactive power compensators in distribution grids. Results Eng. 2022, 15, 100475. [Google Scholar] [CrossRef]
  6. Ali, A.; Abbas, G.; Keerio, M.U.; Mirsaeidi, S.; Alshahr, S.; Alshahir, A. Multi-objective Optimal Siting and Sizing of Distributed Generators and Shunt Capacitors Considering the Effect of Voltage-dependent Nonlinear Load Models. IEEE Access 2023, 11, 21465–21487. [Google Scholar] [CrossRef]
  7. Gil-González, W.; Montoya, O.D.; Rajagopalan, A.; Grisales-Noreña, L.F.; Hernández, J.C. Optimal selection and location of fixed-step capacitor banks in distribution networks using a discrete version of the vortex search algorithm. Energies 2020, 13, 4914. [Google Scholar] [CrossRef]
  8. Parashar, S.M.; Leena, G.; Pande, M.; Singh, J. Dynamic Capacitor Placement To Mitigate Disaster in Distribution System: A Fuzzy Approach. In Proceedings of the 2019 International Conference on Power Electronics, Control and Automation (ICPECA), New Delhi, India, 16–17 November 2019; pp. 1–5. [Google Scholar]
  9. Szultka, A.; Małkowski, R. Selection of optimal location and rated power of capacitor banks in distribution network using genetic algorithm. In Proceedings of the 2017 18th International Scientific Conference on Electric Power Engineering (EPE), Kouty nad Desnou, Czech Republic, 17–19 May 2017; pp. 1–6. [Google Scholar]
  10. Soma, G.G. Optimal sizing and placement of capacitor banks in distribution networks using a genetic algorithm. Electricity 2021, 2, 187–204. [Google Scholar] [CrossRef]
  11. Abou El-Ela, A.A.; El-Sehiemy, R.A.; Kinawy, A.M.; Mouwafi, M.T. Optimal capacitor placement in distribution systems for power loss reduction and voltage profile improvement. IET Gener. Transm. Distrib. 2016, 10, 1209–1221. [Google Scholar] [CrossRef]
  12. Dehghani, M.; Montazeri, Z.; Dhiman, G.; Malik, O.; Morales-Menendez, R.; Ramirez-Mendoza, R.A.; Dehghani, A.; Guerrero, J.M.; Parra-Arroyo, L. A spring search algorithm applied to engineering optimization problems. Appl. Sci. 2020, 10, 6173. [Google Scholar] [CrossRef]
  13. Lee, C.S.; Ayala, H.V.H.; dos Santos Coelho, L. Capacitor placement of distribution systems using particle swarm optimization approaches. Int. J. Electr. Power Energy Syst. 2015, 64, 839–851. [Google Scholar] [CrossRef]
  14. Cao, B.; Li, W.; Zhao, J.; Yang, S.; Kang, X.; Ling, Y.; Lv, Z. Spark-based parallel cooperative co-evolution particle swarm optimization algorithm. In Proceedings of the 2016 IEEE International Conference on Web Services (ICWS), San Francisco, CA, USA, 27 June–2 July 2016; pp. 570–577. [Google Scholar]
  15. Riaño, F.E.; Cruz, J.F.; Montoya, O.D.; Chamorro, H.R.; Alvarado-Barrios, L. Reduction of losses and operating costs in distribution networks using a genetic algorithm and mathematical optimization. Electronics 2021, 10, 419. [Google Scholar] [CrossRef]
  16. Pérez-Abril, I. Capacitors placement in distribution systems with nonlinear load by using the variables’ inclusion and interchange algorithm. Dyna 2021, 88, 13–22. [Google Scholar] [CrossRef]
  17. Šarić, M.; Hivziefendić, J. Optimal Capacitor Placement in Distribution Network for Loss Reduction and Voltage Profile Improvement. In Proceedings of the 2019 18th International Symposium INFOTEH-JAHORINA (INFOTEH), East Sarajevo, Bosnia and Herzegovina, 20–22 March 2019; pp. 1–4. [Google Scholar]
  18. Asadi, M.; Shokouhandeh, H.; Rahmani, F.; Hamzehnia, S.M.; Harikandeh, M.N.; Lamouki, H.G.; Asghari, F. Optimal placement and sizing of capacitor banks in harmonic polluted distribution network. In Proceedings of the 2021 IEEE Texas Power and Energy Conference (TPEC), Virtually. 2–5 February 2021; pp. 1–6. [Google Scholar]
  19. Esmaeilian, H.R.; Fadaeinedjad, R. Distribution system efficiency improvement using network reconfiguration and capacitor allocation. Int. J. Electr. Power Energy Syst. 2015, 64, 457–468. [Google Scholar] [CrossRef]
  20. Sedighizadeh, M.; Bakhtiary, R. Optimal multi-objective reconfiguration and capacitor placement of distribution systems with the Hybrid Big Bang–Big Crunch algorithm in the fuzzy framework. Ain Shams Eng. J. 2016, 7, 113–129. [Google Scholar] [CrossRef]
  21. Montoya, O.D.; Moya, F.D.; Rajagopalan, A. Annual Operating Costs Minimization in Electrical Distribution Networks via the Optimal Selection and Location of Fixed-Step Capacitor Banks Using a Hybrid Mathematical Formulation. Mathematics 2022, 10, 1600. [Google Scholar] [CrossRef]
  22. Montoya, O.D.; Gil-González, W.; Garcés, A. On the Conic Convex Approximation to Locate and Size Fixed-Step Capacitor Banks in Distribution Networks. Computation 2022, 10, 32. [Google Scholar] [CrossRef]
  23. Liu, B.J.; Bi, X.J. Adaptive ε-constraint multi-objective evolutionary algorithm based on decomposition and differential evolution. IEEE Access 2021, 9, 17596–17609. [Google Scholar] [CrossRef]
  24. Huang, T.L.; Hsiao, Y.T.; Chang, C.H.; Jiang, J.A. Optimal placement of capacitors in distribution systems using an immune multi-objective algorithm. Int. J. Electr. Power Energy Syst. 2008, 30, 184–192. [Google Scholar] [CrossRef]
  25. Rajendran, A.; Narayanan, K. Multi-Objective Hybrid WIPSO–GSA Algorithm-Based DG and Capacitor Planning for Reduction of Power Loss and Voltage Deviation in Distribution System. Smart Sci. 2018, 6, 295–307. [Google Scholar] [CrossRef]
  26. Shaheen, A.M.; El-Sehiemy, R.A. A multiobjective salp optimization algorithm for techno-economic-based performance enhancement of distribution networks. IEEE Syst. J. 2020, 15, 1458–1466. [Google Scholar] [CrossRef]
  27. Elshahed, M.; Tolba, M.A.; El-Rifaie, A.M.; Ginidi, A.; Shaheen, A.; Mohamed, S.A. An Artificial Rabbits’ Optimization to Allocate PVSTATCOM for Ancillary Service Provision in Distribution Systems. Mathematics 2023, 11, 339. [Google Scholar] [CrossRef]
  28. Shaheen, A.M.; El-Sehiemy, R.A.; Ginidi, A.; Elsayed, A.M.; Al-Gahtani, S.F. Optimal Allocation of PV-STATCOM Devices in Distribution Systems for Energy Losses Minimization and Voltage Profile Improvement via Hunter-Prey-Based Algorithm. Energies 2023, 16, 2790. [Google Scholar] [CrossRef]
  29. Montoya, O.D.; Gil-González, W.; Hernández, J.C. Efficient operative cost reduction in distribution grids considering the optimal placement and sizing of D-STATCOMs using a discrete-continuous VSA. Appl. Sci. 2021, 11, 2175. [Google Scholar] [CrossRef]
  30. Castiblanco-Pérez, C.M.; Toro-Rodríguez, D.E.; Montoya, O.D.; Giral-Ramírez, D.A. Optimal Placement and sizing of D-STATCOM in radial and meshed distribution networks using a discrete-continuous version of the genetic algorithm. Electronics 2021, 10, 1452. [Google Scholar] [CrossRef]
  31. Ghiasi, M.; Olamaei, J. Optimal capacitor placement to minimizing cost and power loss in Tehran metro power distribution system using ETAP (A case study). Complexity 2016, 21, 483–493. [Google Scholar] [CrossRef]
  32. Yuan, Z.; Hesamzadeh, M.R. Second-order cone AC optimal power flow: Convex relaxations and feasible solutions. J. Mod. Power Syst. Clean Energy 2018, 7, 268–280. [Google Scholar] [CrossRef]
  33. Kaur, S.; Kumbhar, G.; Sharma, J. A MINLP technique for optimal placement of multiple DG units in distribution systems. Int. J. Electr. Power Energy Syst. 2014, 63, 609–617. [Google Scholar] [CrossRef]
  34. Kumar, A.; Gao, W. Optimal distributed generation location using mixed integer non-linear programming in hybrid electricity markets. IET Gener. Transm. Distrib. 2010, 4, 281. [Google Scholar] [CrossRef]
  35. Bai, X.; Wei, H. A semidefinite programming method with graph partitioning technique for optimal power flow problems. Int. J. Electr. Power Energy Syst. 2011, 33, 1309–1314. [Google Scholar] [CrossRef]
  36. De Oliveira-De Jesus, P.M.; Alvarez, M.; Yusta, J. Distribution power flow method based on a real quasi-symmetric matrix. Electr. Power Syst. Res. 2013, 95, 148–159. [Google Scholar] [CrossRef]
  37. Montoya, O.D.; Gil-González, W. On the numerical analysis based on successive approximations for power flow problems in AC distribution systems. Electr. Power Syst. Res. 2020, 187, 106454. [Google Scholar] [CrossRef]
  38. Garcés-Ruiz, A. Power Flow in Unbalanced Three-Phase Power Distribution Networks Using Matlab: Theory, analysis, and quasi-dynamic simulation. Ingeniería 2022, 27, e19252. [Google Scholar] [CrossRef]
  39. Montoya, O.D.; Molina-Cabrera, A.; Hernández, J.C. A Comparative Study on Power Flow Methods Applied to AC Distribution Networks with Single-Phase Representation. Electronics 2021, 10, 2573. [Google Scholar] [CrossRef]
  40. Zhang, Y.; Jin, Z.; Mirjalili, S. Generalized normal distribution optimization and its applications in parameter extraction of photovoltaic models. Energy Convers. Manag. 2020, 224, 113301. [Google Scholar] [CrossRef]
  41. Vega-Forero, J.A.; Ramos-Castellanos, J.S.; Montoya, O.D. Application of the Generalized Normal Distribution Optimization Algorithm to the Optimal Selection of Conductors in Three-Phase Asymmetric Distribution Networks. Energies 2023, 16, 1311. [Google Scholar] [CrossRef]
  42. Abdel-Basset, M.; Mohamed, R.; Abouhawwash, M.; Chang, V.; Askar, S. A Local Search-Based Generalized Normal Distribution Algorithm for Permutation Flow Shop Scheduling. Appl. Sci. 2021, 11, 4837. [Google Scholar] [CrossRef]
  43. Saib, B.; Abdessemed, M.R.; Hocin, R.; Khoualdi, K. Study of Exploration and Exploitation Mechanisms in Nature Inspired Metaheuristics for Global Optimization. In Proceedings of the 12th International Conference on Information Systems and Advanced Technologies “ICISAT 2022”, Istanbul, Turkey, 22–23 July 2022; Springer International Publishing: Berlin/Heidelberg, Germany, 2023; pp. 442–453. [Google Scholar] [CrossRef]
  44. Grisales-Noreña, L.F.; Garzón-Rivera, O.D.; Ocampo-Toro, J.A.; Ramos-Paja, C.A.; Rodriguez-Cabal, M.A. Metaheuristic Optimization Methods for Optimal Power Flow Analysis in DC Distribution Networks. Trans. Energy Syst. Eng. Appl. 2020, 1, 13–31. [Google Scholar] [CrossRef]
  45. Shuaib, Y.M.; Kalavathi, M.S.; Rajan, C.C.A. Optimal capacitor placement in radial distribution system using Gravitational Search Algorithm. Int. J. Electr. Power Energy Syst. 2015, 64, 384–397. [Google Scholar] [CrossRef]
  46. Abul’Wafa, A.R. Optimal capacitor allocation in radial distribution systems for loss reduction: A two stage method. Electr. Power Syst. Res. 2013, 95, 168–174. [Google Scholar] [CrossRef]
  47. Sultana, S.; Roy, P.K. Optimal capacitor placement in radial distribution systems using teaching learning based optimization. Int. J. Electr. Power Energy Syst. 2014, 54, 387–398. [Google Scholar] [CrossRef]
  48. Tamilselvan, V.; Jayabarathi, T.; Raghunathan, T.; Yang, X.S. Optimal capacitor placement in radial distribution systems using flower pollination algorithm. Alex. Eng. J. 2018, 57, 2775–2786. [Google Scholar] [CrossRef]
  49. Grisales-Noreña, L.F.; Montoya, O.D.; Hernández, J.C.; Ramos-Paja, C.A.; Perea-Moreno, A.J. A Discrete-Continuous PSO for the Optimal Integration of D-STATCOMs into Electrical Distribution Systems by Considering Annual Power Loss and Investment Costs. Mathematics 2022, 10, 2453. [Google Scholar] [CrossRef]
Figure 1. Flowchart for the improved GNDO.
Figure 1. Flowchart for the improved GNDO.
Energies 16 03532 g001
Figure 2. Single line diagrams for the IEEE 33-bus grid: (a) radial and (b) meshed configurations.
Figure 2. Single line diagrams for the IEEE 33-bus grid: (a) radial and (b) meshed configurations.
Energies 16 03532 g002
Figure 3. Daily variations for loads considering active and reactive power curves.
Figure 3. Daily variations for loads considering active and reactive power curves.
Energies 16 03532 g003
Figure 4. Daily energy losses behavior for the radial and meshed networks when comparing the benchmark case vs. the optimal solution: (a) radial and (b) meshed configurations.
Figure 4. Daily energy losses behavior for the radial and meshed networks when comparing the benchmark case vs. the optimal solution: (a) radial and (b) meshed configurations.
Energies 16 03532 g004
Figure 5. Schematic nodal connections in the IEEE 69-bus grid.
Figure 5. Schematic nodal connections in the IEEE 69-bus grid.
Energies 16 03532 g005
Figure 6. Schematic nodal connections of the IEEE 85-bus grid.
Figure 6. Schematic nodal connections of the IEEE 85-bus grid.
Energies 16 03532 g006
Table 1. Parametric information of the IEEE 33-bus grid with radial and meshed configurations.
Table 1. Parametric information of the IEEE 33-bus grid with radial and meshed configurations.
Bus iBus j   R ij   ( Ω )   X ij   ( Ω ) P j  (kW) Q j  (kvar)
120.09220.047710060
230.49300.25119040
340.36600.186412080
450.38110.19416030
560.81900.70706020
670.18720.6188200100
781.71141.2351200100
891.03000.74006020
9101.04000.74006020
10110.19660.06504530
11120.37440.12386035
12131.46801.15506035
13140.54160.712912080
14150.59100.52606010
15160.74630.54506020
16171.28901.72106020
17180.73200.57409040
2190.16400.15659040
19201.50421.35549040
20210.40950.47849040
21220.70890.93739040
3230.45120.30839050
23240.89800.7091420200
24250.89600.7011420200
6260.20300.10346025
26270.28420.14476025
27281.05900.93376020
28290.80420.700612070
29300.50750.2585200600
30310.97440.963015070
31320.31050.3619210100
32330.34100.53026040
122222--
18330.50.5--
25290.50.5--
Table 2. Parametric information to evaluate the objective function.
Table 2. Parametric information to evaluate the objective function.
ParameterValueUnitParameterValueUnit
  C k W h 0.1390USD-kW/hT365days
  Δ h 0.5h   i e 8%
  i r 15%   i o 10%
  | Y | 5Year   C c purc 25USD/kvar
  C c ins 1600USD   C c ope 300USD/bank-year
Table 3. Numerical results for the IEEE 33-bus grid with a radial topology.
Table 3. Numerical results for the IEEE 33-bus grid with a radial topology.
No. of NodesLocationSize (kvar) f NPV  (USD)Ave. Time (s)
0--468,749.2023-
130600410,939.104862.9109
2[13, 30][200, 500]403,811.370468.8260
3[11, 15, 30][100, 100, 500]404,805.444149.9192
4[11, 15, 30, 32][100, 100, 400, 100]405,860.110151.5080
5[11, 14, 29, 30, 31][100, 100, 100, 200, 200]407,754.449845.8391
Table 4. Numerical results for the IEEE 33-bus grid with meshed topology.
Table 4. Numerical results for the IEEE 33-bus grid with meshed topology.
No. of NodesLocationSize (kvar) f NPV  (USD)Ave. Time (s)
0--302,404.0994-
130600279,154.964742.2342
2   30 , 32   400 , 200 279,488.099842.2345
3   14 , 30 , 32   100 , 400 , 100 280,597.373947.9757
4   16 , 29 , 30 , 32   100 , 100 , 300 , 100 282,273.751046.2040
5   8 , 13 , 25 , 30 , 31   100 , 100 , 100 , 300 , 100 284,287.031840.7188
Table 5. Branch and load parameters for the IEEE 69-bus system.
Table 5. Branch and load parameters for the IEEE 69-bus system.
Node iNode j R ij  ( Ω ) X ij  ( Ω ) P j  (kW) Q j  (kvar)Node iNode j R ij  ( Ω ) X ij  ( Ω ) P j  (kW) Q j  (kvar)
120.00050.00120.000.003360.00440.010826.0018.55
230.00050.00120.000.0036370.06400.156526.0018.55
340.00150.00360.000.0037380.10530.12300.000.00
450.02510.02940.000.0038390.03040.035524.0017.00
560.36600.18642.602.2039400.00180.002124.0017.00
670.38100.194140.4030.0040410.72830.85091.201.00
780.09220.047075.0054.0041420.31000.36230.000.00
890.04930.025130.0022.0042430.04100.04786.004.30
9100.81900.270728.0019.0043440.00920.01160.000.00
10110.18720.0619145.00104.0044450.10890.137339.2226.30
11120.71140.2351145.00104.0045460.00090.001229.2226.30
12131.03000.34008.005.004470.00340.00840.000.00
13141.04400.34508.005.5047480.08510.208379.0056.40
14151.05800.34960.000.0048490.28980.7091384.70274.50
15160.19660.065045.5030.0049500.08220.2011384.70274.50
16170.37440.123860.0035.008510.09280.047340.5028.30
17180.00470.001660.0035.0051520.33190.11143.602.70
18190.32760.10830.000.009530.17400.08864.353.50
19200.21060.06901.000.6053540.20300.103426.4019.00
20210.34160.1129114.0081.0054550.28420.144724.0017.20
21220.01400.00465.003.5055560.28130.14330.000.00
22230.15910.05260.000.0056571.59000.53370.000.00
23240.34630.114528.0020.0057580.78370.26300.000.00
24250.74880.24750.000.0058590.30420.1006100.0072.00
25260.30890.102114.0010.0059600.38610.11720.000.00
26270.17320.057214.0010.0060610.50750.25851244.00888.00
3280.00440.010826.0018.6061620.09740.049632.0023.00
28290.06400.156526.0018.6062630.14500.07380.000.00
29300.39780.13150.000.0063640.71050.3619227.00162.00
30310.07020.02320.000.0064651.04100.530259.0042.00
31320.35100.11600.000.0011660.20120.061118.0013.00
32330.83900.281614.0010.0066670.04700.014018.0013.00
33341.70800.564619.5014.0012680.73940.244428.0020.00
34351.47400.48736.004.0068690.00470.001628.0020.00
Table 6. Optimal location of fixed-step capacitor banks in the IEEE 69-bus grid.
Table 6. Optimal location of fixed-step capacitor banks in the IEEE 69-bus grid.
MethodNodesSize [kvar]Losses [kW]
Base case--225.072
GSA [45]   11 , 29 , 60   900 , 1050 , 450 163.280
TSM [46]   19 , 62 , 63   225 , 900 , 225 148.910
TBLO [47]   12 , 61 , 64   600 1050 , 150 146.350
FPA [48]   11 , 61 , 22   450 , 1350 150 145.860
MI-SOCP [22]   11 , 18 , 61   300 , 300 , 1200 145.397
GNDO   11 , 18 , 61   300 , 300 , 1200 145.397
Table 7. Parametrization of the objective function for evaluating the location of D-STATCOMs in distribution grids.
Table 7. Parametrization of the objective function for evaluating the location of D-STATCOMs in distribution grids.
Par.ValueUnitPar.ValueUnit
  k 1 6/21901/Days   k 2 10Years
D-STATCOM
ω 1 (USD/Mvar3) ω 2 (USD/Mvar2) ω 3 (USD/Mvar)
0.30−305.10127,380
Table 8. Comparative results regarding D-STATCOM location and sizing in the IEEE 33- and 69-bus grids.
Table 8. Comparative results regarding D-STATCOM location and sizing in the IEEE 33- and 69-bus grids.
IEEE 33-bus Grid
MethodLocationSize (Mvar)   z cost   (USD/year)Reduction(%)Time (s)
Benchmark case--112,740.90--
COUENNE   16 , 17 , 18   0.0109 , 0.0224 , 0.2065 107,589.504.563.03
BONMIN   17 , 18 , 30   0.0339 , 0.0227 , 0.2395 102,447.299.137.59
GA/PSO   14 , 30 , 31   0.1599 , 0.3497 , 0.1117 98,511.6312.626417.91
VSA   14 , 30 , 32   0.1599 , 0.3591 , 0.1072 98,497.9012.6359.64
GNDO   14 , 30 , 32   0.1599 , 0.3591 , 0.1072 98,497.9012.6347.71
IEEE 69-bus Grid
MethodLocationSize (Mvar)   z cost   (USD/year)Reduction(%)Time (s)
Benchmark case--119,715.63--
GA/PSO   21 , 61 , 64   0.0839 , 0.4600 , 0.1139 102,990.7913.979325.89
VSA   21 , 61 , 64   0.0839 , 0.4601 , 0.1139 102,990.7913.97202.66
GNDO   21 , 61 , 64   0.0839 , 0.4601 , 0.1139 102,990.7913.97171.15
Table 9. Parametric information regarding branches and loads in the IEEE 85-bus system.
Table 9. Parametric information regarding branches and loads in the IEEE 85-bus system.
km R km  ( Ω ) x km  ( Ω ) P k  (kW) Q k  (kW)km R km  ( Ω ) x km  ( Ω ) P k  (kW) Q k  (kW)
120.1080.0750034441.0020.41635.2835.99
230.1630.1120044450.9110.37835.2835.99
340.2170.1495657.1345460.9110.37835.2835.99
450.1080.0740046470.5460.2261414.28
560.4350.29835.2835.9935480.6370.26400
670.2720.1860048490.1820.07500
781.1970.82035.2835.9949500.3640.15136.2837.01
890.1080.0740050510.4550.1895657.13
9100.5980.4100048521.3660.56700
10110.5440.3735657.1352530.4550.18935.2835.99
11120.5440.3730053540.5460.2265657.13
12130.5980.4100052550.5460.2265657.13
13140.2720.18635.2835.9949560.5460.2261414.28
14150.3260.22335.2835.999570.2730.1135657.13
2160.7280.30235.2835.9957580.8190.34000
3170.4550.189112114.2658590.1820.0755657.13
5180.8200.3405657.1358600.5460.2265657.13
18190.6370.2645657.1360610.7280.3025657.13
19200.4550.18935.2835.9961621.0020.4155657.13
20210.8190.34035.2835.9960630.1820.0751414.28
21221.5480.64235.2835.9963640.7280.30200
19230.1820.0755657.1364650.1820.07500
7240.9100.37835.2835.9965660.1820.0755657.13
8250.4550.18935.2835.9964670.4550.18900
25260.3640.1515657.1367680.9100.37800
26270.5460.2260068691.0920.4535657.13
27280.2730.1135657.1369700.4550.18900
28290.5460.2260070710.5460.22635.2835.99
29300.5460.22635.2835.9967720.1820.0755657.13
30310.2730.11335.2835.9968731.1840.49100
31320.1820.0750073740.2730.1135657.13
32330.1820.0751414.2873751.0020.41635.2835.99
33340.8190.3400070760.5460.2265657.13
34350.6370.2640065770.0910.0371414.28
35360.1820.07535.2835.9910780.6370.2645657.13
26370.3640.1515657.1367790.5460.22635.2835.99
27381.0020.4165657.1312800.7280.3025657.13
29390.5460.2265657.1380810.3640.15100
32400.4550.18935.2835.9981820.0910.0375657.13
40411.0020.4160081831.0920.45335.2835.99
41420.2730.11335.2835.9983841.0020.4161414.28
41430.4550.18935.2835.9913850.8190.34035.2835.99
Table 10. Numerical results for the IEEE 85-bus regarding the optimal selection and location of fixed-step capacitor banks.
Table 10. Numerical results for the IEEE 85-bus regarding the optimal selection and location of fixed-step capacitor banks.
No. of NodesLocationSize (kvar) f NPV  (USD)Ave. Time (s)
0643,005.2405
126900503,325.5728231.6172
2   32 , 60   500 , 500 469,918.4905360.2201
3   12 , 34 , 60   200 , 400 , 400 463,494.7688417.9952
4   12 , 35 , 40 , 64   200 , 200 , 200 , 400 463,290.0220367.9361
5   12 , 29 , 48 , 60 , 68   200 , 300 , 200 , 200 , 200 461,133.6344360.5564
6   27 , 35 , 53 , 60 , 70 , 80   200 , 300 , 100 , 200 , 100 , 200 462,226.7173471.7108
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Montoya, O.D.; Gil-González, W.; Hernández, J.C. Efficient Integration of Fixed-Step Capacitor Banks and D-STATCOMs in Radial and Meshed Distribution Networks Considering Daily Operation Curves. Energies 2023, 16, 3532. https://doi.org/10.3390/en16083532

AMA Style

Montoya OD, Gil-González W, Hernández JC. Efficient Integration of Fixed-Step Capacitor Banks and D-STATCOMs in Radial and Meshed Distribution Networks Considering Daily Operation Curves. Energies. 2023; 16(8):3532. https://doi.org/10.3390/en16083532

Chicago/Turabian Style

Montoya, Oscar Danilo, Walter Gil-González, and Jesus C. Hernández. 2023. "Efficient Integration of Fixed-Step Capacitor Banks and D-STATCOMs in Radial and Meshed Distribution Networks Considering Daily Operation Curves" Energies 16, no. 8: 3532. https://doi.org/10.3390/en16083532

APA Style

Montoya, O. D., Gil-González, W., & Hernández, J. C. (2023). Efficient Integration of Fixed-Step Capacitor Banks and D-STATCOMs in Radial and Meshed Distribution Networks Considering Daily Operation Curves. Energies, 16(8), 3532. https://doi.org/10.3390/en16083532

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