Next Article in Journal
Andness Directedness for t-Norms and t-Conorms
Next Article in Special Issue
Algorithmic Aspect and Convergence Analysis for System of Generalized Multivalued Variational-like Inequalities
Previous Article in Journal
Roadmap Optimization: Multi-Annual Project Portfolio Selection Method
Previous Article in Special Issue
A Quick Search Dynamic Vector-Evaluated Particle Swarm Optimization Algorithm Based on Fitness Distance
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Annual Operating Costs Minimization in Electrical Distribution Networks via the Optimal Selection and Location of Fixed-Step Capacitor Banks Using a Hybrid Mathematical Formulation

by
Oscar Danilo Montoya
1,2,*,
Francisco David Moya
3 and
Arul Rajagopalan
4
1
Grupo de Compatibilidad e Interferencia Electromágnetica, Facultad de Ingeniería, Universidad Distrital Francisco José de Caldas, Bogota 110231, Colombia
2
Laboratorio Inteligente de Energía, Universidad Tecnológica de Bolívar, Cartagena 131001, Colombia
3
GESETIC Research Group, School of Electrical Engineering, Universidad Distrital Francisco José de Caldas, Bogota 110231, Colombia
4
School of Electrical Engineering, Vellore Institute of Technology, Chennai 600127, India
*
Author to whom correspondence should be addressed.
Mathematics 2022, 10(9), 1600; https://doi.org/10.3390/math10091600
Submission received: 27 April 2022 / Revised: 5 May 2022 / Accepted: 6 May 2022 / Published: 8 May 2022
(This article belongs to the Special Issue Optimization Theory and Applications)

Abstract

:
The minimization of annual operating costs in radial distribution networks with the optimal selection and siting of fixed-step capacitor banks is addressed in this research by means of a two-stage optimization approach. The first stage proposes an approximated mixed-integer quadratic model to select the nodes where the capacitor banks must be installed. In the second stage, a recursive power flow method is employed to make an exhaustive evaluation of the solution space. The main contribution of this research is the use of the expected load curve to estimate the equivalent annual grid operating costs. Numerical simulations in the IEEE 33- and IEEE 69-bus systems demonstrate the effectiveness of the proposed methodology in comparison with the solution of the exact optimization model in the General Algebraic Modeling System software. Reductions of 33.04 % and 34.29 % with respect to the benchmark case are obtained with the proposed two-stage approach, with minimum investments in capacitor banks. All numerical implementations are performed in the MATLAB software using the convex tool known as CVX and the Gurobi solver. The main advantage of the proposed hybrid optimization method lies in the possibility of dealing with radial and meshed distribution system topologies without any modification on the MIQC model and the recursive power flow approach.

1. Introduction

