Search

Objective: The objective of this paper is to propose a methodology for the optimal location and sizing of D-STATCOMs within a distribution electrical system, with the aim to reduce the annualized operating costs related to the annual power energy losses and the investment costs associated with the installation of the D-STATCOM. Context: This paper presents a hybrid methodology based on a master-slave strategy and the genetic and particle swarm optimization algorithms for solving the problem of optimal location and sizing of Distribution Static Compensators (DSTATCOMs), for reactive compensation in electrical distribution systems. Methodology: In this paper was used a mathematical formulation that represents the effect of the location and sizing of D-STATCOMs in electrical distribution systems; by proposing a master-slave methodology combining the genetic algorithm and the particle swarm optimization algorithms as a solution method. Furthermore, with the aim to validate the effectiveness and robustness of the proposed methodology in this work, three comparison methods, two test systems, and multiple technical considerations were used to represent the electrical distribution systems in a distributed energy resource environment. Results: The results obtained show that the proposed methodology is the most effective solution method for solving the problem, by achieving the greatest reduction in relation to the investment and operating costs. This methodology will allow the grid operators to identify the location and size of the D-STATCOMs within the electrical energy distribution system, with the lowest investment and operating costs in relation to other works reported in specialized literature. Conclusions: The obtained results demonstrate that GA/PSO achieved the best performance, with the DCVSA comparison method in second place, and the GAMS solvers in third place. It is important to notice that it was not possible to evaluate the GAMS solvers on the 69 bus test system, because this solver failed the mathematical formulation that represented this electrical system. Based on previous results, it can be concluded that the GA/PSO is the most suitable optimization method used for solving the problem of optimal integration of D-STATCOMs in Distribution electrical systems for the grid.

Addition of an Author [...]

This research explores the application of metaheuristic algorithms to refine parameter estimation in dynamic systems, with a focus on the inverted pendulum model. Three optimization techniques, Particle Swarm Optimization (PSO), Continuous Genetic Algorithm (CGA), and Salp Swarm Algorithm (SSA), are introduced to solve this problem. Through a thorough statistical evaluation, the optimal performance of each technique within the dynamic methodology is determined. Furthermore, the efficacy of these algorithms is demonstrated through experimental validation on a real prototype, providing practical insights into their performance. The outcomes of this study contribute to the advancement of control strategies by integrating precisely estimated physical parameters into various control algorithms, including PID controllers, fuzzy logic controllers, and model predictive controllers. Each algorithm ran 1000 times, and the SSA algorithm achieved the best performance, with the most accurate parameter estimation with a minimum error of 0.01501 N m and a mean solution error of 0.01506 N m. This precision was further underscored by its lowest standard deviation in RMSE (1.443 99 × 10−6 N m), indicating remarkable consistency across evaluations. The 95% confidence interval for error corroborated the algorithm’s reliability in deriving optimal solutions.

The problem of the optimal placement and sizing of dynamic reactive power compensators in AC distribution networks is addressed in this paper from convex optimization. The exact mixed-integer nonlinear programming (MINLP) model is transformed into a mixed-integer second-order cone programming (MISOCP) model. The main advantage of the MISOCP formulation is the possibility of finding a global optimum with branch & cut combined with interior-point method due to the convex structure of the continuous part of the problem, i.e., the multi-period branch optimal power flow. The dynamic reactive power compensators are sized and dimensioned considering daily load curves and variable reactive power injections. Numerical validations are tested in the 33- and 69-bus test feeders using the CVX tool available for MATLAB with the MOSEK solver. These simulations demonstrate the effectiveness and robustness of the MISOCP approach when compared with the solution of the exact MINLP obtained in the GAMS software.

Thermoelectric generators (TEGs) have the potential to convert waste heat into electrical energy, making them attractive for energy harvesting applications. However, accurately estimating TEG parameters from industrial systems is a complex problem due to the mathematical complex non-linearities and numerous variables involved in the TEG modeling. This paper addresses this research gap by presenting a comparative evaluation of three optimization methods, Particle Swarm Optimization (PSO), Salps Search Algorithm (SSA), and Vortex Search Algorithm (VSA), for TEG parameter estimation. The proposed integrated approach is significant as it overcomes the limitations of existing methods and provides a more accurate and rapid estimation of TEG parameters. The performance of each optimization method is evaluated in terms of root mean square error (RMSE), standard deviation, and processing time. The results indicate that all three methods perform similarly, with average RMSE errors ranging from 0.0019 W to 0.0021 W, and minimum RMSE errors ranging from 0.0017 W to 0.0018 W. However, PSO has a higher standard deviation of the RMSE errors compared to the other two methods. In addition, we present the optimized parameters achieved through the proposed optimization methods, which serve as a reference for future research and enable the comparison of various optimization strategies. The disparities observed in the optimized outcomes underscore the intricacy of the issue and underscore the importance of the integrated approach suggested for precise TEG parameter estimation.

