Search

This paper demonstrates the potential of inverter-based loads to support grid reliability during power system transients thereby enabling reliable integration of renewable energy in power systems. Such loads are referred to in this paper as grid-supportive loads (GSLs). A new GSL model is developed that simulates the transient response capabilities that can be programmed in electronic loads. The model’s design enables it to be easily integrated in widely used commercial power system transient analysis software. Theoretical expressions are derived that explain the workings of the GSL model. The performance, numerical stability, and impact of the GSL model is validated on 9-bus and 2000-bus synthetic power system models using generator tripping and bus fault disturbances. Results on the 2000 bus system show that in the absence of frequency support from wind/solar generation resources, just 20% of loads with grid-supportive capabilities can improve frequency response by up to 2000 MW/0.1 Hz and reduce deviation in frequency at nadir by up to 60% compared to the situation when GSLs are absent. Power system reliability also improves under fault events. It is further shown that GSLs can aid in integrating more renewable generation without degrading the overall transient response of the power system. [ABSTRACT FROM AUTHOR]

This paper presents a new method for studying electromechanical transients in power systems using three phase, combined transmission and distribution models (hybrid models). The methodology models individual phases of an electric network and associated unbalance in load and generation. Therefore, the impacts of load unbalance, single phase distributed generation and line impedance unbalance on electromechanical transients can be studied without using electromagnetic transient simulation (EMTP) programs. The implementation of this methodology in software is called the Three Phase Dynamics Analyzer (TPDA). Case studies included in the paper demonstrate the accuracy of TPDA and its ability to simulate electromechanical transients in hybrid models. TPDA has the potential for providing electric utilities and power system planners with more accurate assessment of system stability than traditional dynamic simulation software that assume balanced network topology. [ABSTRACT FROM PUBLISHER]

Having developed multiobjective optimization algorithms using evolutionary optimization methods and demonstrated their niche on various practical problems involving mostly two and three objectives, there is now a growing need for developing evolutionary multiobjective optimization (EMO) algorithms for handling many-objective (having four or more objectives) optimization problems. In this paper, we recognize a few recent efforts and discuss a number of viable directions for developing a potential EMO algorithm for solving many-objective optimization problems. Thereafter, we suggest a reference-point-based many-objective evolutionary algorithm following NSGA-II framework (we call it NSGA-III) that emphasizes population members that are nondominated, yet close to a set of supplied reference points. The proposed NSGA-III is applied to a number of many-objective test problems with three to 15 objectives and compared with two versions of a recently suggested EMO algorithm (MOEA/D). While each of the two MOEA/D methods works well on different classes of problems, the proposed NSGA-III is found to produce satisfactory results on all problems considered in this paper. This paper presents results on unconstrained problems, and the sequel paper considers constrained and other specialties in handling many-objective optimization problems. [ABSTRACT FROM AUTHOR]

In the precursor paper, a many-objective optimization method (NSGA-III), based on the NSGA-II framework, was suggested and applied to a number of unconstrained test and practical problems with box constraints alone. In this paper, we extend NSGA-III to solve generic constrained many-objective optimization problems. In the process, we also suggest three types of constrained test problems that are scalable to any number of objectives and provide different types of challenges to a many-objective optimizer. A previously suggested MOEA/D algorithm is also extended to solve constrained problems. Results using constrained NSGA-III and constrained MOEA/D show an edge of the former, particularly in solving problems with a large number of objectives. Furthermore, the NSGA-III algorithm is made adaptive in updating and including new reference points on the fly. The resulting adaptive NSGA-III is shown to provide a denser representation of the Pareto-optimal front, compared to the original NSGA-III with an identical computational effort. This, and the original NSGA-III paper, together suggest and amply test a viable evolutionary many-objective optimization algorithm for handling constrained and unconstrained problems. These studies should encourage researchers to use and pay further attention in evolutionary many-objective optimization. [ABSTRACT FROM AUTHOR]

As a first step, most model checkers used in the hardware industry convert a high-level register-transfer-level (RTL) design into a netlist. However, algorithms that operate at the netlist level are unable to exploit the structure of the higher abstraction levels and, thus, are less scalable. The RTL of a hardware description language such as Verilog is similar to a software program with special features for hardware design such as bit-vector arithmetic and concurrency. This paper uses predicate abstraction, a software verification technique, for verifying RTL Verilog. There are two challenges when applying predicate abstraction to circuits: 1) the computation of the abstract model in presence of a large number of predicates and 2) the discovery of suitable word-level predicates for abstraction refinement. We address the first problem using a technique called predicate clustering. We address the second problem by computing the weakest preconditions of Verilog statements in order to obtain new word-level predicates during abstraction refinement. We compare the performance of our technique with localization reduction, a netlist-level abstraction technique, and report improvements on a set of benchmarks. [ABSTRACT FROM AUTHOR]