Search

This research addresses the power flow analysis in bipolar asymmetric direct current (DC) networks by applying Broyden's numerical method. This general successive approximations method allows for a simple Newton-based recursive formula to reach the roots of multiple nonlinear equations. The main advantage of Broyden's approach is its simple but efficient structure which can be applied to real complex nonlinear equations.The power flow problem in bipolar DC networks is still challenging, as multiple operating options must be considered, e.g., the possibility of having a solidly grounded or floating neutral wire. The main goal of this research is to contribute with a generalization of Broyden's method for the power flow solution in bipolar DC networks, with the main advantage that, under well-defined conditions, this is a numerical method equivalent to the matricial backward/forward power flow, which is equivalent to the successive approximations power flow method. Numerical results in the 21-, 33-, and 85-bus grids while considering two connections for the neutral wire (i.e., solidly grounded at any node or floating) show the effectiveness of Broyden's method in the power flow solution for bipolar asymmetric DC networks. All numerical simulations were carried out in the MATLAB programming environment. [ABSTRACT FROM AUTHOR]

The problem regarding the optimal placement and sizing of different FACTS (flexible alternating current transmission systems) in electrical distribution networks is addressed in this research by applying a master–slave optimization approach. The FACTS analyzed correspond to the unified power flow controller (UPFC), the thyristor-controlled shunt compensator (TCSC, also known as the thyristor switched capacitor, or TSC), and the static var compensator (SVC). The master stage is entrusted with defining the location and size of each FACTS device using hybrid discrete-continuous codification through the application of the black widow optimization (BWO) approach. The slave stage corresponds to the successive approximations power flow method based on the admittance grid formulation, which allows determining the expected costs of the energy losses for a one-year operation period. The numerical results in the IEEE 33-, 69-, and 85-bus grids demonstrate that the best FACTS device for locating in distribution networks is the SVC, given that, when compared to the UPFC and the TCSC, it allows for the best possible reduction in the equivalent annual investment and operating cost. A comparative analysis with the General Algebraic Modeling System software, with the aim to solve the exact mixed-integer nonlinear programming model, demonstrated the proposed BWO approach's effectiveness in determining the best location and size for the FACTS in radial distribution networks. Reductions of about 12.63 % and 13.97 % concerning the benchmark cases confirmed that the SVC is the best option for reactive power compensation in distribution grids. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

This paper proposes a recursive conic approximation methodology to deal with the optimal power flow (OPF) problem in unbalanced bipolar DC networks. The OPF problem is formulated through a nonlinear programming (NLP) representation, where the objective function corresponds to the minimization of the expected grid power losses for a particular load scenario. The NLP formulation has a non-convex structure due to the hyperbolic equality constraints that define the current injection/absorption in the constant power terminals as a function of the powers and voltages. To obtain an approximate convex model that represents the OPF problem in bipolar asymmetric distribution networks, the conic relation associated with the product of two positive variables is applied to all nodes with constant power loads. In the case of nodes with dispersed generation, a direct replacement of the voltage variables for their expected operating point is used. An iterative solution procedure is implemented in order to minimize the error introduced by the voltage linearization in the dispersed generation sources. The 21-bus grid is employed for all numerical validations. To validate the effectiveness of the proposed conic model, the power flow problem is solved, considering that the neutral wire is floating and grounded, and obtaining the same numerical results as the traditional power flow methods (successive approximations, triangular-based, and Taylor-based approaches): expected power losses of 95.4237 and 91.2701 kW, respectively. To validate the effectiveness of the proposed convex model for solving the OPF problem, three combinatorial optimization methods are implemented: the sine-cosine algorithm (SCA), the black-hole optimizer (BHO), and the vortex search algorithm (VSA). Numerical results show that the proposed convex model finds the global optimal solution with a value of 22.985 kW, followed by the VSA with a value of 22.986 kW. At the same time, the BHO and SCA are stuck in locally optimal solutions (23.066 and 23.054 kW, respectively). All simulations were carried out in a MATLAB programming environment. [ABSTRACT FROM AUTHOR]