Power losses (PL) are one of the most—if not the most—vital concerns in power distribution networks (DN). With respect to sustainability, distribution network reconfiguration (DNR) is an effective course of action to minimize power losses. However, the optimal DNR is usually a non-convex optimization process that necessitates the employment of powerful global optimization methods. This paper proposes a novel hybrid metaheuristic optimization (MO) method called the chaotic golden flower algorithm (CGFA) for PL minimization. As the name implies, the proposed method combines the golden search method with the flower pollination algorithm to multiply their benefits, guarantee the best solution, and reduce convergence time. The performance of the algorithm has been evaluated under different test systems, including the IEEE 33-bus, IEEE 69-bus, and IEEE 119-bus systems and the smart city (SC) network, each of which includes distributed-generation (DG) units and energy storage systems (ESS). In addition, the locations of tie-switches in the DN, which used to be considered as given information in previous studies, are assumed to be variable, and a branch-exchange adaption is included in the reconfiguration process. Furthermore, uncertainty analysis, such as bus and/or line fault conditions, are studied, and the performance of the proposed method is compared with other pioneering MO algorithms with minimal standard deviations ranging from 0.0012 to 0.0101. The case study of SC is considered and the obtained simulation results show the superiority of the algorithm in finding higher PL reduction under different scenarios, with the lowest standard deviations ranging from 0.012 to 0.0432.

This work addressed the problem regarding the optimal integration of battery systems (BS) in grid-connected networks (GCNs) with the purpose of reducing energy losses and CO2 emissions, for which it formulates a mathematical model that considers the constraints associated with the operation of GCNs in a distributed generation environment that includes BS and variable power generation related to photovoltaic (PV) distributed generation (DG) and demand. As solution strategies, three different master–slave methodologies are employed that are based on sequential programming methods, with the aim to avoid the implementation of commercial software. In the master stage, to solve the problem regarding the location and the type of batteries to be used, parallel-discrete versions of the Montecarlo method (PMC), a genetic algorithm (PDGA), and the search crow algorithm (PDSCA) are employed. In the slave stage, the particle swarm optimization algortihm (PSO) is employed to solve the problem pertaining to the operation of the batteries, using a matrix hourly power flow to assess the impact of each possible solution proposed by the master–slave methodologies on the objective functions and constraints. As a test scenario, a GCN based on the 33-bus test systems is used, which considers the generation, power demand, and CO2 emissions behavior of the city of Medellín (Colombia). Each algorithm is executed 1000 times, with the aim to evaluate the effectiveness of each solution in terms of its quality, standard deviation, and processing times. The simulation results obtained in this work demostrate that PMC/PSO is the master–slave methodology with the best performance in terms of solution quality, repeatability, and processing time.

Thermoelectric generators (TEGs) have gained significant interest as a sustainable energy source, due to their ability to convert thermal energy into electrical energy through the Seebeck effect. However, the power output of TEGs is highly dependent on the thermoelectric material properties and operational conditions. Accurate modeling and parameter estimation are essential for optimizing and designing TEGs, as well as for integrating them into smart grids to meet fluctuating energy demands. This work examines the challenges of accurate modeling and parameter estimation of TEGs and explores various optimization metaheuristics techniques to find TEGs parameters in real applications from experimental conditions. The paper stresses the importance of determining the properties of TEGs with precision and using parameter estimation as a technique for determining the optimal values for parameters in a TEG mathematical model that represent the actual behavior of a thermoelectric module. This methodological approach can improve TEG performance and aid in efficient energy supply and demand management, thus reducing the reliance on traditional fossil fuel-based power generation.

This article deals with the solution of a mixed-integer nonlinear programming (MINLP) problem related to the efficient reallocation of battery energy storage systems (BESS) in monopolar direct current (DC) grids through a master–slave optimization approach. The master stage solves the integer nature of the MINLP model, which is related to the nodes where the BESS will be located. In this stage, the discrete version of the vortex search algorithm is implemented. To determine the objective function value, a recursive convex approximation is implemented to solve the nonlinear component of the MINLP model (multi-period optimal power flow problem) in the slave stage. Two objective functions are considered performance indicators regarding the efficient reallocation of BESS in monopolar DC systems. The first objective function corresponds to the expected costs of the annual energy losses, and the second is associated with the annual expected energy generation costs. Numerical results for the DC version of the IEEE 33 bus grid confirm the effectiveness and robustness of the proposed master–slave optimization approach in comparison with the solution of the exact MINLP model in the General Algebraic Modeling System (GAMS) software. The proposed master–slave optimizer was programmed in the MATLAB software. The recursive convex solution of the multi-period optimal power flow problem was implemented in the convex discipline tool (CVX) with the SDPT3 and SEDUMI solvers. The numerical reductions achieved with respect to the benchmark case in terms of energy loss costs and energy purchasing costs were 7.2091% and 3.2105%, which surpassed the results reached by the GAMS software, with reductions of about 6.0316% and 1.5736%.

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.

This research presents an efficient energy management system (EMS) for battery energy storage systems (BESS) connected to monopolar DC distribution networks which considers a high penetration of photovoltaic generation. The optimization model that expresses the EMS system with the BESS and renewable generation can be classified as a nonlinear programming (NLP) model. This study reformulates the NLP model as a recursive convex approximation (RCA) model. The proposed RCA model is developed by applying a linear approximation for the voltage magnitudes only at nodes that include constant power loads. The nodes with BESS and renewables are approximated through the relaxation of their voltage magnitude. Numerical results obtained in the monopolar version of a 33-bus system, which included three generators and three BESS, demonstrate the effectiveness of the RCA reformulation when compared to the solution of the exact NLP model via combinatorial optimization techniques. Additional simulations considering wind power and diesel generators allow one to verify the effectiveness of the proposed RCA in dealing with the efficient operation of distributed energy resources in monopolar DC networks via recursive convex programming.

