Search

In this paper, we propose a novel Newton method-based distributed algorithm (NMDA), which is also effective in solving the general single-area EDP (SAEDP), to deal with the multi-area economic dispatch problem (MAEDP), of which the focus is to minimize the total generation cost in the presence of system and generator constraints. To develop the NMDA, we first introduce a virtual SAEDP formulation to fit the framework of Newton method (NM), and then employ the average consensus protocol to obtain the global information needed to execute the NM and backtracking line search algorithm in a distributed manner. Compared with the centralized methods that can yield the optimal solution, the proposed NMDA provides a suboptimal solution with a very small relative error. The NMDA ensures the instantaneous system power balance throughout the iteration process while the centralized methods compared in this paper cannot do so. We also provide a rigorous theoretical analysis for the convergence of NMDA. Moreover, the advantage of NMDA in terms of the convergence speed is validated by comparing with other distributed methods such as the gradient-based ADMM (G-ADMM) and quasi Newton-based primal dual interior point (QN-PDIP) method. Finally, case studies demonstrate the effectiveness and scalability of the proposed distributed algorithm. [ABSTRACT FROM AUTHOR]

This paper proposes a two-level distributed algorithmic framework for solving the AC optimal power flow (OPF) problem with convergence guarantees. The presence of highly nonconvex constraints in OPF poses significant challenges to distributed algorithms based on the alternating direction method of multipliers (ADMM). In particular, convergence is not provably guaranteed for nonconvex network optimization problems like AC OPF. In order to overcome this difficulty, we propose a new distributed reformulation for AC OPF and a two-level ADMM algorithm that goes beyond the standard framework of ADMM. We establish the global convergence and iteration complexity of the proposed algorithm under mild assumptions. Extensive numerical experiments over some largest test cases from NESTA and PGLib-OPF (up to 30 000-bus systems) demonstrate advantages of the proposed algorithm over existing ADMM variants in terms of convergence, scalability, and robustness. Moreover, under appropriate parallel implementation, the proposed algorithm exhibits fast convergence comparable to or even better than the state-of-the-art centralized solver. [ABSTRACT FROM AUTHOR]

This paper presents a unified power flow algorithm for large and complex mixed ac/dc power systems based on the partitioning of power grids, a version of the two-level Newton method, and the modified nodal analysis formulation. Partitioning significantly increases numerical efficiency without altering the accuracy of the power flow solution. This approach can be applied to any combination of multiple dc and possibly non-synchronized ac systems. It considers the steady-state interaction of ac and dc systems for a wide range of converter representations and control functions. Simplification of elements within the converter stations is not required. Both dc and ac-side converter losses are adequately accounted for by using a generalized converter loss model. The steady-state converter equations are derived in their most general form, with the ac and/or dc-side power exchange or voltages defined as controlled quantities. [ABSTRACT FROM AUTHOR]

Distributed, consensus-based algorithms have emerged as a promising approach for the coordination of distributed energy resources (DER) due to their communication, computation, privacy and reliability advantages over centralized approaches. However, state-of-the-art consensus-based algorithms address the DER coordination problem in independent time periods and therefore are inherently unable to capture the time-coupling operating characteristics of flexible demand (FD) and energy storage (ES) resources. This paper demonstrates that state-of-the-art algorithms fail to converge when these time-coupling characteristics are considered. In order to address this fundamental limitation, a novel consensus-based algorithm is proposed which includes additional consensus variables. These variables express relative maximum power limits imposed on the FD and ES resources which effectively mitigate the concentration of the FD and ES responses at the same time periods and steer the consensual outcome to a feasible and optimal solution. The convergence and optimality of the proposed algorithm are theoretically proven while case studies numerically demonstrate its convergence, optimality, robustness to initialization and information loss, and plug-and-play adaptability. [ABSTRACT FROM AUTHOR]

The long-term operation planning problem is generally solved by a chain of computational models based on Stochastic Dual Dynamic Programming (SDDP) considering a period of 5–10 years ahead. A recent issue that has arisen concerning this problem is to define a convergence criterion when using conditional value-at-risk (CVaR) with SDDP due to the lack of good upper bound estimators. The main contribution of this paper is to propose a convergence criterion in which including CVaR does not hinder convergence analysis. Also, the proposed method does not increase the computational burden. Moreover, this paper provides a method that allows forward paths to be individually assessed, which can then either be discarded to reduce computational time or even replaced in an alternative resampling scheme in the SDDP. Based on aggregate reservoir representation, the proposed method of convergence was applied on long-term operation planning problems related to the Brazilian Power System. Results showed improvements in both the SDDP technique and the effectiveness of the proposed convergence criterion when CVaR was used. [ABSTRACT FROM AUTHOR]