The problem regarding of optimal power flow in bipolar DC networks is addressed in this paper from the recursive programming stand of view. A hyperbolic relationship between constant power terminals and voltage profiles is used to resolve the optimal power flow in bipolar DC networks. The proposed approximation is based on the Taylors' Taylor series expansion. In addition, nonlinear relationships between dispersed generators and voltage profiles are relaxed based on the small voltage voltage-magnitude variations in contrast with power output. The resulting optimization model transforms the exact nonlinear non-convex formulation into a quadratic convex approximation. The main advantage of the quadratic convex reformulation lies in finding the optimum global via recursive programming, which adjusts the point until the desired convergence is reached. Two test feeders composed of 21 and 33 buses are employed for all the numerical validations. The effectiveness of the proposed recursive convex model is verified through the implementation of different metaheuristic algorithms. All the simulations are carried out in the MATLAB programming environment using the convex disciplined tool known as CVX with the SEDUMI and SDPT3 solvers. [ABSTRACT FROM AUTHOR]

This research deals with the problem regarding the optimal siting and sizing of distribution static compensators (D-STATCOMs) via the application of a master–slave optimization technique. The master stage determines the nodes where the D-STATCOMs must be located and their nominal rates by applying the generalized normal distribution optimizer (GNDO) with a discrete–continuous codification. In the slave stage, the successive approximations power flow method is implemented in order to establish the technical feasibility of the solution provided by the master stage, i.e., voltage regulation and device capabilities, among other features. The main goal of the proposed master–slave optimizer is to minimize the expected annual operating costs of the distribution grid, which includes the energy loss and investment costs of the D-STATCOMs. With the purpose of improving the effectiveness of reactive power compensation during the daily operation of the distribution grid, an optimal reactive power flow (ORPF) approach is used that considers the nodes where D-STATCOMs are located as inputs in order to obtain their daily expected dynamical behavior with regard to reactive power injection to obtain additional net profits. The GNDO approach and the power flow method are implemented in the MATLAB programming environment, and the ORPF approach is implemented in the GAMS software using a test feeder comprising 33 nodes with both radial and meshed configurations. A complete comparative analysis with the Salp Swarm Algorithm is presented in order to demonstrate the effectiveness of the proposed two-stage optimization approach in the fixed operation scenario regarding the final objective function values. In addition, different tests considering the possibility of hourly power injection using D-STATCOMs through the ORPF solution demonstrate that additional gains can be obtained in the expected annual operative costs of the grid. [ABSTRACT FROM AUTHOR]

This paper deals with the problem regarding the optimal siting and sizing of distribution static compensators (D-STATCOMs) in electrical distribution networks to minimize the expected total annual operating costs. These costs are associated with the investments made in D-STATCOMs and expected energy losses costs. To represent the electrical behavior of the distribution networks, a power flow formulation is used which includes voltages, currents, and power as variables via incidence matrix representation. This formulation generates a mixed-integer nonlinear programming (MINLP) model that accurately represents the studied problem. However, in light of the complexities involved in solving this MINLP model efficiently, this research proposes a mixed-integer convex reformulation. Numerical results regarding the final annual operating costs of the network demonstrate that the proposed mixed-integer convex model is efficient for selecting and locating D-STATCOMs in distribution networks, with the main advantage that it is applicable to radial and meshed distribution grid configurations. A comparative analysis with respect to metaheuristic optimizers and convex approximations confirms the robustness of the proposed formulation. All numerical validations were conducted in the MATLAB programming environment with our own scripts (in the case of metaheuristics) and the CVX convex disciplined tool via the Gurobi solver. In addition, the exact MINLP model is solved using the GAMS software. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of the power flow analysis of bipolar direct current (DC) networks considering unbalanced loads and the effect of a neutral wire, which may be solidly grounded or non-grounded. The power flow problem is formulated using the nodal admittance representation of the system and the hyperbolic relations between power loads and voltages in the demand nodes. Using Taylor series expansion with linear terms, a recursive power flow method with quadratic convergence is proposed. The main advantage of the hyperbolic approximation in dealing with power flow problems in DC bipolar networks is that this method can analyze radial and meshed configurations without any modifications to the power flow formula. The numerical results in three test feeders composed of 4, 21, and 85 bus systems show the efficiency of the proposed power flow method. All of the simulations were conducted in MATLAB for a comparison of the proposed approach with the well-established successive approximation method for power flow studies in distribution networks. [ABSTRACT FROM AUTHOR]

