31 July 2006 in IEEE Transactions on Power Systems
This paper shows that the load flow problem of a radial distribution system can be modeled as a convex optimization problem, particularly a conic program. The implications of the conic programming formulation are threefold. First, the solution of the distribution load flow problem can be obtained in polynomial time using interior-point methods. Second, numerical ill-conditioning can be automatically alleviated by the use of scaling in the interior-point algorithm. Third, the conic formulation facilitates the inclusion of the distribution power flow equations in radial system optimization problems. A state-of-the-art implementation of an interior-point method for conic programming is used to obtain the solution of nine different distribution systems. Comparisons are carried out with a previously published radial load flow program by R. Cespedes
27 January 2012 in IEEE Transactions on Power Systems
This paper proposes a mixed-integer conic programming formulation for the minimum loss distribution network reconfiguration problem. This formulation has two features: first, it employs a convex representation of the network model which is based on the conic quadratic format of the power flow equations and second, it optimizes the exact value of the network losses. The use of a convex model in terms of the continuous variables is particularly important because it ensures that an optimal solution obtained by a branch-and-cut algorithm for mixed-integer conic programming is global. In addition, good quality solutions with a relaxed optimality gap can be very efficiently obtained. A polyhedral approximation which is amenable to solution via more widely available mixed-integer linear programming software is also presented. Numerical results on practical test networks including distributed generation show that mixed-integer convex optimization is an effective tool for network reconfiguration.
6 August 2013 in IEEE Transactions on Power Systems
This paper presents an adjustable robust optimization approach to account for the uncertainty of renewable energy sources (RESs) in optimal power flow (OPF). It proposes an affinely adjustable robust OPF formulation where the base-point generation is calculated to serve the forecast load which is not balanced by RESs, and the generation control through participation factors ensures a feasible solution for all realizations of RES output within a prescribed uncertainty set. The adjustable robust OPF framework is solved using quadratic programming with successive constraint enforcement and can coordinate the computation of both the base-point generation and participation factors. Numerical results on standard test networks reveal a relatively small increase in the expected operational cost as the uncertainty level increases. In addition, solutions of networks that include both uncertain wind generation and Gaussian distributed demand are shown to have less cost and a higher level of robustness as compared to those from a recent robust scheduling method.
30 October 2009 in IEEE Transactions on Power Systems
This paper presents a probabilistic approach for statistical modeling of the loads in distribution networks. In a distribution network, the probability density functions (pdfs) of loads at different buses show a number of variations and cannot be represented by any specific distribution. The approach presented in this paper represents all the load pdfs through Gaussian mixture model (GMM). The expectation maximization (EM) algorithm is used to obtain the parameters of the mixture components. The performance of the method is demonstrated on a 95-bus generic distribution network model.
25 June 2013 in IEEE Transactions on Power Systems
This paper presents a robust optimization approach for transmission network expansion planning (TNEP) under uncertainties of renewable generation and load. Unlike conventional stochastic programming, the proposed approach does not require knowledge of the probability distribution of the uncertain net injections; rather the uncertainties of the net injections are specified by a simple uncertainty set. The solution algorithm is exact and produces expansion plans that are robust against all possible realizations of the net injections defined in the uncertainty set; it is based on a Benders decomposition scheme that iterates between a master problem that minimizes the cost of the expansion plan and a slave problem that minimizes the maximum curtailment of load and renewable generation. The paper demonstrates that when adopting the dc load flow model, both the master and the dual slave can be formulated as mixed-integer linear programs for which commercial solvers exist. Numerical results on several networks with uncertainties in their loads and renewable generation show that the proposed approach produces solutions that are superior to those from two recent techniques for robust TNEP design.
16 September 2013 in IEEE Transactions on Power Systems
The uptake of variable megawatts from photovoltaics (PV) challenges distribution system operation. The primary problem is significant voltage rise in the feeder that forces existing voltage control devices such as on-load tap-changers and line voltage regulators to operate continuously. The consequence is the deterioration of the operating life of the voltage control mechanism. Also, conventional non-coordinated reactive power control can result in the operation of the line regulator at its control limit (runaway condition). This paper proposes an optimal reactive power coordination strategy based on the load and irradiance forecast. The objective is to minimize the number of tap operations so as not to reduce the operating life of the tap control mechanism and avoid runaway. The proposed objective is achieved by coordinating various reactive power control options in the distribution network while satisfying constraints such as maximum power point tracking of PV and voltage limits of the feeder. The option of voltage support from PV plant is also considered. The problem is formulated as constrained optimization and solved through the interior point technique. The effectiveness of the approach is demonstrated in a realistic distribution network model.