Network Partition for Distributed Reactive Power Optimization in Power Systems

Abstract

Reactive power optimization is an important measure to improve the secure and economic performance of power systems. To reduce the dimension of solution space and solve the time-consuming problem more effectively, a network partition method for distributed reactive power optimization is introduced to divide a large-scale power system into several small-scale subsystems. The voltage response of nodes to the perturbation of various reactive power resources is calculated in the partition method. And a new electrical distance is worked out in the method, which combines the network topology information with the voltage response. The a decomposition algorithm is used to cluster nodes in power systems. Some supplements based on divided subsystems for distributed reactive power optimization are represented after network partition. The simulation of a practical system verifies that the reasonable and effective results can be obtained using the proposed partition method.

Network partitioning using harmony search and equivalencing for distributed computing

“…Network partitioning based on voltage variation at the load buses relative to other buses is proposed for voltage margin calculations in [32]. A decomposition algorithm is used for partitioning the network for distributed reactive power optimization in a power system in [33]. Meta heuristic algorithms have been used for clustering web documents.…”

Network Decomposition using EvolutionaryAlgorithms in Power Systems

“…A decomposition algorithm is used for partitioning the network for distributed reactive power optimization in power system in [6]. Meta heuristic algorithms have been used for clustering web documents also [7]. However these methods are computation intensive and involves procedures based on natural selection crossover and mutation.…”