Binary Educational Competition Optimizer (BECO) Algorithm For Optimum PMU Placement

In power systems, for wide area monitoring and controlling of various electrical parameters, Phasor Measurement units are used. These devices play a vital role and the measured parameters are time-synchronized through the utilization of the global positioning system. But these PMUs are more expensive. Due to this expensiveness, optimum sites for placing PMUs to obtain maximum observability, and finding a minimal number of PMUs is mandatory. This paper proposes the novel Binary Educational Competition Optimizer (BECO) algorithm inspired by the various educational institutions, to identify the best positions. The proposed approach is simulated for 14, 30, and 57-bus IEEE benchmark systems. The suggested approach results fulfill the optimum locations of the PMU placement with complete visibility of the grid and obtain the minimal number of PMUs. These simulated test results are analyzed in MATLAB with the existing methods such as fast convergence and obtaining fewer iterations.

Authors

Publication Details

Published
2025-02-28
DOI
https://doi.org/10.1109/ssdee64538.2025.10968147
Primary Topic
Scheduling and Timetabling Solutions
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Binary Educational Competition Optimizer (BECO) Algorithm For Optimum PMU Placement

Sachidananda Sen, Vedik Basetti, Sruthi Ankam
1 links
Scheduling and Timetabling Solutions
article

Binary Educational Competition Optimizer (BECO) Algorithm For Optimum PMU Placement

Sachidananda Sen, Vedik Basetti, Sruthi Ankam
article en

Abstract

In power systems, for wide area monitoring and controlling of various electrical parameters, Phasor Measurement units are used. These devices play a vital role and the measured parameters are time-synchronized through the utilization of the global positioning system. But these PMUs are more expensive. Due to this expensiveness, optimum sites for placing PMUs to obtain maximum observability, and finding a minimal number of PMUs is mandatory. This paper proposes the novel Binary Educational Competition Optimizer (BECO) algorithm inspired by the various educational institutions, to identify the best positions. The proposed approach is simulated for 14, 30, and 57-bus IEEE benchmark systems. The suggested approach results fulfill the optimum locations of the PMU placement with complete visibility of the grid and obtain the minimal number of PMUs. These simulated test results are analyzed in MATLAB with the existing methods such as fast convergence and obtaining fewer iterations.

Openalex Percentile: Top 90%
Scheduling and Timetabling Solutions
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.