一种基于进化算法的多层详细路由方法

N. Gockel, R. Drechsler, B. Becker
{"title":"一种基于进化算法的多层详细路由方法","authors":"N. Gockel, R. Drechsler, B. Becker","doi":"10.1109/ICEC.1997.592373","DOIUrl":null,"url":null,"abstract":"We present an evolutionary algorithm (EA) for detailed routing problems (DRPs), like the channel routing problem and the switchbox routing problem. We combine EAs with domain specific knowledge, i.e. the genetic operators make use of the rip-up and reroute technique. The algorithm can work with two layer and multilayer problem instances. The efficiency of our algorithm is demonstrated by application to multilayer channel routing benchmarks. Instances with up to five layers, 130 columns, and more than 60 nets are considered.","PeriodicalId":167852,"journal":{"name":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":"{\"title\":\"A multi-layer detailed routing approach based on evolutionary algorithms\",\"authors\":\"N. Gockel, R. Drechsler, B. Becker\",\"doi\":\"10.1109/ICEC.1997.592373\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present an evolutionary algorithm (EA) for detailed routing problems (DRPs), like the channel routing problem and the switchbox routing problem. We combine EAs with domain specific knowledge, i.e. the genetic operators make use of the rip-up and reroute technique. The algorithm can work with two layer and multilayer problem instances. The efficiency of our algorithm is demonstrated by application to multilayer channel routing benchmarks. Instances with up to five layers, 130 columns, and more than 60 nets are considered.\",\"PeriodicalId\":167852,\"journal\":{\"name\":\"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1997-04-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"13\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICEC.1997.592373\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICEC.1997.592373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13

摘要

我们提出了一种进化算法(EA)来解决详细路由问题(DRPs),如信道路由问题和开关箱路由问题。我们将ea与特定领域知识相结合,即遗传算子利用撕裂和重路由技术。该算法可以处理两层和多层问题实例。在多层信道路由基准测试中的应用验证了算法的有效性。考虑多达五层、130列和60多个网的实例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A multi-layer detailed routing approach based on evolutionary algorithms
We present an evolutionary algorithm (EA) for detailed routing problems (DRPs), like the channel routing problem and the switchbox routing problem. We combine EAs with domain specific knowledge, i.e. the genetic operators make use of the rip-up and reroute technique. The algorithm can work with two layer and multilayer problem instances. The efficiency of our algorithm is demonstrated by application to multilayer channel routing benchmarks. Instances with up to five layers, 130 columns, and more than 60 nets are considered.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信