Electrical distribution networks are constantly growing due to the requirements of commercial, industrial, and residential users in urban and rural areas [1]. Most of the investments in electrical systems are condensed into medium- and low-voltage level applications to satisfy the growing electric demand [2]. For this reason, utilities are intended to improve the quality service in their grids in order to enable the interconnection of new users with minimum investment and operating costs [3]. One of the key aspects in the construction of electrical distribution grids is their topology. These networks are typically constructed with a radial configuration to minimize the investment in electrical infrastructure (conductors, isolators, protective devices, and so on) [4], but these investment reductions are counteracted by increments in the operating costs, since radial configurations have higher power losses in comparison with meshed grid configurations [5].
To deal with the costs of energy losses distribution networks, electric distribution companies typically employ shunt power compensation, i.e., with active and reactive power sources [6,7]. In the case of active power compensation, dispersed generators and/or battery energy storage systems are typically considered [8,9]. Nevertheless, the investment costs of these devices are not compensated by a reduction in power losses, which implies that said devices are installed in the grid to minimize the total energy purchasing costs in the substation bus or to minimize the total greenhouse gases emitted into the atmosphere [10,11]. However, in some cases, with these objective functions, the energy losses can increase with respect to the benchmark case [12]. In the case of reactive power compensation, the most commonly used devices are fixed-step capacitor banks and distribution static compensators (i.e., D-STATCOMs) [13], both of which can be installed in order to reduce energy losses in distribution networks. However, capacitor banks are simple, economic, and reliable devices that require little maintenance and can continue to work for 20–25 years [14], whereas D-STATCOMs imply continuous maintenance costs and are based on power electronics, which implies that the rate of failure is higher in comparison with capacitor banks [15].
In the scientific literature, multiple approaches to locate and size fixed-step capacitor banks in distribution networks have been proposed. Some of these works are discussed below. Ref. [16] proposed the application of the tabu search algorithm to locate and size fixed-step capacitor banks including the exploration and exploitation aspects of genetic algorithms as well as simulated annealing methods. Ref. [14] presented the application of the flower pollination algorithm to locate and size fixed-step capacitor banks in distribution grids with radial structures. Numerical results in IEEE 33-, 34-, 69-, and 85-bus systems demonstrated the efficiency of this proposal when compared with different literature reports based on genetic algorithms and fuzzy logic. Ref. [17] proposed the implementation of the discrete version of the vortex search algorithm to locate and size fixed-step capacitor banks in radial distribution networks. Numerical results in the IEEE 33- and 69-bus grids showed the efficiency of said algorithm when compared with the flower pollination algorithm reported in [14]. Ref. [18] presented the application of the Chu and Beasley genetic algorithm (CBGA) with an integer codification to locate and size fixed-step capacitor banks in distribution networks considering radial and meshed configurations. Numerical results in the IEEE 33- and 69-bus systems demonstrated the efficiency of this optimization approach when compared with the exact solution reached in the General Algebraic Modeling System (GAMS) software. Ref. [19] presented the reformulation of the exact mixed-integer nonlinear programming (MINLP) model in order to locate and size fixed-step capacitor banks into a mixed-integer, second-order cone programming approach. Numerical results in the IEEE 33- and 69-bus grids demonstrated the effectiveness of this solution methodology by improving results obtained in the literature with the CBGA, the GAMS software, and the flower pollination approaches. Other optimization algorithms that can be found in the current literature to locate and size fixed-step capacitor banks are: artificial bee colony optimization [20], particle swarm optimization [21], gravitational search algorithms [22], cuckoo search algorithm [23], and modifications of genetic and tabu search algorithms [24,25], among others.
The main characteristic of the aforementioned literature reports (except for the GAMS and conic approximations) is that metaheuristic approaches work with a master–slave optimization structure, where the master stage is entrusted with selecting the optimal location and sizes of the capacitor banks and the slave stage evaluates the power losses of each configuration provided by the master stage [17]. In some cases, the master stage only provides the set of nodes where the capacitor banks will be installed, and the slave stage solves the optimal power flow problem to find their optimal sizes [26,27].
Considering the advantages of fixed-step capacitor banks and their widespread use to reduce power in distribution networks, as well as the slave optimization methods reported in the literature, this research focuses on proposing a new two-stage optimization approach to locate and size these devices in distribution networks. The main contribution of this research is the formulation of a mixed-integer quadratic convex (MIQC) model to identify the nodes where the capacitor banks will be located. The main advantage of the MIQC formulation is that it ensures the optimal global optimal solution of the relaxed model. This implies that no statistical evaluations confirm the location of the capacitors, which is necessary for metaheuristic-based optimizers. Once the location of the fixed-step capacitor banks is defined by the MIQC model, a recursive power flow solution is implemented in order to evaluate all possible sizes (i.e., exhaustive evaluation of the solution space), which allows for determining the best possible sizes for these capacitors. It is worth mentioning that the exhaustive exploration of the solution space is possible since it has a few thousand options, which are easily assessed with any personal or desktop computer.
Note that the selection of the MIQC formulation to determine the set of nodes where the fixed-step capacitor banks will be located is motivated by the convexity of the solution space for each binary variable combination, which implies that, through the combination of a Branch and Bound method with the interior point approach, it is possible to ensure that the global optimum is found [28]. Even if some metaheuristic models perform efficiently in electrical engineering problems such as the reconfiguration of distribution grids including dispersed generation [29,30], more studies are required in this research field to make metaheuristics competitive against MIQC models.
The remainder of this article is organized as follows: Section 2 presents the proposed MIQC model that defines the optimal location of the fixed-step capacitor banks. This model corresponds to a quadratic objective function with linear integer constraints. Section 3 presents the recursive power flow solution method based on the successive approximation approach to define the optimal sizes of the fixed-step capacitor banks. Section 5 shows the main characteristics of the IEEE 33- and 69-bus systems. Section 6 presents the numerical results, their analysis, and discussions, as well as the comparison between the proposed two-stage solution methodology and the literature reports. Finally, Section 7 lists the main concluding remarks derived from this research, as well as some proposals for future work.

2. Nodal Selection Strategy

To select the nodes where the fixed-step capacitor banks will be installed, a mixed-integer quadratic convex (MIQC) formulation is proposed by using the equivalent linear power flow formulation for electrical distribution networks obtained by simplifying the MINLP model for distribution system reconfiguration reported in [31]. The simplifications made to the MINLP model in order to obtain an MIQC are the following:
i.
All the voltage magnitudes are assumed to be known, i.e., these can be assigned as plane voltages ( 1 0 ) or set as the power flow solution without capacitor banks (i.e., the benchmark case).
ii.
The magnitude of the currents through the distribution lines is mainly governed by the active and reactive power consumption, which implies that the effect of the second Kirchhoff law at each line is negligible in comparison with the first Kirchhoff law at each node.
By considering the aforementioned assumptions on the exact MINLP model proposed by [31], the MIQC model to define the set of nodes where the fixed-step capacitor banks will be installed is obtained (see Figure 1). This model is defined in Equations (1)–(5):
Obj . fun . : min z approx = C kWh T l L h H R l i l , h r 2 + i l , h i 2 Δ h + j N c C C c cap Q c x j c
Subj . to . : p j , h g P j , h d = l L A j l V j , h r i l , h r + V j , k i i l , h i , j N , h H ,
q j , h g + c C Q c x j c Q j , h d = l L A j l V j , h r i l , h i V j , h i i l , h r , j N , h H ,
c C x j c 1 , j N ,
j N c C x j c N ava cap , j N .
Note that all the mathematical symbols, parameters, and variables are contained in the nomenclature list presented at the end of this document.
Note that the proposed MIQC formulation defined in Equations (1)–(5) has the following interpretation: Equation (1) defines the approximated annual grid operative costs of the network, which correspond to the sum of the expected costs concerning the energy losses and the installation of the fixed-step capacitor banks. Equation (2) defines the active power balance equilibrium at node j for each period of time h, which is linear when the voltages V j , h r and V j , h i are assumed to be known. Equation (3) defines the reactive power equilibrium at each node for each period of time. Inequality constraint (4) defines the possibility of installing as much as one fixed-step capacitor bank type at node j. Finally, inequality constraint (5) limits the maximum number of fixed-step capacitor banks that can be installed in the distribution grid.
In order to characterize the optimization model defined in Equations (1)–(5), the classification and type of variables are presented in Table 1, including the number and type of constraints. It is important to mention that, in this classification, n is the number of nodes, h represents the periods of time, c corresponds to the number of capacitor available, and l is the number of lines.
Remark 1.
The solution of the MIQC model defined in Equations (1)–(5) provides the nodes where the capacitor banks will be installed along with their sizes, since it completely defines the final values for the variables x j c . However, only the nodes where these capacitors will be installed are taken from this solution, since their sizes correspond to an approximate solution of the exact MINLP model due to the approximation introduced by the voltage magnitude simplification.
To refine the solution provided by the MIQC model regarding the sizes of the fixed-step capacitor banks, the next section presents the methodology for finding the fixed-step capacitor banks, which is based on the recursive power flow solution for each possible fixed-step capacitor size combination.
It is important to mention that the dimension of the solution space defined by the binary variables in the MIQC model in Equations (1)–(5) takes a combination form, where it depends on the number of capacitors available and the number of nodes in the distribution network. Note that, for the IEEE 33- and 69-bus grids, these dimensions are 4960 and 50,116 when three capacitors are considered for installation [32].

