Chi Yung Chung

Bio: Chi Yung Chung is an academic researcher from University of Saskatchewan. The author has contributed to research in topics: Electric power system & Wind power. The author has an hindex of 40, co-authored 203 publications receiving 5645 citations. Previous affiliations of Chi Yung Chung include Hong Kong Polytechnic University & South China University of Technology.

Probabilistic Load Flow Evaluation With Hybrid Latin Hypercube Sampling and Cholesky Decomposition

Abstract: Monte Carlo simulation method combined with simple random sampling (SRS) suffers from long computation time and heavy computer storage requirement when used in probabilistic load flow (PLF) evaluation and other power system probabilistic analyses. This paper proposes the use of an efficient sampling method, Latin hypercube sampling (LHS) combined with Cholesky decomposition method (LHS-CD), into Monte Carlo simulation for solving the PLF problems. The LHS-CD sampling method is investigated using IEEE 14-bus and 118-bus systems. The method is compared with SRS and LHS only with random permutation (LHS-RP). LHS-CD is found to be robust and flexible and has the potential to be applied in many power system probabilistic problems.

A Chance Constrained Transmission Network Expansion Planning Method With Consideration of Load and Wind Farm Uncertainties

Abstract: This paper proposes a chance constrained formulation to tackle the uncertainties of load and wind turbine generator in transmission network expansion planning. A combined Monte Carlo simulation/analytical probabilistic power flow analysis method is first presented to obtain the probability density function of wind turbine generator output. The paper then shows the development of the chance constrained formulation with the inclusion of the wind turbine generator probability density function and probabilistic power flow in the formulation. The proposed formulation is more computationally efficient and can deal with uncertainties in transmission network expansion planning. The power of the new method is shown through the application of the formulation to two test systems.

Application of Differential Evolution Algorithm for Transient Stability Constrained Optimal Power Flow

Abstract: Consideration of transient stability constraints in optimal power flow (OPF) problems is increasingly important because modern power systems tend to operate closer to stability boundaries due to the rapid increase of electricity demand and the deregulation of electricity markets. Transient stability constrained OPF (TSCOPF) is however a nonlinear optimization problem with both algebraic and differential equations, which is difficult to be solved even for small power systems. This paper develops a robust and efficient method for solving TSCOPF problems based on differential evolution (DE), which is a new branch of evolutionary algorithms with strong ability in searching global optimal solutions of highly nonlinear and nonconvex problems. Due to the flexible properties of DE mechanism, the hybrid method for transient stability assessment, which combines time-domain simulation and transient energy function method, can be employed in DE so that the detailed dynamic models of the system can be incorporated. To reduce the computational burden, several strategies are proposed for the initialization, assessment and selection of solution individuals in evolution process of DE. Numerical tests on the WSCC three-generator, nine-bus system and New England ten-generator, 39-bus system have demonstrated the robustness and effectiveness of the proposed approach. Finally, in order to deal with the large-scale system and speed up the computation, DE is parallelized and implemented on a Beowulf PC-cluster. The effectiveness of the parallel DE approach is demonstrated by simulations on the 17-generator, 162-bus system.

A hybrid genetic algorithm-interior point method for optimal reactive power flow

Abstract: By integrating a genetic algorithm (GA) with a nonlinear interior point method (IPM), a novel hybrid method for the optimal reactive power flow (ORPF) problem is proposed in this paper. The proposed method can be mainly divided into two parts. The first part is to solve the ORPF with the IPM by relaxing the discrete variables. The second part is to decompose the original ORPF into two sub-problems: continuous optimization and discrete optimization. The GA is used to solve the discrete optimization with the continuous variables being fixed, whereas the IPM solves the continuous optimization with the discrete variables being constant. The optimal solution can be obtained by solving the two sub-problems alternately. A dynamic adjustment strategy is also proposed to make the GA and the IPM to complement each other and to enhance the efficiency of the hybrid proposed method. Numerical simulations on the IEEE 30-bus, IEEE 118-bus and Chongqing 161-bus test systems illustrate that the proposed hybrid method is efficient for the ORPF problem

Generation rescheduling methods to improve power transfer capability constrained by small-signal stability