The objective of this research is to propose an efficient energy management system for photovoltaic (PV) generation units connected to monopolar DC distribution networks via convex optimization while considering a day-ahead dispatch operation scenario. A convex approximation is used which is based on linearization via Taylor’s series expansion to the hyperbolic relations between voltages and powers in the demand nodes. A recursive solution methodology is introduced via sequential convex programming to minimize the errors introduced by the linear approximation in the power balance constraints. Numerical results in the DC version of the IEEE 33-bus grid demonstrate the effectiveness of the proposed convex model when compared to different combinatorial optimization methods, with the main advantage that the optimal global solution is found thanks to the convexity of the solution space and the reduction of the error via an iterative solution approach. Different objective functions are analyzed to validate the effectiveness of the proposed iterative convex methodology (ICM), which corresponds to technical (energy losses reduction), economic (energy purchasing and maintenance costs), and environmental (equivalent emissions of CO2 to the atmosphere in conventional sources) factors. The proposed ICM finds reductions of about 43.9754% in daily energy losses, 26.9957% in energy purchasing and operating costs, and 27.3771% in CO2 emissions when compared to the benchmark case in the DC version of the IEEE 33-bus grid. All numerical validations were carried out in the MATLAB programming environment using the SEDUMI and SDPT3 tools for convex programming and our own scripts for metaheuristic methods.

This paper studies the problem regarding the optimal power dispatch of photovoltaic (PV) distributed generators (DGs) in Direct Current (DC) grid-connected and standalone networks. The mathematical model employed considers the reduction of operating costs, energy losses, and CO2 emissions as objective functions, and it integrates all technical and operating constraints implied by DC grids in a scenario of variable PV generation and power demand. As a solution methodology, a master–slave strategy was proposed, whose master stage employs Antlion Optimizer (ALO) for identifying the values of power to be dispatched by each PV-DG installed in the grid, whereas the slave stage uses a matrix hourly power flow method based on successive approximations to evaluate the objective functions and constraints associated with each solution proposed within the iterative process of the ALO. Two test scenarios were considered: a grid-connected network that considers the operating characteristics of the city of Medellín, Antioquia, and a standalone network that uses data from the municipality of Capurganá, Chocó, both of them located in Colombia. As comparison methods, five continuous optimization methods were used which were proposed in the specialized literature to solve optimal power flow problems in DC grids: the crow search algorithm, the particle swarm optimization algorithm, the multiverse optimization algorithm, the salp swarm algorithm, and the vortex search algorithm. The effectiveness of the proposed method was evaluated in terms of the solution, its repeatability, and its processing times, and it obtained the best results with respect to the comparison methods for both grid types. The simulation results obtained for both test systems evidenced that the proposed methodology obtained the best results with regard to the solution, with short processing times for all of the objective functions analyzed.

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.

This paper deals with the problem regarding the optimal operation of photovoltaic (PV) generation sources in AC distribution networks with a single-phase structure, taking into consideration different objective functions. The problem is formulated as a multi-period optimal power flow applied to AC distribution grids, which generates a nonlinear programming (NLP) model with a non-convex structure. Three different objective functions are considered in the optimization model, each optimized using a single-objective function approach. These objective functions are (i) an operating costs function composed of the energy purchasing costs at the substation bus, added with the PV maintenance costs; (ii) the costs of energy losses; and (iii) the total CO2 emissions at the substation bus. All these functions are minimized while considering a frame of operation of 24 h, i.e., in a day-ahead operation environment. To solve the NLP model representing the studied problem, the General Algebraic Modeling System (GAMS) and its SNOPT solver are used. Two different test feeders are used for all the numerical validations, one of them adapted to the urban operation characteristics in the Metropolitan Area of Medellín, which is composed of 33 nodes, and the other one adapted to isolated rural operating conditions, which has 27 nodes and is located in the department of Chocó, Colombia (municipality of Capurganá). Numerical comparisons with multiple combinatorial optimization methods (particle swarm optimization, the continuous genetic algorithm, the Vortex Search algorithm, and the Ant Lion Optimizer) demonstrate the effectiveness of the GAMS software to reach the optimal day-ahead dispatch of all the PV sources in both distribution grids.

The design of an efficient energy management system (EMS) for monopolar DC networks with high penetration of photovoltaic generation plants is addressed in this research through a convex optimization point of view. The EMS is formulated as a multi-objective optimization problem that involves economic, technical, and environmental objective functions subject to typical constraints regarding power balance equilibrium, thermal conductor capabilities, generation source capacities, and voltage regulation constraints, among others, using a nonlinear programming (NLP) model. The main characteristic of this NLP formulation of the EMS for PV plants is that it is a nonconvex optimization problem owing to the product of variables in the power balance constraint. To ensure an effective solution to this NLP problem, a linear approximation of the power balance constraints using the McCormick equivalent for the product of two variables is proposed. In addition, to eliminate the error introduced by the linearization method, an iterative solution methodology (ISM) is proposed. To solve the multi-objective optimization problem, the weighted optimization method is implemented for each pair of objective functions in conflict, with the main advantage that in this extreme the Pareto front has the optimal global solution for the single-objective function optimization approach. Numerical results in the monopolar version of the IEEE 33-bus grid demonstrated that the proposed ISM reaches the optimal global solution for each one of the objective functions under analysis. It demonstrated that the convex optimization theory is more effective in the EMS design when compared with multiple combinatorial optimization methods.

