Application of partitioning techniques for decomposing large-scale electric power networks

摘要: Abstract Two efficient heuristic algorithms for solving cluster problems associated with partitioning of power networks are presented in this paper. Both divided into two stages. In the first stage, an initial partition is created based on electrical distance among system buses. The second stage involves interchanging pairs buses various clusters partition. algorithm solves optimal k -decomposition problem. -decomposition, a network performed by maximizing number uncut links clusters. This type decomposition known to be equivalent 0–1 quadratic programming problem which approximated linear transportation By defining link weight as between linking buses, strongly-connected together while weakly-connected placed different placement n -connected -dimensional Euclidean space; such reduced finding eigenvectors connectivity matrix, defined bus admittance matrix. node interchange iterative method that can used improve partition, obtained either technique or eigenvector approach. moves one at time, from another, attempt maximize total electric final Applications proposed both small and medium-size systems, comparing results those another study, illustrated