Efficient heuristic partitioning algorithm for parallel processing of large power systems network equations

Ka Wing Chan, R. W. Dunn, A. R. Daniels

Research output: Journal article publicationJournal articleAcademic researchpeer-review

42 Citations (Scopus)


An efficient heuristic algorithm for automatic partitioning of a power system network is presented. The algorithm was designed to be used in conjunction with a diakoptics-based coarse grain parallel method for solving large, sparse linear systems arising from network analysis. It exploits the techniques of factorisation path graph partitioning and equivalent post-ordering. Test results for systems up to 811 busbars and 1476 transmission lines are included for comparison purposes. This indicates that the method is able to divide a power system network model into a number of equal sized subnetworks in order to optimise the use of parallel computer systems for network analysis while the resultant number of fill-in elements is kept to a minimum.
Original languageEnglish
Pages (from-to)625-630
Number of pages6
JournalIEE Proceedings: Generation, Transmission and Distribution
Issue number6
Publication statusPublished - 1 Nov 1995
Externally publishedYes

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this