Determination of shortest distance to voltage instability with particle swarm optimization algorithm

✍ Scribed by M. J. Chen; B. Wu; C. Chen

• Publisher: John Wiley and Sons
• Year: 2009
• Tongue: English
• Weight: 109 KB
• Volume: 19
• Category: Article
• ISSN: 1430-144X
• DOI: 10.1002/etep.286

✦ Synopsis

Abstract

Loading margin denotes how close the power system is to voltage instability. This paper presents a new technique to obtain the shortest distance to voltage instability, which converts the computation of the closest point of collapse to an optimization problem. Compared with the existing methods, the notable advantage of this technique is the capability of dealing with various constraints such as generation reactive power limits expediently and of finding out the global shortest distance to instability instead of local one, so that the shortest distance obtained corresponds to the practical system operation and then effective measures may be taken to prevent voltage collapse according to the results. A modified particle swarm optimization algorithm is presented to solve this optimization problem. Of the proposed algorithm, local optimum areas are ascertained and further exploring is implemented to find genuine local optima. Recruiting new particles outside the ascertained local optimum areas enhances the global search stability of the proposed algorithm. Details of the optimization problem and the implementation of the proposed optimization method to test systems are presented and the feasibility and validity are demonstrated. Copyright © 2008 John Wiley & Sons, Ltd.