This paper presents a new optimal power flow (OPF) formulation for monopolar DC networks using a recursive convex representation. The hyperbolic relation between the voltages and power at each constant power terminal (generator or demand) is represented as a linear constraint for the demand nodes and generators. To reach the solution for the OPF problem a recursive evaluation of the model that determines the voltage variables at the iteration t + 1 ( v t + 1 ) by using the information of the voltages at the iteration t ( v t ) is proposed. To finish the recursive solution process of the OPF problem via the convex relaxation, the difference between the voltage magnitudes in two consecutive iterations less than the predefined tolerance is considered as a stopping criterion. The numerical results in the 85-bus grid demonstrate that the proposed recursive convex model can solve the classical power flow problem in monopolar DC networks, and it also solves the OPF problem efficiently with a reduced convergence error when compared with semidefinite programming and combinatorial optimization methods. In addition, the proposed approach can deal with radial and meshed monopolar DC networks without modifications in its formulation. All the numerical implementations were in the MATLAB programming environment and the convex models were solved with the CVX and the Gurobi solver. [ABSTRACT FROM AUTHOR]

Power electronics converters are equipped with current controls that protect the converter from over-currents. This protection introduces non-differentiable equations into the power flow problem. The conventional Newton's method is not suitable in that conditions. This letter proposes a fixed-point iteration to overcome this difficulty. The technique is derivative-free, and hence, it can naturally include the saturation given by the converters’ current protection. Exact conditions for convergence and uniqueness of the solution are demonstrated using Banach's fixed point theorem. Numerical experiments in Matlab complement the analysis. [ABSTRACT FROM AUTHOR]

This paper focuses on minimizing the annual operative costs in monopolar DC distribution networks with the inclusion of solar photovoltaic (PV) generators while considering a planning period of 20 years. This problem is formulated through a mixed-integer nonlinear programming (MINLP) model, in which binary variables define the nodes where the PV generators must be located, and continuous variables are related to the power flow solution and the optimal sizes of the PV sources. The implementation of a master–slave optimization approach is proposed in order to address the complexity of the MINLP formulation. In the master stage, the discrete-continuous generalized normal distribution optimizer (DCGNDO) is implemented to define the nodes for the PV sources along with their sizes. The slave stage corresponds to a specialized power flow approach for monopolar DC networks known as the successive approximation power flow method, which helps determine the total energy generation at the substation terminals and its expected operative costs in the planning period. Numerical results in the 33- and 69-bus grids demonstrate the effectiveness of the DCGNDO optimizer compared to the discrete-continuous versions of the Chu and Beasley genetic algorithm and the vortex search algorithm. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

This paper analyzes the power flow solution in bipolar direct current networks with radial structures considering multiple monopolar and bipolar constant power loads. The electrical configuration of the bipolar DC grid considers that the reference pole is non-grounded along the feeder, which produces important neutral currents and voltage imbalances along the DC grid. The power flow problem is formulated through the triangular-based representation of the grid topology, which generates a recursive formulation that allows determining the voltage values in the demand nodes through an iterative procedure. The linear convergence of the triangular-based power flow method is tested through multiple load variations with respect to the nominal grid operative condition. Numerical results in the 21- and the 85-bus grids reveal the relevant variations in the voltage profiles and total grid power losses when the neutral cable is solidly grounded or not. [ABSTRACT FROM AUTHOR]

