Network decomposition using Kernighan–Lin strategy aided harmony search algorithm

Power system is a large-scale network with a number of components and interconnections for which centralized control becomes cumbersome. For multi-area computations, decentralization is necessary. For implementation of this approach network decomposition becomes an essential task. In this paper the network decomposition problem is solved as an optimization problem using the harmony search (HS) algorithm. To improve the performance of the HS algorithm, a widely used graph bi-partitioning method called Kernighan–Lin (KL) strategy is used in the improvisation process. KL strategy is used in the partitioning of digital and VLSI circuits and is suitable for bi-partitioning networks. The connectivity of the partitioned clusters are checked by means of graph traversal techniques. Simulation are carried out on IEEE Standard systems and found to be very effective in decomposition of the system hierarchically.

► Optimal Network Decomposition is done using Harmony Search Algorithm.
► The Objective is to balance the computational load and minimise the communication.
► Kernighan–Lin strategy is used to improve the harmony memory in the algorithm.
► It finds application in distributed computing of power system computations.
► Performance is validated using IEEE standard test systems.