Groebner bases algorithm for optimal PMU placement

被引:12
|
作者
Becejac, Vladimir [1 ]
Stefanov, Predrag [1 ]
机构
[1] Univ Belgrade, Sch Elect Engn, Dept Power Syst, Belgrade, Serbia
关键词
Phasor measurement unit; Groebner bases; Nonlinear programming; System observability; MEASUREMENT UNIT PLACEMENT; OBSERVABILITY; FORMULATION; NETWORK;
D O I
10.1016/j.ijepes.2019.105427
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In this paper a new method for solving optimal phasor measurement units (PMU) placement problem for full observability in power systems is proposed. A new algorithm is based on forming and solving Groebner bases set of equations for a defined optimization problem. The technique of Groebner bases is applicable wherever the problem may be presented by the set of polynomials and as such, it can be found in a variety of applied mathematics problems. Groebner bases of the set of polynomials represents the canonical form equivalent to the original set, similar to the way the row echelon form for linear systems represents the triangular form of the linear equations set. The canonical form of the Groebner bases polynomials, along with the utilization of recursive algorithms, allows the solution to be effortlessly obtained. Optimal phasor measurement units placement (OPP) problem can be presented in a linear or nonlinear polynomial form, both of which are used in this paper. The settings of OPP problem have been proposed in this paper with the inclusion of zero injection buses (ZIBs), in normal system states and considering contingency related to PMU outage. The problem formulation is defined according to the application of Groebner bases technique. The proposed model is capable of obtaining the full set of optimal solutions instead of only one or partial solutions. The efficiency of the proposed method is tested on IEEE 14-bus, IEEE 24-bus, IEEE 30-bus, IEEE 118-bus and Polish 2383-bus test system and the results are compared with those of some recently reported methods.
引用
收藏
页数:10
相关论文
共 50 条
  • [21] Research on the Method of Optimal PMU Placement
    Xu Jian-jun
    Xu Yan-chao
    Yan Li-mei
    Zhao Hai-long
    Sun Zhi-gang
    Bai Li-li
    Xie Ming-xia
    INTERNATIONAL JOURNAL OF ONLINE ENGINEERING, 2013, 9 (09) : 24 - 29
  • [22] Improved BPSO for Optimal PMU Placement
    Rahman, Nadia. H. A.
    Zobaa, Ahmed F.
    Theodoridis, Michael
    2015 50TH INTERNATIONAL UNIVERSITIES POWER ENGINEERING CONFERENCE (UPEC), 2015,
  • [23] Multiple Solutions of Optimal PMU Placement Using Exponential Binary PSO Algorithm
    Maji, Tapas Kumar
    Acharjee, P.
    2015 ANNUAL IEEE INDIA CONFERENCE (INDICON), 2015,
  • [24] Optimal PMU placement for full network observability using Tabu search algorithm
    Peng, JN
    Sun, YZ
    Wang, HF
    INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2006, 28 (04) : 223 - 231
  • [25] Novel Algorithm For Optimal PMU Placement For Wide Ranging Power System Observability
    Arora, Nitish
    Nagarajan, S. T.
    2021 6TH INTERNATIONAL CONFERENCE FOR CONVERGENCE IN TECHNOLOGY (I2CT), 2021,
  • [26] Optimal PMU placement based on improved binary artificial bee colony algorithm
    Li, Shaoqian
    Meng, Zhaoyong
    2017 IEEE TRANSPORTATION ELECTRIFICATION CONFERENCE AND EXPO, ASIA-PACIFIC (ITEC ASIA-PACIFIC), 2017, : 1417 - 1422
  • [27] Optimal PMU Placement for Power System Restoration
    Golshani, Amir
    Sun, Wei
    Zhou, Qun
    2015 CLEMSON UNIVERSITY POWER SYSTEMS CONFERENCE (PSC), 2015,
  • [28] Optimal PMU placement considering topology constraints
    Zhao, Yuanyuan
    Yuan, Peng
    Ai, Qian
    Lv, Tianguang
    INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2015, 73 : 240 - 248
  • [29] Optimal PMU placement for power system observability using Taguchi binary bat algorithm
    Vedik, Basetti
    Chandel, Ashwani K.
    MEASUREMENT, 2017, 95 : 8 - 20
  • [30] A decoding algorithm for binary linear codes using Groebner bases
    Randriamiarampanahy, Jean Jacques Ferdinand
    Andriatahiny, Harinaivo
    Rabeherimanana, Toussaint Joseph
    INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2019, 14 (02): : 441 - 448