3. Assigning the Optimal Sizes

Once the MIQC model presented in Section 2 has been solved, the values of the variables x j c are known. However, in the second stage of the proposed optimization methodology, the optimal sizes of the fixed-step capacitor banks are refined by fixing these capacitors in the j nodes.
Given that the optimization problem can take a maximum of N ava cap to be installed in the distribution network (one fixed-step capacitor bank per node), in this stage, an integer combination is proposed to represent each fixed-step capacitor size. Note that, if the small fixed-step capacitor bank is assigned to node i with 1 and the largest fixed-step capacitor bank for the k node is set as c, then the proposed codification for the selected nodes has the following structure:
x sol = [ i , j , k , | 1 , 7 , c ] ,
where x sol represents the vector associated with the selected nodes j, k, and m, along with their corresponding sizes (possible solution). It is important to mention that, for each solution in Equation (6), the total costs of the fixed-step capacitors are easily determined with the second component of the objective function (1).
Remark 2.
Due to the fact that the maximum size of the capacitor bank is assigned as c and the maximum number of devices installed is N ava cap , the size of the solution space for the optimal sizing problem of the fixed-step capacitor banks is c N ava cap . This number is 14 3 = 2774 for the studied set of alternatives regarding the fixed-step capacitor banks.
Considering a solution space with c = 14 and N ava cap = 3 , the proposed methodology to determine the optimal sizes of these capacitor banks is exhaustive, which implies that the 2774 options are evaluated in a conventional power flow formula. The proposed power flow methodology is the successive approximation power flow method reported in [33].
The general recursive power flow formula for the successive approximation method is defined in Equation  (7):
V d , h m + 1 = Y d d 1 diag 1 V d , h m S c a p , h S d , h Y d s V s , h ,
where m is the iterative counter, V d is the vector that contains all the voltage variables in the complex domain for all the demand nodes in each period of time h, S c a p , h is the complex vector that contains all the power outputs in the fixed-step capacitor banks in each period of time h (note that this vector is provided for each of the 2744 size combinations), S d , h is the complex demand vector with the active and reactive power consumption in the demand nodes for each period of time, V s , h is the complex voltage output at the substation bus, Y d d is a complex square matrix that contains all the admittances among the demand nodes, and Y d s is a rectangular complex matrix that contains the admittances between the demand and the substation buses. Note that diag z and z are a matrix with all the elements of the z at its diagonal and the conjugate operator of the complex vector z, respectively.
It is important to emphasize that S c a p , h is 0 for the set of nodes different from j, k, and m. Regarding the example codification presented in Equation (7), these nodes are listed below:
S i , h S j , h S k , h = j Q 1 j Q 7 j Q c
The main characteristic of the recursive power flow Formula (7) is that its convergence to the power flow solution can be ensured by applying the Banach fixed-point theorem [34]. To determine if the power flow Formula (7) has converged, the difference between the voltage magnitudes between two consecutive iterations is used, i.e.,
max h | | V d , h m + 1 | | V d , h m | | ε ,
where ε is the tolerance value, which is assigned as 1 × 10 10 , as recommended in [33].
Note that, once the power flow problem is solved with Equation (7), the amount of power losses is calculated for each period of time, as presented in Equation (9):
P loss , h = real V h Y bus V h ,
where V h is the vector that contains the substation and demand voltages, ordered as [ V s , h V d , h ] ; and Y bus is the nodal admittance matrix of the distribution grid. With the power losses at each period of time, the exact operational costs of the distribution systems with fixed-step capacitor banks (i.e., min z cos ts ) can obtained as defined in Equation (10):
min z cos ts = C kWh T i j L h H P loss , h Δ h + j N c C C c cap Q c x j c

4. Summary of the Solution Methodology

The proposed solution methodology for locating and selecting fixed-step capacitor banks is summarized in Algorithm 1. Here, the problem of location is solved with a mixed-integer convex formulation, and the selection (i.e., sizing) is determined with the recursive evaluations of the power flow problem for each one of the N ava cap possible combinations.
Algorithm 1: Proposed two-stage solution methodology to select and locate fixed-step capacitor banks in distribution networks.
Mathematics 10 01600 i001

5. Test Feeder Information

To validate the proposed two-stage optimization methodology, two classical test feeders known as the IEEE 33- and 69-bus systems are employed. The parametric information for these grids is presented below.

5.1. IEEE 33-Bus Grid

The IEEE 33-bus grid is an electrical network operated with 12.66 kV at the substation bus located at node 1. This system has a radial structure, i.e., 33 buses and 32 lines. The electrical configuration of this test feeder is presented in Figure 2a, and its electrical parameters are listed in Table 2.

