María Camila Herrera-Briñez

Bio: María Camila Herrera-Briñez is an academic researcher. The author has contributed to research in topics: Equivalence (measure theory) & Flow (mathematics). The author has an hindex of 1, co-authored 1 publications receiving 4 citations.

The equivalence between successive approximations and matricial load flow formulations

Abstract: This paper shows the equivalence of the matricial form of the classical backward/forward load flow formulation for distribution networks with the recently developed successive approximations (SA) load flow approach. Both formulations allow solving the load flow problem in meshed and radial distribution grids even if these are operated with alternating current (AC) or direct current (DC) technologies. Both load flow methods are completely described in this research to make a fair comparison between them and demonstrate their equivalence. Numerical comparisons in the 33- and 69-bus test feeder with radial topology show that both methods have the same number of iterations to find the solution with a convergence error defined as 1×10−10.

Optimal Design of PV Systems in Electrical Distribution Networks by Minimizing the Annual Equivalent Operative Costs through the Discrete-Continuous Vortex Search Algorithm

Abstract: This paper discusses the minimization of the total annual operative cost for a planning period of 20 years composed by the annualized costs of the energy purchasing at the substation bus summed with the annualized investment costs in photovoltaic (PV) sources, including their maintenance costs in distribution networks based on their optimal siting and sizing. This problem is presented using a mixed-integer nonlinear programming model, which is resolved by applying a master–slave methodology. The master stage, consisting of a discrete-continuous version of the Vortex Search Algorithm (DCVSA), is responsible for providing the optimal locations and sizes for the PV sources—whereas the slave stage employs the Matricial Backward/Forward Power Flow Method, which is used to determine the fitness function value for each individual provided by the master stage. Numerical results in the IEEE 33- and 69-node systems with AC and DC topologies illustrate the efficiency of the proposed approach when compared to the discrete-continuous version of the Chu and Beasley genetic algorithm with the optimal location of three PV sources. All the numerical validations were carried out in the MATLAB programming environment.

Operating Cost Reduction in Distribution Networks Based on the Optimal Phase-Swapping including the Costs of the Working Groups and Energy Losses

Abstract: The problem of optimal phase-balancing in three-phase asymmetric distribution networks is addressed in this research from the point of view of combinatorial optimization using a master–slave optimization approach. The master stage employs an improved sine cosine algorithm (ISCA), which is entrusted with determining the load reconfiguration at each node. The slave stage evaluates the energy losses for each set of load connections provided by the master stage by implementing the triangular-based power flow method. The mathematical model that was solved using the ISCA is designed to minimize the annual operating costs of the three-phase network. These costs include the annual costs of the energy losses, considering daily active and reactive power curves, as well as the costs of the working groups tasked with the implementation of the phase-balancing plan at each node. The peak load scenario was evaluated for a 15-bus test system to demonstrate the effectiveness of the proposed ISCA in reducing the power loss (18.66%) compared with optimization methods such as genetic algorithm (18.64%), the classical sine cosine algorithm (18.42%), black-hole optimizer (18.38%), and vortex search algorithm (18.59%). The IEEE 37-bus system was employed to determine the annual total costs of the network before and after implementing the phase-balancing plan provided by the proposed ISCA. The annual operative costs were reduced by about 13% with respect to the benchmark case, with investments between USD 2100 and USD 2200 in phase-balancing activities developed by the working groups. In addition, the positive effects of implementing the phase-balancing plan were evidenced in the voltage performance of the IEEE 37-bus system by improving the voltage regulation with a maximum of 4% in the whole network from an initial regulation of 6.30%. All numerical validations were performed in the MATLAB programming environment.

An Improved Crow Search Algorithm Applied to the Phase Swapping Problem in Asymmetric Distribution Systems

Abstract: This paper discusses the power loss minimization problem in asymmetric distribution systems (ADS) based on phase swapping. This problem is presented using a mixed-integer nonlinear programming model, which is resolved by applying a master–slave methodology. The master stage consists of an improved version of the crow search algorithm. This stage is based on the generation of candidate solutions using a normal Gaussian probability distribution. The master stage is responsible for providing the connection settings for the system loads using integer coding. The slave stage uses a power flow for ADSs based on the three-phase version of the iterative sweep method, which is used to determine the network power losses for each load connection supplied by the master stage. Numerical results on the 8-, 25-, and 37-node test systems show the efficiency of the proposed approach when compared to the classical version of the crow search algorithm, the Chu and Beasley genetic algorithm, and the vortex search algorithm. All simulations were obtained using MATLAB and validated in the DigSILENT power system analysis software.

A Comparative Study on Power Flow Methods Applied to AC Distribution Networks with Single-Phase Representation

Abstract: This paper presents a comparative analysis of six different iterative power flow methods applied to AC distribution networks, which have been recently reported in the scientific literature. These power flow methods are (i) successive approximations, (ii) matricial backward/forward method, (iii) triangular-based approach, (iv) product linearization method, (v) hyperbolic linearization method, and (vi) diagonal approximation method. The first three methods and the last one are formulated without recurring derivatives, and they can be directly formulated in the complex domain; the fourth and fifth methods are based on the linear approximation of the power balance equations that are also formulated in the complex domain. The numerical comparison involves three main aspects: the convergence rate, processing time, and the number of iterations calculated using the classical Newton–Raphson method as the reference case. Numerical results from two test feeders composed of 34 and 85 nodes demonstrate that the derivative-free methods have linear convergence, and the methods that use derivatives in their formulation have quadratic convergence.