A binary harmony search algorithm approach for security constrained allocation of PMUs to obtain complete observability

5Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper presents security constrained optimal deployment of Phasor Measurement Units (PMUs) in network to obtain complete observability at minimum cost function. An effective Binary Harmony Search Algorithm (BHSA) is proposed for deployment of PMUs at sensitive buses with an increase in redundancy to provide accurate measurements for state estimation. Sensitive buses are derived from proposed VSI index formulated with load flow solution to provide real-time control for system. Redundancy with and without security constrained PMU location is determined at every bus of network to show effectiveness of security constrained PMU allocation with complete observability. Zero Injection (ZI) bus constraint modeling is considered in optimization to decrease PMU locations. Security constrained PMU location with and without ZI constraint modeling is compared to show its importance with sensitive buses. Complete Network Observability Redundancy Index (CNORI) is proposed to measure the reliability with sensitive constrained deployment of PMUs. IEEE –14, –30, and 57—bus test case systems are considered for MATLAB simulations and outcome results are justified with other proposed methods cited in literature survey.

Cite

CITATION STYLE

APA

Ravindra, M., Rao, R. S., & NagaRaju, V. S. (2020). A binary harmony search algorithm approach for security constrained allocation of PMUs to obtain complete observability. In Advances in Intelligent Systems and Computing (Vol. 989, pp. 25–35). Springer Verlag. https://doi.org/10.1007/978-981-13-8618-3_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free