Given the importance of renewable energy sources in distribution systems, this article addresses the problem of locating and determining the capacity of these sources, namely, wind turbines and solar panels. To solve this optimization problem, a new algorithm based on the behavior of salp is used. The objective functions include reducing losses, improving voltage profiles, and reducing the costs of renewable energy sources. In this method, the allocation of renewable resources is considered for different load models in distribution systems and different load levels using smart meters. Due to the fact that these objective functions are multi-objective, the fuzzy decision-making method is used to select the optimal solution from the set of Pareto solutions. The considered objective functions lead to loss reduction, voltage profile improvement, and RES cost reduction (A allocating RES resources optimally without resource limitations; B: allocating RES resources optimally with resource limitations). In addition, daily wind, solar radiation, and temperature data are taken into account. The proposed method is applied to the IEEE standard 33-bus system. The simulation results show the better performance of the multi-objective salp swarm algorithm (MSSA) at improving voltage profiles and reducing losses in distribution systems. Lastly, the optimal results of the MSSA algorithm are compared with the PSO and GA algorithms.

Due to the increasing demand for electricity around the world, different technologies have been developed to ensure the sustainability of each and every process involved in its production, transmission, and consumption. In addition to ensuring energy sustainability, these technologies seek to improve some of the characteristics of power systems and, in doing so, make them efficient from a financial, technical, and environmental perspective. In particular, solar photovoltaic (PV) technology is one of the power generation technologies that has had the most influence and development in recent years due to its easy implementation and low maintenance costs. Additionally, since PV systems can be located close to the load, power losses during distribution and transmission can be significantly reduced. However, in order to maximize the financial, technical, and environmental variables involved in the operation of an electrical system, a PV power generation project must guarantee the proper location and sizing of the generation sources. In the specialized literature, different studies have employed mathematical methods to determine the optimal location and size of generation sources. These methods model the operation of electrical systems and provide potential analysis scenarios following the deployment of solar PV units. The majority of such studies, however, do not assess the quality and repeatability of the solutions in short processing times. In light of this, the purpose of this study is to review the literature and contributions made in the field.

Objective: In this paper, is present a hybrid optimization methodology for the optimal location and sizing of distributed generators (DGs) in electrical distribution networks. We propose a mixed-integer nonlinear problem (MINLP) model for the mathematical formulation, whose objective function is the minimization of power losses due to the Joule effect in conductors. The constraints we considered include active and reactive power balance, voltage regulation, percentage of penetration of DGs into the distribution network, and total DGs allowed in such network. Methodology: To solve the MINLP model, we employed a master–slave strategy that uses the Chu-Beasley genetic algorithm (CBGA) and the optimal power flow (OPF) model as the master and slave algorithms, respectively. This hybrid technique helps to reduce the complexity of the MINLP model by eliminating binary variables through the master algorithm and then solving the resulting Nonlinear problem (NLP), which corresponds to the OPF model, using a classical interior-point method available in MATLAB’s fmincon toolbox. Results: We tested the efficiency and robustness of the proposed methodology in 33- and 69-node radial distribution networks. The results show its high performance in terms of power loss reduction and final sizing of DGs Conclusions: The results obtained in the test systems under analysis reveal that there is a direct and proportional relationship between technical losses, the percentage of distributed generation penetration, and the number of generators available.

This paper addresses the problem of optimal economic-environmental dispatch in Multi-Terminal High-Voltage Direct Current (MT-HVDC) networks using the Sine-Cosine Algorithm (SCA). This optimization methodology allows working with nonlinear non-convex large-scale optimization problems via sequential programming. The SCA works with an initial population and rules of advance based on the best current solution and sine and cosine functions that define the direction of the next solution. Three variants of the SCA are evaluated in a standard six-node MT-HVDC system considering a linear combination of the objective functions (i.e., greenhouse emissions and energy production costs). The main advantage of the proposed evolutionary approach lies in its pure algorithmic structure. Thus, it can be easily adapted to any continuous optimization problem. All numerical calculations are performed using MATLAB software.

This paper deals with the problem of the optimal reconfiguration of medium voltage distribution networks by proposing a mixed-integer nonlinear programming (MINLP) model. This optimization model has as objective function the minimization of the total power losses in all the branches of the network constrained by active and reactive power balance equations, voltage regulation bounds and device capabilities, among others. The proposed MINLP formulation works with branch-to-node incidence that allows representing the active and reactive power flow in branches as a function of the real and imaginary parts of the voltages and currents. The solution of the MINLP model is reached through the general algebraic modeling system widely know as GAMS package by presenting it in a tutorial form. This software allows implementing in compact form the proposed model and solve it via branch and bound methods. Two test feeders composed by 5 and 14 nodes permits demonstrating the fidelity of the proposed MINLP model regarding power losses minimization when compared with literature reports.

This article reviews the main methodologies employed for the optimal location, sizing, and operation of Distributed Generators (DGs) and Energy Storage Systems (ESSs) in electrical networks. For such purpose, we first analyzed the devices that comprise a microgrid (MG) in an environment with Distributed Energy Resources (DERs) and their modes of operation. Following that, we examined the planning and operation of each DER considered in this study (DGs and ESSs). Finally, we addressed the joint integration of DGs and ESSs into MGs. From this literature review, we were able to identify both the objective functions and constraints that are most commonly used to formulate the problem of the optimal integration and operation of DGs and ESSs in MGs. Moreover, this review allowed us to identify the methodologies that have been employed for such integration, as well as the current needs in the field. With this information, the purpose is to develop new mathematical formulations and approaches for the optimal integration and operation of DERs into MGs that provide financial and operational benefits.

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 CO2 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.

