Method for optimal tearing of electrical networks

Abstract A method for optimal tearing of electrical networks to be analysed by diakoptics is presented. Starting from the completely disconnected network, the nodes are aggregated in areas by dynamic programming. At each step, nodes are displaced in order to minimize the requirement of the total core memory of the network impedance or admittance matrices. The choice of nodes, which are the seeds of aggregation for the areas, is made with regard to the connectivity properties as evaluated by the nodal proximity matrix expressed in the form P = P ′ + e P 2 . The test results for the AEP 14, 30, 57 and IEEE 118 bus systems are also presented.

[1]  R. Bellman.  Dynamic programming. , 1957, Science.

[2]  Marlin H. Mickle,et al.  Optimal Decomposition of Large-Scale Networks , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[3]  Leon O. Chua,et al.  An efficient heuristic cluster algorithm for tearing large-scale networks , 1977 .

[4]  H. H. Happ,et al.  Automatic Sectionalization of Power System Networks for Network Solutions , 1971 .

[5]  F.L. Alvarado,et al.  Sparsity in diakoptic algorithms , 1977, IEEE Transactions on Power Apparatus and Systems.

[6]  J. M. Undrill,et al.  Diakoptics and networks , 1971 .

[7]  H. H. Happ,et al.  Piecewise methods and applications to power systems , 1980 .

[8]  Ibrahim N. Hajj,et al.  Sparsity considerations in network solution by tearing , 1980 .

[9]  F. Alvarado,et al.  Computational complexity in power systems , 1976, IEEE Transactions on Power Apparatus and Systems.