TY - JOUR
T1 - A bounded exhaustive search technique for optimal phasor measurement unit placement in power grids
AU - Ibrahim, Ahmad Asrul
AU - Khalid, Khairuddin
AU - Shareef, Hussain
AU - Kamari, Nor Azwan Mohamed
N1 - Funding Information:
Funding: This work was funded by Universiti Kebangsaan Malaysia under grants GUP-2018-024 and GGPM-2019-031.
Publisher Copyright:
© 2020 by the authors. Licensee MDPI, Basel, Switzerland.
PY - 2020/12
Y1 - 2020/12
N2 - This paper proposes a technique to determine the possible optimal placement of the phasor measurement unit (PMU) in power grids for normal operating conditions. All possible combinations of PMU placement, including infeasible combinations, are typically considered in finding the optimal solution, which could be a massive search space. An integer search algorithm called the bounded search technique is introduced to reduce the search space in solving a minimum number of PMU allocations whilst maintaining full system observability. The proposed technique is based on connectivity and symmetry constraints that can be derived from the observability matrix. As the technique is coupled with the exhaustive technique, the technique is called the bounded exhaustive search (BES) technique. Several IEEE test systems, namely, IEEE 9-bus, IEEE 14-bus, IEEE 24-bus and IEEE 30-bus, are considered to showcase the performance of the proposed technique. An initial Monte Carlo simulation was carried out to evaluate the capability of the bounded search technique in providing a smaller feasible search space. The effectiveness of the BES technique in terms of computational time is compared with the existing exhaustive technique. Results demonstrate that the search space can be reduced tremendously, and the computational burden can be eased, when finding the optimal PMU placement in power grids.
AB - This paper proposes a technique to determine the possible optimal placement of the phasor measurement unit (PMU) in power grids for normal operating conditions. All possible combinations of PMU placement, including infeasible combinations, are typically considered in finding the optimal solution, which could be a massive search space. An integer search algorithm called the bounded search technique is introduced to reduce the search space in solving a minimum number of PMU allocations whilst maintaining full system observability. The proposed technique is based on connectivity and symmetry constraints that can be derived from the observability matrix. As the technique is coupled with the exhaustive technique, the technique is called the bounded exhaustive search (BES) technique. Several IEEE test systems, namely, IEEE 9-bus, IEEE 14-bus, IEEE 24-bus and IEEE 30-bus, are considered to showcase the performance of the proposed technique. An initial Monte Carlo simulation was carried out to evaluate the capability of the bounded search technique in providing a smaller feasible search space. The effectiveness of the BES technique in terms of computational time is compared with the existing exhaustive technique. Results demonstrate that the search space can be reduced tremendously, and the computational burden can be eased, when finding the optimal PMU placement in power grids.
KW - Bounded exhaustive search
KW - Connectivity and symmetry constraints
KW - Full system observability
KW - Optimal placement
KW - Phasor measurement unit
UR - http://www.scopus.com/inward/record.url?scp=85106854619&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85106854619&partnerID=8YFLogxK
U2 - 10.3390/sym12122021
DO - 10.3390/sym12122021
M3 - Article
AN - SCOPUS:85106854619
SN - 2073-8994
VL - 12
SP - 1
EP - 13
JO - Symmetry
JF - Symmetry
IS - 12
M1 - 2021
ER -