Network partitioning using harmony search and equivalencing for distributed computing

Power system has a highly interconnected network that requires intense computational effort and resources for centralized control. Distributed computing needs the systems to be partitioned optimally into clusters. The network partitioning is an optimization problem whose objective is to minimize the number of nodes in a cluster and the tie lines between the clusters. Harmony Search(HS) Algorithm is one of the recently developed meta heuristic algorithms that can be applied to optimization problems. In this work, the HS algorithm is applied to the network partitioning problem and power flow based equivalencing is done to represent the external system. Simulation is done on IEEE Standard Test Systems. The algorithm is found to be very effective in partitioning the system hierarchically and the equivalencing method gives accurate results in comparison to the centralized control.

► New method of partitioning and equivalencing networks for distributed computing.
► Partitioning is done using heuristic harmony search.
► External equivalencing is done using the boundary injections.
► Applicability and suitability of the proposed method is validated.
► Proposed method can be applied and extended to various power network studies.