Abstract: Small-signal stability, often in the form of low frequency oscillations, has been found to be the limiting factor when determining power transfer capabilities in a number of power systems. This paper proposes a new strategy to improve the power transfer capability constrained by small-signal stability by appropriately rescheduling generation based on sensitivity analysis. In the proposed strategy, a small-signal stability index, which can be computed quickly and reliably, is used to determine the small-signal security status of a system and also for the purpose of contingency screening. Two sensitivity-based dispatch methods are proposed to reschedule the generation in order to maximize power transfer subject to the small-signal stability constraint under a set of selected contingencies. The effectiveness of the proposed methods is demonstrated by comparing with other generation dispatch methods on a real power system model.

Differential Evolution: A Survey of the State-of-the-Art

Abstract: Differential evolution (DE) is arguably one of the most powerful stochastic real-parameter optimization algorithms in current use. DE operates through similar computational steps as employed by a standard evolutionary algorithm (EA). However, unlike traditional EAs, the DE-variants perturb the current-generation population members with the scaled differences of randomly selected and distinct population members. Therefore, no separate probability distribution has to be used for generating the offspring. Since its inception in 1995, DE has drawn the attention of many researchers all over the world resulting in a lot of variants of the basic algorithm with improved performance. This paper presents a detailed review of the basic concepts of DE and a survey of its major variants, its application to multiobjective, constrained, large scale, and uncertain optimization problems, and the theoretical studies conducted on DE so far. Also, it provides an overview of the significant engineering applications that have benefited from the powerful nature of DE.

博弈论 : 矛盾冲突分析 = Game theory : analysis of conflict

Abstract: Preface 1. Decision-Theoretic Foundations 1.1 Game Theory, Rationality, and Intelligence 1.2 Basic Concepts of Decision Theory 1.3 Axioms 1.4 The Expected-Utility Maximization Theorem 1.5 Equivalent Representations 1.6 Bayesian Conditional-Probability Systems 1.7 Limitations of the Bayesian Model 1.8 Domination 1.9 Proofs of the Domination Theorems Exercises 2. Basic Models 2.1 Games in Extensive Form 2.2 Strategic Form and the Normal Representation 2.3 Equivalence of Strategic-Form Games 2.4 Reduced Normal Representations 2.5 Elimination of Dominated Strategies 2.6 Multiagent Representations 2.7 Common Knowledge 2.8 Bayesian Games 2.9 Modeling Games with Incomplete Information Exercises 3. Equilibria of Strategic-Form Games 3.1 Domination and Ratonalizability 3.2 Nash Equilibrium 3.3 Computing Nash Equilibria 3.4 Significance of Nash Equilibria 3.5 The Focal-Point Effect 3.6 The Decision-Analytic Approach to Games 3.7 Evolution. Resistance. and Risk Dominance 3.8 Two-Person Zero-Sum Games 3.9 Bayesian Equilibria 3.10 Purification of Randomized Strategies in Equilibria 3.11 Auctions 3.12 Proof of Existence of Equilibrium 3.13 Infinite Strategy Sets Exercises 4. Sequential Equilibria of Extensive-Form Games 4.1 Mixed Strategies and Behavioral Strategies 4.2 Equilibria in Behavioral Strategies 4.3 Sequential Rationality at Information States with Positive Probability 4.4 Consistent Beliefs and Sequential Rationality at All Information States 4.5 Computing Sequential Equilibria 4.6 Subgame-Perfect Equilibria 4.7 Games with Perfect Information 4.8 Adding Chance Events with Small Probability 4.9 Forward Induction 4.10 Voting and Binary Agendas 4.11 Technical Proofs Exercises 5. Refinements of Equilibrium in Strategic Form 5.1 Introduction 5.2 Perfect Equilibria 5.3 Existence of Perfect and Sequential Equilibria 5.4 Proper Equilibria 5.5 Persistent Equilibria 5.6 Stable Sets 01 Equilibria 5.7 Generic Properties 5.8 Conclusions Exercises 6. Games with Communication 6.1 Contracts and Correlated Strategies 6.2 Correlated Equilibria 6.3 Bayesian Games with Communication 6.4 Bayesian Collective-Choice Problems and Bayesian Bargaining Problems 6.5 Trading Problems with Linear Utility 6.6 General Participation Constraints for Bayesian Games with Contracts 6.7 Sender-Receiver Games 6.8 Acceptable and Predominant Correlated Equilibria 6.9 Communication in Extensive-Form and Multistage Games Exercises Bibliographic Note 7. Repeated Games 7.1 The Repeated Prisoners Dilemma 7.2 A General Model of Repeated Garnet 7.3 Stationary Equilibria of Repeated Games with Complete State Information and Discounting 7.4 Repeated Games with Standard Information: Examples 7.5 General Feasibility Theorems for Standard Repeated Games 7.6 Finitely Repeated Games and the Role of Initial Doubt 7.7 Imperfect Observability of Moves 7.8 Repeated Wines in Large Decentralized Groups 7.9 Repeated Games with Incomplete Information 7.10 Continuous Time 7.11 Evolutionary Simulation of Repeated Games Exercises 8. Bargaining and Cooperation in Two-Person Games 8.1 Noncooperative Foundations of Cooperative Game Theory 8.2 Two-Person Bargaining Problems and the Nash Bargaining Solution 8.3 Interpersonal Comparisons of Weighted Utility 8.4 Transferable Utility 8.5 Rational Threats 8.6 Other Bargaining Solutions 8.7 An Alternating-Offer Bargaining Game 8.8 An Alternating-Offer Game with Incomplete Information 8.9 A Discrete Alternating-Offer Game 8.10 Renegotiation Exercises 9. Coalitions in Cooperative Games 9.1 Introduction to Coalitional Analysis 9.2 Characteristic Functions with Transferable Utility 9.3 The Core 9.4 The Shapkey Value 9.5 Values with Cooperation Structures 9.6 Other Solution Concepts 9.7 Colational Games with Nontransferable Utility 9.8 Cores without Transferable Utility 9.9 Values without Transferable Utility Exercises Bibliographic Note 10. Cooperation under Uncertainty 10.1 Introduction 10.2 Concepts of Efficiency 10.3 An Example 10.4 Ex Post Inefficiency and Subsequent Oilers 10.5 Computing Incentive-Efficient Mechanisms 10.6 Inscrutability and Durability 10.7 Mechanism Selection by an Informed Principal 10.8 Neutral Bargaining Solutions 10.9 Dynamic Matching Processes with Incomplete Information Exercises Bibliography Index

