PSO-Based Oscillatory Stability Assessment by Using the Torque Coefficients for SMIB

This study discusses the evaluation of oscillatory stability based on the synchronizing <inline-formula> <math display="inline"> <semantics> <msub> <mi>K</mi> <mi>s</mi> </msub> </semantics> </math> </inline-formula> and damping <inline-formula> <math display="inline"> <semantics> <msub> <mi>K</mi> <mi>d</mi> </msub> </semantics> </math> </inline-formula> torque coefficients for a single-machine system connected to an infinite bus (SMIB). Particle swarm optimization (PSO) technique is used to determine <inline-formula> <math display="inline"> <semantics> <msub> <mi>K</mi> <mi>s</mi> </msub> </semantics> </math> </inline-formula> and <inline-formula> <math display="inline"> <semantics> <msub> <mi>K</mi> <mi>d</mi> </msub> </semantics> </math> </inline-formula> values and subsequently identify the oscillatory stability conditions in the SMIB. The ability of PSO is compared with those of evolutionary programming (EP) techniques and artificial immune system (AIS). The least square (LS) method is selected as the benchmark for <inline-formula> <math display="inline"> <semantics> <msub> <mi>K</mi> <mi>s</mi> </msub> </semantics> </math> </inline-formula> and <inline-formula> <math display="inline"> <semantics> <msub> <mi>K</mi> <mi>d</mi> </msub> </semantics> </math> </inline-formula> values determined by PSO, EP, and AIS. Simulation results show that PSO successfully estimated <inline-formula> <math display="inline"> <semantics> <msub> <mi>K</mi> <mi>s</mi> </msub> </semantics> </math> </inline-formula> and <inline-formula> <math display="inline"> <semantics> <msub> <mi>K</mi> <mi>d</mi> </msub> </semantics> </math> </inline-formula> values closest to LS compared with EP and AIS. PSO also uses lower computational time compared with those of the two other techniques. The proposed technique is suitable for solving oscillatory stability problems based on the determination of eigenvalues and minimum damping ratio.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.