Due to the need to include renewable energy resources in electrical grids as well as the development and high implementation of PV generation and DC grids worldwide, it is necessary to propose effective optimization methodologies that guarantee that PV generators are located and sized on the DC electrical network. This will reduce the operation costs and cover the investment and maintenance cost related to the new technologies (PV distributed generators), thus satisfying all technical and operative constraints of the distribution grid. It is important to propose solution methodologies that require short processing times, with the aim of exploring a large number of scenarios while planning energy projects that are to be presented in public and private contracts, as well as offering solutions to technical problems of electrical distribution companies within short periods of time. Based on these needs, this paper proposes the implementation of a Discrete–Continuous Parallel version of the Particle Swarm Optimization algorithm (DCPPSO) to solve the problem regarding the integration of photovoltaic (PV) distributed generators (DGs) in Direct Current (DC) grids, with the purpose of reducing the annual costs related to energy purchasing as well as the investment and maintenance cost associated with PV sources in a scenario of variable power demand and generation. In order to evaluate the effectiveness, repeatability, and robustness of the proposed methodology, four comparison methods were employed, i.e., a commercial software and three discrete–continuous methodologies, as well as two test systems of 33 and 69 buses. In analyzing the results obtained in terms of solution quality, it was possible to identify that the DCPPSO proposed obtained the best performance in relation to the comparison methods used, with excellent results in relation to the processing times and standard deviation. The main contribution of the proposed methodology is the implementation of a discrete–continuous codification with a parallel processing tool for the evaluation of the fitness function. The results obtained and the reports in the literature for alternating current networks demonstrate that the DCPPSO is the optimization methodology with the best performance in solving the problem of the optimal integration of PV sources in economic terms and for any kind of electrical system and size.

The problem of optimally integrating PV DGs into electrical networks to reduce annual costs (which include energy purchase and investment costs) was addressed in this research by presenting a new solution methodology. For such purpose, we used a Discrete–Continuous Parallel Particle Swarm Optimization method (DCPPSO), which considers both the discrete and continuous variables associated with the location and sizing of DGs in an electrical network and employs a parallel processing tool to reduce processing times. The optimization parameters of the proposed solution methodology were tuned using an external optimization algorithm. To validate the performance of DCPPSO, we employed the 33- and 69-bus test systems and compared it with five other solution methods: the BONMIN solver of the General Algebraic Modeling System (GAMS) and other four discrete–continuous methodologies that have been recently proposed. According to the findings, the DCPPSO produced the best results in terms of quality of the solution, processing time, and repeatability in electrical networks of any size, since it showed a better performance as the size of the electrical system increased.

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.

This paper presents a new methodology to simultaneously solve the optimal conductor selection and optimal phase-balancing problems in unbalanced three-phase distribution systems. Both problems were represented by means of a mathematical model known as the Mixed-Integer Nonlinear Programming (MINLP) model, and the objective function was the minimization of the total annual operating costs. The latter included the costs associated with energy losses, investment in conductors per network segment, and phase reconfiguration at each node in the system. To solve the problem addressed in this study, a master–slave methodology was implemented. The master stage employs a discrete version of the Salp Swarm Algorithm (SSA) to determine the set of conductors to be installed in each line, as well as the set of connections per phase at each of the nodes that compose the system. Afterward, the slave stage uses the three-phase version of the backward/forward sweep power flow method to determine the value of the fitness function of each individual provided by the master stage. Compared to those of the Hurricane-based Optimization Algorithm (HOA) and the Sine Cosine Algorithm (SCA), the numerical results obtained by the proposed solution methodology in the IEEE 8- and 25-node test systems demonstrate its applicability and effectiveness. All the numerical validations were performed in MATLAB.

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.

Currently, with the quick increase in global population, the energetic crisis, the environmental problematic, and the development of the power electronic devices generated the need to include new technologies for supporting and potentiating electrical distributions systems; Distribution Static Compensators (D-STATCOMs) are highly used for this task due to the advantages that this technology presents: reduction in power loss, operation costs, and chargeability of branches, among others. The possibility to include this kind of technology within the electrical system has shown the need to develop efficient methodologies from the point of view of quality solution, repeatability and processing times by considering operation and investment costs as well as the technical conditions of the electrical grids under a scenario of variable power demand and then representing the real operation of the electrical grid. With the aim to propose a solution for this requirement, this paper presents a new Discrete-Continuous Particle Swarm Optimization (DCPSO) algorithm to solve the problem of the optimal integration of D-STATCOMs into Electrical Distribution Systems (EDSs). In this case, the objective function is the minimization of annual operating costs by using a weighted mono-objective function composed of the annual power loss and the investment cost and by including all constraints associated with the operation of an EDS in a distributed reactive compensation environmentinside the mathematical formulation. In order to evaluate the effectiveness and robustness of the proposed solution method, this study implemented two tests systems (i.e., 33- and 69-bus), as well as four comparison methods, and different considerations related to the inclusion of D-STATCOMs in the EDSs. Furthermore, for evaluating the repeatability of the solution obtained by each solution methods used, each algorithm was executed 100 times in Matlab software. The results obtained demonstrated that the proposed DCPSO/HSA methodology achieved the best trade-off between solution quality and processing time, with low standard deviation values for EDSs of any size.

