In this paper, we propose a new discrete-continuous codification of the Chu–Beasley genetic algorithm to address the optimal placement and sizing problem of the distribution static compensators (D-STATCOM) in electrical distribution grids. The discrete part of the codification determines the nodes where D-STATCOM will be installed. The continuous part of the codification regulates their sizes. The objective function considered in this study is the minimization of the annual operative costs regarding energy losses and installation investments in D-STATCOM. This objective function is subject to the classical power balance constraints and devices’ capabilities. The proposed discrete-continuous version of the genetic algorithm solves the mixed-integer non-linear programming model that the classical power balance generates. Numerical validations in the 33 test feeder with radial and meshed configurations show that the proposed approach effectively minimizes the annual operating costs of the grid. In addition, the GAMS software compares the results of the proposed optimization method, which allows demonstrating its efficiency and robustness.

https://www.mdpi.com/2079-9292/10/12/1452/pdf

Optimal Placement and Sizing of D-STATCOM in Radial and Meshed Distribution Networks Using a Discrete-Continuous Version of the Genetic Algorithm

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.

https://www.mdpi.com/2073-8994/13/7/1124/pdf

Optimal Demand Reconfiguration in Three-Phase Distribution Grids Using an MI-Convex Model

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

https://www.mdpi.com/1996-1073/14/15/4535/pdf

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

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.

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

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.

https://www.mdpi.com/2073-431X/10/9/109/pdf

Approximated Mixed-Integer Convex Model for Phase Balancing in Three-Phase Electric Networks

The problem of the optimal siting and placement of static compensates (STATCOMs) in power systems is addressed in this paper from an exact mathematical optimization point of view. A mixed-integer nonlinear programming model to present the problem was developed with the aim of minimizing the annual operating costs of the power system, which is the sum of the costs of the energy losses and of the installation of the STATCOMs. The optimization model has constraints regarding the active and reactive power balance equations and those associated with the devices’ capabilities, among others. To characterize the electrical behavior of the power system, different load profiles such as residential, industrial, and commercial are considered for a period of 24 h of operation. The solution of the proposed model is reached with the general algebraic modeling system optimization package. The numerical results indicate the positive effect of the dynamic reactive power injections in the power systems on annual operating cost reduction. A Pareto front was built to present the multi-objective behavior of the studied problem when compared to investment and operative costs. The complete numerical validations are made in the IEEE 24-, IEEE 33-, and IEEE 69-bus systems, respectively.

Jose Angel Barrios

Papers

Optimal Demand Reconfiguration in Three-Phase Distribution Grids Using an MI-Convex Model

Reduction of Annual Operational Costs in Power Systems through the Optimal Siting and Sizing of STATCOMs