By Topic

Fast prediction of loadability margins using neural networks to approximate security boundaries of power systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
X. Gu ; Sch. of Electr. Eng., North China Electr. Power Univ., Baoding Hebei Province ; C. A. Canizares

Determining loadability margins to various security limits is of great importance for the secure operation of a power system, especially in the current deregulated environment. Here, a novel approach is proposed for fast prediction of loadability margins of power systems based on neural networks. Static security boundaries, comprised of static voltage stability limits, oscillatory stability limits and other operating limits such as generator power output limits, are constructed by means of loading the power system until these security limits are reached from a base operating point along various loading directions. Back-propagation neural networks for different contingencies are trained to approximate the security boundaries. A search algorithm is then employed to predict the loadability margins from any stable operating points along arbitrary loading directions through an iterative technique based on the trained neural networks. The simulation results for the IEEE two-area benchmark system and the IEEE 50-machine test system demonstrate the effectiveness of the proposed method for on-line prediction of loadability margins

Published in:

IET Generation, Transmission & Distribution  (Volume:1 ,  Issue: 3 )