This paper proposes a new solution methodology based on a mixed-integer conic formulation to locate and size photovoltaic (PV) generation units in AC distribution networks with a radial structure. The objective function comprises the annual expected energy costs of the conventional substation in addition to the investment and operating costs of PV sources. The original optimization model that represents this problem belongs to the family of mixed-integer nonlinear programming (MINLP); however, the complexity of the power balance constraints make it difficult to find the global optimum. In order to improve the quality of the optimization model, a mixed-integer conic (MIC) formulation is proposed in this research in order to represent the studied problem. Numerical results in two test feeders composed of 33 and 69 nodes demonstrate the effectiveness of the proposed MIC model when compared to multiple metaheuristic optimizers such as the Chu and Beasley Genetic Algorithm, the Newton Metaheuristic Algorithm, the Vortex Search Algorithm, the Gradient-Based Metaheuristic Optimization Algorithm, and the Arithmetic Optimization Algorithm, among others. The final results obtained with the MIC model show improvements greater than USD 100,000 per year of operation. All simulations were run in the MATLAB programming environment, using its own scripts for all the metaheuristic algorithms and the disciplined convex tool known as CVX with the Gurobi solver in order to solve the proposed MIC model.

This paper proposes a sliding-mode controller to ensure both the global stability and maximum power generation of a photovoltaic system based on a flyback converter. The controller is based on an adaptive sliding-surface, which is designed to impose a constant frequency to the switching converter, thus simplifying the selection of both the passive and active elements of the device. Moreover, the controller stability is analyzed using the transversality, reachability and equivalent control conditions. The solution also includes an auto-tuning process for the parameters of the perturb and observe algorithm, which are calculated to ensure the global stability of the sliding-mode controller, thus ensuring the PV system stability. Finally, the performance of the complete solution is verified using detailed circuital simulations of a realistic application case.

The problem of optimal siting and dimensioning of photovoltaic (PV) generators in medium-voltage distribution networks is addressed in this research from the perspective of combinatorial optimization. The exact mixed-integer programming (MINLP) model is solved using a master–slave (MS) optimization approach. In the master stage, the generalized normal distribution optimization (GNDO) with a discrete–continuous codification is used to represent the locations and sizes of the PV generators. In the slave stage, the generalization of the backward/forward power method, known as the successive approximation power flow method, is adopted. Numerical simulations in the IEEE 33-bus and 69-bus systems demonstrated that the GNDO approach is the most efficient method for solving the exact MINLP model, as it obtained better results than the genetic algorithm, vortex-search algorithm, Newton-metaheuristic optimizer, and exact solution using the General Algebraic Modeling System (GAMS) software with the BONMIN solver. Simulations showed that, on average, the proposed MS optimizer reduced the total annual operative costs by approximately 27% for both test feeders when compared with the reference case. In addition, variations in renewable generation availability showed that from 30% ahead, positive reductions with respect to the reference case were obtained.

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.

This research addresses the problem of the optimal placement and sizing of (PV) sources in medium voltage distribution grids through the application of the recently developed Newton metaheuristic optimization algorithm (NMA). The studied problem is formulated through a mixed-integer nonlinear programming model where the binary variables regard the installation of a PV source in a particular node, and the continuous variables are associated with power generations as well as the voltage magnitudes and angles, among others. To improve the performance of the NMA, we propose the implementation of a discrete–continuous codification where the discrete component deals with the location problem and the continuous component works with the sizing problem of the PV sources. The main advantage of the NMA is that it works based on the first and second derivatives of the fitness function considering an evolution formula that contains its current solution (xit) and the best current solution (xbest), where the former one allows location exploitation and the latter allows the global exploration of the solution space. To evaluate the fitness function and its derivatives, the successive approximation power flow method was implemented, which became the proposed solution strategy in a master–slave optimizer, where the master stage is governed by the NMA and the slave stage corresponds to the power flow method. Numerical results in the IEEE 34- and IEEE 85-bus systems show the effectiveness of the proposed optimization approach to minimize the total annual operative costs of the network when compared to the classical Chu and Beasley genetic algorithm and the MINLP solvers available in the general algebraic modeling system with reductions of 26.89% and 27.60% for each test feeder with respect to the benchmark cases.

This paper deals with the multi-objective operation of battery energy storage systems (BESS) in AC distribution systems using a convex reformulation. The objective functions are CO2 emissions, and the costs of the daily energy losses are considered. The conventional non-linear nonconvex branch multi-period optimal power flow model is reformulated with a second-order cone programming (SOCP) model, which ensures finding the global optimum for each point present in the Pareto front. The weighting factors methodology is used to convert the multi-objective model into a convex single-objective model, which allows for finding the optimal Pareto front using an iterative search. Two operational scenarios regarding BESS are considered: (i) a unity power factor operation and (ii) a variable power factor operation. The numerical results demonstrate that including the reactive power capabilities in BESS reduces 200 kg of CO2 emissions and USD 80 per day of operation. All of the numerical validations were developed in MATLAB 2020b with the CVX tool and the SEDUMI and SDPT3 solvers.

