改进蚁群算法在集成电路布线中的应用

2009 International Conference on Computer and Communications Security Pub Date : 2009-12-05 DOI:10.1109/ICCCS.2009.16

H. Liying, T. Hongmei, Sun Zhijie, Zhang Cunshan, Zhao Hongdong

{"title":"改进蚁群算法在集成电路布线中的应用","authors":"H. Liying, T. Hongmei, Sun Zhijie, Zhang Cunshan, Zhao Hongdong","doi":"10.1109/ICCCS.2009.16","DOIUrl":null,"url":null,"abstract":"As VLSI fabrication technology developing to VDSM and the magnitude increasing rapidly¿a more effective optimized algorithm is requited to realize circuit routing in the physical design. In this paper, through optimizing the basic ant colony algorithm based on ant colony system, a better solution is found. It can improve the problem of excessive search time using the basic ant colony to solve traveling salesman problem (TSP). The improved algorithm has fast convergence capability and strong optimization ability. Using the improved ant colony algorithm to solve the multiterminal net routing problem around the obstacles, a better total connection length is achieved. The experimental results show that the improved ant colony algorithm is an effective way to solve difficult NP wire problems.","PeriodicalId":103274,"journal":{"name":"2009 International Conference on Computer and Communications Security","volume":"80 17","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Application of Improved Ant Colony Algorithm in Integrated Circuit Routing\",\"authors\":\"H. Liying, T. Hongmei, Sun Zhijie, Zhang Cunshan, Zhao Hongdong\",\"doi\":\"10.1109/ICCCS.2009.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As VLSI fabrication technology developing to VDSM and the magnitude increasing rapidly¿a more effective optimized algorithm is requited to realize circuit routing in the physical design. In this paper, through optimizing the basic ant colony algorithm based on ant colony system, a better solution is found. It can improve the problem of excessive search time using the basic ant colony to solve traveling salesman problem (TSP). The improved algorithm has fast convergence capability and strong optimization ability. Using the improved ant colony algorithm to solve the multiterminal net routing problem around the obstacles, a better total connection length is achieved. The experimental results show that the improved ant colony algorithm is an effective way to solve difficult NP wire problems.\",\"PeriodicalId\":103274,\"journal\":{\"name\":\"2009 International Conference on Computer and Communications Security\",\"volume\":\"80 17\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Computer and Communications Security\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCCS.2009.16\",\"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 Computer and Communications Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCS.2009.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

随着超大规模集成电路制造技术向超大规模集成电路(VDSM)的发展和量级的迅速增加，需要一种更有效的优化算法来实现物理设计中的电路布线。本文通过对基于蚁群系统的基本蚁群算法进行优化，找到了较好的解决方案。利用基本蚁群算法求解旅行商问题(TSP)，改善了搜索时间过长的问题。改进后的算法收敛速度快，优化能力强。采用改进的蚁群算法求解多终端网络绕障路由问题，获得了较好的总连接长度。实验结果表明，改进的蚁群算法是求解NP线难题的有效方法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Application of Improved Ant Colony Algorithm in Integrated Circuit Routing

As VLSI fabrication technology developing to VDSM and the magnitude increasing rapidly¿a more effective optimized algorithm is requited to realize circuit routing in the physical design. In this paper, through optimizing the basic ant colony algorithm based on ant colony system, a better solution is found. It can improve the problem of excessive search time using the basic ant colony to solve traveling salesman problem (TSP). The improved algorithm has fast convergence capability and strong optimization ability. Using the improved ant colony algorithm to solve the multiterminal net routing problem around the obstacles, a better total connection length is achieved. The experimental results show that the improved ant colony algorithm is an effective way to solve difficult NP wire problems.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2009 International Conference on Computer and Communications Security

自引率

0.00%

发文量