z-logo
open-access-imgOpen Access
Optimal PMU placement for modeling power grid observability with mathematical programming methods
Author(s) -
Almunif Anas,
Fan Lingling
Publication year - 2020
Publication title -
international transactions on electrical energy systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.428
H-Index - 42
ISSN - 2050-7038
DOI - 10.1002/2050-7038.12182
Subject(s) - observability , phasor , integer programming , electric power system , nonlinear programming , mathematical optimization , computer science , redundancy (engineering) , linear programming , units of measurement , nonlinear system , grid , control theory (sociology) , phasor measurement unit , power (physics) , algorithm , mathematics , physics , geometry , quantum mechanics , control (management) , artificial intelligence , operating system
Summary Phasor measurement units (PMUs) can obtain synchronized voltage and current phasors to increase the accuracy of state estimation results. Optimal PMU placement (OPP) reduces the required number of PMUs to make the system fully observable. In this paper, two mathematical programming formulations, which are mixed integer linear programming (MILP) and nonlinear programming (NLP), for power grid observability modeling to solve the OPP problem are presented. Power flow and zero injection measurement modeling along with restricted communication facilities, PMU failure, and limited channel capacity contingencies are investigated. MILP zero injection formulation is improved to overcome the observability redundancy and optimality drawbacks. A new formulation for nonlinear programming‐based PMU placement for zero injection measurement is proposed. MILP and NLP methods are compared to illustrate the advantages and disadvantages of each method. The comparison and proposed formulations are examined on IEEE 14‐, 57‐, 118‐, 300‐bus test systems and a large 2383‐bus Polish system to demonstrate their effectiveness.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here