This article presents an optimal power flow (OPF) formulation based on the branch flow model for bipolar DC grids with asymmetric loading. The proposal considers the power injection formulation of the OPF to obtain the branch flow model equations that allow solving the power flow problem in bipolar DC networks. Furthermore, a nonlinear programming (NLP) optimization model is deduced and transformed into a second-order conic programming one, which involves convex optimization and guarantees a global optimum for the relaxed model, the uniqueness of this solution, and fast convergence. Finally, an approximation based on balanced operation is proposed to simplify the OPF. Several case studies in two test systems composed of 21 and 85 nodes with a bipolar structure demonstrate that the proposal is accurate, fast, and close to the exact solution of the NLP model when compared with competitive literature reports. All optimization models were implemented in the Python language. • Bipolar DC networks can operate with balanced and unbalanced conditions as a function of the demands connected between poles. • A convex approximation can be applied to bipolar DC networks via second order cone programming. • A simplification based on expected balanced operation ca be reached to obtain a relaxed convex model with low estimation errors. • Dispersed generators and battery energy storage systems can be added to bipolar DC networks using a optimal power flow formulation. [ABSTRACT FROM AUTHOR]

This paper proposes a new power flow (PF) formulation for electrical distribution systems using the current injection method and applying the Laurent series expansion. Two solution algorithms are proposed: a Newton-like iterative procedure and a fixed-point iteration based on the successive approximation method (SAM). The convergence analysis of the SAM is proven via the Banach fixed-point theorem, ensuring numerical stability, the uniqueness of the solution, and independence on the initializing point. Numerical results are obtained for both proposed algorithms and compared to well-known PF formulations considering their rate of convergence, computational time, and numerical stability. Tests are performed for different branch R / X ratios, loading conditions, and initialization points in balanced and unbalanced networks with radial and weakly-meshed topologies. Results show that the SAM is computationally more efficient than the compared PFs, being more than ten times faster than the backward–forward sweep algorithm. • Two novel efficient power flow algorithms for distribution systems. • Linearization using Laurent series expansion. • Convergence and stability analysis using Banach fixed-point theorem. • Proposed algorithms are at least three times faster than the backward–forward sweep. [ABSTRACT FROM AUTHOR]

This paper deals with the power flow problem in bipolar direct current distribution networks with unbalanced constant power loads. The effect of the neutral wire is considered in two prominent cases: (i) when the system is solidly grounded at each load point and (ii) when the neutral terminal is only grounded at the substation bus. The problem is solved using the successive approximation power flow method. Numerical results in two test feeders composed of 4 and 25 nodes demonstrate that the successive approximation power flow approach is adequate to solve the problem. It is also demonstrated that it is equivalent to the backward/forward power flow in matrix form. The main advantage of both power flow approaches is that they can work with radial and meshed distribution networks. Additionally, they do not require inverting matrices at each iteration, making them efficient in terms of computational processing times requirements. All the simulations are carried out in the MATLAB programming environment. • Bipolar DC networks have the double transference capability of their monopolar DC networks. • Convergence of the successive approximation power is ensured through the application of the Banach fixed point theorem. • Power losses increase for the topology with non-grounded neutral wire. • Monopolar unbalanced loads produce voltage imbalances between the positive and negative poles. [ABSTRACT FROM AUTHOR]

This paper addresses the problem concerning the efficient minimization of power losses in asymmetric distribution grids from the perspective of convex optimization. This research's main objective is to propose an approximation optimization model to reduce the total power losses in a three-phase network using the concept of electrical momentum. To obtain a mixed-integer convex formulation, the voltage variables at each node are relaxed by assuming them to be equal to those at the substation bus. With this assumption, the power balance constraints are reduced to flow restrictions, allowing us to formulate a set of linear rules. The objective function is formulated as a strictly convex objective function by applying the concept of average electrical momentum, by representing the current flows in distribution lines as the active and reactive power variables. To solve the relaxed MIQC model, the GAMS software (Version 28.1.2) and its CPLEX, SBB, and XPRESS solvers are used. In order to validate the effectiveness of load redistribution in power loss minimization, the initial and final grid configurations are tested with the triangular-based power flow method for asymmetric distribution networks. Numerical results show that the proposed mixed-integer model allows for reductions of 24.34 % , 18.64 % , and 4.14 % for the 8-, 15-, and 25-node test feeders, respectively, in comparison with the benchmark case. The sine–cosine algorithm and the black hole optimization method are also used for comparison, demonstrating the efficiency of the MIQC approach in minimizing the expected grid power losses for three-phase unbalanced networks. [ABSTRACT FROM AUTHOR]

