Abstract

Phasor measurement units (PMUs) are essential tools for monitoring, protection and control of power systems. The optimal PMU placement (OPP) problem refers to the determination of the minimal number of PMUs and their corresponding locations in order to achieve full network observability. This paper introduces a recursive Tabu search (RTS) method to solve the OPP problem. More specifically, the traditional Tabu search (TS) metaheuristic algorithm is executed multiple times, while in the initialisation of each TS the best solution found from all previous executions is used. The proposed RTS is found to be the best among three alternative TS initialisation schemes, in regard to the impact on the success rate of the algorithm. A numerical method is proposed for checking network observability, unlike most existing metaheuristic OPP methods, which are based on topological observability methods. The proposed RTS method is tested on the IEEE 14, 30, 57 and 118-bus test systems, on the New England 39-bus test system and on the 2383-bus power system. The obtained results are compared with other reported PMU placement methods. The simulation results show that the proposed RTS method finds the minimum number of PMUs, unlike earlier methods which may find either the same or even higher number of PMUs.

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