5.2. IEEE 69-Bus Grid

The IEEE 69-bus grid is an electrical network operated with 12.66 kV at the substation bus located at node 1. This system has a radial structure, i.e., 69 buses and 68 lines. The electrical configuration of this test feeder is presented in Figure 2b, and its electrical parameters are listed in Table 3.

5.3. Parameters for the Economic Assessment

To determine the annual grid operating costs in the network when the fixed-step capacitor banks are installed, the information regarding sizes and costs is presented in Table 4. Note that this information was adapted from [14].

6. Computational Implementation

The proposed two-stage optimization approach was implemented in the MATLAB software, version 2019b. The mixed-integer linear programming model was implemented using the CVX and the Gurobi solver. The recursive power flow solution was implemented with our own scripts, which used the successive approximation power flow formulation. All the simulations were run on a desktop computer with an Intel(R) Core(TM) i7-7700 2.8-GHz processor and 16.0 GB of RAM on a 64-bit version of Microsoft Windows 10 Home.

6.1. IEEE 33-Bus Grid

For this test feeder, considering that, throughout the year, the system operates under peak load conditions, as analyzed by [14], the first stage of our proposed optimization method identifies nodes 13, 24, and 30 as the optimal location for the capacitor banks.
Now, by fixing the sizes provided by the MIQC model and applying the refinement stage of our proposed optimization model, the optimal sizes for these locations are 450, 450, and 1050 kvar. Note that this solution has an expected annual operative cost of US$/year 23,747.317, with an investment of US$/year 467.10 . These values imply a reduction of 33.04 % with respect to the annual cost of the benchmark case (i.e., US$/year 35,445.909 without capacitors). Table 5 presents a comparison with the solution of the exact MINLP model in the GAMS software and the best three solutions reported for our two-stage proposed optimization approach.
The most important result in Table 5 is that, with the proposed two-stage optimization method, it is possible to generate a list with the alternative solutions. Note that, in this list, there are three solutions with better final objective function value than the solution obtained with the GAMS software.

6.2. IEEE 69-Bus Grid

For this test feeder, considering that, throughout the year, the system operates under peak load conditions, as analyzed by [14], the first stage of our proposed optimization method identifies nodes 11, 21, and 61 as the optimal location for the capacitor banks. In addition, by fixing the sizes provided by the MIQC model and applying the refinement stage of our proposed optimization model, the optimal sizes for these locations are 450, 150, and 1200 kvar. Note that this solution has an expected annual operative cost of US$/year 24,845.246, with an investment of US$/year 392.85 . These values imply a reduction of 34.29 % with respect to the annual cost of the benchmark case (i.e., US$/year 37,812.056 without capacitors). Table 5 presents a comparison with the solution of the exact MINLP model in the GAMS software and the best three solutions reported for our two-stage proposed optimization approach.
Note that the main result in Table 6 is that the proposed two-stage optimization method allows for identifying at least four solutions with better objective function values than the solution reached with the GAMS software.
Table 6 confirms that performing an exhaustive exploration once the nodes where the fixed-step capacitor banks will be installed have been identified enables the identification of additional solutions that cannot be found by means of commercial approaches. This situation is particularly important for utilities since additional investment alternatives can be identified prior to making the final decision regarding installation in the grids.

6.3. Numerical Results Considering Daily Load Variations

To verify the effectiveness and robustness of the proposed optimization approach, in this simulation scenario, the daily variations of the active and reactive power curve in 30-min periods were considered [35]. The active and reactive power variations are listed in Table 7.
Considering the daily information in Table 7 for the active and reactive power demands, in the case of the IEEE 33-bus grid, the best solution provided by the proposed two-stage optimization method corresponds to locating the fixed-step capacitor banks in nodes 2, 7, and 30, with sizes of 150, 450, and 450 kvar, respectively. These capacitor banks have an investment cost of US$/year 302.70 , with total annual operative costs of US$/year 12,763.112. This value corresponds to a reduction of 17.95 % with respect to the benchmark case (i.e., US$/year 15,555.063 without installing fixed-step capacitor banks). For the IEEE 69-bus system, the proposed methodology identifies the nodes 11, 24, and 61 and fixed-step capacitor banks with sizes of 150, 150, and 600 kvar, respectively. These capacitor banks have an investment cost of US$/year 282, with total annual operative costs of US$/year 13,141.378. This implies a reduction of 20.44 % with respect to the benchmark case (i.e., US$/year 16,517.383 without installing fixed-step capacitor banks).

6.4. Applicability in Meshed Distribution Networks

To demonstrate the applicability of the proposed hybrid optimization model to deal with the problem regarding the optimal placement and sizing of fixed-step capacitor banks in electrical distribution grids with meshed configurations, in this simulation scenario, the meshed configuration of the IEEE 33-bus grid was considered with all the tie-lines in the reconfiguration problem studied in [36] permanently closed. For the sake of completeness, the lines added to the IEEE 33-bus system are listed in Table 8.
For the IEEE 33-bus system, where the distribution lines in Table 8 are added to the distribution system topology presented in Figure 2a and the daily active and reactive power behavior in Table 7 is considered, the solution of the MIQC model (1)–(5) defines the location of the fixed-step capacitor banks at nodes 2, 8, and 30, respectively. In addition, by fixing these sizes in the recursive power flow solution methodology, the optimal sizes assigned for these nodes are 150, 300, and 600 kvar, respectively. When these fixed-step capacitor banks are installed, the annual grid operative costs take a value of US$/year 7927.316 , i.e., a reduction of 14.88 % with respect to the benchmark case.
Note that the most important result in the meshed scenario is as expected: the annual grid operating costs is low in comparison with the radial operative case, since the benchmark case in the radial scenario was US$/year 15 , 555.063 , while, in the full meshed operation scenario, this value decreased to US$/year 9313.495 . This is due to the presence of meshes in the distribution network allowing for a better power flow distribution and improving voltage regulation in the network, which are directly related with the reductions in the total energy losses of the network compared to the radial topology.