This paper proposes an interconnection of the MATLAB and GAMS software interfaces, which were designed based on a master-slave methodology, to solve the mixed-integer nonlinear programming (MINLP) model problem associated with the problem regarding the optimal location and sizing of static distribution compensators (D-STATCOMs) in meshed and radial distribution networks, considering the problem of optimal reactive power flow compensation and the fact that the networks have commercial, industrial, and residential loads for a daily operation scenario. The objective of this study is to reduce the annual investment and operating costs associated with energy losses and the installation costs of D-STATCOMs. This objective function is based on the classical energy budget and the capacity constraints of the device. In the master stage, MATLAB software is used to program a discrete version of the sine-cosine algorithm (DSCA), which determines the locations where the D-STATCOMs will be installed. In the slave stage, using the BONMIN solver of the GAMS software and the known locations of the D-STATCOMs, the MINLP model representing the problem under study is solved to find the value of the objective function and the nominal power of the D-STATCOMs. To validate the effectiveness of the proposed master-slave optimizer, the 33-node IEEE test system with both radial and meshed topologies is used. With this test system, numerical comparisons were made with the exact solution of the MINLP model, using different solvers in the GAMS software, the genetic-convex strategy, and the discrete-continuous versions of the Chu and Beasley genetic algorithm and the salp swarm optimization algorithm. The numerical results show that DSCA-BONMIN achieves a global solution to the problem under study, making the proposed method an effective tool for decision-making in distribution companies. [ABSTRACT FROM AUTHOR]

This study addresses the problem of selecting the conductor sizes for medium-voltage distribution networks with radial configurations. The optimization model that represents this problem is part of the mixed-integer non-linear programming (MINLP) models, in which a power flow must be solved for each possible combination of conductor sizes. The main objective of this optimization problem is to find the best set of conductor sizes that minimize an economic objective function composed of the total costs of conducting materials added with the expected annual costs of the energy losses by proposing a new hybrid optimization methodology from the family of combinatorial optimization methods. To solve the MINLP model, a master–slave optimization method based on the modified version of the gradient-based metaheuristic optimizer (MGbMO) combined with the successive approximation power flow method for unbalanced distribution networks is presented. The MGbMO defines the set of conductor sizes assignable for each distribution line using an integer codification. The slave stage (three-phase power flow) quantifies the total power losses and their expected annual operating costs. Numerical results in the IEEE 8-, 27-, and 85-bus grids demonstrate the effectiveness of the proposed master–slave optimizer when compared with multiple combinatorial optimization methods (vortex search algorithm, the Newton-metaheuristic optimizer, the traditional and Chu and Beasley genetic algorithms, and the tabu search approaches). Two scenarios regarding the demand behavior were analyzed for the IEEE 8- and 27-bus grids: a peak load operation was considered, and, for the IEEE 85-bus grid, the daily demand behavior, including the presence of renewable generators, was considered. The 85-bus grid allowed showing that the most realistic operative scenario for selecting conductors is the case where a demand curve is implemented since reductions over 40% in the annual investment and operating costs were found when compared to the peak load operating condition. All numerical validations were performed in MATLAB software. [ABSTRACT FROM AUTHOR]