Optimal power flow (OPF) is a fundamental problem in power system operating and planning. The need for distributed solutions is rapidly growing in distribution systems with radial networks, discrete equipments and many distributed generation units. Typically the model is difficult to solve due to the highly non-convexity and even non-continuity of the arising OPF problem. In this paper, we address these challenges by developing a penalty dual decomposition (PDD) based algorithm to obtain distributed solutions. The proposed PDD based algorithm mainly consists of two loops: in the outer loop we update the dual variables and the penalty parameter according to the constraint violation, while in the inner loop we divide the primal variables into several blocks and employ the block successive upper-bound minimization (BSUM) method to iteratively optimize each block variables with fixed penalty parameter and dual variables. Each subproblem in the proposed PDD based algorithm can be solved either in closed-form or by the bisection method and every limit point generated by the proposed algorithm is guaranteed to be a stationary point of the OPF problem. Simulation results, and comparison with centralized PDD and concave-convex procedure (CCCP) based algorithms are presented to validate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

We present a hybrid metaheuristic optimization algorithm for solving economic dispatch problems in power systems. The proposed algorithm, based on bat algorithm, combines chaotic map and random black hole model together. Chaotic map is used to prevent premature convergence, and the random black hole model is helpful not only in avoiding premature convergence, but also in increasing the global search ability, enlarging exploitation area and accelerating convergence speed. The pseudocode and related parameters of the proposed algorithm are also given in this paper. Different from other related works, the costs of conventional thermal generators and random wind power are both included in the cost function because of the increasing penetration of wind power. The proposed algorithm has no requirement on the convexity or continuous differentiability of the cost function, although the effect on fuel cost, caused by the underestimation and overestimation of wind power, is included. This makes it feasible to take more practical nonlinear constraints into account, such as prohibited operating zones and ramp rate limits. Three test cases are given to illustrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

This paper proposes a general framework for determining the effect of communication delays on the convergence of certain distributed frequency regulation (DFR) protocols for prosumer-based energy systems, where prosumers are serving as balancing areas. DFR relies on iterative and distributed optimization algorithms to obtain an optimal feedback law for frequency regulation. But, it is, in general, hard to know beforehand how many iterations suffice to ensure stability. This paper develops a framework to determine a lower bound on the number of iterations required for two distributed optimization protocols. This allows prosumers to determine whether they can compute stabilizing control strategies within an acceptable time frame by taking communication delays into account. The efficacy of the method is demonstrated on two realistic power systems. [ABSTRACT FROM PUBLISHER]

Distributed generators are integrated into microgrids or geographically distributed subsystems in active distribution networks and may belong to various entities. Centralized solutions cannot meet future requirements such as high resilience and privacy protection. Therefore, fully distributed economic dispatch (ED) methods are needed and most existing algorithms exhibit linear or sublinear convergence. This paper introduces an efficient fully distributed dynamic ED solution for minimizing photovoltaic power curtailment, based on a parallel primal-dual interior-point algorithm with a quasi-Newton technique. In this method, each area optimizes its own problem with limited information exchanged with its neighbors, and no central coordinator is needed. Based on a peer-to-peer communication paradigm, this method can achieve a global optimum while the privacy of each area is obliquely protected. Numerical tests demonstrated that the algorithm outperforms gradient-based methods such as ADMM and maintains stability under a partial communication failure. [ABSTRACT FROM AUTHOR]

An increasing amount of distributed energy resources is being integrated into both distribution systems (DSs) and networked microgrids (MGs). The coordination among DSs and MGs becomes essential for DS operators and MG operators considering the high uncertainties of renewable energies and load demands. In this paper, we propose a decentralized energy management framework to coordinate the power exchange between DS and MGs based on the alternating direction method of multipliers algorithm in a fully decentralized fashion. The energy management model in each entity (DSs or MGs) is formulated using two-stage robust optimization to address the uncertainties of renewables and load demands. The problem is treated as a second order cone programming one based on a relaxed distflow model. Moreover, the robust model is solved by column and constraint generation algorithm, where cutting planes are introduced to ensure the exactness of second-order cone relaxation. Numerical results on a modified IEEE 33-bus system with three MGs validate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]