This paper presents a new contingency ranking approach based on geneti
c algorithms. It formulates contingency ranking as an optimization pro
blem with the objective of finding all critical cases. The genetic alg
orithm was selected as the search method because of its ability to fin
d the optimal or near optimal solution while only evaluating a small p
ercent of the problem space. In addition to limiting the number of eva
luated contingencies, this approach can encompass other techniques int
ended to reduce the computational burden of analyzing each contingency
. The severity of a particular contingency is measured by the minimum
singular value of the power flow Jacobian. Test results showing the ef
fectiveness of the proposed approach on two test systems are included.
(C) 1997 Elsevier Science S.A.