Particle Swarm Optimization: Basic Concepts, Variants and Applications in Power Systems

Abstract: Many areas in power systems require solving one or more nonlinear optimization problems. While analytical methods might suffer from slow convergence and the curse of dimensionality, heuristics-based swarm intelligence can be an efficient alternative. Particle swarm optimization (PSO), part of the swarm intelligence family, is known to effectively solve large-scale nonlinear optimization problems. This paper presents a detailed overview of the basic concepts of PSO and its variants. Also, it provides a comprehensive survey on the power system applications that have benefited from the powerful nature of PSO as an optimization technique. For each application, technical details that are required for applying PSO, such as its type, particle formulation (solution representation), and the most efficient fitness functions are also discussed.

Zero Duality Gap in Optimal Power Flow Problem

Abstract: The optimal power flow (OPF) problem is nonconvex and generally hard to solve. In this paper, we propose a semidefinite programming (SDP) optimization, which is the dual of an equivalent form of the OPF problem. A global optimum solution to the OPF problem can be retrieved from a solution of this convex dual problem whenever the duality gap is zero. A necessary and sufficient condition is provided in this paper to guarantee the existence of no duality gap for the OPF problem. This condition is satisfied by the standard IEEE benchmark systems with 14, 30, 57, 118, and 300 buses as well as several randomly generated systems. Since this condition is hard to study, a sufficient zero-duality-gap condition is also derived. This sufficient condition holds for IEEE systems after small resistance (10-5 per unit) is added to every transformer that originally assumes zero resistance. We investigate this sufficient condition and justify that it holds widely in practice. The main underlying reason for the successful convexification of the OPF problem can be traced back to the modeling of transformers and transmission lines as well as the non-negativity of physical quantities such as resistance and inductance.