A mixed-integer nonlinear programming model for optimal reconfiguration of DC distribution feeders

This paper deals with the optimal reconfiguration problem of DC distribution networks by proposing a new mixed-integer nonlinear programming (MINLP) formulation. This MINLP model focuses on minimising the power losses in the distribution lines by reformulating the classical power balance equations through a branch-to-node incidence matrix. The general algebraic modelling system (GAMS) is chosen as a solution tool, showing in tutorial form the implementation of the proposed MINLP model in a 6-nodes test feeder with 10 candidate lines. The validation of the MINLP formulation is performed in two classical 10-nodes DC test feeders. These are typically used for power flow and optimal power flow analyses. Numerical results demonstrate that power losses are reduced by about 16% when the optimal reconfiguration plan is found. The numerical validations are made in the GAMS software licensed by Universidad Tecnológica de Bolívar

Optimal methodology for distribution systems reconfiguration based on OPF and solved by decomposition technique

This paper presents a new and efficient methodology for distribution network reconfiguration integrated with optimal power flow (OPF) based on a Benders decomposition approach. The objective minimizes power losses, balancing load among feeders and subject to constraints: capacity limit of branches, minimum and maximum power limits of substations or distributed generators, minimum deviation of bus voltages and radial optimal operation of networks. The Generalized Benders decomposition algorithm is applied to solve the problem. The formulation can be embedded under two stages; the first one is the Master problem and is formulated as a mixed integer non-linear programming problem. This stage determines the radial topology of the distribution network. The second stage is the Slave problem and is formulated as a non-linear programming problem. This stage is used to determine the feasibility of the Master problem solution by means of an OPF and provides information to formulate the linear Benders cuts that connect both problems. The model is programmed in GAMS. The effectiveness of the proposal is demonstrated through two examples extracted from the literature

A coordinated control method of voltage and reactive power for active distribution net-works based on soft open point

The increasing penetration of distributed generators (DGs) exacerbates the risk of voltage violations in active distribu-tion networks (ADNs). The conventional voltage regulation de-vices limited by the physical constraints are difficult to meet the requirement of real-time voltage and VAR control (VVC) with high precision when DGs fluctuate frequently. However, soft open point (SOP), a flexible power electronic device, can be used as the continuous reactive power source to realize the fast voltage regu-lation. Considering the cooperation of SOP and multiple regula-tion devices, this paper proposes a coordinated VVC method based on SOP for ADNs. Firstly, a time-series model of coordi-nated VVC is developed to minimize operation costs and eliminate voltage violations of ADNs. Then, by applying the linearization and conic relaxation, the original nonconvex mixed-integer non-linear optimization model is converted into a mixed-integer sec-ond-order cone programming (MISOCP) model which can be efficiently solved to meet the requirement of voltage regulation rapidity. Case studies are carried out on the IEEE 33-node system and IEEE 123-node system to illustrate the effectiveness of the proposed method

A New Efficient Stochastic Energy Management Technique for Interconnected AC Microgrids

Cooperating interconnected microgrids with the Distribution System Operation (DSO) can lead to an improvement in terms of operation and reliability. This paper investigates the optimal operation and scheduling of interconnected microgrids highly penetrated by renewable energy resources (DERs). Moreover, an efficient stochastic framework based on the Unscented Transform (UT) method is proposed to model uncertainties associated with the hourly market price, hourly load demand and DERs output power. Prior to the energy management, a newly developed linearization technique is employed to linearize nodal equations extracted from the AC power flow. The proposed stochastic problem is formulated as a single-objective optimization problem minimizing the interconnected AC MGs cost function. In order to validate the proposed technique, a modified IEEE 69 bus network is studied as the test case

Optimizing Service Restoration in Distribution Systems with Uncertain Repair Time and Demand

This paper proposes a novel method to co-optimize distribution system operation and repair crew routing for outage restoration after extreme weather events. A two-stage stochastic mixed integer linear program is developed. The first stage is to dispatch the repair crews to the damaged components. The second stage is distribution system restoration using distributed generators, and reconfiguration. We consider demand uncertainty in terms of a truncated normal forecast error distribution, and model the uncertainty of the repair time using a lognormal distribution. A new decomposition approach, combined with the Progressive Hedging algorithm, is developed for solving large-scale outage management problems in an effective and timely manner. The proposed method is validated on modified IEEE 34- and 8500-bus distribution test systems.Comment: Under review in IEEE Transactions on Power System

Feeder Reconfiguration in Distribution Networks Based on Convex Relaxation of OPF

The feeder reconfiguration problem chooses the on/off status of the switches in a distribution network in order to minimize a certain cost such as power loss. It is a mixed-integer nonlinear program and, hence, hard to solve. In this paper, we propose a heuristic algorithm that is based on the recently developed convex relaxation of the ac optimal power flow problem. The algorithm is computationally efficient and scales linearly with the number of redundant lines. It requires neither parameter tuning nor initialization for different networks. It successfully computes an optimal configuration on all four networks we have tested. Moreover, we have proved that the algorithm solves the feeder reconfiguration problem optimally under certain conditions for the case where only a single redundant line needs to be opened. We also propose a more computationally efficient algorithm and show that it incurs a loss in optimality of less than 3% on the four test networks