Abstract

Large-scale power grid observability is still a challenge because of deteriorating infrastructure and the incorporation of renewable energy sources. A smart grid that makes use of cutting-edge technology, such as a phasor measurement unit (PMU), is an excellent option for monitoring and bringing networks up to speed with the latest information. Latterly, the considerable investment required for the deployment locations has slowed down the adoption of PMU. Therefore, because PMUs are expensive, it is necessary to deploy them in the best possible places on large-scale power grids. The most significant share of optimal PMU placement problems (OPPP) is defined as 0–1 knapsack problems. Considering this, the development of an effective optimization technique that can handle difficulties has emerged as an appealing topic in recent years. In this paper, a meta-heuristic algorithm based on the binary particle swarm algorithm (BPSO), a binary accelerated particle swarm optimization (BAPSO), is offered for solving OPPP. Since earlier research has shown that BPSO is likely to stick to local optima, the majority of them evaluated their suggested technique using small-scale test systems. The technique that has been suggested searches for the optimal solution by employing two topologies—one global and one local—that are analogous to BPSO. This work determines the optimal PMU position for a large network in a reasonable amount of time by fine-tuning the acceleration factor. Additionally, in order to employ fewer PMUs, an integration strategy was put into place for the radial buses. The OPPP solutions are provided by the suggested method within a reasonable period with prior solutions published in reliable publications, according to computational findings.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call