Optimal placement of PMUs in power systems based on bacterial foraging algorithm

K. Mazlumi, H. Vahedi
{"title":"Optimal placement of PMUs in power systems based on bacterial foraging algorithm","authors":"K. Mazlumi, H. Vahedi","doi":"10.1109/IRANIANCEE.2010.5506953","DOIUrl":null,"url":null,"abstract":"This paper aims to optimize the PMU (Phasor Measurement Unit) placement for a full observation of the power network and the minimum number of PMU. Bacterial foraging algorithm (BFA) that is irresistible in high-dimensional function optimization is presented in this paper. The effectiveness and superiority of the proposed algorithm is demonstrated with PMU placement optimization simulation and a redundancy measurement analysis by using IEEE14-bus system and Tehran 41-bus system.","PeriodicalId":282587,"journal":{"name":"2010 18th Iranian Conference on Electrical Engineering","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 18th Iranian Conference on Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IRANIANCEE.2010.5506953","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

This paper aims to optimize the PMU (Phasor Measurement Unit) placement for a full observation of the power network and the minimum number of PMU. Bacterial foraging algorithm (BFA) that is irresistible in high-dimensional function optimization is presented in this paper. The effectiveness and superiority of the proposed algorithm is demonstrated with PMU placement optimization simulation and a redundancy measurement analysis by using IEEE14-bus system and Tehran 41-bus system.
基于细菌觅食算法的电力系统pmu优化配置
本文旨在优化相量测量单元(PMU)的位置,以实现对电网的全面观测和最小的PMU数量。提出了在高维函数优化中不可抗拒的细菌觅食算法(BFA)。通过ieee14总线系统和德黑兰41总线系统的PMU放置优化仿真和冗余测量分析,验证了该算法的有效性和优越性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信