Abstract
A new version of the fast decoupled load flow, in which a more broad range of power systems can be solved, is presented. The key lies in the different way in which the resistances are ignored and in a different iteration scheme. In the standard algorithm the resistances are ignored while building the B' load flow matrix: it is shown that it is preferable that the resistances are ignored in the B" matrix instead of the B' matrix. For normal test systems there is hardly any difference in the number of iterations. However, the new algorithm iterates faster if one or more problematic R/X ratios are present. An iteration scheme with strict successive P and Q iterations prevents cycling convergence behavior which can be found in some low voltage systems. The advantages of the new version are demonstrated with runs on IEEE test systems, with both uniformly and nonuniformly scaled reactances. R-scaling up to 3 is always possible, and sometimes values up to 5 can be used. X-scaling of at least 0.1 is possible without losing convergence and with iteration counts which are significantly lower than with the standard scheme.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Keywords
Affiliated Institutions
Related Publications
A General-Purpose Version of the Fast Decoupled Loadflow
A new version of the fast decoupled load flow, in which a more broad range of power systems can be solved, is presented. The key lies in the different way in which the resistanc...
Fast Decoupled Load Flow
This paper describes a simple, very reliable and extremely fast load-flow solution method with a wide range of practical application. It is attractive for accurate or approximat...
Neural networks for routing communication traffic
The use of neural network computational algorithms to determine optimal traffic routing for communication networks is introduced. The routing problem requires choosing multilink...
A statistical method for global optimization
An algorithm for finding global optima using statistical prediction is presented. Assuming a random function model, lower confidence bounds on predicted values are used for sequ...
Consensus and Cooperation in Networked Multi-Agent Systems
<para xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> This paper provides a theoretical framework for analysis of consensus algorithms...
Publication Info
- Year
- 1989
- Type
- article
- Volume
- 4
- Issue
- 2
- Pages
- 760-770
- Citations
- 154
- Access
- Closed
External Links
Social Impact
Social media, news, blog, policy document mentions
Citation Metrics
Cite This
Identifiers
- DOI
- 10.1109/59.193851