Scheduled System Maintenance:
On Wednesday, July 29th, IEEE Xplore will undergo scheduled maintenance from 7:00-9:00 AM ET (11:00-13:00 UTC). During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

Aggregation of Buses for a Network Reduction

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
$31 $13
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

1 Author(s)
HyungSeon Oh ; State Univ. of New York at Buffalo, Buffalo, NY, USA

A simple but precise model would improve the computation efficiency for planning a large-scale power system. Recent development of a new network reduction algorithm yields such a model with a given grouping of buses. While the flow over the reduced network is estimated precisely, a proper value of the flow limit still remains unresolved. In this study, a method is proposed to group buses based on the congestion profile in the original network and to assign the flow limits of a reduced network. The method is tested on modified IEEE 30-bus and 118-bus systems at various load profiles, and the simulation results are compared.

Published in:

Power Systems, IEEE Transactions on  (Volume:27 ,  Issue: 2 )