7. Conclusions and Future Work

The problem regarding the optimal placement and sizing of fixed-step capacitor banks in electrical distribution networks with radial structure was addressed in this research via the application of a two-stage optimization methodology. The first stage of the proposed optimization approach dealt with selecting the nodes where the fixed-step capacitor banks would be installed through the implementation of an MIQC model. The second stage corresponded to an exhaustive assessment of the solution space by using the successive approximation power flow method for each possible size combination of the fixed-step capacitor banks on the nodes, which was provided by the MIQC model.
The numerical results in the IEEE 33- and 69-bus grids showed that the proposed two-stage optimization approach finds better objective function values than the GAMS software with its exact MINLP solvers. For the IEEE 33-bus grid, the difference between the proposed method and the GAMS software was US$/year 111.996 . In addition, for this test feeder, the proposed MIQC model found two additional solutions with better objective function values when compared to the GAMS optimal solution. In the case of the IEEE 69-bus system, the proposed two-stage approach found an additional gain of US$/year 31.664 . In addition, the proposed MIQC model found three alternative solutions with better objective function values in comparison with the GAMS optimal solution.
As for the reductions with respect to the benchmark case, in the scenario involving a year-long operation under peak load conditions, for the IEEE 33-bus, the annual expected improvement was about 33.04 % , and, for the IEEE 69-bus system, it was 34.29 % . However, when the daily active and reactive power consumption was considered, the expected improvement was about 17.95 % for the IEEE 33-bus grid, and, for the IEEE 69-bus grid, it was about 20.44 % . Note that these behaviors were expected in the context of this simulation, given that the daily behavior of the active and reactive power curves corresponded to a realistic operative scenario, whereas the peak load operation represented a theoretical operative scenario that only served to validate new solution methodologies with respect to literature reports.
The main limitation of the proposed optimization method is related to the possibility of evaluating the entirety of the solution space regarding the possible sizes of the fixed-step capacitor banks, since, for large test feeders where more than three capacitor banks are available, the proposed recursive solution methodology entails long processing times. Note that, for a system with an availability of 7 capacitor banks and 14 possible sizes, the dimension of the solution space is 105,413,504, i.e., more than 105 million possible solutions. Therefore, for large solution spaces, it is recommended to replace the recursive power flow evaluation method with a specialized metaheuristic optimization technique that can efficiently deal with discrete variables with reduced computational effort.
As future work, it will be possible to conduct the following studies: (i) to propose a mixed-integer conic model that allows for integrating fixed-step capacitor banks with the optimal grid reconfiguration of the network while considering daily active and reactive power variations; (ii) to extend the proposed MIQC model in order to locate and size renewable energy resources and batteries in distribution networks; and (iii) to consider more realistic models to represent capacitor banks, including energy losses and reactive power injection variability as a function of the voltage at the nodes where the banks are connected.

Author Contributions

Conceptualization, methodology, software, and writing (review and editing): O.D.M., F.D.M. and A.R. All authors have read and agreed to the published version of the manuscript.

Funding

This work was partially supported in part by the Center for Research and Scientific Development of Universidad Distrital Francisco José de Caldas, under grant 1643-12-2020 associated with the project Desarrollo de una metodología de optimización para la gestión óptima de recursos energéticos distribuidos en redes de distribución de energía eléctrica [Development of an optimization methodology for the optimal management of energy resources distributed across electrical energy distribution networks].

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

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

Conflicts of Interest

The authors declare no conflict of interest.

Nomenclature

S c a p , h Complex vector that contains all the power outputs
in the fixed-step capacitor banks for each period of time h (var).
S d , h Complex vector with the active and reactive power
consumption in the demand nodes for each period of time (VA).
V d , h Complex vector that contains all the voltages in the
demanded nodes for each period of time (V).
V s , h Complex variable associated with the voltage output at the slack source (V).
Y bus Nodal admittance matrix (S).
Y d d Component of the nodal admittance matrix that associates
demand nodes with each other (S).
A j l Component of the node-to-branch incidence matrix that associates node j with line l.
C Set that contains all fixed-step capacitor bank types available
for installation in the distribution grid.
H Set that contains all hours of the operation period (typically 24 h).
L Set that contains all distribution lines of the network.
N Set that contains all the nodes of the network.
ε Parameter associated with the maximum convergence error
admissible for the power flow solution (V).
C kWh Expected costs of the energy losses (US$/kWh-year).
C c cap Installation cost of the fixed-step capacitor bank type c (US$/kvar).
hSubscript associated with the set H .
i l , h i Imaginary component of the current flowing through line l in the period of time h (A).
i l , h r Real component of the current flowing through line l in the period of time h (A).
jSubscript associated with the set N .
lSubscript associated with the set L .
mSuperscript associated with the number of iterations.
N ava cap Number of fixed-step capacitor banks available for installation.
P loss , h Active power losses in the distribution network for each period of time (W).
P j , h d Active power generation consumed at node j in period of time h (W).
p j , h g Active power generation injected at node j in period of time h (W).
Q c Reactive power capacity of a type c fixed-step capacitor bank (kvar).
Q j , h d Reactive power generation consumed at node j in period of time h (var).
q j , h g Reactive power generation injected at node j in period of time h (var).
R l Resistive parameter of the distribution line l ( Ω ).
TLength of the planning period (days).
V j , h i Imaginary component of the voltage magnitude at node j in the period of time h (V).
V j , h r Real component of the voltage magnitude at node j in the period of time h (V).
x sol Solution vector that contains the nodes where the fixed-step capacitor
banks will be located along with their possible sizes.
x j c Binary variable associated with the installation ( x j c = 1 ) or not ( x j c = 0 )
of a fixed-step capacitor bank type c at node j.
z approx Approximate objective function value associated with the
expected annual grid operating costs (US$).
z cos ts Expected annual operating costs of the network (US$).

