{"title":"A genetic algorithm for constrained via minimization","authors":"M. Tang, K. Eshraghian, H. Cheung","doi":"10.1109/ICONIP.1999.845634","DOIUrl":null,"url":null,"abstract":"Constrained via minimization is a typical optimization problem in very large scale integrated circuit (VLSI) routing. It is used to minimize the number of vias introduced in a VLSI routing. The first genetic algorithm for the constrained via minimization problem is proposed. Experimental results show that the developed genetic algorithm can consistently produce the same or better results than the best deterministic constrained via minimization algorithms.","PeriodicalId":237855,"journal":{"name":"ICONIP'99. ANZIIS'99 & ANNES'99 & ACNN'99. 6th International Conference on Neural Information Processing. Proceedings (Cat. No.99EX378)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1999-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICONIP'99. ANZIIS'99 & ANNES'99 & ACNN'99. 6th International Conference on Neural Information Processing. Proceedings (Cat. No.99EX378)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICONIP.1999.845634","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
Constrained via minimization is a typical optimization problem in very large scale integrated circuit (VLSI) routing. It is used to minimize the number of vias introduced in a VLSI routing. The first genetic algorithm for the constrained via minimization problem is proposed. Experimental results show that the developed genetic algorithm can consistently produce the same or better results than the best deterministic constrained via minimization algorithms.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
