相量测量单元布置的整数线性规划方法

R. S. F. Ferraz, R. S. F. Ferraz, Augusto C. Rueda-Medina, M. Paiva
{"title":"相量测量单元布置的整数线性规划方法","authors":"R. S. F. Ferraz, R. S. F. Ferraz, Augusto C. Rueda-Medina, M. Paiva","doi":"10.1109/urucon53396.2021.9647377","DOIUrl":null,"url":null,"abstract":"Phasor Measurement Units (PMUs) are essential devices in the monitoring and protection of modern power systems. However, its prohibitive cost may limit the wide installation of this device in the networks. For this reason, in this paper, the problem of optimal PMU placement was solved using Integer Linear Programming and some metaheuristic techniques, such as, the Genetic Algorithms, Particle Swarm Optimization and Cuckoo Search. In addition, the test feeders were modeled as graphs, in order to introduce the domination concepts of graph theory in this problem formulation and, using the upper and lower bounds of the domination number, evaluate the optimization algorithms results. The proposed methodology was performed using the IEEE 13, 34, 37 and 123 node test feeders, and it can be generalized for feeders with higher dimensions. Based on the results, it is possible to conclude that the Integer Linear Programming is the most suitable for this application, presenting the lowest number of PMUs and the fastest convergence.","PeriodicalId":337257,"journal":{"name":"2021 IEEE URUCON","volume":"216 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An Integer Linear Programming Approach for Phasor Measurement Unit Placement\",\"authors\":\"R. S. F. Ferraz, R. S. F. Ferraz, Augusto C. Rueda-Medina, M. Paiva\",\"doi\":\"10.1109/urucon53396.2021.9647377\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Phasor Measurement Units (PMUs) are essential devices in the monitoring and protection of modern power systems. However, its prohibitive cost may limit the wide installation of this device in the networks. For this reason, in this paper, the problem of optimal PMU placement was solved using Integer Linear Programming and some metaheuristic techniques, such as, the Genetic Algorithms, Particle Swarm Optimization and Cuckoo Search. In addition, the test feeders were modeled as graphs, in order to introduce the domination concepts of graph theory in this problem formulation and, using the upper and lower bounds of the domination number, evaluate the optimization algorithms results. The proposed methodology was performed using the IEEE 13, 34, 37 and 123 node test feeders, and it can be generalized for feeders with higher dimensions. Based on the results, it is possible to conclude that the Integer Linear Programming is the most suitable for this application, presenting the lowest number of PMUs and the fastest convergence.\",\"PeriodicalId\":337257,\"journal\":{\"name\":\"2021 IEEE URUCON\",\"volume\":\"216 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-11-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE URUCON\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/urucon53396.2021.9647377\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE URUCON","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/urucon53396.2021.9647377","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

相量测量单元(pmu)是现代电力系统监测和保护中必不可少的设备。然而,其高昂的成本可能会限制该设备在网络中的广泛安装。为此,本文采用整数线性规划和遗传算法、粒子群算法、布谷鸟搜索等元启发式方法求解PMU的最优布局问题。此外,将测试馈线建模为图,以便在该问题表述中引入图论的支配概念,并利用支配数的上界和下界来评价优化算法的结果。该方法在IEEE 13、34、37和123节点测试馈线上进行了验证,可以推广到更高维度的馈线。根据结果,可以得出结论,整数线性规划是最适合此应用的,具有最少的pmu数量和最快的收敛速度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Integer Linear Programming Approach for Phasor Measurement Unit Placement
Phasor Measurement Units (PMUs) are essential devices in the monitoring and protection of modern power systems. However, its prohibitive cost may limit the wide installation of this device in the networks. For this reason, in this paper, the problem of optimal PMU placement was solved using Integer Linear Programming and some metaheuristic techniques, such as, the Genetic Algorithms, Particle Swarm Optimization and Cuckoo Search. In addition, the test feeders were modeled as graphs, in order to introduce the domination concepts of graph theory in this problem formulation and, using the upper and lower bounds of the domination number, evaluate the optimization algorithms results. The proposed methodology was performed using the IEEE 13, 34, 37 and 123 node test feeders, and it can be generalized for feeders with higher dimensions. Based on the results, it is possible to conclude that the Integer Linear Programming is the most suitable for this application, presenting the lowest number of PMUs and the fastest convergence.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Advanced Cardiovascular Life Support High Fidelity Simulator: Review and Feasibility Analysis Failure Prediction in Automatic Reclosers Using Machine Learning Approaches Half-wave dipole antenna design comparison of 60, 67 y 74 GHz frequencies Dear presenters Fingerprint Recognition Based on Wavelet Transform and Ensemble Subspace Classifier
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1