References

  1. Millar, R.; Hyvarinen, M.; Lehtonen, M.; Hamalainen, P. Urban distribution networks - some general planning observations. In Proceedings of the 20th International Conference and Exhibition on Electricity Distribution (CIRED 2009), Prague, Czech Republic, 8–11 June 2009. [Google Scholar] [CrossRef]
  2. Pană, A.; Băloi, A.; Molnar-Matei, F. From the Balancing Reactive Compensator to the Balancing Capacitive Compensator. Energies 2018, 11, 1979. [Google Scholar] [CrossRef] [Green Version]
  3. Qing, K.; Huang, Q.; Du, Y. Integrated Optimal Planning of Distribution Network With Geographical-Zone-Restricted Renewable Energy Sources. Front. Energy Res. 2022, 10, 864914. [Google Scholar] [CrossRef]
  4. Lavorato, M.; Franco, J.F.; Rider, M.J.; Romero, R. Imposing Radiality Constraints in Distribution System Optimization Problems. IEEE Trans. Power Syst. 2012, 27, 172–180. [Google Scholar] [CrossRef]
  5. Celli, G.; Pilo, F.; Pisano, G.; Cicoria, R.; Iaria, A. Meshed vs. radial MV distribution network in the presence of large amount of DG. In Proceedings of the IEEE PES Power Systems Conference and Exposition, 2004, New York, NY, USA, 10–13 October 2004. [Google Scholar] [CrossRef]
  6. Fergany, A.A.E.; Abdelaziz, A.Y. Reactive power compensation in distribution networks using cuckoo search algorithm. Int. J. Bio-Inspired Comput. 2014, 6, 230. [Google Scholar] [CrossRef]
  7. Xu, G.; Zhang, B.; Yang, L.; Wang, Y. Active and Reactive Power Collaborative Optimization for Active Distribution Networks Considering Bi-Directional V2G Behavior. Sustainability 2021, 13, 6489. [Google Scholar] [CrossRef]
  8. Valencia, A.; Hincapie, R.A.; Gallego, R.A. Optimal location, selection, and operation of battery energy storage systems and renewable distributed generation in medium–low voltage distribution networks. J. Energy Storage 2021, 34, 102158. [Google Scholar] [CrossRef]
  9. Home-Ortiz, J.M.; Pourakbari-Kasmaei, M.; Lehtonen, M.; Mantovani, J.R.S. Optimal location-allocation of storage devices and renewable-based DG in distribution systems. Electr. Power Syst. Res. 2019, 172, 11–21. [Google Scholar] [CrossRef]
  10. Luhmann, T.; Wieben, E.; Treydel, R.; Stadler, M.; Kumm, T. An Approach for Cost-Efficient Grid Integration of Distributed Renewable Energy Sources. Engineering 2015, 1, 447–452. [Google Scholar] [CrossRef] [Green Version]
  11. Iweh, C.D.; Gyamfi, S.; Tanyi, E.; Effah-Donyina, E. Distributed Generation and Renewable Energy Integration into the Grid: Prerequisites, Push Factors, Practical Options, Issues and Merits. Energies 2021, 14, 5375. [Google Scholar] [CrossRef]
  12. Bocean, C.G.; Vărzaru, A.A.; Al-Floarei, A.T.; Dumitriu, S.; Diaconescu, D.L.; Barbu, M.C.R. Efficient Management of Power Losses from Renewable Sources Using Removable E.V. Batteries. Appl. Sci. 2021, 11, 6413. [Google Scholar] [CrossRef]
  13. Liang, L.; Luo, C. A GPU-Based Resilience Enhanced Voltage Optimization Model for Distribution Networks. Front. Energy Res. 2022, 10, 843241. [Google Scholar] [CrossRef]
  14. 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]
  15. Sode-Yome, A.; Mithulananthan, N. Comparison of Shunt Capacitor, SVC and STATCOM in Static Voltage Stability Margin Enhancement. Int. J. Electr. Eng. Educ. 2004, 41, 158–171. [Google Scholar] [CrossRef]
  16. Gallego, R.; Monticelli, A.; Romero, R. Optimal capacitor placement in radial distribution networks. IEEE Trans. Power Syst. 2001, 16, 630–637. [Google Scholar] [CrossRef]
  17. 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]
  18. 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]
  19. 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]
  20. El-Fergany, A.A.; Abdelaziz, A.Y. Capacitor placement for net saving maximization and system stability enhancement in distribution networks using artificial bee colony-based approach. Int. J. Electr. Power Energy Syst. 2014, 54, 235–243. [Google Scholar] [CrossRef]
  21. Prakash, K.; Sydulu, M. Particle Swarm Optimization Based Capacitor Placement on Radial Distribution Systems. In Proceedings of the 2007 IEEE Power Engineering Society General Meeting, Tampa, FL, USA, 24–28 June 2007. [Google Scholar] [CrossRef]
  22. 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]
  23. Devabalaji, K.; Yuvaraj, T.; Ravi, K. An efficient method for solving the optimal sitting and sizing problem of capacitor banks based on cuckoo search algorithm. Ain Shams Eng. J. 2018, 9, 589–597. [Google Scholar] [CrossRef] [Green Version]
  24. Ogita, Y.; Mori, H. Parallel Dual Tabu Search for Capacitor Placement in Smart Grids. Procedia Comput. Sci. 2012, 12, 307–313. [Google Scholar] [CrossRef] [Green Version]
  25. Augugliaro, A.; Dusonchet, L.; Favuzza, S.; Ippolito, M.G.; Mangione, S.; Sanseverino, E.R. A Modified Genetic Algorithm for Optimal Allocation of Capacitor Banks in MV Distribution Networks. Intell. Ind. Syst. 2015, 1, 201–212. [Google Scholar] [CrossRef] [Green Version]
  26. Cristian, D.P.; Teslovan, R.; Barbulescu, C.; Kilyeni, S.; Simo, A. PSO based OPF algorithm. In Proceedings of the Eurocon 2013, Zagreb, Croatia, 1–4 July 2013. [Google Scholar] [CrossRef]
  27. Cristian, D.; Barbulescu, C.; Kilyeni, S.; Popescu, V. Particle swarm optimization techniques. Power systems applications. In Proceedings of the 2013 6th International Conference on Human System Interactions (HSI), Sopot, Poland, 6–8 June 2013. [Google Scholar] [CrossRef]
  28. Gil-González, W.; Garces, A.; Montoya, O.D.; Hernández, J.C. A Mixed-Integer Convex Model for the Optimal Placement and Sizing of Distributed Generators in Power Distribution Networks. Appl. Sci. 2021, 11, 627. [Google Scholar] [CrossRef]
  29. Helmi, A.M.; Carli, R.; Dotoli, M.; Ramadan, H.S. Efficient and Sustainable Reconfiguration of Distribution Networks via Metaheuristic Optimization. IEEE Trans. Autom. Sci. Eng. 2022, 19, 82–98. [Google Scholar] [CrossRef]
  30. Muhammad, M.A.; Mokhlis, H.; Naidu, K.; Amin, A.; Franco, J.F.; Othman, M. Distribution Network Planning Enhancement via Network Reconfiguration and DG Integration Using Dataset Approach and Water Cycle Algorithm. J. Mod. Power Syst. Clean Energy 2020, 8, 86–93. [Google Scholar] [CrossRef]
  31. Montoya, O.D.; Gil-González, W.J.; Grisales-Noreña, L.F.; Giral-Ramírez, D.A.; Molina-Cabrera, A. On the optimal reconfiguration of radial AC distribution networks using an MINLP formulation: A GAMS-based approach. Ing. Investig. 2022, 42, 1–12. [Google Scholar] [CrossRef]
  32. Montoya, O.D. Notes on the Dimension of the Solution Space in Typical Electrical Engineering Optimization Problems. Ingeniería 2022, 27, e19310. [Google Scholar] [CrossRef]
  33. 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]
  34. Shen, T.; Li, Y.; Xiang, J. A Graph-Based Power Flow Method for Balanced Distribution Systems. Energies 2018, 11, 511. [Google Scholar] [CrossRef] [Green Version]
  35. Montoya, O.D.; Alvarado-Barrios, L.; Hernández, J.C. An Approximate Mixed-Integer Convex Model to Reduce Annual Operating Costs in Radial Distribution Networks Using STATCOMs. Electronics 2021, 10, 3102. [Google Scholar] [CrossRef]
  36. Vai, V.; Suk, S.; Lorm, R.; Chhlonh, C.; Eng, S.; Bun, L. Optimal Reconfiguration in Distribution Systems with Distributed Generations Based on Modified Sequential Switch Opening and Exchange. Appl. Sci. 2021, 11, 2146. [Google Scholar] [CrossRef]
