Open Collections

Fast load flow algorithms

University of British Columbia

New, fast and reliable algorithms for solving load-flow problems are presented in this thesis. Each of these algorithms iteratively solves a set of linear equations in terms of voltage magnitude squared and phase angles, and converges onto the final solution in a few iterations. Although the line losses of the system are used in deriving the equations of the basic line-loss load-flow algorithm, knowledge of their (approximate) values is not a prerequisite to using the algorithm. The basic line-loss load-flow algorithm is slightly modified to give an incremental-change line-loss algorithm which proves to be always preferable to the basic algorithm. By exploiting the weak interdependence between active power and voltage magnitude, and between reactive power and phase angle, two decoupled versions of the incremental-change line-loss algorithm were also developed. All these algorithms have constant gradient characteristics, and their storage requirements are, at most, the same as those of the standard Newton-Raphson algorithm. If need be, the storage requirements can be reduced to those of the triangularized Y-matrix iterative algorithms. Tests on various systems indicate fast and reliable convergence characteristics better than those of the Newton-Raphson algorithm and comparable, to those obtained by Stott and Alsac with their decoupled Newton-Raphson load-flow algorithm.

Text

2010-02-21

For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use.

http://hdl.handle.net/2429/20683

Electrical and Computer Engineering

University of British Columbia

Graduate