The optimal expansion of AC medium-voltage distribution grids for rural applications is addressed in this study from a heuristic perspective. The optimal routes of a distribution feeder are selected by applying the concept of a minimum spanning tree by limiting the number of branches that are connected to a substation (mixed-integer linear programming formulation). In order to choose the caliber of the conductors for the selected feeder routes, the maximum expected current that is absorbed by the loads is calculated, thereby defining the minimum thermal bound of the conductor caliber. With the topology and the initial selection of the conductors, a tabu search algorithm (TSA) is implemented to refine the solution with the help of a three-phase power flow simulation in MATLAB for three different load conditions, i.e., maximum, medium, and minimum consumption with values of 100%, 60%, and 30%, respectively. This helps in calculating the annual costs of the energy losses that will be summed with the investment cost in conductors for determining the final costs of the planning project. Numerical simulations in two test feeders comprising 9 and 25 nodes with one substation show the effectiveness of the proposed methodology regarding the final grid planning cost; in addition, the heuristic selection of the calibers using the minimum expected current absorbed by the loads provides at least 70% of the calibers that are contained in the final solution of the problem. This demonstrates the importance of using adequate starting points to potentiate metaheuristic optimizers such as the TSA. [ABSTRACT FROM AUTHOR]

The problem of the optimal load redistribution in electrical three-phase medium-voltage grids is addressed in this research from the point of view of mixed-integer convex optimization. The mathematical formulation of the load redistribution problem is developed in terminals of the distribution node by accumulating all active and reactive power loads per phase. These loads are used to propose an objective function in terms of minimization of the average unbalanced (asymmetry) grade of the network with respect to the ideal mean consumption per-phase. The objective function is defined as the l 1 -norm which is a convex function. As the constraints consider the binary nature of the decision variable, each node is conformed by a 3 × 3 matrix where each row and column have to sum 1, and two equations associated with the load redistribution at each phase for each of the network nodes. Numerical results demonstrate the efficiency of the proposed mixed-integer convex model to equilibrate the power consumption per phase in regards with the ideal value in three different test feeders, which are composed of 4, 15, and 37 buses, respectively. [ABSTRACT FROM AUTHOR]

This study presents a master–slave methodology to solve the problem of optimally locating and sizing photovoltaic (PV) generation units in electrical networks. This problem is represented by means of a Mixed-Integer Nonlinear Programming (MINLP) model, whose objective function is to reduce the total annual operating costs of a network for a 20-year planning period. Such costs include (i) the costs of purchasing energy at the conventional generators (the main supply node in this particular case), (ii) the investment in the PV generation units, and (iii) their corresponding operation and maintenance costs. In the proposed master–slave method, the master stage uses the Discrete–Continuous version of the Crow Search Algorithm (DCCSA) to define the set of nodes where the PV generation units will be installed (location), as well as their nominal power (sizing), and the slave stage employs the successive approximation power flow technique to find the value of the objective function of each individual provided by the master stage. The numerical results obtained in the 33- and 69-node test systems demonstrated its applicability, efficiency, and robustness when compared to other methods reported in the specialized literature, such as the vortex search algorithm, the generalized normal distribution optimizer, and the particle swarm optimization algorithm. All simulations were performed in MATLAB using our own scripts. [ABSTRACT FROM AUTHOR]

This paper deals with the problem regarding the optimal placement and sizing of distribution static compensators (D-STATCOMs) in radial and meshed distribution networks. These grids consider industrial, residential, and commercial loads within a daily operation scenario. The optimal reactive power flow compensation problem is formulated through a mixed-integer nonlinear programming (MINLP) model. The objective function is associated with the minimization of the expected energy losses costs for a year of operation by considering the investment costs of D-STATCOMs. To solve the MINLP model, the application of a master–slave optimization approach is proposed, which combines the salp swarm algorithm (SSA) in the master stage and the matricial backward/forward power flow method in the slave stage. The master stage is entrusted with defining the optimal nodal location and sizes of the D-STATCOMs, while the slave stage deals with the power flow solution to determine the expected annual energy losses costs for each combination of nodes and sizes for the D-STATCOMs as provided by the SSA. To validate the effectiveness of the proposed master–slave optimizer, the IEEE 33-bus grid was selected as a test feeder. Numerical comparisons were made against the exact solution of the MINLP model with different solvers in the general algebraic modeling system (GAMS) software. All the simulations of the master–slave approach were implemented in the MATLAB programming environment (version 2021b). Numerical results showed that the SSA can provide multiple possible solutions for the studied problem, with small variations in the final objective function, which makes the proposed approach an efficient tool for decision-making in distribution companies. [ABSTRACT FROM AUTHOR]

