2012
DOI: 10.1016/j.ijepes.2012.03.011
|View full text |Cite
|
Sign up to set email alerts
|

An optimal PMU placement technique for power system observability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
35
0
7

Year Published

2012
2012
2020
2020

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 180 publications
(42 citation statements)
references
References 18 publications
0
35
0
7
Order By: Relevance
“…By utilizing an embedded heuristic, a sequence of solutions is provided in which the best solution is obtained if one were to utilize repeated random trials of that heuristic. The Iterated Local Search (ILS) metaheuristic in [26,28,31] is used to minimize the size of the PMU configuration needed to observe the network .The algorithm is tested on IEEE test networks with 14, 57 and 118 nodes and compared to the results obtained in previous publications.…”
Section: Iterated Local Search (Ils)mentioning
confidence: 99%
“…By utilizing an embedded heuristic, a sequence of solutions is provided in which the best solution is obtained if one were to utilize repeated random trials of that heuristic. The Iterated Local Search (ILS) metaheuristic in [26,28,31] is used to minimize the size of the PMU configuration needed to observe the network .The algorithm is tested on IEEE test networks with 14, 57 and 118 nodes and compared to the results obtained in previous publications.…”
Section: Iterated Local Search (Ils)mentioning
confidence: 99%
“…The optimal PMU placement problem concerns with how many PMUs and where they should be installed in a power network to achieve full observability at minimum number of PMUs [14]. Hence, minimizing the number of PMUs is the objective function of this optimization problem and the constraint of the problem is being full observable of the network.…”
Section: Description Of Optimal Pmu Placement Problemmentioning
confidence: 99%
“…[14] presents an iterative whereas [15] determines the imperialistic competition algor partial swarm optimization (BP Table II describes the buse different references. Total no IEEE-30 bus system are 6.…”
Section: Test Systems and Simulatiomentioning
confidence: 99%
“…Ref. [14] presents an iterative method for PMU placement, whereas [15] determines the optimal location by binary imperialistic competition algorithm (BICA) and [16] by binary partial swarm optimization (BPSO) technique. Table III shows the buses taken as zero injection bus by different references.…”
Section: Test Systems and Simulatiomentioning
confidence: 99%