An Approximate Mixed-Integer Convex Model to Reduce Annual Operating Costs in Radial Distribution Networks Using STATCOMs

The problem of optimal siting and sizing of distribution static compensators (STATCOMs) is addressed in this research from the point of view of exact mathematical optimization. The exact mixed-integer nonlinear programming model (MINLP) is decoupled into two convex optimization sub-problems, named the location problem and the sizing problem. The location problem is addressed by relaxing the exact MINLP model, assuming that all the voltages are equal to 1∠0∘, which allows obtaining a mixed-integer quadratic programming model as a function of the active and reactive power flows. The solution of this model provides the best set of nodes to locate all the STATCOMs. When all the nodes are selected, it solves the optimal reactive power problem through a second-order cone programming relaxation of the exact optimal power flow problem; the solution of the SOCP model provides the optimal sizes of the STATCOMs. Finally, it refines the exact objective function value due to the intrinsic non-convexities associated with the costs of the STATCOMs that were relaxed through the application of Taylor’s series expansion in the location and sizing stages. The numerical results in the IEEE 33- and 69-bus systems demonstrate the effectiveness and robustness of the proposed optimization problem when compared with large-scale MINLP solvers in GAMS and the discrete-continuous version of the vortex search algorithm (DCVSA) recently reported in the current literature. With respect to the benchmark cases of the test feeders, the proposed approach reaches the best reductions with 14.17% and 15.79% in the annual operative costs, which improves the solutions of the DCVSA, which are 13.71% and 15.30%, respectively.

On the Optimal Selection and Integration of Batteries in DC Grids through a Mixed-Integer Quadratic Convex Formulation

This paper deals with the problem of the optimal selection and location of batteries in DC distribution grids by proposing a new mixed-integer convex model. The exact mixed-integer nonlinear model is transformed into a mixed-integer quadratic convex model (MIQC) by approximating the product among voltages in the power balance equations as a hyperplane. The most important characteristic of our proposal is that the MIQC formulations ensure the global optimum reaching via branch & bound methods and quadratic programming since each combination of the binary variables generates a node with a convex optimization subproblem. The formulation of the objective function is associated with the minimization of the energy losses for a daily operation scenario considering high renewable energy penetration. Numerical simulations show the effectiveness of the proposed MIQC model to reach the global optimum of the optimization model when compared with the exact optimization model in a 21-node test feeder. All the validations are carried out in the GAMS optimization software.

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

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.

An efficient inverse method for structural identification considering modeling and response uncertainties

The inverse problem analysis method provides an effective way for the structural parameter identification. Due to the coupling of multi-source uncertainties in the measured responses and the modeling parameters, the inverse of unknown structural parameter will face the challenges in the solving mechanism and the computational cost. In this paper, an uncertain inverse method based on convex model and dimension reduction decomposition is proposed to realize the interval identification of unknown structural parameter according to the uncertain measured responses and modeling parameters. Firstly, the polygonal convex set model is established to quantify the uncertainties of modeling parameters. Afterwards, a space collocation method based on dimension reduction decomposition is proposed to transform the inverse problem considering multi-source uncertainties into a few interval inverse problems considering response uncertainty. The transformed interval inverse problem involves the two-layer solving process including interval propagation and optimization updating. In order to solve the interval inverse problems considering response uncertainty, an efficient interval inverse method based on the high dimensional model representation and affine algorithm is further developed. Through the coupling of the above two methods, the proposed uncertain inverse method avoids the time-consuming multi-layer nested calculation procedure, and then effectively realize the inverse uncertainty quantification of unknown structural parameters. Finally, two engineering examples are provided to verify the effectiveness of the proposed uncertain inverse method.

A Decoupling Strategy for Reliability Analysis of Multidisciplinary System with Aleatory and Epistemic Uncertainties

In reliability-based multidisciplinary design optimization, both aleatory and epistemic uncertainties may exist in multidisciplinary systems simultaneously. The uncertainty propagation through coupled subsystems makes multidisciplinary reliability analysis computationally expensive. In order to improve the efficiency of multidisciplinary reliability analysis under aleatory and epistemic uncertainties, a comprehensive reliability index that has clear geometric meaning under multisource uncertainties is proposed. Based on the comprehensive reliability index, a sequential multidisciplinary reliability analysis method is presented. The method provides a decoupling strategy based on performance measure approach (PMA), probability theory and convex model. In this strategy, the probabilistic analysis and convex analysis are decoupled from each other and performed sequentially. The probabilistic reliability analysis is implemented sequentially based on the concurrent subspace optimization (CSSO) and PMA, and the non-probabilistic reliability analysis is replaced by convex model extreme value analysis, which improves the efficiency of multidisciplinary reliability analysis with aleatory and epistemic uncertainties. A mathematical example and an engineering application are demonstrated to verify the effectiveness of the proposed method.

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

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.

Exact minimization of the energy losses and the CO2 emissions in isolated DC distribution networks using PV sources

This paper addresses the optimal location and sizing of photovoltaic (PV) sources in isolated direct current (DC) electrical networks, considering time-varying load and renewable generation curves. The mathematical formulation of this problem corresponds to mixed-integer nonlinear programming (MINLP), which is reformulated via mixed-integer convex optimization: This ensures the global optimum solving the resulting optimization model via branch & bound and interior-point methods. The main idea of including PV sources in the DC grid is to minimize the daily energy losses and greenhouse emissions produced by diesel generators in isolated areas. The GAMS package is employed to solve the MINLP model, using mixed and integer variables; also, the CVX and MOSEK solvers are used to obtain solutions from the proposed mixed-integer convex model in the MATLAB. Numerical results demonstrate important reductions in the daily energy losses and the harmful gas emissions when PV sources are optimally integrated into DC grid.