Figure 1. Representation of a distribution branch with the main variables of the MIQC model.
Figure 1. Representation of a distribution branch with the main variables of the MIQC model.
Mathematics 10 01600 g001
Figure 2. Grid configuration of the test feeders: (a) IEEE 33- and (b) IEEE 69-node system.
Figure 2. Grid configuration of the test feeders: (a) IEEE 33- and (b) IEEE 69-node system.
Mathematics 10 01600 g002
Table 1. Characterization of the MIQC model (1)–().
Table 1. Characterization of the MIQC model (1)–().
VariablesTypeNumber
Capacitor locations and sizesBinary n c
Currents (real and imaginary parts)Real 2 l h
Active and reactive power generationReal 2 n h
Objective functionReal1
Total number of variablesReal + binary 2 l + n h + n c + 1
ConstraintsTypeNumber
Active power balanceEquality n p
Reactive power balanceEquality n p
Capacitors per nodeInequalityn
Number of capacitors availableInequality1
Objective functionEquality1
Total number of constraintsEqualities + inequalities 2 p + 1 n + 1
Table 2. Parametric information for the IEEE 33-bus system.
Table 2. Parametric information for the IEEE 33-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.09220.04771006017180.73200.57409040
230.49300.251190402190.16400.15659040
340.36600.18641208019201.50421.35549040
450.38110.1941603020210.40950.47849040
560.81900.7070602021220.70890.93739040
670.18720.61882001003230.45120.30839050
781.71141.235120010023240.89800.7091420200
891.03000.7400602024250.89600.7011420200
9101.04000.740060206260.20300.10346025
10110.19660.0650453026270.28420.14476025
11120.37440.1238603527281.05900.93376020
12131.46801.1550603528290.80420.700612070
13140.54160.71291208029300.50750.2585200600
14150.59100.5260601030310.97440.963015070
15160.74630.5450602031320.31050.3619210100
16171.28601.7210602032330.34100.53026040
Table 3. Parametric information for the IEEE 69-bus system.
Table 3. Parametric information 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.0012003360.00440.01082618.55
230.00050.00120036370.06400.15652618.55
340.00150.00360037380.10530.123000
450.02510.02940038390.03040.03552417
560.36600.18642.62.239400.00180.00212417
670.38100.194140.43040410.72830.85091.21
780.09220.0470755441420.31000.362300
890.04930.0251302242430.04100.047564.3
9100.81900.2707281943440.00920.011600
10110.18720.061914510444450.10890.137339.2226.3
11120.71140.235114510445460.00090.001239.2226.3
12131.03000.3400854470.00340.008400
13141.04400.345085.547480.08510.20837956.4
14151.05800.34960048490.28980.7091384.7274.5
15160.19660.065045.53049500.08220.2011384.7274.5
16170.37440.123860358510.09280.047340.528.3
17180.00470.0016603551520.33190.11143.62.7
18190.32760.1083009530.17400.08864.353.5
19200.21060.069010.653540.20300.103426.419
20210.34160.11291148154550.28420.14472417.2
21220.01400.004653.555560.28130.143300
22230.15910.05260056571.59000.533700
23240.34600.1145282057580.78370.263000
24250.74880.24750058590.30420.100610072
25260.30890.1021141059600.38610.117200
26270.17320.0572141060610.50750.25851244888
3280.00440.01082618.661620.09740.04963223
28290.06400.15652618.662630.14500.073800
29300.39780.13150063640.71050.3619227162
30310.07020.02320064651.04100.53025942
31320.35100.11600011660.20120.06111813
32330.83900.2816141066670.00470.00141813
33341.70800.564619.51412680.73940.24442820
34351.47400.48736468690.00470.00162820
Table 4. Costs of the capacitors per capacity.
Table 4. Costs of the capacitors per capacity.
Option Q c (kvar)Cost ($/kvar-Year)Option Q c (kvar)Cost ($/kvar-Year)
11500.500812000.170
23000.350913500.207
34500.2531015000.201
46000.2201116500.193
57500.2761218000.870
69000.1831319500.211
710500.2281421000.176
Table 5. Optimal location, sizes, and annual expected costs for the IEEE 33-bus system under peak load conditions.
Table 5. Optimal location, sizes, and annual expected costs for the IEEE 33-bus system under peak load conditions.
MethodSize (Node) (Mvar)Losses (kW)C. Caps. US$C. Total US$
GAMS{0.30(14), 0.45(24), 1.05(30)}139.292458.2523,859.313
MIQC (sol. 1){0.45(13), 0.45(24), 1.05(30)}138.473467.1023,747.317
MIQC (sol. 2){0.45(13), 0.60(24), 0.90(30)}138.917410.5523,748.531
MIQC (sol. 3){0.45(13), 0.45(24), 0.90(30)}139.075392.4023,757.083
Table 6. Optimal location, sizes, and annual expected costs for the IEEE 69-bus system under peak load conditions.
Table 6. Optimal location, sizes, and annual expected costs for the IEEE 69-bus system under peak load conditions.
MethodSize (Node) (Mvar)Losses (kW)C. Caps. US$C. Total US$
GAMS{0.45(11), 0.15(27), 1.20(61)}145.738392.8524,876.910
MIQC (sol. 1){0.45(11), 0.15(21), 1.20(61)}145.550392.8524,845.246
MIQC (sol. 2){0.30(11), 0.30(21), 1.20(61)}145.492414.0024,856.573
MIQC (sol. 3){0.60(11), 0.15(21), 1.20(61)}145.614411.0024,874.173
MIQC (sol. 4){0.45(11), 0.30(21), 1.20(61)}145.556422.8524,876.229
Table 7. Behavior of the daily active and reactive power consumption.
Table 7. Behavior of the daily active and reactive power consumption.
Time (h)Active (pu)Reactive (pu)Time (h)Active (pu)Reactive (pu)
10.340.2954250.940.6764
20.280.2238260.940.7228
30.220.1964270.900.7754
40.220.1666280.840.6868
50.220.1478290.860.7542
60.200.1654300.900.8538
70.180.1662310.900.8448
80.180.1274320.900.7294
90.180.1404330.900.8452
100.200.1750340.900.6162
110.220.1456350.900.5988
120.260.2428360.900.6672
130.280.2462370.860.7086
140.340.2780380.840.6798
150.400.2820390.920.8468
160.500.39964010.8122
170.620.4994410.980.7640
180.680.6448420.940.7640
190.720.6526430.900.7774
200.780.7322440.840.5502
210.840.7170450.760.6766
220.860.6632460.680.4710
230.900.8374470.580.4602
240.920.7304480.500.3636
Table 8. Distribution lines added to the IEEE 33-bus grid.
Table 8. Distribution lines added to the IEEE 33-bus grid.
Node iNode j R ij ( Ω ) X ij ( Ω )Node iNode j R ij ( Ω ) X ij ( Ω )
8212.02.012222.02.0
9152.02.018330.50.5
25290.50.5
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

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. https://doi.org/10.3390/math10091600

AMA Style

Montoya OD, Moya FD, 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(9):1600. https://doi.org/10.3390/math10091600

Chicago/Turabian Style

Montoya, Oscar Danilo, Francisco David Moya, and Arul Rajagopalan. 2022. "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 10, no. 9: 1600. https://doi.org/10.3390/math10091600

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