Optimal Placement of Micro-Phasor Measurement Units in Distribution Network using Pattern Search Algorithm

R. Manam, Ramesh Adireddy, Lakshmi Kambampati, Manoz Kumar Reddy Karri, Tata Rao Donepudi, S. Rayapudi
{"title":"Optimal Placement of Micro-Phasor Measurement Units in Distribution Network using Pattern Search Algorithm","authors":"R. Manam, Ramesh Adireddy, Lakshmi Kambampati, Manoz Kumar Reddy Karri, Tata Rao Donepudi, S. Rayapudi","doi":"10.1109/ICECCT56650.2023.10179715","DOIUrl":null,"url":null,"abstract":"This paper presents a Pattern Search (PS) algorithm for optimal placement of Micro-Phasor Measurement Units (M-PMUs) in a distribution network to obtain complete observability through which security of network can be attained. By the distribution state estimation process, these M-PMU measurements can help to estimate the state of every node in the network. The pattern search algorithm is a nonlinear, constrained procedure used to optimize network locations for M-PMU placement. Redundancy bus nodes in the feeder network are considered in the optimization process to minimize PMU locations. The locations of M-PMUs with and without radial buses are compared. A redundancy index (RI) at the node and a complete network observabilty index (CNOI) for the entire network are proposed to assess network observabilty. The proposed indices can show whether the system is completely observable or not. Test cases that are MATLAB-programmed include the IEEE-13, 33, and 69 feeder networks. The effectiveness of the findings in the optimization of nonlinear constraints is shown by comparison with other widely used techniques.","PeriodicalId":180790,"journal":{"name":"2023 Fifth International Conference on Electrical, Computer and Communication Technologies (ICECCT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 Fifth International Conference on Electrical, Computer and Communication Technologies (ICECCT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICECCT56650.2023.10179715","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

This paper presents a Pattern Search (PS) algorithm for optimal placement of Micro-Phasor Measurement Units (M-PMUs) in a distribution network to obtain complete observability through which security of network can be attained. By the distribution state estimation process, these M-PMU measurements can help to estimate the state of every node in the network. The pattern search algorithm is a nonlinear, constrained procedure used to optimize network locations for M-PMU placement. Redundancy bus nodes in the feeder network are considered in the optimization process to minimize PMU locations. The locations of M-PMUs with and without radial buses are compared. A redundancy index (RI) at the node and a complete network observabilty index (CNOI) for the entire network are proposed to assess network observabilty. The proposed indices can show whether the system is completely observable or not. Test cases that are MATLAB-programmed include the IEEE-13, 33, and 69 feeder networks. The effectiveness of the findings in the optimization of nonlinear constraints is shown by comparison with other widely used techniques.
基于模式搜索算法的配电网微相量测量单元优化配置
提出了一种基于模式搜索的配电网微相量测量单元(m - pmu)优化配置算法,以获得完全可观测性,从而保证配电网的安全性。通过分布状态估计过程,这些M-PMU测量值可以帮助估计网络中每个节点的状态。模式搜索算法是一种非线性约束过程,用于优化M-PMU放置的网络位置。在优化过程中考虑馈线网络中的冗余总线节点,以最小化PMU的位置。比较了带和不带径向母线的m - pmu的位置。提出了节点的冗余指数(RI)和整个网络的完全网络可观察性指数(CNOI)来评估网络的可观察性。所提出的指标可以显示系统是否完全可观察。用matlab编程的测试用例包括IEEE-13、33和69馈线网络。通过与其他广泛使用的技术进行比较,证明了这些发现在非线性约束优化中的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信