通过改进种群生成实现配电网络设计中去耦电容器优化的增强遗传算法

Jack Juang;Ling Zhang;Haran Manoharan;Francesco De Paulis;Chulsoon Hwang
{"title":"通过改进种群生成实现配电网络设计中去耦电容器优化的增强遗传算法","authors":"Jack Juang;Ling Zhang;Haran Manoharan;Francesco De Paulis;Chulsoon Hwang","doi":"10.1109/TSIPI.2024.3490512","DOIUrl":null,"url":null,"abstract":"In power distribution network designs, a large number of decoupling capacitors (decaps) may be needed to satisfy target impedance limits. Many algorithms have been proposed and implemented for finding the optimal decap placement, including genetic algorithms (GA), and machine learning methods. In this work, an improved GA is proposed for finding the decap placement pattern that can satisfy a target impedance using the minimum number of decaps. The distribution of capacitors expected to appear in the global minimum solution is first predicted by determining how effective each decap type is toward satisfying certain critical impedance points. This estimation is used to inform the generation of initial solutions in order to put the initial search space nearer the global minimum and ensure certain solution characteristics appear. GA search using this improved population generation is found to be an improvement over a Canonical GA implementation, by finding solutions where the latter could not, or finding a solution using fewer decaps.","PeriodicalId":100646,"journal":{"name":"IEEE Transactions on Signal and Power Integrity","volume":"3 ","pages":"186-198"},"PeriodicalIF":0.0000,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Augmented Genetic Algorithm for Decoupling Capacitor Optimization in Power Distribution Network Design Through Improved Population Generation\",\"authors\":\"Jack Juang;Ling Zhang;Haran Manoharan;Francesco De Paulis;Chulsoon Hwang\",\"doi\":\"10.1109/TSIPI.2024.3490512\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In power distribution network designs, a large number of decoupling capacitors (decaps) may be needed to satisfy target impedance limits. Many algorithms have been proposed and implemented for finding the optimal decap placement, including genetic algorithms (GA), and machine learning methods. In this work, an improved GA is proposed for finding the decap placement pattern that can satisfy a target impedance using the minimum number of decaps. The distribution of capacitors expected to appear in the global minimum solution is first predicted by determining how effective each decap type is toward satisfying certain critical impedance points. This estimation is used to inform the generation of initial solutions in order to put the initial search space nearer the global minimum and ensure certain solution characteristics appear. GA search using this improved population generation is found to be an improvement over a Canonical GA implementation, by finding solutions where the latter could not, or finding a solution using fewer decaps.\",\"PeriodicalId\":100646,\"journal\":{\"name\":\"IEEE Transactions on Signal and Power Integrity\",\"volume\":\"3 \",\"pages\":\"186-198\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-11-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Signal and Power Integrity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10742294/\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Signal and Power Integrity","FirstCategoryId":"1085","ListUrlMain":"https://ieeexplore.ieee.org/document/10742294/","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在配电网络设计中,可能需要大量去耦电容器(decap)来满足目标阻抗限制。人们提出并实施了许多算法,包括遗传算法(GA)和机器学习方法,用于寻找最佳的去耦电容器位置。在这项工作中,我们提出了一种改进的遗传算法,用于寻找能够满足目标阻抗的去盖帽放置模式,并使用最少的去盖帽数量。首先,通过确定每种分路器类型对满足某些临界阻抗点的有效性,来预测预计会出现在全局最小解决方案中的电容器分布。这种估算用于生成初始解决方案,以便使初始搜索空间更接近全局最小值,并确保出现某些解决方案特征。使用这种改进的种群生成方法进行 GA 搜索,发现比 Canonical GA 实施方法有了改进,可以找到后者无法找到的解决方案,或使用更少的分封点找到解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Augmented Genetic Algorithm for Decoupling Capacitor Optimization in Power Distribution Network Design Through Improved Population Generation
In power distribution network designs, a large number of decoupling capacitors (decaps) may be needed to satisfy target impedance limits. Many algorithms have been proposed and implemented for finding the optimal decap placement, including genetic algorithms (GA), and machine learning methods. In this work, an improved GA is proposed for finding the decap placement pattern that can satisfy a target impedance using the minimum number of decaps. The distribution of capacitors expected to appear in the global minimum solution is first predicted by determining how effective each decap type is toward satisfying certain critical impedance points. This estimation is used to inform the generation of initial solutions in order to put the initial search space nearer the global minimum and ensure certain solution characteristics appear. GA search using this improved population generation is found to be an improvement over a Canonical GA implementation, by finding solutions where the latter could not, or finding a solution using fewer decaps.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信