利用改进的遗传算法互连寄生提取

A. S. Abdellatif, A. E. Rouby, Mohamed B. Abdelhalim, A. Khalil
{"title":"利用改进的遗传算法互连寄生提取","authors":"A. S. Abdellatif, A. E. Rouby, Mohamed B. Abdelhalim, A. Khalil","doi":"10.1109/ICM.2009.5418622","DOIUrl":null,"url":null,"abstract":"Three new Genetic Algorithm (GA) are proposed and used to solve a Curve fitting problem for Parasitic Extraction Macro-modeling application. The first proposed approach, Diagonal GA (DGA); is based on replacing the traditional random population initialization method with a deterministic diagonal-like one. The second proposed approach, Elite Condensation GA (ECGA); is based on fine tuning the GA by explicitly condensing the population around a number of elite individuals. The third proposed approach, ECGA2, is a modified version of ECGA; that chooses elite members among all the population in each generation, then it divides the population into a number of sub-populations where each sub-population is composed of a single elite and a condensed population around it. Then, it performs GA operations on each of those subpopulations separately before merging them all into one population and keep repeating that divide-merging sequence. The performances of these three proposed approaches were measured on an extensive real data sets and used along with the understanding of the physical problem to offer various explanations of the theoretical aspects of the new algorithms.","PeriodicalId":391668,"journal":{"name":"2009 International Conference on Microelectronics - ICM","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Interconnects parasitic extraction using modified Genetic Algorithm\",\"authors\":\"A. S. Abdellatif, A. E. Rouby, Mohamed B. Abdelhalim, A. Khalil\",\"doi\":\"10.1109/ICM.2009.5418622\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Three new Genetic Algorithm (GA) are proposed and used to solve a Curve fitting problem for Parasitic Extraction Macro-modeling application. The first proposed approach, Diagonal GA (DGA); is based on replacing the traditional random population initialization method with a deterministic diagonal-like one. The second proposed approach, Elite Condensation GA (ECGA); is based on fine tuning the GA by explicitly condensing the population around a number of elite individuals. The third proposed approach, ECGA2, is a modified version of ECGA; that chooses elite members among all the population in each generation, then it divides the population into a number of sub-populations where each sub-population is composed of a single elite and a condensed population around it. Then, it performs GA operations on each of those subpopulations separately before merging them all into one population and keep repeating that divide-merging sequence. The performances of these three proposed approaches were measured on an extensive real data sets and used along with the understanding of the physical problem to offer various explanations of the theoretical aspects of the new algorithms.\",\"PeriodicalId\":391668,\"journal\":{\"name\":\"2009 International Conference on Microelectronics - ICM\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Microelectronics - ICM\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICM.2009.5418622\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Microelectronics - ICM","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICM.2009.5418622","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

提出了三种新的遗传算法,并将其应用于寄生提取宏观建模中的曲线拟合问题。首先提出的方法是对角遗传算法(Diagonal GA, DGA);是基于用确定性类对角线初始化方法取代传统的随机总体初始化方法。第二种方法,精英凝聚遗传算法(ECGA);是基于通过明确地将人口集中在一些精英个人周围来微调GA。第三种提议的方法ECGA2是ECGA的修改版本;它在每一代的所有人口中选择精英成员,然后将人口分成若干个子人口,每个子人口由一个精英和其周围的浓缩人口组成。然后,在将这些子种群合并为一个种群之前,它分别对每个子种群执行GA操作,并不断重复该划分合并序列。这三种方法的性能在广泛的真实数据集上进行了测量,并与对物理问题的理解一起使用,为新算法的理论方面提供了各种解释。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Interconnects parasitic extraction using modified Genetic Algorithm
Three new Genetic Algorithm (GA) are proposed and used to solve a Curve fitting problem for Parasitic Extraction Macro-modeling application. The first proposed approach, Diagonal GA (DGA); is based on replacing the traditional random population initialization method with a deterministic diagonal-like one. The second proposed approach, Elite Condensation GA (ECGA); is based on fine tuning the GA by explicitly condensing the population around a number of elite individuals. The third proposed approach, ECGA2, is a modified version of ECGA; that chooses elite members among all the population in each generation, then it divides the population into a number of sub-populations where each sub-population is composed of a single elite and a condensed population around it. Then, it performs GA operations on each of those subpopulations separately before merging them all into one population and keep repeating that divide-merging sequence. The performances of these three proposed approaches were measured on an extensive real data sets and used along with the understanding of the physical problem to offer various explanations of the theoretical aspects of the new algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信