This paper presents an efficient master–slave methodology to solve the problem of integrating photovoltaic (PV) generators into DC grids for a planning period of 20 years. The problem is mathematically formulated as Mixed-Integer Nonlinear Programming (MINLP) with the objective of minimizing the total annual operating cost. The main stage, consisting of a discrete-continuous version of the Crow search algorithm (DCCSA), is in charge of determining the installation positions of the PV generators and their corresponding power ratings. On the other hand, at the slave level, the successive approximation power flow method is used to determine the objective function value. Numerical results on 33- and 69-bus test systems demonstrate the applicability, efficiency and robustness of the developed approach with respect to different methodologies previously discussed in the scientific literature, such as the vortex search algorithm, the generalized normal distribution optimizer and the particle swarm optimization algorithm. Numerical tests are performed in the MATLAB programming environment using proprietary scripts. [ABSTRACT FROM AUTHOR]

This document presents a master–slave methodology for solving the problem of optimal operation of photovoltaic (PV) distributed generators (DGs) in direct current (DC) networks. This problem was modeled using a nonlinear programming model (NLP) that considers the minimization of three different objective functions in a daily operation of the system. The first one corresponds to the minimization of the total operational cost of the system, including the energy purchasing cost to the conventional generators and maintenance costs of the PV sources; the second objective function corresponds to the reduction of the energy losses associated with the transport of energy in the network, and the third objective function is related to the minimization of the total emissions of CO 2 by the conventional generators installed on the DC grid. The minimization of these objective functions is achieved by using a master–slave optimization approach through the application of the Vortex Search algorithm combined with a matrix hourly power flow. To evaluate the effectiveness and robustness of the proposed approach, two test scenarios were used, which correspond to a grid-connected and a standalone network located in two different regions of Colombia. The grid-connected system emulates the behavior of the solar resource and power demand of the city of Medellín-Antioquia, and the standalone network corresponds to an adaptation of the generation and demand curves for the municipality of Capurganá-Choco. A numerical comparison was performed with four optimization methodologies reported in the literature: particle swarm optimization, multiverse optimizer, crow search algorithm, and salp swarm algorithm. The results obtained demonstrate that the proposed optimization approach achieved excellent solutions in terms of response quality, repeatability, and processing times. [ABSTRACT FROM AUTHOR]

This study addresses the problem of the maximization of the voltage stability index (λ -coefficient) in medium-voltage distribution networks considering the optimal placement and sizing of dispersed generators. The problem is formulated through a mixed-integer nonlinear programming model (MINLP), which is solved using General Algebraic Modeling System (GAMS) software. A numerical example with a 7-bus radial distribution network is employed to introduce the usage of GAMS software to solve the proposed MINLP model. A new validation methodology to verify the numerical results provided for the λ -coefficient is proposed by using recursive power flow evaluations in MATLAB and DigSILENT software. The recursive evaluations allow the determination of the λ -coefficient through the implementation of the successive approximation power flow method and the Newton–Raphson approach, respectively. It is effected by fixing the sizes and locations of the dispersed sources using the optimal solution obtained with GAMS software. Numerical simulations in the IEEE 33- and 69-bus systems with different generation penetration levels and the possibility of installing one to three dispersed generators demonstrate that the GAMS and the recursive approaches determine the same loadability index. Moreover, the numerical results indicate that, depending on the number of dispersed generators allocated, it is possible to improve the λ -coefficient between 20.96 % and 37.43 % for the IEEE 33-bus system, and between 18.41 % and 41.98 % for the IEEE 69-bus system. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]