In this paper, we propose a master–slave methodology to address the problem of optimal integration (location and sizing) of Distributed Generators (DGs) in Direct Current (DC) networks. This proposed methodology employs a parallel version of the Population-Based Incremental Learning (PPBIL) optimization method in the master stage to solve the location problem and the Vortex Search Algorithm (VSA) in the slave stage to solve the sizing problem. In addition, it uses the reduction of power losses as the objective function, considering all the constraints associated with the technical conditions specific to DGs and DC networks. To validate its effectiveness and robustness, we use as comparison methods, different solution methodologies that have been reported in the specialized literature, as well as two test systems (the 21 and 69-bus test systems). All simulations were performed in MATLAB. According to the results, the proposed hybrid (PPBIL–VSA) methodology provides the best trade-off between quality of the solution and processing times and exhibits an adequate repeatability every time it is executed.

With this study, we address the optimal phase balancing problem in three-phase networks with asymmetric loads in reference to a mixed-integer quadratic convex (MIQC) model. The objective function considers the minimization of the sum of the square currents through the distribution lines multiplied by the average resistance value of the line. As constraints are considered for the active and reactive power redistribution in all the nodes considering a 3×3 binary decision variable having six possible combinations, the branch and nodal current relations are related to an extended upper-triangular matrix. The solution offered by the proposed MIQC model is evaluated using the triangular-based three-phase power flow method in order to determine the final steady state of the network with respect to the number of power loss upon the application of the phase balancing approach. The numerical results in three radial test feeders composed of 8, 15, and 25 nodes demonstrated the effectiveness of the proposed MIQC model as compared to metaheuristic optimizers such as the genetic algorithm, black hole optimizer, sine–cosine algorithm, and vortex search algorithm. All simulations were carried out in MATLAB 2020a using the CVX tool and the Gurobi solver.

This paper addresses the phase-balancing problem in three-phase power grids with the radial configuration from the perspective of master–slave optimization. The master stage corresponds to an improved version of the Chu and Beasley genetic algorithm, which is based on the multi-point mutation operator and the generation of solutions using a Gaussian normal distribution based on the exploration and exploitation schemes of the vortex search algorithm. The master stage is entrusted with determining the configuration of the phases by using an integer codification. In the slave stage, a power flow for imbalanced distribution grids based on the three-phase version of the successive approximation method was used to determine the costs of daily energy losses. The objective of the optimization model is to minimize the annual operative costs of the network by considering the daily active and reactive power curves. Numerical results from a modified version of the IEEE 37-node test feeder demonstrate that it is possible to reduce the annual operative costs of the network by approximately 20% by using optimal load balancing. In addition, numerical results demonstrated that the improved version of the CBGA is at least three times faster than the classical CBGA, this was obtained in the peak load case for a test feeder composed of 15 nodes; also, the improved version of the CBGA was nineteen times faster than the vortex search algorithm. Other comparisons with the sine–cosine algorithm and the black hole optimizer confirmed the efficiency of the proposed optimization method regarding running time and objective function values.

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 l1-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.

The power flow problem in three-phase unbalanced distribution networks is addressed in this research using a derivative-free numerical method based on the upper-triangular matrix. The upper-triangular matrix is obtained from the topological connection among nodes of the network (i.e., through a graph-based method). The main advantage of the proposed three-phase power flow method is the possibility of working with single-, two-, and three-phase loads, including Δ- and Y-connections. The Banach fixed-point theorem for loads with Y-connection helps ensure the convergence of the upper-triangular power flow method based an impedance-like equivalent matrix. Numerical results in three-phase systems with 8, 25, and 37 nodes demonstrate the effectiveness and computational efficiency of the proposed three-phase power flow formulation compared to the classical three-phase backward/forward method and the implementation of the power flow problem in the DigSILENT software. Comparisons with the backward/forward method demonstrate that the proposed approach is 47.01%, 47.98%, and 36.96% faster in terms of processing times by employing the same number of iterations as when evaluated in the 8-, 25-, and 37-bus systems, respectively. An application of the Chu-Beasley genetic algorithm using a leader–follower optimization approach is applied to the phase-balancing problem utilizing the proposed power flow in the follower stage. Numerical results present optimal solutions with processing times lower than 5 s, which confirms its applicability in large-scale optimization problems employing embedding master–slave optimization structures.

This work proposed a base method for automated assessment of Small Hydro-Power (SHP) potential for a run-of-river (RoR) scheme using geographic information systems (GIS). The hydro-power potential (HP) was represented through a comprehensive methodology consisting of a structured raster database. A calibrated and validated hydrological model (Soil and Water Assessment Tool—SWAT) was used to estimate monthly streamflow as the Mesh Sweeping Approach (MSA) driver. The methodology was applied for the upper part of the Huazuntlan River Watershed in Los Tuxtlas Mountains, Mexico. The MSA divided the study area into a rectangular mesh. Then, at every location within the mesh, SHP was obtained. The main components of the MSA as a RoR scheme were the intake, the powerhouse, and the surge tank. The surge tank was located at cells where the hydro-power was calculated and used as a reference to later locate the intake and powerhouse by maximizing the discharge and head. SHP calculation was performed by sweeping under different values of the penstock’s length, and the headrace’s length. The maximum permissible lengths for these two variables represented potential hydro-power generation locations. Results showed that the headrace’s length represented the major contribution for hydro-power potential estimation. Additionally, values of 2000 m and 1500 m for the penstock and the headrace were considered potential thresholds as there is no significant increment in hydro-power after increasing any of these values. The availability of hydro-power on a raster representation has advantages for further hydro-power data analysis and processing.

