Security-constrained optimal placement of PMUs using Crow Search Algorithm

Abstract

For precise power system monitoring, a major focus is on involvement of the latest technology based on phasor measurement units (PMUs). As the sole system monitor, state estimator plays an important role in the security of power system operations. Optimal placement of PMUs (OPP) with numerical observability ensures reliable state estimation. For economical and efficient utilization, there is a need to optimize the placement of PMUs in the power system network. A new approach called Crow Search Algorithm (CSA) devised by others, has been used to solve an OPP problem. The performance of this new approach is compared to the dominant method for an optimization problem — binary integer linear programming (BILP). Comparison studies have also been carried out with particle swarm optimization (PSO) method. The major constraints such as topological, numerical observability conditions with and without zero-injection buses (ZIBs) are considered. Contingencies and limitation of measurement channels in a PMU device are also incorporated as constraints. The main advantage of using the CSA is that it provides multiple location sets for same optimal number of PMUs (optimal number same as obtained by BILP). While BILP method provides only one set of locations for the optimal number of PMUs obtained. This becomes advantageous in planning stage for power engineers for placing PMUs. Test systems considered for the case studies are of varied sizes such as IEEE 14-bus, IEEE 30-bus, IEEE 57-bus and 72-bus practical equivalent system of Indian southern region power grid. © 2022 Elsevier B.V.