کاربرد الگوریتم ژنتیک در ارزیابی امنیت سیستم قدرت
|کد مقاله||سال انتشار||مقاله انگلیسی||ترجمه فارسی||تعداد کلمات|
|8236||2013||8 صفحه PDF||سفارش دهید||6480 کلمه|
Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)
Journal : International Journal of Electrical Power & Energy Systems, Volume 49, July 2013, Pages 114–121
This paper addresses the security assessment of power systems when the simultaneous loss of K components is considered. The problem is formulated as a bilevel program. The upper-level optimization identifies a set of simultaneous out-of-service components in the power system, whereas the lower-level optimization models the reaction of the system operator against the outages selected in the upper level. The system operator reacts by determining the optimal power system operation under contingency. Due to the inherent nonconvexity and nonlinearity of the resulting bilevel problem, efficient solution procedures are yet to be explored. A genetic algorithm is proposed in this paper to attain high-quality near-optimal solutions with moderate computational effort. The modeling flexibility provided by this evolution-inspired methodology makes it suitable for this kind of bilevel programming problems. Numerical results demonstrate the effectiveness of the proposed approach in the identification of critical power system components.
Reliability and security are major factors in the operation and planning of power systems. Current reliability policy and associated security standards in power systems worldwide materialize in the well-known n-1 and n-2 security criteria, by which the system is capable to withstand the loss of a single component or a couple of components, respectively . However, recent blackouts have uncovered the vulnerability of power systems . Moreover, these catastrophic events have been caused by the coincidence in time of the loss of several independent system components. Therefore, these disruptions reveal the need for considering a larger number of simultaneous outages. The extension of current n-1 and n-2 security criteria to an n-K criterion with K out-of-service components considerably increases the number of contingencies that should be examined. Therefore, new models and solution approaches are required to properly account for the extended contingency set. In the framework of power system vulnerability analysis, the primary task is the assessment of security under multiple contingencies , hereinafter denoted as n-K power system security assessment. This tool provides information on the compliance of the n-K security criterion. Moreover, this analysis includes the identification of the critical power system components, i.e., those assets whose outage would yield the maximum damage to the system. The solution to the n-K power system security assessment problem is relevant for the system planner and the system operator so that effective protective and corrective actions can be devised. Thus, several strategies can be implemented such as adding new assets for purposes of redundancy  and , and hardening the infrastructure or improving its active defenses so that the hardened or defended assets become invulnerable  and . The analysis of the impact of multiple out-of-service components could be carried out using traditional security analysis approaches in which a pre-specified set of contingencies is simulated, one at a time , , ,  and . Current computing capabilities may allow using such traditional simulation-based methods for the set of contingencies associated with n-1 and n-2 security criteria for practical power systems. However, the incorporation of tighter security levels, such as the n-K criterion analyzed in this paper, would lead to intractability due to the huge number of contingency states that should be considered. As a consequence, traditional simulation-based models only examine a limited set of credible contingencies, which is determined based on experience and engineering judgment. This simplification, however, may yield suboptimal or even infeasible solutions once contingencies occur. Researchers have only recently begun to address n-K power system security assessment with the development of models based on bilevel programming , , , , , , , ,  and . The upper-level optimization identifies a set of simultaneous outages in the power system whereas the lower-level optimization models the reaction of the system operator against the outages obtained in the upper level. Unlike traditional security analysis, bilevel programming models embed all contingencies associated with the n-K security criterion without explicitly requiring their individual simulation. Bilevel programming  and  is a suitable framework for decision-making problems involving two optimization levels in which their respective objective functions are optimized over a jointly dependent set. Unfortunately, bilevel programs are strongly NP-hard  even in the simplest case with linear expressions and continuous variables. Therefore, devising exact methodologies to solve this kind of problems is a complex task. Several solution techniques for bilevel-programming-based n-K power system security assessment have been proposed in the technical literature such as decomposition-based approaches , ,  and , equivalent transformations to mixed-integer programs , ,  and , and approximate methods  and . However, all previous works share limitations from either the modeling or methodological perspectives. Thus, these models typically rely on a simplified representation of the system behavior leading to bilevel programs with convex lower-level problems. Furthermore, solution techniques (i) do not guarantee optimality, and (ii) are specifically tailored to such simplified models. Therefore, we still lack efficient tools addressing more realistic models. This paper presents an alternative approach based on a genetic algorithm for a general bilevel programming framework for the n-K security assessment problem that allows considering the nonlinearities and nonconvexities associated with power system operation under contingency. Based on the idea of natural selection, a genetic algorithm  works by evolving or improving a constant-sized population of individuals over successive iterations called generations. Individuals represent samples of the search space and are typically referred to as chromosomes, which are encoded as strings of symbols. The position of a symbol and its value are respectively denoted as gene and allele. Each individual is evaluated in terms of its overall fitness with respect to the given application domain. High-performing individuals are selected to produce offspring that retain many of the features of their parents. The evolution process is carried out through a series of genetic operators ,  and . Main genetic operators include (i) selection, which implements survival of the fittest or best solutions and determines the parents of the new generation; (ii) crossover, which randomly exchanges gene structures from two selected parents to produce new offspring; and (iii) mutation, which randomly changes one or more components of a selected individual, thus acting as a population perturbation operator. Several factors have boosted the appeal of genetic algorithms as global optimization approaches: • The need for more sophisticated models makes it difficult or even impossible the use of traditional optimization techniques. Although these models typically result in complex optimization problems with many local optima and little inherent structure to guide the search, the flexible modeling framework provided by genetic algorithms allows handling nonlinearities and nonconvexities. • Genetic algorithms are generally quite effective for rapid global search of large solution spaces. As a result, near-optimal solutions are likely to be attained in reasonable computation times. • Genetic algorithms operate on a pool of individuals, thus multiple solutions are suggested. • The search mechanism is intrinsically parallel, thus lending itself to a parallel implementation with the potential reduction in the computational requirement. As a result, genetic algorithms have been widely used in the field of power system operation and planning ,  and . The practical relevance and timeliness of genetic algorithms in the context of power systems are both backed by recent contributions , ,  and . In addition, genetic algorithms have also been successfully applied to several instances of bilevel programming , , , ,  and . These previous works pave the way for the application of genetic algorithms to address the bilevel-programming-based n-K power system security assessment. This paper reports experience with the application of a genetic algorithm to a particular instance of n-K power system security assessment. The problem addressed is a maximum disruption model  considering line switching, that was recently solved in  through a heuristic approach inspired by Benders decomposition. As a complicating factor, the set of corrective actions available to the system operator includes the modification of the network topology through the connection and disconnection of transmission assets, which requires the use of binary variables in the lower-level problem. It should be noted that the presence of binary lower-level decision variables has been typically neglected by available genetic-algorithm-based approaches for bilevel programming , , ,  and , thereby constituting a salient feature of our approach. In the proposed genetic algorithm, an individual is defined as the vector of statuses of system components. The evaluation of each individual requires the solution of a mixed-integer nonlinear optimal power flow corresponding to the lower-level optimization. The application of genetic operators may yield infeasible individuals. As another distinctive aspect with respect to previous works , , , ,  and , infeasibilities are handled by a specific feasibility repair procedure. The major contributions of this paper are threefold: 1. The system planner is provided with a general bilevel programming framework for n-K power system security assessment. In addition, a novel genetic algorithm is proposed as a suitable solution approach for the resulting mixed-integer nonlinear bilevel programs. 2. The applicability of the genetic algorithm is illustrated with the solution of an instance of n-K power system security assessment, namely a maximum disruption model with line switching, for which no exact solution is currently available. 3. The effective and robust performance of the proposed tool is illustrated with the solution of several case studies based on the IEEE Reliability Test System. The remaining sections are outlined as follows. Section 2 provides a general bilevel programming framework for n-K power system security assessment. Section 3 describes the proposed genetic algorithm. Section 4 addresses the maximum disruption model with line switching. In Section 5, numerical results are presented and analyzed. Finally, relevant conclusions are drawn in Section 6.
نتیجه گیری انگلیسی
A genetic algorithm is proposed to solve a general bilevel-programming-based model for n-K power system security assessment. The modeling framework provided by the proposed approach allows considering the nonlinearities and nonconvexities associated with the operation of power systems under contingency. The proposed genetic algorithm has been applied to a recently reported maximum disruption model with line switching. The resulting problem is characterized as a mixed-integer nonlinear bilevel programming problem for which no exact solution techniques are available. Numerical simulations revealed an effective performance by the genetic algorithm in terms of solution quality, robustness, and computational burden. Although computational issues are not a primary concern in this kind of planning problems, we recognize that the proposed approach may be computationally expensive for a large power system. Further work will examine the computational savings that may be gained from the parallel or distributed implementation of the genetic algorithm, the consideration of alternative genetic operators, and the use of efficient low-level software. In addition, research is currently underway to address more sophisticated security assessment models accounting for a precise nonlinear representation of power flows through the transmission network. Admittedly, an ac-network-constrained model will require much more computation time and needs further numerical studies. Another interesting issue for future research is to study the behavior of the genetic algorithm on minimum disruption models.