This research addresses the problem of the optimal location and sizing distributed generators (DGs) in direct current (DC) distribution networks from the combinatorial optimization. It is proposed a master–slave optimization approach in order to solve the problems of placement and location of DGs, respectively. The master stage applies to the classical Chu & Beasley genetic algorithm (GA), while the slave stage resolves a second-order cone programming reformulation of the optimal power flow problem for DC grids. This master–slave approach generates a hybrid optimization approach, named GA-SOCP. The main advantage of optimal dimensioning of DGs via SOCP is that this method makes part of the exact mathematical optimization that guarantees the possibility of finding the global optimal solution due to the solution space’s convex structure, which is a clear improvement regarding classical metaheuristic optimization methodologies. Numerical comparisons with hybrid and exact optimization approaches reported in the literature demonstrate the proposed hybrid GA-SOCP approach’s effectiveness and robustness to achieve the global optimal solution. Two test feeders compose of 21 and 69 nodes that can locate three distributed generators are considered. All of the computational validations have been carried out in the MATLAB software and the CVX tool for convex optimization.

This paper deals with a classical problem in power system analysis regarding the optimal location and sizing of distributed generators (DGs) in direct current (DC) distribution networks using the mathematical optimization. This optimization problem is divided into two sub-problems as follows: the optimal location of DGs is a problem, with those with a binary structure being the first sub-problem; and the optimal sizing of DGs with a nonlinear programming (NLP) structure is the second sub-problem. These problems originate from a general mixed-integer nonlinear programming model (MINLP), which corresponds to an NP-hard optimization problem. It is not possible to provide the global optimum with conventional programming methods. A mixed-integer semidefinite programming (MI-SDP) model is proposed to address this problem, where the binary part is solved via the branch and bound (B&B) methods and the NLP part is solved via convex optimization (i.e., SDP). The main advantage of the proposed MI-SDP model is the possibility of guaranteeing a global optimum solution if each of the nodes in the B&B search is convex, as is ensured by the SDP method. Numerical validations in two test feeders composed of 21 and 69 nodes demonstrate that in all of these problems, the optimal global solution is reached by the MI-SDP approach, compared to the classical metaheuristic and hybrid programming models reported in the literature. All the simulations have been carried out using the MATLAB software with the CVX tool and the Mosek solver.

This paper deals with the problem of the optimal selection of capacitor banks in electrical AC distribution systems for minimizing the costs of energy losses during a year of operation through a discrete version of the vortex search algorithm (DVSA). This algorithm works with a hypersphere with a variable radius defined by an exponential function where a Gaussian distribution is used to generate a set of candidate solutions uniformly distributed around the center of this hypersphere. This center corresponds to the best solution obtained at the iteration t, which is initialized at the center of the solution space at the iterative search beginning. The main advantage of combining the exponential function with the Gaussian distribution is the correct balance between the exploration and exploitation of the solution space, which allows reaching the global optimal solution of the optimization problem with a low standard deviation, i.e., guaranteeing repeatability at each simulation. Two classical distribution networks composed of 33 and 69 nodes were used to validate the proposed DVSA algorithm. They demonstrated that the DVSA improves numerical reports found in specialized literature regarding the optimal selection and location of fixed-step capacitor banks with a low computational burden. All the simulations were carried out in MATLAB software.

In the last decade, the deployment of electric vehicles (EVs) has been largely promoted. This development has increased challenges in the power systems in the context of planning and operation due to the massive amount of recharge needed for EVs. Furthermore, EVs may also offer new opportunities and can be used to support the grid to provide auxiliary services. In this regard, and considering the research around EVs and power grids, this paper presents a chronological background review of EVs and their interactions with power systems, particularly electric distribution networks, considering publications from the IEEE Xplore database. The review is extended from 1973 to 2019 and is developed via systematic classification using key categories that describe the types of interactions between EVs and power grids. These interactions are in the framework of the power quality, study of scenarios, electricity markets, demand response, demand management, power system stability, Vehicle-to-Grid (V2G) concept, and optimal location of battery swap and charging stations.

A convex mathematical model based on second-order cone programming (SOCP) for the optimal operation in direct current microgrids (DCMGs) with high-level penetration of renewable energies and battery energy storage systems (BESSs) is developed in this paper. The SOCP formulation allows converting the non-convex model of economic dispatch into a convex approach that guarantees the global optimum and has an easy implementation in specialized software, i.e., CVX. This conversion is accomplished by performing a mathematical relaxation to ensure the global optimum in DCMG. The SOCP model includes changeable energy purchase prices in the DCMG operation, which makes it in a suitable formulation to be implemented in real-time operation. An energy short-term forecasting model based on a receding horizon control (RHC) plus an artificial neural network (ANN) is used to forecast primary sources of renewable energy for periods of 0.5h. The proposed mathematical approach is compared to the non-convex model and semidefinite programming (SDP) in three simulation scenarios to validate its accuracy and efficiency.

This paper addresses the problem of the optimal location and sizing of photovoltaic (PV) sources in direct current (DC) electrical networks considering time-varying load and renewable generation curves. To represent this problem, a mixed-integer nonlinear programming (MINLP) model is developed. The main idea of including PV sources in the DC grid is minimizing the total greenhouse emissions produced by diesel generators in isolated areas. An artificial neural network is employed for short-term forecasting to deal with uncertainties in the PV power generation. The general algebraic modeling system (GAMS) package is employed to solve the MINLP model by using the CONOPT solver that works with mixed and integer variables. Numerical results demonstrate important reductions of harmful gas emissions to the atmosphere when PV sources are optimally integrated (size and location) to the DC grid.