2019
DOI: 10.1007/978-981-13-8618-3_4
|View full text |Cite
|
Sign up to set email alerts
|

A Binary Harmony Search Algorithm Approach for Security Constrained Allocation of PMUs to Obtain Complete Observability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 9 publications
(6 citation statements)
references
References 11 publications
0
6
0
Order By: Relevance
“…e performance of ABHSA was tested on both lowand high-dimensional knapsack problems. Ravindra et al [41] developed a BHSA for optimal deployment of phasor measurement units. Lin and Li [42] designed a hybrid BHSA to solve winner determination problem.…”
Section: Binary Hsamentioning
confidence: 99%
“…e performance of ABHSA was tested on both lowand high-dimensional knapsack problems. Ravindra et al [41] developed a BHSA for optimal deployment of phasor measurement units. Lin and Li [42] designed a hybrid BHSA to solve winner determination problem.…”
Section: Binary Hsamentioning
confidence: 99%
“…Authors in [6] solve the OPP problem with binary particle swarm (BPSO) algorithm by considering the measurement contingencies such as line outage or PMU failure. Authors in [7] solve the OPP problem with the objective of maximizing the observability via binary harmony search algorithm (BHSA).…”
Section: Introductionmentioning
confidence: 99%
“…In [30], OPP employing TLBO is suggested to accomplish complete observability. In [31], the author proposed a binary harmony search algorithm (BHSA) for OPP to minimize installation cost of PMU without losing complete observability. In [32], the author proposed minimum connectivity-based reduction (MCBR) technique which is proposed for deployment of PMUs to accomplish complete observability.…”
Section: Introductionmentioning
confidence: 99%