Aggregation of Buses for a Network Reduction

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 t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on power systems 2012-05, Vol.27 (2), p.705-712
Main Author: Oh, HyungSeon
Format: Article
Language:English
Subjects:
Bulk
Computational modeling
congestion
demand-rich area (DRA)
Economics
Electric potential
Joining processes
near boundary
optimal power flow (OPF)
Planning
Power systems
power transfer distribution factor (PTDF)
supply-rich area (SRA)
Vectors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0885-8950
1558-0679
DOI:10.1109/TPWRS.2011.2176758